./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8cf9a91c8f1111f4616406dfb4a7fdeef392d21e591ff8d6357140f3015668db --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:29:35,653 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:29:35,655 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:29:35,678 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:29:35,679 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:29:35,680 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:29:35,681 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:29:35,683 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:29:35,684 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:29:35,685 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:29:35,686 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:29:35,687 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:29:35,687 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:29:35,688 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:29:35,689 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:29:35,690 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:29:35,691 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:29:35,692 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:29:35,693 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:29:35,695 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:29:35,696 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:29:35,700 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:29:35,701 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:29:35,701 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:29:35,704 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:29:35,704 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:29:35,704 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:29:35,705 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:29:35,705 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:29:35,706 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:29:35,706 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:29:35,707 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:29:35,708 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:29:35,708 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:29:35,709 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:29:35,709 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:29:35,710 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:29:35,710 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:29:35,711 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:29:35,718 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:29:35,718 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:29:35,720 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:29:35,748 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:29:35,748 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:29:35,748 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:29:35,748 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:29:35,749 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:29:35,749 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:29:35,750 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:29:35,750 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:29:35,750 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:29:35,750 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:29:35,750 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:29:35,750 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:29:35,751 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:29:35,751 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:29:35,751 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:29:35,751 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:29:35,751 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:29:35,751 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:29:35,752 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:29:35,752 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:29:35,752 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:29:35,752 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:29:35,752 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:29:35,752 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:29:35,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:29:35,753 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:29:35,753 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:29:35,753 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:29:35,753 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:29:35,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:29:35,753 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:29:35,754 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:29:35,754 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:29:35,754 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 -> 8cf9a91c8f1111f4616406dfb4a7fdeef392d21e591ff8d6357140f3015668db [2022-02-20 18:29:36,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:29:36,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:29:36,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:29:36,026 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:29:36,026 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:29:36,027 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c [2022-02-20 18:29:36,089 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0424ff61/88711654d66942daaaca5c1337bb8e8a/FLAG503a90b2f [2022-02-20 18:29:36,443 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:29:36,444 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c [2022-02-20 18:29:36,451 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0424ff61/88711654d66942daaaca5c1337bb8e8a/FLAG503a90b2f [2022-02-20 18:29:36,850 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0424ff61/88711654d66942daaaca5c1337bb8e8a [2022-02-20 18:29:36,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:29:36,855 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:29:36,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:29:36,860 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:29:36,863 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:29:36,864 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:29:36" (1/1) ... [2022-02-20 18:29:36,865 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73b9375c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:36, skipping insertion in model container [2022-02-20 18:29:36,866 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:29:36" (1/1) ... [2022-02-20 18:29:36,871 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:29:36,893 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:29:37,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c[8379,8392] [2022-02-20 18:29:37,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:29:37,084 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:29:37,125 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c[8379,8392] [2022-02-20 18:29:37,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:29:37,138 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:29:37,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:37 WrapperNode [2022-02-20 18:29:37,139 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:29:37,140 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:29:37,140 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:29:37,140 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:29:37,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:37" (1/1) ... [2022-02-20 18:29:37,153 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:37" (1/1) ... [2022-02-20 18:29:37,188 INFO L137 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 272 [2022-02-20 18:29:37,189 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:29:37,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:29:37,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:29:37,190 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:29:37,196 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:37" (1/1) ... [2022-02-20 18:29:37,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:37" (1/1) ... [2022-02-20 18:29:37,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:37" (1/1) ... [2022-02-20 18:29:37,199 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:37" (1/1) ... [2022-02-20 18:29:37,206 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:37" (1/1) ... [2022-02-20 18:29:37,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:37" (1/1) ... [2022-02-20 18:29:37,214 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:37" (1/1) ... [2022-02-20 18:29:37,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:29:37,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:29:37,217 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:29:37,217 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:29:37,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:37" (1/1) ... [2022-02-20 18:29:37,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:29:37,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:29:37,247 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:29:37,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:29:37,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:29:37,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:29:37,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:29:37,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:29:37,379 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:29:37,385 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:29:37,772 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:29:37,778 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:29:37,779 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:29:37,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:29:37 BoogieIcfgContainer [2022-02-20 18:29:37,781 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:29:37,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:29:37,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:29:37,785 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:29:37,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:29:36" (1/3) ... [2022-02-20 18:29:37,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7102f453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:29:37, skipping insertion in model container [2022-02-20 18:29:37,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:37" (2/3) ... [2022-02-20 18:29:37,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7102f453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:29:37, skipping insertion in model container [2022-02-20 18:29:37,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:29:37" (3/3) ... [2022-02-20 18:29:37,788 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c [2022-02-20 18:29:37,792 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:29:37,792 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:29:37,836 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:29:37,841 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:29:37,842 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:29:37,866 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 75 states have (on average 1.7066666666666668) internal successors, (128), 76 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:37,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 18:29:37,872 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:37,872 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:29:37,873 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:37,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:37,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1837107710, now seen corresponding path program 1 times [2022-02-20 18:29:37,884 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:37,884 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809614913] [2022-02-20 18:29:37,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:37,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:38,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:38,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {80#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; {80#true} is VALID [2022-02-20 18:29:38,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {80#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {80#true} is VALID [2022-02-20 18:29:38,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {80#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {80#true} is VALID [2022-02-20 18:29:38,136 INFO L290 TraceCheckUtils]: 3: Hoare triple {80#true} init_#res#1 := init_~tmp~0#1; {80#true} is VALID [2022-02-20 18:29:38,136 INFO L290 TraceCheckUtils]: 4: Hoare triple {80#true} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {80#true} is VALID [2022-02-20 18:29:38,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {80#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {81#false} is VALID [2022-02-20 18:29:38,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {81#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {81#false} is VALID [2022-02-20 18:29:38,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {81#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {81#false} is VALID [2022-02-20 18:29:38,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {81#false} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {81#false} is VALID [2022-02-20 18:29:38,138 INFO L290 TraceCheckUtils]: 9: Hoare triple {81#false} assume !(node1_~m1~0#1 != ~nomsg~0); {81#false} is VALID [2022-02-20 18:29:38,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {81#false} ~mode1~0 := 0; {81#false} is VALID [2022-02-20 18:29:38,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {81#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {81#false} is VALID [2022-02-20 18:29:38,139 INFO L290 TraceCheckUtils]: 12: Hoare triple {81#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {81#false} is VALID [2022-02-20 18:29:38,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {81#false} assume !(node2_~m2~0#1 != ~nomsg~0); {81#false} is VALID [2022-02-20 18:29:38,140 INFO L290 TraceCheckUtils]: 14: Hoare triple {81#false} ~mode2~0 := 0; {81#false} is VALID [2022-02-20 18:29:38,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {81#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {81#false} is VALID [2022-02-20 18:29:38,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {81#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {81#false} is VALID [2022-02-20 18:29:38,141 INFO L290 TraceCheckUtils]: 17: Hoare triple {81#false} assume !(node3_~m3~0#1 != ~nomsg~0); {81#false} is VALID [2022-02-20 18:29:38,142 INFO L290 TraceCheckUtils]: 18: Hoare triple {81#false} ~mode3~0 := 0; {81#false} is VALID [2022-02-20 18:29:38,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {81#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {81#false} is VALID [2022-02-20 18:29:38,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {81#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {81#false} is VALID [2022-02-20 18:29:38,147 INFO L290 TraceCheckUtils]: 21: Hoare triple {81#false} assume !(node4_~m4~0#1 != ~nomsg~0); {81#false} is VALID [2022-02-20 18:29:38,148 INFO L290 TraceCheckUtils]: 22: Hoare triple {81#false} ~mode4~0 := 0; {81#false} is VALID [2022-02-20 18:29:38,148 INFO L290 TraceCheckUtils]: 23: Hoare triple {81#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; {81#false} is VALID [2022-02-20 18:29:38,149 INFO L290 TraceCheckUtils]: 24: Hoare triple {81#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {81#false} is VALID [2022-02-20 18:29:38,150 INFO L290 TraceCheckUtils]: 25: Hoare triple {81#false} check_#res#1 := check_~tmp~1#1; {81#false} is VALID [2022-02-20 18:29:38,150 INFO L290 TraceCheckUtils]: 26: Hoare triple {81#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {81#false} is VALID [2022-02-20 18:29:38,150 INFO L290 TraceCheckUtils]: 27: Hoare triple {81#false} assume 0 == assert_~arg#1 % 256; {81#false} is VALID [2022-02-20 18:29:38,151 INFO L290 TraceCheckUtils]: 28: Hoare triple {81#false} assume !false; {81#false} is VALID [2022-02-20 18:29:38,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:29:38,152 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:38,153 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809614913] [2022-02-20 18:29:38,154 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809614913] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:38,154 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:38,154 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:29:38,157 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004310850] [2022-02-20 18:29:38,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:38,163 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 18:29:38,165 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:38,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:38,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:38,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:29:38,205 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:38,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:29:38,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:29:38,238 INFO L87 Difference]: Start difference. First operand has 77 states, 75 states have (on average 1.7066666666666668) internal successors, (128), 76 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:38,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:38,353 INFO L93 Difference]: Finished difference Result 122 states and 201 transitions. [2022-02-20 18:29:38,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:29:38,354 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 18:29:38,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:38,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:38,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 201 transitions. [2022-02-20 18:29:38,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:38,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 201 transitions. [2022-02-20 18:29:38,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 201 transitions. [2022-02-20 18:29:38,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:38,553 INFO L225 Difference]: With dead ends: 122 [2022-02-20 18:29:38,557 INFO L226 Difference]: Without dead ends: 73 [2022-02-20 18:29:38,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:29:38,564 INFO L933 BasicCegarLoop]: 121 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, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:38,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:38,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-02-20 18:29:38,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-02-20 18:29:38,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:38,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 73 states, 72 states have (on average 1.6805555555555556) internal successors, (121), 72 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:38,597 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 73 states, 72 states have (on average 1.6805555555555556) internal successors, (121), 72 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:38,598 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 73 states, 72 states have (on average 1.6805555555555556) internal successors, (121), 72 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:38,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:38,606 INFO L93 Difference]: Finished difference Result 73 states and 121 transitions. [2022-02-20 18:29:38,606 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 121 transitions. [2022-02-20 18:29:38,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:38,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:38,610 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 72 states have (on average 1.6805555555555556) internal successors, (121), 72 states have internal predecessors, (121), 0 states have call successors, (0), 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 73 states. [2022-02-20 18:29:38,611 INFO L87 Difference]: Start difference. First operand has 73 states, 72 states have (on average 1.6805555555555556) internal successors, (121), 72 states have internal predecessors, (121), 0 states have call successors, (0), 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 73 states. [2022-02-20 18:29:38,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:38,617 INFO L93 Difference]: Finished difference Result 73 states and 121 transitions. [2022-02-20 18:29:38,617 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 121 transitions. [2022-02-20 18:29:38,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:38,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:38,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:38,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:38,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.6805555555555556) internal successors, (121), 72 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:38,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 121 transitions. [2022-02-20 18:29:38,632 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 121 transitions. Word has length 29 [2022-02-20 18:29:38,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:38,633 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 121 transitions. [2022-02-20 18:29:38,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:38,633 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 121 transitions. [2022-02-20 18:29:38,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 18:29:38,636 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:38,636 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:29:38,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:29:38,637 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:38,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:38,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1971121216, now seen corresponding path program 1 times [2022-02-20 18:29:38,640 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:38,640 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441816062] [2022-02-20 18:29:38,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:38,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:38,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {449#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; {449#true} is VALID [2022-02-20 18:29:38,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {449#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {449#true} is VALID [2022-02-20 18:29:38,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {449#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {451#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 18:29:38,754 INFO L290 TraceCheckUtils]: 3: Hoare triple {451#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {452#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:29:38,755 INFO L290 TraceCheckUtils]: 4: Hoare triple {452#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {453#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 18:29:38,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {453#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {450#false} is VALID [2022-02-20 18:29:38,756 INFO L290 TraceCheckUtils]: 6: Hoare triple {450#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {450#false} is VALID [2022-02-20 18:29:38,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {450#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {450#false} is VALID [2022-02-20 18:29:38,757 INFO L290 TraceCheckUtils]: 8: Hoare triple {450#false} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {450#false} is VALID [2022-02-20 18:29:38,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {450#false} assume !(node1_~m1~0#1 != ~nomsg~0); {450#false} is VALID [2022-02-20 18:29:38,757 INFO L290 TraceCheckUtils]: 10: Hoare triple {450#false} ~mode1~0 := 0; {450#false} is VALID [2022-02-20 18:29:38,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {450#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {450#false} is VALID [2022-02-20 18:29:38,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {450#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {450#false} is VALID [2022-02-20 18:29:38,758 INFO L290 TraceCheckUtils]: 13: Hoare triple {450#false} assume !(node2_~m2~0#1 != ~nomsg~0); {450#false} is VALID [2022-02-20 18:29:38,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {450#false} ~mode2~0 := 0; {450#false} is VALID [2022-02-20 18:29:38,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {450#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {450#false} is VALID [2022-02-20 18:29:38,759 INFO L290 TraceCheckUtils]: 16: Hoare triple {450#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {450#false} is VALID [2022-02-20 18:29:38,759 INFO L290 TraceCheckUtils]: 17: Hoare triple {450#false} assume !(node3_~m3~0#1 != ~nomsg~0); {450#false} is VALID [2022-02-20 18:29:38,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {450#false} ~mode3~0 := 0; {450#false} is VALID [2022-02-20 18:29:38,759 INFO L290 TraceCheckUtils]: 19: Hoare triple {450#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {450#false} is VALID [2022-02-20 18:29:38,763 INFO L290 TraceCheckUtils]: 20: Hoare triple {450#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {450#false} is VALID [2022-02-20 18:29:38,764 INFO L290 TraceCheckUtils]: 21: Hoare triple {450#false} assume !(node4_~m4~0#1 != ~nomsg~0); {450#false} is VALID [2022-02-20 18:29:38,764 INFO L290 TraceCheckUtils]: 22: Hoare triple {450#false} ~mode4~0 := 0; {450#false} is VALID [2022-02-20 18:29:38,764 INFO L290 TraceCheckUtils]: 23: Hoare triple {450#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; {450#false} is VALID [2022-02-20 18:29:38,764 INFO L290 TraceCheckUtils]: 24: Hoare triple {450#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {450#false} is VALID [2022-02-20 18:29:38,764 INFO L290 TraceCheckUtils]: 25: Hoare triple {450#false} check_#res#1 := check_~tmp~1#1; {450#false} is VALID [2022-02-20 18:29:38,766 INFO L290 TraceCheckUtils]: 26: Hoare triple {450#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {450#false} is VALID [2022-02-20 18:29:38,768 INFO L290 TraceCheckUtils]: 27: Hoare triple {450#false} assume 0 == assert_~arg#1 % 256; {450#false} is VALID [2022-02-20 18:29:38,768 INFO L290 TraceCheckUtils]: 28: Hoare triple {450#false} assume !false; {450#false} is VALID [2022-02-20 18:29:38,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:29:38,769 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:38,770 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441816062] [2022-02-20 18:29:38,770 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441816062] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:38,770 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:38,770 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:29:38,771 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191826045] [2022-02-20 18:29:38,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:38,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 18:29:38,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:38,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:38,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:38,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:29:38,813 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:38,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:29:38,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:29:38,815 INFO L87 Difference]: Start difference. First operand 73 states and 121 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:39,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:39,124 INFO L93 Difference]: Finished difference Result 121 states and 194 transitions. [2022-02-20 18:29:39,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:29:39,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 18:29:39,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:39,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:39,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 194 transitions. [2022-02-20 18:29:39,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:39,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 194 transitions. [2022-02-20 18:29:39,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 194 transitions. [2022-02-20 18:29:39,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:39,333 INFO L225 Difference]: With dead ends: 121 [2022-02-20 18:29:39,333 INFO L226 Difference]: Without dead ends: 73 [2022-02-20 18:29:39,334 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:29:39,335 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 3 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:39,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 450 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:39,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-02-20 18:29:39,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-02-20 18:29:39,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:39,341 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 73 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 72 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:39,341 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 73 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 72 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:39,342 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 73 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 72 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:39,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:39,344 INFO L93 Difference]: Finished difference Result 73 states and 98 transitions. [2022-02-20 18:29:39,344 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 98 transitions. [2022-02-20 18:29:39,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:39,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:39,345 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 72 states have internal predecessors, (98), 0 states have call successors, (0), 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 73 states. [2022-02-20 18:29:39,346 INFO L87 Difference]: Start difference. First operand has 73 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 72 states have internal predecessors, (98), 0 states have call successors, (0), 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 73 states. [2022-02-20 18:29:39,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:39,348 INFO L93 Difference]: Finished difference Result 73 states and 98 transitions. [2022-02-20 18:29:39,348 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 98 transitions. [2022-02-20 18:29:39,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:39,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:39,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:39,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:39,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 72 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:39,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 98 transitions. [2022-02-20 18:29:39,352 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 98 transitions. Word has length 29 [2022-02-20 18:29:39,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:39,352 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 98 transitions. [2022-02-20 18:29:39,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:39,352 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 98 transitions. [2022-02-20 18:29:39,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:29:39,354 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:39,354 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:29:39,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:29:39,354 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:39,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:39,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1333293339, now seen corresponding path program 1 times [2022-02-20 18:29:39,355 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:39,356 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667790535] [2022-02-20 18:29:39,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:39,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:39,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:39,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {824#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; {824#true} is VALID [2022-02-20 18:29:39,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {824#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {824#true} is VALID [2022-02-20 18:29:39,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {824#true} assume 0 == ~r1~0 % 256; {824#true} is VALID [2022-02-20 18:29:39,429 INFO L290 TraceCheckUtils]: 3: Hoare triple {824#true} assume ~id1~0 >= 0; {824#true} is VALID [2022-02-20 18:29:39,430 INFO L290 TraceCheckUtils]: 4: Hoare triple {824#true} assume 0 == ~st1~0; {824#true} is VALID [2022-02-20 18:29:39,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {824#true} assume ~send1~0 == ~id1~0; {824#true} is VALID [2022-02-20 18:29:39,431 INFO L290 TraceCheckUtils]: 6: Hoare triple {824#true} assume 0 == ~mode1~0 % 256; {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:39,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:39,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:39,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:39,433 INFO L290 TraceCheckUtils]: 10: Hoare triple {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:39,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:39,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:39,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:39,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:39,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:39,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:39,436 INFO L290 TraceCheckUtils]: 17: Hoare triple {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:39,437 INFO L290 TraceCheckUtils]: 18: Hoare triple {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:39,437 INFO L290 TraceCheckUtils]: 19: Hoare triple {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:39,438 INFO L290 TraceCheckUtils]: 20: Hoare triple {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:39,438 INFO L290 TraceCheckUtils]: 21: Hoare triple {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:39,439 INFO L290 TraceCheckUtils]: 22: Hoare triple {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:39,439 INFO L290 TraceCheckUtils]: 23: Hoare triple {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:39,440 INFO L290 TraceCheckUtils]: 24: Hoare triple {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:39,440 INFO L290 TraceCheckUtils]: 25: Hoare triple {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:39,441 INFO L290 TraceCheckUtils]: 26: Hoare triple {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:39,442 INFO L290 TraceCheckUtils]: 27: Hoare triple {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:39,442 INFO L290 TraceCheckUtils]: 28: Hoare triple {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:39,443 INFO L290 TraceCheckUtils]: 29: Hoare triple {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:39,443 INFO L290 TraceCheckUtils]: 30: Hoare triple {826#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {825#false} is VALID [2022-02-20 18:29:39,444 INFO L290 TraceCheckUtils]: 31: Hoare triple {825#false} assume !(node1_~m1~0#1 != ~nomsg~0); {825#false} is VALID [2022-02-20 18:29:39,444 INFO L290 TraceCheckUtils]: 32: Hoare triple {825#false} ~mode1~0 := 0; {825#false} is VALID [2022-02-20 18:29:39,444 INFO L290 TraceCheckUtils]: 33: Hoare triple {825#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {825#false} is VALID [2022-02-20 18:29:39,444 INFO L290 TraceCheckUtils]: 34: Hoare triple {825#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {825#false} is VALID [2022-02-20 18:29:39,444 INFO L290 TraceCheckUtils]: 35: Hoare triple {825#false} assume !(node2_~m2~0#1 != ~nomsg~0); {825#false} is VALID [2022-02-20 18:29:39,445 INFO L290 TraceCheckUtils]: 36: Hoare triple {825#false} ~mode2~0 := 0; {825#false} is VALID [2022-02-20 18:29:39,445 INFO L290 TraceCheckUtils]: 37: Hoare triple {825#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {825#false} is VALID [2022-02-20 18:29:39,445 INFO L290 TraceCheckUtils]: 38: Hoare triple {825#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {825#false} is VALID [2022-02-20 18:29:39,445 INFO L290 TraceCheckUtils]: 39: Hoare triple {825#false} assume !(node3_~m3~0#1 != ~nomsg~0); {825#false} is VALID [2022-02-20 18:29:39,445 INFO L290 TraceCheckUtils]: 40: Hoare triple {825#false} ~mode3~0 := 0; {825#false} is VALID [2022-02-20 18:29:39,446 INFO L290 TraceCheckUtils]: 41: Hoare triple {825#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {825#false} is VALID [2022-02-20 18:29:39,446 INFO L290 TraceCheckUtils]: 42: Hoare triple {825#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {825#false} is VALID [2022-02-20 18:29:39,446 INFO L290 TraceCheckUtils]: 43: Hoare triple {825#false} assume !(node4_~m4~0#1 != ~nomsg~0); {825#false} is VALID [2022-02-20 18:29:39,446 INFO L290 TraceCheckUtils]: 44: Hoare triple {825#false} ~mode4~0 := 0; {825#false} is VALID [2022-02-20 18:29:39,447 INFO L290 TraceCheckUtils]: 45: Hoare triple {825#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; {825#false} is VALID [2022-02-20 18:29:39,447 INFO L290 TraceCheckUtils]: 46: Hoare triple {825#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {825#false} is VALID [2022-02-20 18:29:39,447 INFO L290 TraceCheckUtils]: 47: Hoare triple {825#false} check_#res#1 := check_~tmp~1#1; {825#false} is VALID [2022-02-20 18:29:39,449 INFO L290 TraceCheckUtils]: 48: Hoare triple {825#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {825#false} is VALID [2022-02-20 18:29:39,450 INFO L290 TraceCheckUtils]: 49: Hoare triple {825#false} assume 0 == assert_~arg#1 % 256; {825#false} is VALID [2022-02-20 18:29:39,450 INFO L290 TraceCheckUtils]: 50: Hoare triple {825#false} assume !false; {825#false} is VALID [2022-02-20 18:29:39,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:29:39,451 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:39,451 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667790535] [2022-02-20 18:29:39,451 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667790535] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:39,451 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:39,451 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:29:39,452 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589960519] [2022-02-20 18:29:39,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:39,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:29:39,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:39,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:39,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:39,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:29:39,491 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:39,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:29:39,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:39,492 INFO L87 Difference]: Start difference. First operand 73 states and 98 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:39,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:39,655 INFO L93 Difference]: Finished difference Result 155 states and 226 transitions. [2022-02-20 18:29:39,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:29:39,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:29:39,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:39,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:39,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 226 transitions. [2022-02-20 18:29:39,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:39,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 226 transitions. [2022-02-20 18:29:39,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 226 transitions. [2022-02-20 18:29:39,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:39,845 INFO L225 Difference]: With dead ends: 155 [2022-02-20 18:29:39,845 INFO L226 Difference]: Without dead ends: 111 [2022-02-20 18:29:39,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:39,847 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 59 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:39,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 220 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:39,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-02-20 18:29:39,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2022-02-20 18:29:39,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:39,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 109 states, 108 states have (on average 1.4351851851851851) internal successors, (155), 108 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:39,855 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 109 states, 108 states have (on average 1.4351851851851851) internal successors, (155), 108 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:39,856 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 109 states, 108 states have (on average 1.4351851851851851) internal successors, (155), 108 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:39,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:39,859 INFO L93 Difference]: Finished difference Result 111 states and 156 transitions. [2022-02-20 18:29:39,859 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 156 transitions. [2022-02-20 18:29:39,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:39,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:39,860 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 108 states have (on average 1.4351851851851851) internal successors, (155), 108 states have internal predecessors, (155), 0 states have call successors, (0), 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 111 states. [2022-02-20 18:29:39,860 INFO L87 Difference]: Start difference. First operand has 109 states, 108 states have (on average 1.4351851851851851) internal successors, (155), 108 states have internal predecessors, (155), 0 states have call successors, (0), 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 111 states. [2022-02-20 18:29:39,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:39,864 INFO L93 Difference]: Finished difference Result 111 states and 156 transitions. [2022-02-20 18:29:39,864 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 156 transitions. [2022-02-20 18:29:39,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:39,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:39,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:39,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:39,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.4351851851851851) internal successors, (155), 108 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:39,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 155 transitions. [2022-02-20 18:29:39,868 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 155 transitions. Word has length 51 [2022-02-20 18:29:39,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:39,868 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 155 transitions. [2022-02-20 18:29:39,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:39,869 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 155 transitions. [2022-02-20 18:29:39,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:29:39,870 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:39,870 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:29:39,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:29:39,871 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:39,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:39,871 INFO L85 PathProgramCache]: Analyzing trace with hash -606737519, now seen corresponding path program 1 times [2022-02-20 18:29:39,871 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:39,872 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839413087] [2022-02-20 18:29:39,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:39,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:39,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:39,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {1352#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; {1352#true} is VALID [2022-02-20 18:29:39,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {1352#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1352#true} is VALID [2022-02-20 18:29:39,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {1352#true} assume 0 == ~r1~0 % 256; {1352#true} is VALID [2022-02-20 18:29:39,972 INFO L290 TraceCheckUtils]: 3: Hoare triple {1352#true} assume ~id1~0 >= 0; {1352#true} is VALID [2022-02-20 18:29:39,973 INFO L290 TraceCheckUtils]: 4: Hoare triple {1352#true} assume 0 == ~st1~0; {1352#true} is VALID [2022-02-20 18:29:39,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {1352#true} assume ~send1~0 == ~id1~0; {1352#true} is VALID [2022-02-20 18:29:39,973 INFO L290 TraceCheckUtils]: 6: Hoare triple {1352#true} assume 0 == ~mode1~0 % 256; {1352#true} is VALID [2022-02-20 18:29:39,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {1352#true} assume ~id2~0 >= 0; {1352#true} is VALID [2022-02-20 18:29:39,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {1352#true} assume 0 == ~st2~0; {1352#true} is VALID [2022-02-20 18:29:39,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {1352#true} assume ~send2~0 == ~id2~0; {1352#true} is VALID [2022-02-20 18:29:39,974 INFO L290 TraceCheckUtils]: 10: Hoare triple {1352#true} assume 0 == ~mode2~0 % 256; {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:39,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:39,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:39,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:39,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:39,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:39,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:39,978 INFO L290 TraceCheckUtils]: 17: Hoare triple {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:39,978 INFO L290 TraceCheckUtils]: 18: Hoare triple {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:39,979 INFO L290 TraceCheckUtils]: 19: Hoare triple {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:39,979 INFO L290 TraceCheckUtils]: 20: Hoare triple {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:39,980 INFO L290 TraceCheckUtils]: 21: Hoare triple {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:39,980 INFO L290 TraceCheckUtils]: 22: Hoare triple {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:39,981 INFO L290 TraceCheckUtils]: 23: Hoare triple {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:39,981 INFO L290 TraceCheckUtils]: 24: Hoare triple {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:39,982 INFO L290 TraceCheckUtils]: 25: Hoare triple {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:39,982 INFO L290 TraceCheckUtils]: 26: Hoare triple {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:39,983 INFO L290 TraceCheckUtils]: 27: Hoare triple {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:39,984 INFO L290 TraceCheckUtils]: 28: Hoare triple {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:39,984 INFO L290 TraceCheckUtils]: 29: Hoare triple {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:39,985 INFO L290 TraceCheckUtils]: 30: Hoare triple {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:39,985 INFO L290 TraceCheckUtils]: 31: Hoare triple {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:39,986 INFO L290 TraceCheckUtils]: 32: Hoare triple {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:39,986 INFO L290 TraceCheckUtils]: 33: Hoare triple {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1354#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:39,987 INFO L290 TraceCheckUtils]: 34: Hoare triple {1354#(= (+ (* (- 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; {1353#false} is VALID [2022-02-20 18:29:39,987 INFO L290 TraceCheckUtils]: 35: Hoare triple {1353#false} assume !(node2_~m2~0#1 != ~nomsg~0); {1353#false} is VALID [2022-02-20 18:29:39,987 INFO L290 TraceCheckUtils]: 36: Hoare triple {1353#false} ~mode2~0 := 0; {1353#false} is VALID [2022-02-20 18:29:39,988 INFO L290 TraceCheckUtils]: 37: Hoare triple {1353#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1353#false} is VALID [2022-02-20 18:29:39,988 INFO L290 TraceCheckUtils]: 38: Hoare triple {1353#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1353#false} is VALID [2022-02-20 18:29:39,988 INFO L290 TraceCheckUtils]: 39: Hoare triple {1353#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1353#false} is VALID [2022-02-20 18:29:39,988 INFO L290 TraceCheckUtils]: 40: Hoare triple {1353#false} ~mode3~0 := 0; {1353#false} is VALID [2022-02-20 18:29:39,988 INFO L290 TraceCheckUtils]: 41: Hoare triple {1353#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1353#false} is VALID [2022-02-20 18:29:39,989 INFO L290 TraceCheckUtils]: 42: Hoare triple {1353#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1353#false} is VALID [2022-02-20 18:29:39,989 INFO L290 TraceCheckUtils]: 43: Hoare triple {1353#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1353#false} is VALID [2022-02-20 18:29:39,989 INFO L290 TraceCheckUtils]: 44: Hoare triple {1353#false} ~mode4~0 := 0; {1353#false} is VALID [2022-02-20 18:29:39,989 INFO L290 TraceCheckUtils]: 45: Hoare triple {1353#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; {1353#false} is VALID [2022-02-20 18:29:39,989 INFO L290 TraceCheckUtils]: 46: Hoare triple {1353#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {1353#false} is VALID [2022-02-20 18:29:39,990 INFO L290 TraceCheckUtils]: 47: Hoare triple {1353#false} check_#res#1 := check_~tmp~1#1; {1353#false} is VALID [2022-02-20 18:29:39,990 INFO L290 TraceCheckUtils]: 48: Hoare triple {1353#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1353#false} is VALID [2022-02-20 18:29:39,990 INFO L290 TraceCheckUtils]: 49: Hoare triple {1353#false} assume 0 == assert_~arg#1 % 256; {1353#false} is VALID [2022-02-20 18:29:39,990 INFO L290 TraceCheckUtils]: 50: Hoare triple {1353#false} assume !false; {1353#false} is VALID [2022-02-20 18:29:39,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:29:39,991 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:39,991 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839413087] [2022-02-20 18:29:39,992 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839413087] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:39,992 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:39,992 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:29:39,992 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536691764] [2022-02-20 18:29:39,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:39,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:29:39,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:39,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:40,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:40,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:29:40,031 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:40,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:29:40,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:40,032 INFO L87 Difference]: Start difference. First operand 109 states and 155 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:40,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:40,198 INFO L93 Difference]: Finished difference Result 257 states and 387 transitions. [2022-02-20 18:29:40,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:29:40,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:29:40,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:40,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:40,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 226 transitions. [2022-02-20 18:29:40,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:40,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 226 transitions. [2022-02-20 18:29:40,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 226 transitions. [2022-02-20 18:29:40,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:40,389 INFO L225 Difference]: With dead ends: 257 [2022-02-20 18:29:40,390 INFO L226 Difference]: Without dead ends: 177 [2022-02-20 18:29:40,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:40,395 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 55 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:40,397 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 219 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:40,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-02-20 18:29:40,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2022-02-20 18:29:40,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:40,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand has 175 states, 174 states have (on average 1.4827586206896552) internal successors, (258), 174 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:40,415 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand has 175 states, 174 states have (on average 1.4827586206896552) internal successors, (258), 174 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:40,416 INFO L87 Difference]: Start difference. First operand 177 states. Second operand has 175 states, 174 states have (on average 1.4827586206896552) internal successors, (258), 174 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:40,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:40,422 INFO L93 Difference]: Finished difference Result 177 states and 259 transitions. [2022-02-20 18:29:40,422 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 259 transitions. [2022-02-20 18:29:40,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:40,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:40,423 INFO L74 IsIncluded]: Start isIncluded. First operand has 175 states, 174 states have (on average 1.4827586206896552) internal successors, (258), 174 states have internal predecessors, (258), 0 states have call successors, (0), 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 177 states. [2022-02-20 18:29:40,424 INFO L87 Difference]: Start difference. First operand has 175 states, 174 states have (on average 1.4827586206896552) internal successors, (258), 174 states have internal predecessors, (258), 0 states have call successors, (0), 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 177 states. [2022-02-20 18:29:40,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:40,429 INFO L93 Difference]: Finished difference Result 177 states and 259 transitions. [2022-02-20 18:29:40,429 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 259 transitions. [2022-02-20 18:29:40,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:40,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:40,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:40,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:40,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 174 states have (on average 1.4827586206896552) internal successors, (258), 174 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:40,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 258 transitions. [2022-02-20 18:29:40,436 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 258 transitions. Word has length 51 [2022-02-20 18:29:40,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:40,438 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 258 transitions. [2022-02-20 18:29:40,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:40,439 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 258 transitions. [2022-02-20 18:29:40,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:29:40,441 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:40,441 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:29:40,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:29:40,443 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:40,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:40,444 INFO L85 PathProgramCache]: Analyzing trace with hash 2093945095, now seen corresponding path program 1 times [2022-02-20 18:29:40,444 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:40,444 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404569178] [2022-02-20 18:29:40,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:40,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:40,572 INFO L290 TraceCheckUtils]: 0: Hoare triple {2215#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; {2215#true} is VALID [2022-02-20 18:29:40,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {2215#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {2215#true} is VALID [2022-02-20 18:29:40,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {2215#true} assume 0 == ~r1~0 % 256; {2215#true} is VALID [2022-02-20 18:29:40,573 INFO L290 TraceCheckUtils]: 3: Hoare triple {2215#true} assume ~id1~0 >= 0; {2215#true} is VALID [2022-02-20 18:29:40,573 INFO L290 TraceCheckUtils]: 4: Hoare triple {2215#true} assume 0 == ~st1~0; {2215#true} is VALID [2022-02-20 18:29:40,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {2215#true} assume ~send1~0 == ~id1~0; {2215#true} is VALID [2022-02-20 18:29:40,573 INFO L290 TraceCheckUtils]: 6: Hoare triple {2215#true} assume 0 == ~mode1~0 % 256; {2215#true} is VALID [2022-02-20 18:29:40,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {2215#true} assume ~id2~0 >= 0; {2215#true} is VALID [2022-02-20 18:29:40,574 INFO L290 TraceCheckUtils]: 8: Hoare triple {2215#true} assume 0 == ~st2~0; {2215#true} is VALID [2022-02-20 18:29:40,574 INFO L290 TraceCheckUtils]: 9: Hoare triple {2215#true} assume ~send2~0 == ~id2~0; {2215#true} is VALID [2022-02-20 18:29:40,574 INFO L290 TraceCheckUtils]: 10: Hoare triple {2215#true} assume 0 == ~mode2~0 % 256; {2215#true} is VALID [2022-02-20 18:29:40,574 INFO L290 TraceCheckUtils]: 11: Hoare triple {2215#true} assume ~id3~0 >= 0; {2215#true} is VALID [2022-02-20 18:29:40,574 INFO L290 TraceCheckUtils]: 12: Hoare triple {2215#true} assume 0 == ~st3~0; {2215#true} is VALID [2022-02-20 18:29:40,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {2215#true} assume ~send3~0 == ~id3~0; {2215#true} is VALID [2022-02-20 18:29:40,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {2215#true} assume 0 == ~mode3~0 % 256; {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:40,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:40,576 INFO L290 TraceCheckUtils]: 16: Hoare triple {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:40,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:40,577 INFO L290 TraceCheckUtils]: 18: Hoare triple {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:40,578 INFO L290 TraceCheckUtils]: 19: Hoare triple {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:40,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:40,579 INFO L290 TraceCheckUtils]: 21: Hoare triple {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:40,579 INFO L290 TraceCheckUtils]: 22: Hoare triple {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:40,580 INFO L290 TraceCheckUtils]: 23: Hoare triple {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:40,580 INFO L290 TraceCheckUtils]: 24: Hoare triple {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:40,581 INFO L290 TraceCheckUtils]: 25: Hoare triple {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:40,581 INFO L290 TraceCheckUtils]: 26: Hoare triple {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:40,582 INFO L290 TraceCheckUtils]: 27: Hoare triple {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:40,582 INFO L290 TraceCheckUtils]: 28: Hoare triple {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:40,583 INFO L290 TraceCheckUtils]: 29: Hoare triple {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:40,583 INFO L290 TraceCheckUtils]: 30: Hoare triple {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:40,584 INFO L290 TraceCheckUtils]: 31: Hoare triple {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:40,584 INFO L290 TraceCheckUtils]: 32: Hoare triple {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:40,585 INFO L290 TraceCheckUtils]: 33: Hoare triple {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:40,585 INFO L290 TraceCheckUtils]: 34: Hoare triple {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:40,586 INFO L290 TraceCheckUtils]: 35: Hoare triple {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:40,586 INFO L290 TraceCheckUtils]: 36: Hoare triple {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:40,587 INFO L290 TraceCheckUtils]: 37: Hoare triple {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {2217#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:40,592 INFO L290 TraceCheckUtils]: 38: Hoare triple {2217#(= (+ (* (- 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; {2216#false} is VALID [2022-02-20 18:29:40,592 INFO L290 TraceCheckUtils]: 39: Hoare triple {2216#false} assume !(node3_~m3~0#1 != ~nomsg~0); {2216#false} is VALID [2022-02-20 18:29:40,592 INFO L290 TraceCheckUtils]: 40: Hoare triple {2216#false} ~mode3~0 := 0; {2216#false} is VALID [2022-02-20 18:29:40,593 INFO L290 TraceCheckUtils]: 41: Hoare triple {2216#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {2216#false} is VALID [2022-02-20 18:29:40,593 INFO L290 TraceCheckUtils]: 42: Hoare triple {2216#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2216#false} is VALID [2022-02-20 18:29:40,593 INFO L290 TraceCheckUtils]: 43: Hoare triple {2216#false} assume !(node4_~m4~0#1 != ~nomsg~0); {2216#false} is VALID [2022-02-20 18:29:40,593 INFO L290 TraceCheckUtils]: 44: Hoare triple {2216#false} ~mode4~0 := 0; {2216#false} is VALID [2022-02-20 18:29:40,593 INFO L290 TraceCheckUtils]: 45: Hoare triple {2216#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; {2216#false} is VALID [2022-02-20 18:29:40,594 INFO L290 TraceCheckUtils]: 46: Hoare triple {2216#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {2216#false} is VALID [2022-02-20 18:29:40,594 INFO L290 TraceCheckUtils]: 47: Hoare triple {2216#false} check_#res#1 := check_~tmp~1#1; {2216#false} is VALID [2022-02-20 18:29:40,594 INFO L290 TraceCheckUtils]: 48: Hoare triple {2216#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {2216#false} is VALID [2022-02-20 18:29:40,594 INFO L290 TraceCheckUtils]: 49: Hoare triple {2216#false} assume 0 == assert_~arg#1 % 256; {2216#false} is VALID [2022-02-20 18:29:40,594 INFO L290 TraceCheckUtils]: 50: Hoare triple {2216#false} assume !false; {2216#false} is VALID [2022-02-20 18:29:40,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:29:40,595 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:40,595 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404569178] [2022-02-20 18:29:40,595 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404569178] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:40,596 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:40,596 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:29:40,596 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021391967] [2022-02-20 18:29:40,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:40,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:29:40,597 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:40,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:40,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:40,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:29:40,633 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:40,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:29:40,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:40,634 INFO L87 Difference]: Start difference. First operand 175 states and 258 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:40,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:40,792 INFO L93 Difference]: Finished difference Result 443 states and 676 transitions. [2022-02-20 18:29:40,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:29:40,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:29:40,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:40,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:40,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 226 transitions. [2022-02-20 18:29:40,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:40,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 226 transitions. [2022-02-20 18:29:40,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 226 transitions. [2022-02-20 18:29:40,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:40,977 INFO L225 Difference]: With dead ends: 443 [2022-02-20 18:29:40,977 INFO L226 Difference]: Without dead ends: 297 [2022-02-20 18:29:40,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:40,978 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 51 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:40,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 218 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:40,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-02-20 18:29:40,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 295. [2022-02-20 18:29:40,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:40,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 297 states. Second operand has 295 states, 294 states have (on average 1.5034013605442176) internal successors, (442), 294 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:40,999 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand has 295 states, 294 states have (on average 1.5034013605442176) internal successors, (442), 294 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:41,000 INFO L87 Difference]: Start difference. First operand 297 states. Second operand has 295 states, 294 states have (on average 1.5034013605442176) internal successors, (442), 294 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:41,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:41,009 INFO L93 Difference]: Finished difference Result 297 states and 443 transitions. [2022-02-20 18:29:41,009 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 443 transitions. [2022-02-20 18:29:41,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:41,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:41,011 INFO L74 IsIncluded]: Start isIncluded. First operand has 295 states, 294 states have (on average 1.5034013605442176) internal successors, (442), 294 states have internal predecessors, (442), 0 states have call successors, (0), 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 297 states. [2022-02-20 18:29:41,012 INFO L87 Difference]: Start difference. First operand has 295 states, 294 states have (on average 1.5034013605442176) internal successors, (442), 294 states have internal predecessors, (442), 0 states have call successors, (0), 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 297 states. [2022-02-20 18:29:41,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:41,020 INFO L93 Difference]: Finished difference Result 297 states and 443 transitions. [2022-02-20 18:29:41,021 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 443 transitions. [2022-02-20 18:29:41,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:41,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:41,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:41,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:41,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 294 states have (on average 1.5034013605442176) internal successors, (442), 294 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:41,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 442 transitions. [2022-02-20 18:29:41,032 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 442 transitions. Word has length 51 [2022-02-20 18:29:41,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:41,032 INFO L470 AbstractCegarLoop]: Abstraction has 295 states and 442 transitions. [2022-02-20 18:29:41,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:41,032 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 442 transitions. [2022-02-20 18:29:41,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:29:41,033 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:41,033 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:29:41,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:29:41,034 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:41,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:41,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1863229059, now seen corresponding path program 1 times [2022-02-20 18:29:41,034 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:41,035 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963876569] [2022-02-20 18:29:41,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:41,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:41,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {3694#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; {3694#true} is VALID [2022-02-20 18:29:41,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {3694#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {3694#true} is VALID [2022-02-20 18:29:41,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {3694#true} assume 0 == ~r1~0 % 256; {3694#true} is VALID [2022-02-20 18:29:41,146 INFO L290 TraceCheckUtils]: 3: Hoare triple {3694#true} assume ~id1~0 >= 0; {3694#true} is VALID [2022-02-20 18:29:41,147 INFO L290 TraceCheckUtils]: 4: Hoare triple {3694#true} assume 0 == ~st1~0; {3694#true} is VALID [2022-02-20 18:29:41,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {3694#true} assume ~send1~0 == ~id1~0; {3694#true} is VALID [2022-02-20 18:29:41,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {3694#true} assume 0 == ~mode1~0 % 256; {3694#true} is VALID [2022-02-20 18:29:41,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {3694#true} assume ~id2~0 >= 0; {3694#true} is VALID [2022-02-20 18:29:41,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {3694#true} assume 0 == ~st2~0; {3694#true} is VALID [2022-02-20 18:29:41,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {3694#true} assume ~send2~0 == ~id2~0; {3694#true} is VALID [2022-02-20 18:29:41,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {3694#true} assume 0 == ~mode2~0 % 256; {3694#true} is VALID [2022-02-20 18:29:41,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {3694#true} assume ~id3~0 >= 0; {3694#true} is VALID [2022-02-20 18:29:41,148 INFO L290 TraceCheckUtils]: 12: Hoare triple {3694#true} assume 0 == ~st3~0; {3694#true} is VALID [2022-02-20 18:29:41,148 INFO L290 TraceCheckUtils]: 13: Hoare triple {3694#true} assume ~send3~0 == ~id3~0; {3694#true} is VALID [2022-02-20 18:29:41,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {3694#true} assume 0 == ~mode3~0 % 256; {3694#true} is VALID [2022-02-20 18:29:41,149 INFO L290 TraceCheckUtils]: 15: Hoare triple {3694#true} assume ~id4~0 >= 0; {3694#true} is VALID [2022-02-20 18:29:41,149 INFO L290 TraceCheckUtils]: 16: Hoare triple {3694#true} assume 0 == ~st4~0; {3694#true} is VALID [2022-02-20 18:29:41,149 INFO L290 TraceCheckUtils]: 17: Hoare triple {3694#true} assume ~send4~0 == ~id4~0; {3694#true} is VALID [2022-02-20 18:29:41,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {3694#true} assume 0 == ~mode4~0 % 256; {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:41,150 INFO L290 TraceCheckUtils]: 19: Hoare triple {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:41,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:41,151 INFO L290 TraceCheckUtils]: 21: Hoare triple {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:41,152 INFO L290 TraceCheckUtils]: 22: Hoare triple {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:41,152 INFO L290 TraceCheckUtils]: 23: Hoare triple {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:41,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:41,153 INFO L290 TraceCheckUtils]: 25: Hoare triple {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:41,154 INFO L290 TraceCheckUtils]: 26: Hoare triple {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:41,154 INFO L290 TraceCheckUtils]: 27: Hoare triple {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:41,155 INFO L290 TraceCheckUtils]: 28: Hoare triple {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:41,155 INFO L290 TraceCheckUtils]: 29: Hoare triple {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:41,161 INFO L290 TraceCheckUtils]: 30: Hoare triple {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:41,162 INFO L290 TraceCheckUtils]: 31: Hoare triple {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:41,163 INFO L290 TraceCheckUtils]: 32: Hoare triple {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:41,164 INFO L290 TraceCheckUtils]: 33: Hoare triple {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:41,164 INFO L290 TraceCheckUtils]: 34: Hoare triple {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:41,166 INFO L290 TraceCheckUtils]: 35: Hoare triple {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:41,167 INFO L290 TraceCheckUtils]: 36: Hoare triple {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:41,167 INFO L290 TraceCheckUtils]: 37: Hoare triple {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:41,168 INFO L290 TraceCheckUtils]: 38: Hoare triple {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:41,168 INFO L290 TraceCheckUtils]: 39: Hoare triple {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:41,169 INFO L290 TraceCheckUtils]: 40: Hoare triple {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:41,172 INFO L290 TraceCheckUtils]: 41: Hoare triple {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {3696#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:41,173 INFO L290 TraceCheckUtils]: 42: Hoare triple {3696#(= (+ (* (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; {3695#false} is VALID [2022-02-20 18:29:41,173 INFO L290 TraceCheckUtils]: 43: Hoare triple {3695#false} assume !(node4_~m4~0#1 != ~nomsg~0); {3695#false} is VALID [2022-02-20 18:29:41,173 INFO L290 TraceCheckUtils]: 44: Hoare triple {3695#false} ~mode4~0 := 0; {3695#false} is VALID [2022-02-20 18:29:41,173 INFO L290 TraceCheckUtils]: 45: Hoare triple {3695#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; {3695#false} is VALID [2022-02-20 18:29:41,173 INFO L290 TraceCheckUtils]: 46: Hoare triple {3695#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {3695#false} is VALID [2022-02-20 18:29:41,173 INFO L290 TraceCheckUtils]: 47: Hoare triple {3695#false} check_#res#1 := check_~tmp~1#1; {3695#false} is VALID [2022-02-20 18:29:41,174 INFO L290 TraceCheckUtils]: 48: Hoare triple {3695#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {3695#false} is VALID [2022-02-20 18:29:41,174 INFO L290 TraceCheckUtils]: 49: Hoare triple {3695#false} assume 0 == assert_~arg#1 % 256; {3695#false} is VALID [2022-02-20 18:29:41,174 INFO L290 TraceCheckUtils]: 50: Hoare triple {3695#false} assume !false; {3695#false} is VALID [2022-02-20 18:29:41,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:29:41,175 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:41,175 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963876569] [2022-02-20 18:29:41,175 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963876569] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:41,178 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:41,178 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:29:41,178 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393098093] [2022-02-20 18:29:41,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:41,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:29:41,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:41,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:41,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:41,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:29:41,224 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:41,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:29:41,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:41,227 INFO L87 Difference]: Start difference. First operand 295 states and 442 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:41,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:41,419 INFO L93 Difference]: Finished difference Result 779 states and 1188 transitions. [2022-02-20 18:29:41,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:29:41,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:29:41,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:41,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:41,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 226 transitions. [2022-02-20 18:29:41,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:41,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 226 transitions. [2022-02-20 18:29:41,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 226 transitions. [2022-02-20 18:29:41,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:41,596 INFO L225 Difference]: With dead ends: 779 [2022-02-20 18:29:41,597 INFO L226 Difference]: Without dead ends: 513 [2022-02-20 18:29:41,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:41,598 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 47 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:41,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 217 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:41,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2022-02-20 18:29:41,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 511. [2022-02-20 18:29:41,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:41,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 513 states. Second operand has 511 states, 510 states have (on average 1.5019607843137255) internal successors, (766), 510 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:41,623 INFO L74 IsIncluded]: Start isIncluded. First operand 513 states. Second operand has 511 states, 510 states have (on average 1.5019607843137255) internal successors, (766), 510 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:41,625 INFO L87 Difference]: Start difference. First operand 513 states. Second operand has 511 states, 510 states have (on average 1.5019607843137255) internal successors, (766), 510 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:41,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:41,641 INFO L93 Difference]: Finished difference Result 513 states and 767 transitions. [2022-02-20 18:29:41,641 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 767 transitions. [2022-02-20 18:29:41,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:41,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:41,643 INFO L74 IsIncluded]: Start isIncluded. First operand has 511 states, 510 states have (on average 1.5019607843137255) internal successors, (766), 510 states have internal predecessors, (766), 0 states have call successors, (0), 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 513 states. [2022-02-20 18:29:41,644 INFO L87 Difference]: Start difference. First operand has 511 states, 510 states have (on average 1.5019607843137255) internal successors, (766), 510 states have internal predecessors, (766), 0 states have call successors, (0), 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 513 states. [2022-02-20 18:29:41,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:41,660 INFO L93 Difference]: Finished difference Result 513 states and 767 transitions. [2022-02-20 18:29:41,661 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 767 transitions. [2022-02-20 18:29:41,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:41,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:41,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:41,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:41,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 510 states have (on average 1.5019607843137255) internal successors, (766), 510 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:41,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 766 transitions. [2022-02-20 18:29:41,680 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 766 transitions. Word has length 51 [2022-02-20 18:29:41,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:41,680 INFO L470 AbstractCegarLoop]: Abstraction has 511 states and 766 transitions. [2022-02-20 18:29:41,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:41,681 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 766 transitions. [2022-02-20 18:29:41,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:29:41,681 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:41,682 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:29:41,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:29:41,682 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:41,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:41,682 INFO L85 PathProgramCache]: Analyzing trace with hash -645243661, now seen corresponding path program 1 times [2022-02-20 18:29:41,683 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:41,683 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044362858] [2022-02-20 18:29:41,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:41,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:41,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {6297#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; {6297#true} is VALID [2022-02-20 18:29:41,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {6297#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {6297#true} is VALID [2022-02-20 18:29:41,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {6297#true} assume 0 == ~r1~0 % 256; {6297#true} is VALID [2022-02-20 18:29:41,756 INFO L290 TraceCheckUtils]: 3: Hoare triple {6297#true} assume ~id1~0 >= 0; {6297#true} is VALID [2022-02-20 18:29:41,757 INFO L290 TraceCheckUtils]: 4: Hoare triple {6297#true} assume 0 == ~st1~0; {6299#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:41,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {6299#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {6299#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:41,758 INFO L290 TraceCheckUtils]: 6: Hoare triple {6299#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {6299#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:41,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {6299#(<= ~st1~0 0)} assume ~id2~0 >= 0; {6299#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:41,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {6299#(<= ~st1~0 0)} assume 0 == ~st2~0; {6300#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,759 INFO L290 TraceCheckUtils]: 9: Hoare triple {6300#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {6300#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,759 INFO L290 TraceCheckUtils]: 10: Hoare triple {6300#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {6300#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {6300#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {6300#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {6300#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {6301#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {6301#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {6301#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {6301#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {6301#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {6301#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {6301#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {6301#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,762 INFO L290 TraceCheckUtils]: 17: Hoare triple {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,763 INFO L290 TraceCheckUtils]: 18: Hoare triple {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,764 INFO L290 TraceCheckUtils]: 19: Hoare triple {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,765 INFO L290 TraceCheckUtils]: 21: Hoare triple {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,765 INFO L290 TraceCheckUtils]: 22: Hoare triple {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,765 INFO L290 TraceCheckUtils]: 23: Hoare triple {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,766 INFO L290 TraceCheckUtils]: 24: Hoare triple {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,766 INFO L290 TraceCheckUtils]: 25: Hoare triple {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,767 INFO L290 TraceCheckUtils]: 26: Hoare triple {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,767 INFO L290 TraceCheckUtils]: 27: Hoare triple {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,768 INFO L290 TraceCheckUtils]: 28: Hoare triple {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,768 INFO L290 TraceCheckUtils]: 29: Hoare triple {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,769 INFO L290 TraceCheckUtils]: 30: Hoare triple {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,769 INFO L290 TraceCheckUtils]: 31: Hoare triple {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,770 INFO L290 TraceCheckUtils]: 32: Hoare triple {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,770 INFO L290 TraceCheckUtils]: 33: Hoare triple {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,770 INFO L290 TraceCheckUtils]: 34: Hoare triple {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,771 INFO L290 TraceCheckUtils]: 35: Hoare triple {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,771 INFO L290 TraceCheckUtils]: 36: Hoare triple {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,772 INFO L290 TraceCheckUtils]: 37: Hoare triple {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,772 INFO L290 TraceCheckUtils]: 38: Hoare triple {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,773 INFO L290 TraceCheckUtils]: 39: Hoare triple {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,773 INFO L290 TraceCheckUtils]: 40: Hoare triple {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,774 INFO L290 TraceCheckUtils]: 41: Hoare triple {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,774 INFO L290 TraceCheckUtils]: 42: Hoare triple {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,775 INFO L290 TraceCheckUtils]: 43: Hoare triple {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,777 INFO L290 TraceCheckUtils]: 44: Hoare triple {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,777 INFO L290 TraceCheckUtils]: 45: Hoare triple {6302#(<= (+ ~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; {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,778 INFO L290 TraceCheckUtils]: 46: Hoare triple {6302#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {6298#false} is VALID [2022-02-20 18:29:41,778 INFO L290 TraceCheckUtils]: 47: Hoare triple {6298#false} check_#res#1 := check_~tmp~1#1; {6298#false} is VALID [2022-02-20 18:29:41,778 INFO L290 TraceCheckUtils]: 48: Hoare triple {6298#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {6298#false} is VALID [2022-02-20 18:29:41,778 INFO L290 TraceCheckUtils]: 49: Hoare triple {6298#false} assume 0 == assert_~arg#1 % 256; {6298#false} is VALID [2022-02-20 18:29:41,779 INFO L290 TraceCheckUtils]: 50: Hoare triple {6298#false} assume !false; {6298#false} is VALID [2022-02-20 18:29:41,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:29:41,779 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:41,779 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044362858] [2022-02-20 18:29:41,779 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044362858] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:41,780 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:41,780 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:29:41,780 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228759321] [2022-02-20 18:29:41,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:41,781 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:29:41,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:41,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:41,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:41,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:29:41,816 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:41,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:29:41,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:29:41,816 INFO L87 Difference]: Start difference. First operand 511 states and 766 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:44,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:44,228 INFO L93 Difference]: Finished difference Result 4367 states and 6662 transitions. [2022-02-20 18:29:44,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 18:29:44,228 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:29:44,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:44,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:44,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 650 transitions. [2022-02-20 18:29:44,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:44,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 650 transitions. [2022-02-20 18:29:44,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 650 transitions. [2022-02-20 18:29:44,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 650 edges. 650 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:45,282 INFO L225 Difference]: With dead ends: 4367 [2022-02-20 18:29:45,282 INFO L226 Difference]: Without dead ends: 3885 [2022-02-20 18:29:45,283 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:29:45,283 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 765 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:45,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [765 Valid, 629 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:29:45,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3885 states. [2022-02-20 18:29:45,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3885 to 991. [2022-02-20 18:29:45,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:45,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3885 states. Second operand has 991 states, 990 states have (on average 1.4848484848484849) internal successors, (1470), 990 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:45,745 INFO L74 IsIncluded]: Start isIncluded. First operand 3885 states. Second operand has 991 states, 990 states have (on average 1.4848484848484849) internal successors, (1470), 990 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:45,747 INFO L87 Difference]: Start difference. First operand 3885 states. Second operand has 991 states, 990 states have (on average 1.4848484848484849) internal successors, (1470), 990 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:46,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:46,204 INFO L93 Difference]: Finished difference Result 3885 states and 5797 transitions. [2022-02-20 18:29:46,204 INFO L276 IsEmpty]: Start isEmpty. Operand 3885 states and 5797 transitions. [2022-02-20 18:29:46,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:46,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:46,214 INFO L74 IsIncluded]: Start isIncluded. First operand has 991 states, 990 states have (on average 1.4848484848484849) internal successors, (1470), 990 states have internal predecessors, (1470), 0 states have call successors, (0), 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 3885 states. [2022-02-20 18:29:46,215 INFO L87 Difference]: Start difference. First operand has 991 states, 990 states have (on average 1.4848484848484849) internal successors, (1470), 990 states have internal predecessors, (1470), 0 states have call successors, (0), 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 3885 states. [2022-02-20 18:29:46,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:46,745 INFO L93 Difference]: Finished difference Result 3885 states and 5797 transitions. [2022-02-20 18:29:46,745 INFO L276 IsEmpty]: Start isEmpty. Operand 3885 states and 5797 transitions. [2022-02-20 18:29:46,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:46,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:46,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:46,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:46,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 990 states have (on average 1.4848484848484849) internal successors, (1470), 990 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:46,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1470 transitions. [2022-02-20 18:29:46,807 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1470 transitions. Word has length 51 [2022-02-20 18:29:46,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:46,807 INFO L470 AbstractCegarLoop]: Abstraction has 991 states and 1470 transitions. [2022-02-20 18:29:46,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:46,807 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1470 transitions. [2022-02-20 18:29:46,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:29:46,808 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:46,809 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:29:46,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:29:46,809 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:46,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:46,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1275401347, now seen corresponding path program 1 times [2022-02-20 18:29:46,810 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:46,811 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144228653] [2022-02-20 18:29:46,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:46,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:46,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:46,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {20678#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; {20678#true} is VALID [2022-02-20 18:29:46,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {20678#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {20678#true} is VALID [2022-02-20 18:29:46,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {20678#true} assume 0 == ~r1~0 % 256; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,869 INFO L290 TraceCheckUtils]: 3: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 >= 0; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,869 INFO L290 TraceCheckUtils]: 4: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 == ~id1~0; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 >= 0; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 == ~id2~0; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,871 INFO L290 TraceCheckUtils]: 10: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 >= 0; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 == ~id3~0; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,873 INFO L290 TraceCheckUtils]: 15: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id4~0 >= 0; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st4~0; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,874 INFO L290 TraceCheckUtils]: 17: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send4~0 == ~id4~0; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode4~0 % 256; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,875 INFO L290 TraceCheckUtils]: 19: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id2~0; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,875 INFO L290 TraceCheckUtils]: 20: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id3~0; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,876 INFO L290 TraceCheckUtils]: 21: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id4~0; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,876 INFO L290 TraceCheckUtils]: 22: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id3~0; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,876 INFO L290 TraceCheckUtils]: 23: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id4~0; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,877 INFO L290 TraceCheckUtils]: 24: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,877 INFO L290 TraceCheckUtils]: 25: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} init_#res#1 := init_~tmp~0#1; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,877 INFO L290 TraceCheckUtils]: 26: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,878 INFO L290 TraceCheckUtils]: 27: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == assume_abort_if_not_~cond#1); {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,878 INFO L290 TraceCheckUtils]: 28: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,879 INFO L290 TraceCheckUtils]: 29: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,879 INFO L290 TraceCheckUtils]: 30: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode1~0 % 256); {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,879 INFO L290 TraceCheckUtils]: 31: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,880 INFO L290 TraceCheckUtils]: 32: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,880 INFO L290 TraceCheckUtils]: 33: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,880 INFO L290 TraceCheckUtils]: 34: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode2~0 % 256); {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,881 INFO L290 TraceCheckUtils]: 35: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,881 INFO L290 TraceCheckUtils]: 36: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,882 INFO L290 TraceCheckUtils]: 37: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,882 INFO L290 TraceCheckUtils]: 38: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode3~0 % 256); {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,882 INFO L290 TraceCheckUtils]: 39: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,883 INFO L290 TraceCheckUtils]: 40: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,883 INFO L290 TraceCheckUtils]: 41: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,883 INFO L290 TraceCheckUtils]: 42: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode4~0 % 256); {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,884 INFO L290 TraceCheckUtils]: 43: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,884 INFO L290 TraceCheckUtils]: 44: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,885 INFO L290 TraceCheckUtils]: 45: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,885 INFO L290 TraceCheckUtils]: 46: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:46,886 INFO L290 TraceCheckUtils]: 47: Hoare triple {20680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~r1~0 % 256 >= 4; {20679#false} is VALID [2022-02-20 18:29:46,886 INFO L290 TraceCheckUtils]: 48: Hoare triple {20679#false} assume ~r1~0 % 256 < 4;check_~tmp~1#1 := 1; {20679#false} is VALID [2022-02-20 18:29:46,886 INFO L290 TraceCheckUtils]: 49: Hoare triple {20679#false} check_#res#1 := check_~tmp~1#1; {20679#false} is VALID [2022-02-20 18:29:46,886 INFO L290 TraceCheckUtils]: 50: Hoare triple {20679#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {20679#false} is VALID [2022-02-20 18:29:46,886 INFO L290 TraceCheckUtils]: 51: Hoare triple {20679#false} assume 0 == assert_~arg#1 % 256; {20679#false} is VALID [2022-02-20 18:29:46,887 INFO L290 TraceCheckUtils]: 52: Hoare triple {20679#false} assume !false; {20679#false} is VALID [2022-02-20 18:29:46,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:29:46,887 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:46,887 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144228653] [2022-02-20 18:29:46,888 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144228653] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:46,888 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:46,888 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:29:46,888 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911503601] [2022-02-20 18:29:46,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:46,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:29:46,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:46,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:46,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:46,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:29:46,935 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:46,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:29:46,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:46,936 INFO L87 Difference]: Start difference. First operand 991 states and 1470 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:48,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:48,035 INFO L93 Difference]: Finished difference Result 2397 states and 3570 transitions. [2022-02-20 18:29:48,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:29:48,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:29:48,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:48,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:48,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2022-02-20 18:29:48,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:48,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2022-02-20 18:29:48,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 227 transitions. [2022-02-20 18:29:48,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:48,266 INFO L225 Difference]: With dead ends: 2397 [2022-02-20 18:29:48,266 INFO L226 Difference]: Without dead ends: 1435 [2022-02-20 18:29:48,267 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:48,268 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 39 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:48,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 184 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:48,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2022-02-20 18:29:48,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1433. [2022-02-20 18:29:48,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:48,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1435 states. Second operand has 1433 states, 1432 states have (on average 1.4692737430167597) internal successors, (2104), 1432 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:48,911 INFO L74 IsIncluded]: Start isIncluded. First operand 1435 states. Second operand has 1433 states, 1432 states have (on average 1.4692737430167597) internal successors, (2104), 1432 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:48,914 INFO L87 Difference]: Start difference. First operand 1435 states. Second operand has 1433 states, 1432 states have (on average 1.4692737430167597) internal successors, (2104), 1432 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:48,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:48,998 INFO L93 Difference]: Finished difference Result 1435 states and 2105 transitions. [2022-02-20 18:29:48,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 2105 transitions. [2022-02-20 18:29:49,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:49,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:49,002 INFO L74 IsIncluded]: Start isIncluded. First operand has 1433 states, 1432 states have (on average 1.4692737430167597) internal successors, (2104), 1432 states have internal predecessors, (2104), 0 states have call successors, (0), 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 1435 states. [2022-02-20 18:29:49,004 INFO L87 Difference]: Start difference. First operand has 1433 states, 1432 states have (on average 1.4692737430167597) internal successors, (2104), 1432 states have internal predecessors, (2104), 0 states have call successors, (0), 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 1435 states. [2022-02-20 18:29:49,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:49,089 INFO L93 Difference]: Finished difference Result 1435 states and 2105 transitions. [2022-02-20 18:29:49,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 2105 transitions. [2022-02-20 18:29:49,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:49,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:49,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:49,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:49,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 1432 states have (on average 1.4692737430167597) internal successors, (2104), 1432 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:49,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 2104 transitions. [2022-02-20 18:29:49,211 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 2104 transitions. Word has length 53 [2022-02-20 18:29:49,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:49,211 INFO L470 AbstractCegarLoop]: Abstraction has 1433 states and 2104 transitions. [2022-02-20 18:29:49,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:49,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 2104 transitions. [2022-02-20 18:29:49,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:29:49,213 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:49,213 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:29:49,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:29:49,214 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:49,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:49,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1341894859, now seen corresponding path program 1 times [2022-02-20 18:29:49,214 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:49,215 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609424191] [2022-02-20 18:29:49,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:49,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:49,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {28267#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; {28267#true} is VALID [2022-02-20 18:29:49,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {28267#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {28267#true} is VALID [2022-02-20 18:29:49,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {28267#true} assume 0 == ~r1~0 % 256; {28267#true} is VALID [2022-02-20 18:29:49,439 INFO L290 TraceCheckUtils]: 3: Hoare triple {28267#true} assume ~id1~0 >= 0; {28267#true} is VALID [2022-02-20 18:29:49,439 INFO L290 TraceCheckUtils]: 4: Hoare triple {28267#true} assume 0 == ~st1~0; {28269#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 18:29:49,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {28269#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume ~send1~0 == ~id1~0; {28269#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 18:29:49,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {28269#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume 0 == ~mode1~0 % 256; {28269#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 18:29:49,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {28269#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume ~id2~0 >= 0; {28269#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 18:29:49,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {28269#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume 0 == ~st2~0; {28270#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:29:49,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {28270#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~send2~0 == ~id2~0; {28270#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:29:49,452 INFO L290 TraceCheckUtils]: 10: Hoare triple {28270#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~mode2~0 % 256; {28270#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:29:49,452 INFO L290 TraceCheckUtils]: 11: Hoare triple {28270#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~id3~0 >= 0; {28270#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:29:49,454 INFO L290 TraceCheckUtils]: 12: Hoare triple {28270#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~st3~0; {28271#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:29:49,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {28271#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send3~0 == ~id3~0; {28271#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:29:49,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {28271#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode3~0 % 256; {28271#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:29:49,456 INFO L290 TraceCheckUtils]: 15: Hoare triple {28271#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id4~0 >= 0; {28271#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:29:49,457 INFO L290 TraceCheckUtils]: 16: Hoare triple {28271#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st4~0; {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:49,460 INFO L290 TraceCheckUtils]: 17: Hoare triple {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send4~0 == ~id4~0; {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:49,462 INFO L290 TraceCheckUtils]: 18: Hoare triple {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume 0 == ~mode4~0 % 256; {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:49,463 INFO L290 TraceCheckUtils]: 19: Hoare triple {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id2~0; {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:49,463 INFO L290 TraceCheckUtils]: 20: Hoare triple {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id3~0; {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:49,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id4~0; {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:49,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id2~0 != ~id3~0; {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:49,465 INFO L290 TraceCheckUtils]: 23: Hoare triple {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id2~0 != ~id4~0; {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:49,468 INFO L290 TraceCheckUtils]: 24: Hoare triple {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:49,468 INFO L290 TraceCheckUtils]: 25: Hoare triple {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} init_#res#1 := init_~tmp~0#1; {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:49,469 INFO L290 TraceCheckUtils]: 26: Hoare triple {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:49,469 INFO L290 TraceCheckUtils]: 27: Hoare triple {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == assume_abort_if_not_~cond#1); {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:49,470 INFO L290 TraceCheckUtils]: 28: Hoare triple {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:49,470 INFO L290 TraceCheckUtils]: 29: Hoare triple {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:49,471 INFO L290 TraceCheckUtils]: 30: Hoare triple {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 != ~mode1~0 % 256); {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:49,471 INFO L290 TraceCheckUtils]: 31: Hoare triple {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:49,472 INFO L290 TraceCheckUtils]: 32: Hoare triple {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:49,472 INFO L290 TraceCheckUtils]: 33: Hoare triple {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:49,473 INFO L290 TraceCheckUtils]: 34: Hoare triple {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 != ~mode2~0 % 256); {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:49,473 INFO L290 TraceCheckUtils]: 35: Hoare triple {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:49,474 INFO L290 TraceCheckUtils]: 36: Hoare triple {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:49,474 INFO L290 TraceCheckUtils]: 37: Hoare triple {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:49,474 INFO L290 TraceCheckUtils]: 38: Hoare triple {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 != ~mode3~0 % 256); {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:49,475 INFO L290 TraceCheckUtils]: 39: Hoare triple {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:49,475 INFO L290 TraceCheckUtils]: 40: Hoare triple {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:49,476 INFO L290 TraceCheckUtils]: 41: Hoare triple {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:49,476 INFO L290 TraceCheckUtils]: 42: Hoare triple {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 != ~mode4~0 % 256); {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:49,476 INFO L290 TraceCheckUtils]: 43: Hoare triple {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:49,477 INFO L290 TraceCheckUtils]: 44: Hoare triple {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:49,477 INFO L290 TraceCheckUtils]: 45: Hoare triple {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:49,478 INFO L290 TraceCheckUtils]: 46: Hoare triple {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:49,478 INFO L290 TraceCheckUtils]: 47: Hoare triple {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~r1~0 % 256 >= 4); {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:49,479 INFO L290 TraceCheckUtils]: 48: Hoare triple {28272#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);check_~tmp~1#1 := 0; {28268#false} is VALID [2022-02-20 18:29:49,479 INFO L290 TraceCheckUtils]: 49: Hoare triple {28268#false} check_#res#1 := check_~tmp~1#1; {28268#false} is VALID [2022-02-20 18:29:49,479 INFO L290 TraceCheckUtils]: 50: Hoare triple {28268#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {28268#false} is VALID [2022-02-20 18:29:49,479 INFO L290 TraceCheckUtils]: 51: Hoare triple {28268#false} assume 0 == assert_~arg#1 % 256; {28268#false} is VALID [2022-02-20 18:29:49,479 INFO L290 TraceCheckUtils]: 52: Hoare triple {28268#false} assume !false; {28268#false} is VALID [2022-02-20 18:29:49,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:29:49,480 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:49,480 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609424191] [2022-02-20 18:29:49,480 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609424191] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:49,480 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:49,480 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:29:49,480 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975921857] [2022-02-20 18:29:49,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:49,481 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:29:49,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:49,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:49,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:49,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:29:49,523 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:49,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:29:49,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:29:49,524 INFO L87 Difference]: Start difference. First operand 1433 states and 2104 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:51,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:51,140 INFO L93 Difference]: Finished difference Result 2837 states and 4178 transitions. [2022-02-20 18:29:51,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:29:51,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:29:51,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:51,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:51,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 234 transitions. [2022-02-20 18:29:51,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:51,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 234 transitions. [2022-02-20 18:29:51,144 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 234 transitions. [2022-02-20 18:29:51,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:51,376 INFO L225 Difference]: With dead ends: 2837 [2022-02-20 18:29:51,376 INFO L226 Difference]: Without dead ends: 1435 [2022-02-20 18:29:51,377 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:29:51,378 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 280 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:51,378 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 287 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:29:51,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2022-02-20 18:29:52,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1433. [2022-02-20 18:29:52,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:52,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1435 states. Second operand has 1433 states, 1432 states have (on average 1.452513966480447) internal successors, (2080), 1432 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:52,145 INFO L74 IsIncluded]: Start isIncluded. First operand 1435 states. Second operand has 1433 states, 1432 states have (on average 1.452513966480447) internal successors, (2080), 1432 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:52,147 INFO L87 Difference]: Start difference. First operand 1435 states. Second operand has 1433 states, 1432 states have (on average 1.452513966480447) internal successors, (2080), 1432 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:52,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:52,221 INFO L93 Difference]: Finished difference Result 1435 states and 2081 transitions. [2022-02-20 18:29:52,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 2081 transitions. [2022-02-20 18:29:52,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:52,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:52,225 INFO L74 IsIncluded]: Start isIncluded. First operand has 1433 states, 1432 states have (on average 1.452513966480447) internal successors, (2080), 1432 states have internal predecessors, (2080), 0 states have call successors, (0), 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 1435 states. [2022-02-20 18:29:52,227 INFO L87 Difference]: Start difference. First operand has 1433 states, 1432 states have (on average 1.452513966480447) internal successors, (2080), 1432 states have internal predecessors, (2080), 0 states have call successors, (0), 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 1435 states. [2022-02-20 18:29:52,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:52,290 INFO L93 Difference]: Finished difference Result 1435 states and 2081 transitions. [2022-02-20 18:29:52,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 2081 transitions. [2022-02-20 18:29:52,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:52,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:52,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:52,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:52,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 1432 states have (on average 1.452513966480447) internal successors, (2080), 1432 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:52,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 2080 transitions. [2022-02-20 18:29:52,361 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 2080 transitions. Word has length 53 [2022-02-20 18:29:52,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:52,361 INFO L470 AbstractCegarLoop]: Abstraction has 1433 states and 2080 transitions. [2022-02-20 18:29:52,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:52,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 2080 transitions. [2022-02-20 18:29:52,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:29:52,362 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:52,362 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:29:52,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:29:52,363 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:52,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:52,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1765655459, now seen corresponding path program 1 times [2022-02-20 18:29:52,363 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:52,363 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219337218] [2022-02-20 18:29:52,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:52,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:52,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:52,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {36407#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; {36407#true} is VALID [2022-02-20 18:29:52,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {36407#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {36407#true} is VALID [2022-02-20 18:29:52,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {36407#true} assume 0 == ~r1~0 % 256; {36407#true} is VALID [2022-02-20 18:29:52,466 INFO L290 TraceCheckUtils]: 3: Hoare triple {36407#true} assume ~id1~0 >= 0; {36407#true} is VALID [2022-02-20 18:29:52,466 INFO L290 TraceCheckUtils]: 4: Hoare triple {36407#true} assume 0 == ~st1~0; {36407#true} is VALID [2022-02-20 18:29:52,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {36407#true} assume ~send1~0 == ~id1~0; {36407#true} is VALID [2022-02-20 18:29:52,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {36407#true} assume 0 == ~mode1~0 % 256; {36407#true} is VALID [2022-02-20 18:29:52,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {36407#true} assume ~id2~0 >= 0; {36407#true} is VALID [2022-02-20 18:29:52,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {36407#true} assume 0 == ~st2~0; {36407#true} is VALID [2022-02-20 18:29:52,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {36407#true} assume ~send2~0 == ~id2~0; {36407#true} is VALID [2022-02-20 18:29:52,467 INFO L290 TraceCheckUtils]: 10: Hoare triple {36407#true} assume 0 == ~mode2~0 % 256; {36407#true} is VALID [2022-02-20 18:29:52,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {36407#true} assume ~id3~0 >= 0; {36407#true} is VALID [2022-02-20 18:29:52,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {36407#true} assume 0 == ~st3~0; {36407#true} is VALID [2022-02-20 18:29:52,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {36407#true} assume ~send3~0 == ~id3~0; {36407#true} is VALID [2022-02-20 18:29:52,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {36407#true} assume 0 == ~mode3~0 % 256; {36407#true} is VALID [2022-02-20 18:29:52,467 INFO L290 TraceCheckUtils]: 15: Hoare triple {36407#true} assume ~id4~0 >= 0; {36407#true} is VALID [2022-02-20 18:29:52,468 INFO L290 TraceCheckUtils]: 16: Hoare triple {36407#true} assume 0 == ~st4~0; {36407#true} is VALID [2022-02-20 18:29:52,468 INFO L290 TraceCheckUtils]: 17: Hoare triple {36407#true} assume ~send4~0 == ~id4~0; {36407#true} is VALID [2022-02-20 18:29:52,468 INFO L290 TraceCheckUtils]: 18: Hoare triple {36407#true} assume 0 == ~mode4~0 % 256; {36407#true} is VALID [2022-02-20 18:29:52,468 INFO L290 TraceCheckUtils]: 19: Hoare triple {36407#true} assume ~id1~0 != ~id2~0; {36407#true} is VALID [2022-02-20 18:29:52,468 INFO L290 TraceCheckUtils]: 20: Hoare triple {36407#true} assume ~id1~0 != ~id3~0; {36407#true} is VALID [2022-02-20 18:29:52,468 INFO L290 TraceCheckUtils]: 21: Hoare triple {36407#true} assume ~id1~0 != ~id4~0; {36407#true} is VALID [2022-02-20 18:29:52,468 INFO L290 TraceCheckUtils]: 22: Hoare triple {36407#true} assume ~id2~0 != ~id3~0; {36407#true} is VALID [2022-02-20 18:29:52,468 INFO L290 TraceCheckUtils]: 23: Hoare triple {36407#true} assume ~id2~0 != ~id4~0; {36407#true} is VALID [2022-02-20 18:29:52,469 INFO L290 TraceCheckUtils]: 24: Hoare triple {36407#true} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {36409#(= |ULTIMATE.start_init_~tmp~0#1| 1)} is VALID [2022-02-20 18:29:52,469 INFO L290 TraceCheckUtils]: 25: Hoare triple {36409#(= |ULTIMATE.start_init_~tmp~0#1| 1)} init_#res#1 := init_~tmp~0#1; {36410#(= |ULTIMATE.start_init_#res#1| 1)} is VALID [2022-02-20 18:29:52,469 INFO L290 TraceCheckUtils]: 26: Hoare triple {36410#(= |ULTIMATE.start_init_#res#1| 1)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {36411#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)} is VALID [2022-02-20 18:29:52,469 INFO L290 TraceCheckUtils]: 27: Hoare triple {36411#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)} assume !(0 == assume_abort_if_not_~cond#1); {36407#true} is VALID [2022-02-20 18:29:52,469 INFO L290 TraceCheckUtils]: 28: Hoare triple {36407#true} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {36407#true} is VALID [2022-02-20 18:29:52,470 INFO L290 TraceCheckUtils]: 29: Hoare triple {36407#true} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {36407#true} is VALID [2022-02-20 18:29:52,470 INFO L290 TraceCheckUtils]: 30: Hoare triple {36407#true} assume !(0 != ~mode1~0 % 256); {36407#true} is VALID [2022-02-20 18:29:52,470 INFO L290 TraceCheckUtils]: 31: Hoare triple {36407#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {36407#true} is VALID [2022-02-20 18:29:52,470 INFO L290 TraceCheckUtils]: 32: Hoare triple {36407#true} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {36407#true} is VALID [2022-02-20 18:29:52,470 INFO L290 TraceCheckUtils]: 33: Hoare triple {36407#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {36407#true} is VALID [2022-02-20 18:29:52,470 INFO L290 TraceCheckUtils]: 34: Hoare triple {36407#true} assume !(0 != ~mode2~0 % 256); {36407#true} is VALID [2022-02-20 18:29:52,470 INFO L290 TraceCheckUtils]: 35: Hoare triple {36407#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {36407#true} is VALID [2022-02-20 18:29:52,470 INFO L290 TraceCheckUtils]: 36: Hoare triple {36407#true} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {36407#true} is VALID [2022-02-20 18:29:52,470 INFO L290 TraceCheckUtils]: 37: Hoare triple {36407#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {36407#true} is VALID [2022-02-20 18:29:52,470 INFO L290 TraceCheckUtils]: 38: Hoare triple {36407#true} assume !(0 != ~mode3~0 % 256); {36407#true} is VALID [2022-02-20 18:29:52,470 INFO L290 TraceCheckUtils]: 39: Hoare triple {36407#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {36407#true} is VALID [2022-02-20 18:29:52,470 INFO L290 TraceCheckUtils]: 40: Hoare triple {36407#true} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {36407#true} is VALID [2022-02-20 18:29:52,471 INFO L290 TraceCheckUtils]: 41: Hoare triple {36407#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {36407#true} is VALID [2022-02-20 18:29:52,471 INFO L290 TraceCheckUtils]: 42: Hoare triple {36407#true} assume !(0 != ~mode4~0 % 256); {36407#true} is VALID [2022-02-20 18:29:52,471 INFO L290 TraceCheckUtils]: 43: Hoare triple {36407#true} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {36407#true} is VALID [2022-02-20 18:29:52,471 INFO L290 TraceCheckUtils]: 44: Hoare triple {36407#true} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {36407#true} is VALID [2022-02-20 18:29:52,471 INFO L290 TraceCheckUtils]: 45: Hoare triple {36407#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; {36407#true} is VALID [2022-02-20 18:29:52,471 INFO L290 TraceCheckUtils]: 46: Hoare triple {36407#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {36407#true} is VALID [2022-02-20 18:29:52,472 INFO L290 TraceCheckUtils]: 47: Hoare triple {36407#true} assume !(~r1~0 % 256 >= 4); {36407#true} is VALID [2022-02-20 18:29:52,472 INFO L290 TraceCheckUtils]: 48: Hoare triple {36407#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {36407#true} is VALID [2022-02-20 18:29:52,472 INFO L290 TraceCheckUtils]: 49: Hoare triple {36407#true} assume ~r1~0 % 256 < 4;check_~tmp~1#1 := 1; {36412#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} is VALID [2022-02-20 18:29:52,473 INFO L290 TraceCheckUtils]: 50: Hoare triple {36412#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} check_#res#1 := check_~tmp~1#1; {36413#(not (= 0 |ULTIMATE.start_check_#res#1|))} is VALID [2022-02-20 18:29:52,473 INFO L290 TraceCheckUtils]: 51: Hoare triple {36413#(not (= 0 |ULTIMATE.start_check_#res#1|))} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {36414#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} is VALID [2022-02-20 18:29:52,474 INFO L290 TraceCheckUtils]: 52: Hoare triple {36414#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} assume 0 == assert_~arg#1 % 256; {36408#false} is VALID [2022-02-20 18:29:52,474 INFO L290 TraceCheckUtils]: 53: Hoare triple {36408#false} assume !false; {36408#false} is VALID [2022-02-20 18:29:52,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:29:52,475 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:52,475 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219337218] [2022-02-20 18:29:52,475 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219337218] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:52,475 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:52,475 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:29:52,475 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096854405] [2022-02-20 18:29:52,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:52,476 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:29:52,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:52,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:52,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:52,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:29:52,512 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:52,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:29:52,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:29:52,513 INFO L87 Difference]: Start difference. First operand 1433 states and 2080 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:54,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:54,947 INFO L93 Difference]: Finished difference Result 2664 states and 3817 transitions. [2022-02-20 18:29:54,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 18:29:54,947 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:29:54,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:54,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:54,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2022-02-20 18:29:54,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:54,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2022-02-20 18:29:54,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 171 transitions. [2022-02-20 18:29:55,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:55,327 INFO L225 Difference]: With dead ends: 2664 [2022-02-20 18:29:55,327 INFO L226 Difference]: Without dead ends: 2662 [2022-02-20 18:29:55,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2022-02-20 18:29:55,328 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 526 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:55,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [526 Valid, 467 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:55,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2662 states. [2022-02-20 18:29:56,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2662 to 1529. [2022-02-20 18:29:56,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:56,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2662 states. Second operand has 1529 states, 1528 states have (on average 1.418848167539267) internal successors, (2168), 1528 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:56,439 INFO L74 IsIncluded]: Start isIncluded. First operand 2662 states. Second operand has 1529 states, 1528 states have (on average 1.418848167539267) internal successors, (2168), 1528 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:56,440 INFO L87 Difference]: Start difference. First operand 2662 states. Second operand has 1529 states, 1528 states have (on average 1.418848167539267) internal successors, (2168), 1528 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:56,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:56,625 INFO L93 Difference]: Finished difference Result 2662 states and 3776 transitions. [2022-02-20 18:29:56,625 INFO L276 IsEmpty]: Start isEmpty. Operand 2662 states and 3776 transitions. [2022-02-20 18:29:56,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:56,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:56,629 INFO L74 IsIncluded]: Start isIncluded. First operand has 1529 states, 1528 states have (on average 1.418848167539267) internal successors, (2168), 1528 states have internal predecessors, (2168), 0 states have call successors, (0), 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 2662 states. [2022-02-20 18:29:56,630 INFO L87 Difference]: Start difference. First operand has 1529 states, 1528 states have (on average 1.418848167539267) internal successors, (2168), 1528 states have internal predecessors, (2168), 0 states have call successors, (0), 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 2662 states. [2022-02-20 18:29:56,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:56,868 INFO L93 Difference]: Finished difference Result 2662 states and 3776 transitions. [2022-02-20 18:29:56,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2662 states and 3776 transitions. [2022-02-20 18:29:56,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:56,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:56,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:56,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:56,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1529 states, 1528 states have (on average 1.418848167539267) internal successors, (2168), 1528 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:56,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1529 states and 2168 transitions. [2022-02-20 18:29:56,953 INFO L78 Accepts]: Start accepts. Automaton has 1529 states and 2168 transitions. Word has length 54 [2022-02-20 18:29:56,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:56,953 INFO L470 AbstractCegarLoop]: Abstraction has 1529 states and 2168 transitions. [2022-02-20 18:29:56,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:56,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 2168 transitions. [2022-02-20 18:29:56,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:29:56,954 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:56,954 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-20 18:29:56,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:29:56,955 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:56,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:56,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1473223963, now seen corresponding path program 1 times [2022-02-20 18:29:56,955 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:56,956 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888998083] [2022-02-20 18:29:56,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:56,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:56,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:57,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {46975#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; {46975#true} is VALID [2022-02-20 18:29:57,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {46975#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {46975#true} is VALID [2022-02-20 18:29:57,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {46975#true} assume 0 == ~r1~0 % 256; {46975#true} is VALID [2022-02-20 18:29:57,036 INFO L290 TraceCheckUtils]: 3: Hoare triple {46975#true} assume ~id1~0 >= 0; {46975#true} is VALID [2022-02-20 18:29:57,036 INFO L290 TraceCheckUtils]: 4: Hoare triple {46975#true} assume 0 == ~st1~0; {46977#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:57,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {46977#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {46977#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:57,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {46977#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {46977#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:57,037 INFO L290 TraceCheckUtils]: 7: Hoare triple {46977#(<= ~st1~0 0)} assume ~id2~0 >= 0; {46977#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:57,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {46977#(<= ~st1~0 0)} assume 0 == ~st2~0; {46978#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {46978#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {46978#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,038 INFO L290 TraceCheckUtils]: 10: Hoare triple {46978#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {46978#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,039 INFO L290 TraceCheckUtils]: 11: Hoare triple {46978#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {46978#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,039 INFO L290 TraceCheckUtils]: 12: Hoare triple {46978#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,040 INFO L290 TraceCheckUtils]: 15: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,041 INFO L290 TraceCheckUtils]: 17: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,041 INFO L290 TraceCheckUtils]: 18: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,042 INFO L290 TraceCheckUtils]: 19: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,043 INFO L290 TraceCheckUtils]: 22: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,043 INFO L290 TraceCheckUtils]: 23: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,043 INFO L290 TraceCheckUtils]: 24: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,044 INFO L290 TraceCheckUtils]: 25: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,044 INFO L290 TraceCheckUtils]: 26: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,045 INFO L290 TraceCheckUtils]: 27: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,045 INFO L290 TraceCheckUtils]: 28: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,046 INFO L290 TraceCheckUtils]: 29: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,048 INFO L290 TraceCheckUtils]: 30: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,048 INFO L290 TraceCheckUtils]: 31: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,049 INFO L290 TraceCheckUtils]: 32: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,049 INFO L290 TraceCheckUtils]: 33: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,049 INFO L290 TraceCheckUtils]: 34: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,050 INFO L290 TraceCheckUtils]: 35: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,050 INFO L290 TraceCheckUtils]: 36: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,050 INFO L290 TraceCheckUtils]: 37: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,051 INFO L290 TraceCheckUtils]: 38: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,051 INFO L290 TraceCheckUtils]: 39: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,051 INFO L290 TraceCheckUtils]: 40: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,052 INFO L290 TraceCheckUtils]: 41: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,052 INFO L290 TraceCheckUtils]: 42: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,053 INFO L290 TraceCheckUtils]: 43: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,053 INFO L290 TraceCheckUtils]: 44: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,053 INFO L290 TraceCheckUtils]: 45: Hoare triple {46979#(<= (+ ~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; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,054 INFO L290 TraceCheckUtils]: 46: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,054 INFO L290 TraceCheckUtils]: 47: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 4); {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,054 INFO L290 TraceCheckUtils]: 48: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,055 INFO L290 TraceCheckUtils]: 49: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 4;check_~tmp~1#1 := 1; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,055 INFO L290 TraceCheckUtils]: 50: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} check_#res#1 := check_~tmp~1#1; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,055 INFO L290 TraceCheckUtils]: 51: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,056 INFO L290 TraceCheckUtils]: 52: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assert_~arg#1 % 256); {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,056 INFO L290 TraceCheckUtils]: 53: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_assert } true; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,057 INFO L290 TraceCheckUtils]: 54: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,057 INFO L290 TraceCheckUtils]: 55: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,057 INFO L290 TraceCheckUtils]: 56: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(node1_~m1~0#1 != ~nomsg~0); {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,058 INFO L290 TraceCheckUtils]: 57: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,058 INFO L290 TraceCheckUtils]: 58: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,058 INFO L290 TraceCheckUtils]: 59: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,059 INFO L290 TraceCheckUtils]: 60: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(node2_~m2~0#1 != ~nomsg~0); {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,059 INFO L290 TraceCheckUtils]: 61: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,059 INFO L290 TraceCheckUtils]: 62: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,060 INFO L290 TraceCheckUtils]: 63: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,060 INFO L290 TraceCheckUtils]: 64: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(node3_~m3~0#1 != ~nomsg~0); {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,061 INFO L290 TraceCheckUtils]: 65: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 0; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,061 INFO L290 TraceCheckUtils]: 66: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,061 INFO L290 TraceCheckUtils]: 67: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,062 INFO L290 TraceCheckUtils]: 68: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume node4_~m4~0#1 != ~nomsg~0; {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,062 INFO L290 TraceCheckUtils]: 69: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(node4_~m4~0#1 > ~id4~0); {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,062 INFO L290 TraceCheckUtils]: 70: Hoare triple {46979#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume node4_~m4~0#1 == ~id4~0;~st4~0 := 1; {46980#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:29:57,063 INFO L290 TraceCheckUtils]: 71: Hoare triple {46980#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} ~mode4~0 := 0; {46980#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:29:57,063 INFO L290 TraceCheckUtils]: 72: Hoare triple {46980#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {46980#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:29:57,064 INFO L290 TraceCheckUtils]: 73: Hoare triple {46980#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {46976#false} is VALID [2022-02-20 18:29:57,064 INFO L290 TraceCheckUtils]: 74: Hoare triple {46976#false} check_#res#1 := check_~tmp~1#1; {46976#false} is VALID [2022-02-20 18:29:57,064 INFO L290 TraceCheckUtils]: 75: Hoare triple {46976#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {46976#false} is VALID [2022-02-20 18:29:57,064 INFO L290 TraceCheckUtils]: 76: Hoare triple {46976#false} assume 0 == assert_~arg#1 % 256; {46976#false} is VALID [2022-02-20 18:29:57,064 INFO L290 TraceCheckUtils]: 77: Hoare triple {46976#false} assume !false; {46976#false} is VALID [2022-02-20 18:29:57,065 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 18:29:57,065 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:57,065 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888998083] [2022-02-20 18:29:57,065 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888998083] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:57,066 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:57,066 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:29:57,066 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222068169] [2022-02-20 18:29:57,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:57,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-02-20 18:29:57,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:57,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:57,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:57,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:29:57,123 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:57,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:29:57,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:29:57,124 INFO L87 Difference]: Start difference. First operand 1529 states and 2168 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:04,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:04,077 INFO L93 Difference]: Finished difference Result 7835 states and 11137 transitions. [2022-02-20 18:30:04,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:30:04,077 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-02-20 18:30:04,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:04,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:04,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 440 transitions. [2022-02-20 18:30:04,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:04,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 440 transitions. [2022-02-20 18:30:04,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 440 transitions. [2022-02-20 18:30:04,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 440 edges. 440 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:06,021 INFO L225 Difference]: With dead ends: 7835 [2022-02-20 18:30:06,022 INFO L226 Difference]: Without dead ends: 6337 [2022-02-20 18:30:06,023 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:30:06,024 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 447 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:06,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [447 Valid, 465 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:06,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6337 states. [2022-02-20 18:30:08,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6337 to 3025. [2022-02-20 18:30:08,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:08,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6337 states. Second operand has 3025 states, 3024 states have (on average 1.4153439153439153) internal successors, (4280), 3024 states have internal predecessors, (4280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:08,311 INFO L74 IsIncluded]: Start isIncluded. First operand 6337 states. Second operand has 3025 states, 3024 states have (on average 1.4153439153439153) internal successors, (4280), 3024 states have internal predecessors, (4280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:08,316 INFO L87 Difference]: Start difference. First operand 6337 states. Second operand has 3025 states, 3024 states have (on average 1.4153439153439153) internal successors, (4280), 3024 states have internal predecessors, (4280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:09,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:09,574 INFO L93 Difference]: Finished difference Result 6337 states and 8976 transitions. [2022-02-20 18:30:09,574 INFO L276 IsEmpty]: Start isEmpty. Operand 6337 states and 8976 transitions. [2022-02-20 18:30:09,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:09,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:09,584 INFO L74 IsIncluded]: Start isIncluded. First operand has 3025 states, 3024 states have (on average 1.4153439153439153) internal successors, (4280), 3024 states have internal predecessors, (4280), 0 states have call successors, (0), 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 6337 states. [2022-02-20 18:30:09,586 INFO L87 Difference]: Start difference. First operand has 3025 states, 3024 states have (on average 1.4153439153439153) internal successors, (4280), 3024 states have internal predecessors, (4280), 0 states have call successors, (0), 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 6337 states. [2022-02-20 18:30:10,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:10,774 INFO L93 Difference]: Finished difference Result 6337 states and 8976 transitions. [2022-02-20 18:30:10,774 INFO L276 IsEmpty]: Start isEmpty. Operand 6337 states and 8976 transitions. [2022-02-20 18:30:10,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:10,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:10,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:10,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:10,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3025 states, 3024 states have (on average 1.4153439153439153) internal successors, (4280), 3024 states have internal predecessors, (4280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:11,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3025 states to 3025 states and 4280 transitions. [2022-02-20 18:30:11,074 INFO L78 Accepts]: Start accepts. Automaton has 3025 states and 4280 transitions. Word has length 78 [2022-02-20 18:30:11,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:11,075 INFO L470 AbstractCegarLoop]: Abstraction has 3025 states and 4280 transitions. [2022-02-20 18:30:11,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:11,075 INFO L276 IsEmpty]: Start isEmpty. Operand 3025 states and 4280 transitions. [2022-02-20 18:30:11,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:30:11,076 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:11,076 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-20 18:30:11,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:30:11,076 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:11,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:11,077 INFO L85 PathProgramCache]: Analyzing trace with hash -295558853, now seen corresponding path program 1 times [2022-02-20 18:30:11,077 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:11,077 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453868425] [2022-02-20 18:30:11,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:11,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:11,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {73128#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; {73128#true} is VALID [2022-02-20 18:30:11,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {73128#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {73128#true} is VALID [2022-02-20 18:30:11,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {73128#true} assume 0 == ~r1~0 % 256; {73128#true} is VALID [2022-02-20 18:30:11,174 INFO L290 TraceCheckUtils]: 3: Hoare triple {73128#true} assume ~id1~0 >= 0; {73128#true} is VALID [2022-02-20 18:30:11,174 INFO L290 TraceCheckUtils]: 4: Hoare triple {73128#true} assume 0 == ~st1~0; {73130#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:11,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {73130#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {73130#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:11,175 INFO L290 TraceCheckUtils]: 6: Hoare triple {73130#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {73130#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:11,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {73130#(<= ~st1~0 0)} assume ~id2~0 >= 0; {73130#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:11,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {73130#(<= ~st1~0 0)} assume 0 == ~st2~0; {73131#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {73131#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {73131#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,176 INFO L290 TraceCheckUtils]: 10: Hoare triple {73131#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {73131#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,177 INFO L290 TraceCheckUtils]: 11: Hoare triple {73131#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {73131#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,177 INFO L290 TraceCheckUtils]: 12: Hoare triple {73131#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {73131#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,178 INFO L290 TraceCheckUtils]: 13: Hoare triple {73131#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {73131#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {73131#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {73131#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,178 INFO L290 TraceCheckUtils]: 15: Hoare triple {73131#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {73131#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,179 INFO L290 TraceCheckUtils]: 16: Hoare triple {73131#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,180 INFO L290 TraceCheckUtils]: 18: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,180 INFO L290 TraceCheckUtils]: 19: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,180 INFO L290 TraceCheckUtils]: 20: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,181 INFO L290 TraceCheckUtils]: 21: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,181 INFO L290 TraceCheckUtils]: 22: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,182 INFO L290 TraceCheckUtils]: 23: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,182 INFO L290 TraceCheckUtils]: 24: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,182 INFO L290 TraceCheckUtils]: 25: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,183 INFO L290 TraceCheckUtils]: 26: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,183 INFO L290 TraceCheckUtils]: 27: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,184 INFO L290 TraceCheckUtils]: 28: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,184 INFO L290 TraceCheckUtils]: 29: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,185 INFO L290 TraceCheckUtils]: 30: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,185 INFO L290 TraceCheckUtils]: 31: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,185 INFO L290 TraceCheckUtils]: 32: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,186 INFO L290 TraceCheckUtils]: 33: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,186 INFO L290 TraceCheckUtils]: 34: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,187 INFO L290 TraceCheckUtils]: 35: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,187 INFO L290 TraceCheckUtils]: 36: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,188 INFO L290 TraceCheckUtils]: 37: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,188 INFO L290 TraceCheckUtils]: 38: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,188 INFO L290 TraceCheckUtils]: 39: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,189 INFO L290 TraceCheckUtils]: 40: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,189 INFO L290 TraceCheckUtils]: 41: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,190 INFO L290 TraceCheckUtils]: 42: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,190 INFO L290 TraceCheckUtils]: 43: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,190 INFO L290 TraceCheckUtils]: 44: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,191 INFO L290 TraceCheckUtils]: 45: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,191 INFO L290 TraceCheckUtils]: 46: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,191 INFO L290 TraceCheckUtils]: 47: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 4); {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,192 INFO L290 TraceCheckUtils]: 48: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,192 INFO L290 TraceCheckUtils]: 49: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 4;check_~tmp~1#1 := 1; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,192 INFO L290 TraceCheckUtils]: 50: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} check_#res#1 := check_~tmp~1#1; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,193 INFO L290 TraceCheckUtils]: 51: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,193 INFO L290 TraceCheckUtils]: 52: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 == assert_~arg#1 % 256); {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,194 INFO L290 TraceCheckUtils]: 53: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_assert } true; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,194 INFO L290 TraceCheckUtils]: 54: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,194 INFO L290 TraceCheckUtils]: 55: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,195 INFO L290 TraceCheckUtils]: 56: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(node1_~m1~0#1 != ~nomsg~0); {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,195 INFO L290 TraceCheckUtils]: 57: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,196 INFO L290 TraceCheckUtils]: 58: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,196 INFO L290 TraceCheckUtils]: 59: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,196 INFO L290 TraceCheckUtils]: 60: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(node2_~m2~0#1 != ~nomsg~0); {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,197 INFO L290 TraceCheckUtils]: 61: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,197 INFO L290 TraceCheckUtils]: 62: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,198 INFO L290 TraceCheckUtils]: 63: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,198 INFO L290 TraceCheckUtils]: 64: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume node3_~m3~0#1 != ~nomsg~0; {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,199 INFO L290 TraceCheckUtils]: 65: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(node3_~m3~0#1 > ~id3~0); {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:11,199 INFO L290 TraceCheckUtils]: 66: Hoare triple {73132#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume node3_~m3~0#1 == ~id3~0;~st3~0 := 1; {73133#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:11,200 INFO L290 TraceCheckUtils]: 67: Hoare triple {73133#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} ~mode3~0 := 0; {73133#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:11,200 INFO L290 TraceCheckUtils]: 68: Hoare triple {73133#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {73133#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:11,201 INFO L290 TraceCheckUtils]: 69: Hoare triple {73133#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {73133#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:11,201 INFO L290 TraceCheckUtils]: 70: Hoare triple {73133#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} assume !(node4_~m4~0#1 != ~nomsg~0); {73133#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:11,201 INFO L290 TraceCheckUtils]: 71: Hoare triple {73133#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} ~mode4~0 := 0; {73133#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:11,202 INFO L290 TraceCheckUtils]: 72: Hoare triple {73133#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {73133#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:11,202 INFO L290 TraceCheckUtils]: 73: Hoare triple {73133#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {73129#false} is VALID [2022-02-20 18:30:11,203 INFO L290 TraceCheckUtils]: 74: Hoare triple {73129#false} check_#res#1 := check_~tmp~1#1; {73129#false} is VALID [2022-02-20 18:30:11,203 INFO L290 TraceCheckUtils]: 75: Hoare triple {73129#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {73129#false} is VALID [2022-02-20 18:30:11,203 INFO L290 TraceCheckUtils]: 76: Hoare triple {73129#false} assume 0 == assert_~arg#1 % 256; {73129#false} is VALID [2022-02-20 18:30:11,203 INFO L290 TraceCheckUtils]: 77: Hoare triple {73129#false} assume !false; {73129#false} is VALID [2022-02-20 18:30:11,204 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 18:30:11,204 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:11,204 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453868425] [2022-02-20 18:30:11,204 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453868425] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:11,204 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:11,204 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:30:11,205 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998647923] [2022-02-20 18:30:11,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:11,205 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-02-20 18:30:11,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:11,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:11,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:11,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:30:11,266 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:11,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:30:11,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:30:11,267 INFO L87 Difference]: Start difference. First operand 3025 states and 4280 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:20,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:20,180 INFO L93 Difference]: Finished difference Result 9331 states and 13249 transitions. [2022-02-20 18:30:20,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:30:20,180 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-02-20 18:30:20,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:20,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:20,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 440 transitions. [2022-02-20 18:30:20,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:20,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 440 transitions. [2022-02-20 18:30:20,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 440 transitions. [2022-02-20 18:30:20,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 440 edges. 440 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:22,793 INFO L225 Difference]: With dead ends: 9331 [2022-02-20 18:30:22,793 INFO L226 Difference]: Without dead ends: 7833 [2022-02-20 18:30:22,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:30:22,796 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 401 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:22,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [401 Valid, 515 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:30:22,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7833 states. [2022-02-20 18:30:26,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7833 to 5273. [2022-02-20 18:30:26,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:26,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7833 states. Second operand has 5273 states, 5272 states have (on average 1.4089529590288317) internal successors, (7428), 5272 states have internal predecessors, (7428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:26,798 INFO L74 IsIncluded]: Start isIncluded. First operand 7833 states. Second operand has 5273 states, 5272 states have (on average 1.4089529590288317) internal successors, (7428), 5272 states have internal predecessors, (7428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:26,803 INFO L87 Difference]: Start difference. First operand 7833 states. Second operand has 5273 states, 5272 states have (on average 1.4089529590288317) internal successors, (7428), 5272 states have internal predecessors, (7428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:28,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:28,529 INFO L93 Difference]: Finished difference Result 7833 states and 11088 transitions. [2022-02-20 18:30:28,529 INFO L276 IsEmpty]: Start isEmpty. Operand 7833 states and 11088 transitions. [2022-02-20 18:30:28,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:28,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:28,542 INFO L74 IsIncluded]: Start isIncluded. First operand has 5273 states, 5272 states have (on average 1.4089529590288317) internal successors, (7428), 5272 states have internal predecessors, (7428), 0 states have call successors, (0), 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 7833 states. [2022-02-20 18:30:28,544 INFO L87 Difference]: Start difference. First operand has 5273 states, 5272 states have (on average 1.4089529590288317) internal successors, (7428), 5272 states have internal predecessors, (7428), 0 states have call successors, (0), 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 7833 states. [2022-02-20 18:30:30,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:30,275 INFO L93 Difference]: Finished difference Result 7833 states and 11088 transitions. [2022-02-20 18:30:30,276 INFO L276 IsEmpty]: Start isEmpty. Operand 7833 states and 11088 transitions. [2022-02-20 18:30:30,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:30,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:30,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:30,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:30,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5273 states, 5272 states have (on average 1.4089529590288317) internal successors, (7428), 5272 states have internal predecessors, (7428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:31,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5273 states to 5273 states and 7428 transitions. [2022-02-20 18:30:31,214 INFO L78 Accepts]: Start accepts. Automaton has 5273 states and 7428 transitions. Word has length 78 [2022-02-20 18:30:31,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:31,214 INFO L470 AbstractCegarLoop]: Abstraction has 5273 states and 7428 transitions. [2022-02-20 18:30:31,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:31,214 INFO L276 IsEmpty]: Start isEmpty. Operand 5273 states and 7428 transitions. [2022-02-20 18:30:31,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:30:31,216 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:31,216 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-20 18:30:31,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 18:30:31,216 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:31,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:31,217 INFO L85 PathProgramCache]: Analyzing trace with hash 836080987, now seen corresponding path program 1 times [2022-02-20 18:30:31,217 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:31,217 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62212371] [2022-02-20 18:30:31,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:31,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:31,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:31,297 INFO L290 TraceCheckUtils]: 0: Hoare triple {106921#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; {106921#true} is VALID [2022-02-20 18:30:31,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {106921#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {106921#true} is VALID [2022-02-20 18:30:31,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {106921#true} assume 0 == ~r1~0 % 256; {106921#true} is VALID [2022-02-20 18:30:31,298 INFO L290 TraceCheckUtils]: 3: Hoare triple {106921#true} assume ~id1~0 >= 0; {106921#true} is VALID [2022-02-20 18:30:31,298 INFO L290 TraceCheckUtils]: 4: Hoare triple {106921#true} assume 0 == ~st1~0; {106923#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:31,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {106923#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {106923#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:31,299 INFO L290 TraceCheckUtils]: 6: Hoare triple {106923#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {106923#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:31,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {106923#(<= ~st1~0 0)} assume ~id2~0 >= 0; {106923#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:31,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {106923#(<= ~st1~0 0)} assume 0 == ~st2~0; {106923#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:31,300 INFO L290 TraceCheckUtils]: 9: Hoare triple {106923#(<= ~st1~0 0)} assume ~send2~0 == ~id2~0; {106923#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:31,300 INFO L290 TraceCheckUtils]: 10: Hoare triple {106923#(<= ~st1~0 0)} assume 0 == ~mode2~0 % 256; {106923#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:31,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {106923#(<= ~st1~0 0)} assume ~id3~0 >= 0; {106923#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:31,301 INFO L290 TraceCheckUtils]: 12: Hoare triple {106923#(<= ~st1~0 0)} assume 0 == ~st3~0; {106924#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,301 INFO L290 TraceCheckUtils]: 13: Hoare triple {106924#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {106924#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,302 INFO L290 TraceCheckUtils]: 14: Hoare triple {106924#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {106924#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,302 INFO L290 TraceCheckUtils]: 15: Hoare triple {106924#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id4~0 >= 0; {106924#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {106924#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~st4~0; {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,303 INFO L290 TraceCheckUtils]: 17: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,303 INFO L290 TraceCheckUtils]: 18: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,303 INFO L290 TraceCheckUtils]: 19: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,304 INFO L290 TraceCheckUtils]: 20: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,305 INFO L290 TraceCheckUtils]: 22: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,305 INFO L290 TraceCheckUtils]: 23: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,305 INFO L290 TraceCheckUtils]: 24: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,306 INFO L290 TraceCheckUtils]: 25: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,306 INFO L290 TraceCheckUtils]: 26: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,307 INFO L290 TraceCheckUtils]: 27: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,307 INFO L290 TraceCheckUtils]: 28: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,307 INFO L290 TraceCheckUtils]: 29: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,308 INFO L290 TraceCheckUtils]: 30: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,308 INFO L290 TraceCheckUtils]: 31: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,309 INFO L290 TraceCheckUtils]: 32: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,309 INFO L290 TraceCheckUtils]: 33: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,310 INFO L290 TraceCheckUtils]: 34: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,310 INFO L290 TraceCheckUtils]: 35: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,310 INFO L290 TraceCheckUtils]: 36: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,311 INFO L290 TraceCheckUtils]: 37: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,311 INFO L290 TraceCheckUtils]: 38: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,312 INFO L290 TraceCheckUtils]: 39: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,312 INFO L290 TraceCheckUtils]: 40: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,312 INFO L290 TraceCheckUtils]: 41: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,313 INFO L290 TraceCheckUtils]: 42: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,313 INFO L290 TraceCheckUtils]: 43: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,314 INFO L290 TraceCheckUtils]: 44: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,314 INFO L290 TraceCheckUtils]: 45: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,314 INFO L290 TraceCheckUtils]: 46: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,315 INFO L290 TraceCheckUtils]: 47: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 4); {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,315 INFO L290 TraceCheckUtils]: 48: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,316 INFO L290 TraceCheckUtils]: 49: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~r1~0 % 256 < 4;check_~tmp~1#1 := 1; {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,316 INFO L290 TraceCheckUtils]: 50: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} check_#res#1 := check_~tmp~1#1; {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,316 INFO L290 TraceCheckUtils]: 51: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,320 INFO L290 TraceCheckUtils]: 52: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(0 == assert_~arg#1 % 256); {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,320 INFO L290 TraceCheckUtils]: 53: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume { :end_inline_assert } true; {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,321 INFO L290 TraceCheckUtils]: 54: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,321 INFO L290 TraceCheckUtils]: 55: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,321 INFO L290 TraceCheckUtils]: 56: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(node1_~m1~0#1 != ~nomsg~0); {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,322 INFO L290 TraceCheckUtils]: 57: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} ~mode1~0 := 0; {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,322 INFO L290 TraceCheckUtils]: 58: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,322 INFO L290 TraceCheckUtils]: 59: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,323 INFO L290 TraceCheckUtils]: 60: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume node2_~m2~0#1 != ~nomsg~0; {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,324 INFO L290 TraceCheckUtils]: 61: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(node2_~m2~0#1 > ~id2~0); {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:31,324 INFO L290 TraceCheckUtils]: 62: Hoare triple {106925#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume node2_~m2~0#1 == ~id2~0;~st2~0 := 1; {106926#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:31,325 INFO L290 TraceCheckUtils]: 63: Hoare triple {106926#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} ~mode2~0 := 0; {106926#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:31,325 INFO L290 TraceCheckUtils]: 64: Hoare triple {106926#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {106926#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:31,325 INFO L290 TraceCheckUtils]: 65: Hoare triple {106926#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {106926#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:31,326 INFO L290 TraceCheckUtils]: 66: Hoare triple {106926#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume !(node3_~m3~0#1 != ~nomsg~0); {106926#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:31,326 INFO L290 TraceCheckUtils]: 67: Hoare triple {106926#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} ~mode3~0 := 0; {106926#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:31,327 INFO L290 TraceCheckUtils]: 68: Hoare triple {106926#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {106926#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:31,327 INFO L290 TraceCheckUtils]: 69: Hoare triple {106926#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {106926#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:31,328 INFO L290 TraceCheckUtils]: 70: Hoare triple {106926#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume !(node4_~m4~0#1 != ~nomsg~0); {106926#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:31,328 INFO L290 TraceCheckUtils]: 71: Hoare triple {106926#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} ~mode4~0 := 0; {106926#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:31,329 INFO L290 TraceCheckUtils]: 72: Hoare triple {106926#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {106926#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:31,329 INFO L290 TraceCheckUtils]: 73: Hoare triple {106926#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {106922#false} is VALID [2022-02-20 18:30:31,329 INFO L290 TraceCheckUtils]: 74: Hoare triple {106922#false} check_#res#1 := check_~tmp~1#1; {106922#false} is VALID [2022-02-20 18:30:31,329 INFO L290 TraceCheckUtils]: 75: Hoare triple {106922#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {106922#false} is VALID [2022-02-20 18:30:31,329 INFO L290 TraceCheckUtils]: 76: Hoare triple {106922#false} assume 0 == assert_~arg#1 % 256; {106922#false} is VALID [2022-02-20 18:30:31,330 INFO L290 TraceCheckUtils]: 77: Hoare triple {106922#false} assume !false; {106922#false} is VALID [2022-02-20 18:30:31,330 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 18:30:31,330 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:31,330 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62212371] [2022-02-20 18:30:31,331 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62212371] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:31,331 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:31,331 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:30:31,331 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557510424] [2022-02-20 18:30:31,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:31,332 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-02-20 18:30:31,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:31,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:31,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:31,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:30:31,387 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:31,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:30:31,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:30:31,388 INFO L87 Difference]: Start difference. First operand 5273 states and 7428 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)