./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.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-var-start-time.3.2.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 850d02aa9cb18294f9975f6e4e447a197934bcfd77c20fda5c55e9f9e3e0a979 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:26:54,692 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:26:54,695 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:26:54,735 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:26:54,736 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:26:54,739 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:26:54,740 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:26:54,745 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:26:54,746 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:26:54,750 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:26:54,751 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:26:54,752 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:26:54,752 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:26:54,755 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:26:54,756 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:26:54,760 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:26:54,761 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:26:54,762 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:26:54,764 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:26:54,769 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:26:54,770 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:26:54,771 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:26:54,772 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:26:54,773 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:26:54,777 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:26:54,780 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:26:54,780 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:26:54,781 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:26:54,782 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:26:54,783 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:26:54,783 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:26:54,784 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:26:54,785 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:26:54,786 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:26:54,787 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:26:54,787 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:26:54,788 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:26:54,788 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:26:54,788 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:26:54,789 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:26:54,789 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:26:54,791 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:26:54,818 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:26:54,818 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:26:54,819 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:26:54,819 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:26:54,820 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:26:54,820 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:26:54,821 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:26:54,821 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:26:54,821 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:26:54,821 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:26:54,822 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:26:54,822 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:26:54,823 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:26:54,823 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:26:54,823 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:26:54,823 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:26:54,823 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:26:54,823 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:26:54,824 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:26:54,824 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:26:54,824 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:26:54,824 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:26:54,824 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:26:54,825 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:26:54,825 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:26:54,825 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:26:54,825 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:26:54,825 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:26:54,826 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:26:54,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:26:54,827 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:26:54,827 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:26:54,827 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:26:54,828 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 -> 850d02aa9cb18294f9975f6e4e447a197934bcfd77c20fda5c55e9f9e3e0a979 [2022-02-20 18:26:55,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:26:55,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:26:55,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:26:55,051 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:26:55,052 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:26:55,053 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c [2022-02-20 18:26:55,107 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f7e46105/1233a65883d144459a64998d1dd0e108/FLAG94505a725 [2022-02-20 18:26:55,470 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:26:55,471 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c [2022-02-20 18:26:55,477 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f7e46105/1233a65883d144459a64998d1dd0e108/FLAG94505a725 [2022-02-20 18:26:55,875 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f7e46105/1233a65883d144459a64998d1dd0e108 [2022-02-20 18:26:55,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:26:55,879 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:26:55,885 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:26:55,885 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:26:55,888 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:26:55,888 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:26:55" (1/1) ... [2022-02-20 18:26:55,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38f035a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:26:55, skipping insertion in model container [2022-02-20 18:26:55,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:26:55" (1/1) ... [2022-02-20 18:26:55,895 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:26:55,932 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:26:56,122 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c[6787,6800] [2022-02-20 18:26:56,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:26:56,131 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:26:56,188 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c[6787,6800] [2022-02-20 18:26:56,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:26:56,204 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:26:56,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:26:56 WrapperNode [2022-02-20 18:26:56,205 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:26:56,206 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:26:56,206 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:26:56,207 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:26:56,213 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:26:56" (1/1) ... [2022-02-20 18:26:56,222 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:26:56" (1/1) ... [2022-02-20 18:26:56,261 INFO L137 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 246 [2022-02-20 18:26:56,262 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:26:56,262 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:26:56,263 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:26:56,263 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:26:56,270 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:26:56" (1/1) ... [2022-02-20 18:26:56,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:26:56" (1/1) ... [2022-02-20 18:26:56,272 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:26:56" (1/1) ... [2022-02-20 18:26:56,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:26:56" (1/1) ... [2022-02-20 18:26:56,278 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:26:56" (1/1) ... [2022-02-20 18:26:56,285 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:26:56" (1/1) ... [2022-02-20 18:26:56,287 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:26:56" (1/1) ... [2022-02-20 18:26:56,289 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:26:56,290 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:26:56,290 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:26:56,290 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:26:56,291 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:26:56" (1/1) ... [2022-02-20 18:26:56,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:26:56,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:26:56,328 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:26:56,332 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:26:56,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:26:56,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:26:56,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:26:56,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:26:56,419 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:26:56,421 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:26:56,834 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:26:56,840 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:26:56,841 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:26:56,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:26:56 BoogieIcfgContainer [2022-02-20 18:26:56,842 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:26:56,843 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:26:56,846 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:26:56,856 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:26:56,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:26:55" (1/3) ... [2022-02-20 18:26:56,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47aa5a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:26:56, skipping insertion in model container [2022-02-20 18:26:56,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:26:56" (2/3) ... [2022-02-20 18:26:56,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47aa5a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:26:56, skipping insertion in model container [2022-02-20 18:26:56,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:26:56" (3/3) ... [2022-02-20 18:26:56,858 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c [2022-02-20 18:26:56,862 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:26:56,863 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:26:56,900 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:26:56,905 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:26:56,905 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:26:56,920 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 76 states have (on average 1.6710526315789473) internal successors, (127), 77 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:56,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 18:26:56,925 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:26:56,926 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] [2022-02-20 18:26:56,926 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:26:56,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:26:56,930 INFO L85 PathProgramCache]: Analyzing trace with hash -430581620, now seen corresponding path program 1 times [2022-02-20 18:26:56,937 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:26:56,937 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203833339] [2022-02-20 18:26:56,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:26:56,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:26:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:26:57,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {81#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; {81#true} is VALID [2022-02-20 18:26:57,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {81#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~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~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive3~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; {81#true} is VALID [2022-02-20 18:26:57,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {81#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {83#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 18:26:57,134 INFO L290 TraceCheckUtils]: 3: Hoare triple {83#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {84#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:26:57,135 INFO L290 TraceCheckUtils]: 4: Hoare triple {84#(= |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; {85#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 18:26:57,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {85#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {82#false} is VALID [2022-02-20 18:26:57,136 INFO L290 TraceCheckUtils]: 6: Hoare triple {82#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;main_~i2~0#1 := 0; {82#false} is VALID [2022-02-20 18:26:57,136 INFO L290 TraceCheckUtils]: 7: Hoare triple {82#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; {82#false} is VALID [2022-02-20 18:26:57,136 INFO L290 TraceCheckUtils]: 8: Hoare triple {82#false} assume !(0 != ~mode1~0 % 256); {82#false} is VALID [2022-02-20 18:26:57,137 INFO L290 TraceCheckUtils]: 9: Hoare triple {82#false} assume !(0 != ~alive1~0 % 256); {82#false} is VALID [2022-02-20 18:26:57,137 INFO L290 TraceCheckUtils]: 10: Hoare triple {82#false} ~mode1~0 := 1; {82#false} is VALID [2022-02-20 18:26:57,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {82#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {82#false} is VALID [2022-02-20 18:26:57,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {82#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {82#false} is VALID [2022-02-20 18:26:57,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {82#false} assume !(node2_~m2~0#1 != ~nomsg~0); {82#false} is VALID [2022-02-20 18:26:57,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {82#false} ~mode2~0 := 0; {82#false} is VALID [2022-02-20 18:26:57,139 INFO L290 TraceCheckUtils]: 15: Hoare triple {82#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {82#false} is VALID [2022-02-20 18:26:57,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {82#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {82#false} is VALID [2022-02-20 18:26:57,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {82#false} assume !(node3_~m3~0#1 != ~nomsg~0); {82#false} is VALID [2022-02-20 18:26:57,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {82#false} ~mode3~0 := 0; {82#false} is VALID [2022-02-20 18:26:57,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {82#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {82#false} is VALID [2022-02-20 18:26:57,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {82#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {82#false} is VALID [2022-02-20 18:26:57,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {82#false} check_#res#1 := check_~tmp~1#1; {82#false} is VALID [2022-02-20 18:26:57,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {82#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; {82#false} is VALID [2022-02-20 18:26:57,143 INFO L290 TraceCheckUtils]: 23: Hoare triple {82#false} assume 0 == assert_~arg#1 % 256; {82#false} is VALID [2022-02-20 18:26:57,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {82#false} assume !false; {82#false} is VALID [2022-02-20 18:26:57,148 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:26:57,148 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:26:57,149 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203833339] [2022-02-20 18:26:57,150 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203833339] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:26:57,150 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:26:57,150 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:26:57,153 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682275230] [2022-02-20 18:26:57,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:26:57,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-02-20 18:26:57,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:26:57,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:57,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:26:57,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:26:57,191 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:26:57,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:26:57,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:26:57,220 INFO L87 Difference]: Start difference. First operand has 78 states, 76 states have (on average 1.6710526315789473) internal successors, (127), 77 states have internal predecessors, (127), 0 states have call successors, (0), 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 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:57,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:57,543 INFO L93 Difference]: Finished difference Result 133 states and 215 transitions. [2022-02-20 18:26:57,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:26:57,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-02-20 18:26:57,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:26:57,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:57,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 215 transitions. [2022-02-20 18:26:57,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:57,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 215 transitions. [2022-02-20 18:26:57,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 215 transitions. [2022-02-20 18:26:57,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 215 edges. 215 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:26:57,744 INFO L225 Difference]: With dead ends: 133 [2022-02-20 18:26:57,744 INFO L226 Difference]: Without dead ends: 74 [2022-02-20 18:26:57,747 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:26:57,750 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 3 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:26:57,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 452 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:26:57,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-02-20 18:26:57,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-02-20 18:26:57,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:26:57,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 74 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 73 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:57,778 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 74 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 73 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:57,778 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 74 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 73 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:57,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:57,782 INFO L93 Difference]: Finished difference Result 74 states and 103 transitions. [2022-02-20 18:26:57,783 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 103 transitions. [2022-02-20 18:26:57,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:26:57,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:26:57,784 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 73 states have internal predecessors, (103), 0 states have call successors, (0), 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 74 states. [2022-02-20 18:26:57,784 INFO L87 Difference]: Start difference. First operand has 74 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 73 states have internal predecessors, (103), 0 states have call successors, (0), 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 74 states. [2022-02-20 18:26:57,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:57,788 INFO L93 Difference]: Finished difference Result 74 states and 103 transitions. [2022-02-20 18:26:57,788 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 103 transitions. [2022-02-20 18:26:57,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:26:57,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:26:57,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:26:57,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:26:57,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 73 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:57,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 103 transitions. [2022-02-20 18:26:57,793 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 103 transitions. Word has length 25 [2022-02-20 18:26:57,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:26:57,794 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 103 transitions. [2022-02-20 18:26:57,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:57,794 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 103 transitions. [2022-02-20 18:26:57,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 18:26:57,796 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:26:57,796 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] [2022-02-20 18:26:57,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:26:57,796 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:26:57,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:26:57,797 INFO L85 PathProgramCache]: Analyzing trace with hash -482254910, now seen corresponding path program 1 times [2022-02-20 18:26:57,797 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:26:57,798 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839676178] [2022-02-20 18:26:57,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:26:57,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:26:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:26:57,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {466#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; {466#true} is VALID [2022-02-20 18:26:57,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {466#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~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~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive3~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; {466#true} is VALID [2022-02-20 18:26:57,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {466#true} assume 0 == ~r1~0 % 256; {466#true} is VALID [2022-02-20 18:26:57,904 INFO L290 TraceCheckUtils]: 3: Hoare triple {466#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {466#true} is VALID [2022-02-20 18:26:57,904 INFO L290 TraceCheckUtils]: 4: Hoare triple {466#true} assume ~id1~0 >= 0; {466#true} is VALID [2022-02-20 18:26:57,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {466#true} assume 0 == ~st1~0; {466#true} is VALID [2022-02-20 18:26:57,904 INFO L290 TraceCheckUtils]: 6: Hoare triple {466#true} assume ~send1~0 == ~id1~0; {466#true} is VALID [2022-02-20 18:26:57,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {466#true} assume 0 == ~mode1~0 % 256; {466#true} is VALID [2022-02-20 18:26:57,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {466#true} assume ~id2~0 >= 0; {466#true} is VALID [2022-02-20 18:26:57,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {466#true} assume 0 == ~st2~0; {466#true} is VALID [2022-02-20 18:26:57,905 INFO L290 TraceCheckUtils]: 10: Hoare triple {466#true} assume ~send2~0 == ~id2~0; {466#true} is VALID [2022-02-20 18:26:57,906 INFO L290 TraceCheckUtils]: 11: Hoare triple {466#true} assume 0 == ~mode2~0 % 256; {468#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:57,907 INFO L290 TraceCheckUtils]: 12: Hoare triple {468#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {468#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:57,907 INFO L290 TraceCheckUtils]: 13: Hoare triple {468#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {468#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:57,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {468#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {468#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:57,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {468#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {468#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:57,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {468#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {468#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:57,910 INFO L290 TraceCheckUtils]: 17: Hoare triple {468#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {468#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:57,910 INFO L290 TraceCheckUtils]: 18: Hoare triple {468#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {468#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:57,912 INFO L290 TraceCheckUtils]: 19: Hoare triple {468#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {468#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:57,912 INFO L290 TraceCheckUtils]: 20: Hoare triple {468#(= (+ (* (- 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; {468#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:57,913 INFO L290 TraceCheckUtils]: 21: Hoare triple {468#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {468#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:57,914 INFO L290 TraceCheckUtils]: 22: Hoare triple {468#(= (+ (* (- 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;main_~i2~0#1 := 0; {468#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:57,914 INFO L290 TraceCheckUtils]: 23: Hoare triple {468#(= (+ (* (- 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; {468#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:57,915 INFO L290 TraceCheckUtils]: 24: Hoare triple {468#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {468#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:57,919 INFO L290 TraceCheckUtils]: 25: Hoare triple {468#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~alive1~0 % 256); {468#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:57,919 INFO L290 TraceCheckUtils]: 26: Hoare triple {468#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {468#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:57,920 INFO L290 TraceCheckUtils]: 27: Hoare triple {468#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {468#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:57,921 INFO L290 TraceCheckUtils]: 28: Hoare triple {468#(= (+ (* (- 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; {467#false} is VALID [2022-02-20 18:26:57,921 INFO L290 TraceCheckUtils]: 29: Hoare triple {467#false} assume !(node2_~m2~0#1 != ~nomsg~0); {467#false} is VALID [2022-02-20 18:26:57,922 INFO L290 TraceCheckUtils]: 30: Hoare triple {467#false} ~mode2~0 := 0; {467#false} is VALID [2022-02-20 18:26:57,922 INFO L290 TraceCheckUtils]: 31: Hoare triple {467#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {467#false} is VALID [2022-02-20 18:26:57,922 INFO L290 TraceCheckUtils]: 32: Hoare triple {467#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {467#false} is VALID [2022-02-20 18:26:57,922 INFO L290 TraceCheckUtils]: 33: Hoare triple {467#false} assume !(node3_~m3~0#1 != ~nomsg~0); {467#false} is VALID [2022-02-20 18:26:57,923 INFO L290 TraceCheckUtils]: 34: Hoare triple {467#false} ~mode3~0 := 0; {467#false} is VALID [2022-02-20 18:26:57,923 INFO L290 TraceCheckUtils]: 35: Hoare triple {467#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {467#false} is VALID [2022-02-20 18:26:57,923 INFO L290 TraceCheckUtils]: 36: Hoare triple {467#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {467#false} is VALID [2022-02-20 18:26:57,923 INFO L290 TraceCheckUtils]: 37: Hoare triple {467#false} check_#res#1 := check_~tmp~1#1; {467#false} is VALID [2022-02-20 18:26:57,924 INFO L290 TraceCheckUtils]: 38: Hoare triple {467#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; {467#false} is VALID [2022-02-20 18:26:57,924 INFO L290 TraceCheckUtils]: 39: Hoare triple {467#false} assume 0 == assert_~arg#1 % 256; {467#false} is VALID [2022-02-20 18:26:57,924 INFO L290 TraceCheckUtils]: 40: Hoare triple {467#false} assume !false; {467#false} is VALID [2022-02-20 18:26:57,925 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:26:57,925 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:26:57,926 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839676178] [2022-02-20 18:26:57,926 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839676178] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:26:57,926 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:26:57,926 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:26:57,927 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638089237] [2022-02-20 18:26:57,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:26:57,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-02-20 18:26:57,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:26:57,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:57,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:26:57,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:26:57,969 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:26:57,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:26:57,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:26:57,972 INFO L87 Difference]: Start difference. First operand 74 states and 103 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:58,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:58,143 INFO L93 Difference]: Finished difference Result 164 states and 243 transitions. [2022-02-20 18:26:58,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:26:58,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-02-20 18:26:58,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:26:58,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:58,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 243 transitions. [2022-02-20 18:26:58,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:58,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 243 transitions. [2022-02-20 18:26:58,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 243 transitions. [2022-02-20 18:26:58,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:26:58,338 INFO L225 Difference]: With dead ends: 164 [2022-02-20 18:26:58,339 INFO L226 Difference]: Without dead ends: 113 [2022-02-20 18:26:58,342 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:26:58,345 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 64 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 213 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:26:58,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 213 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:26:58,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-02-20 18:26:58,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2022-02-20 18:26:58,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:26:58,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 111 states, 110 states have (on average 1.4636363636363636) internal successors, (161), 110 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:58,364 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 111 states, 110 states have (on average 1.4636363636363636) internal successors, (161), 110 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:58,364 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 111 states, 110 states have (on average 1.4636363636363636) internal successors, (161), 110 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:58,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:58,368 INFO L93 Difference]: Finished difference Result 113 states and 162 transitions. [2022-02-20 18:26:58,368 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 162 transitions. [2022-02-20 18:26:58,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:26:58,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:26:58,376 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 110 states have (on average 1.4636363636363636) internal successors, (161), 110 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 113 states. [2022-02-20 18:26:58,376 INFO L87 Difference]: Start difference. First operand has 111 states, 110 states have (on average 1.4636363636363636) internal successors, (161), 110 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 113 states. [2022-02-20 18:26:58,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:58,381 INFO L93 Difference]: Finished difference Result 113 states and 162 transitions. [2022-02-20 18:26:58,381 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 162 transitions. [2022-02-20 18:26:58,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:26:58,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:26:58,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:26:58,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:26:58,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.4636363636363636) internal successors, (161), 110 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:58,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2022-02-20 18:26:58,388 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 41 [2022-02-20 18:26:58,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:26:58,389 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions. [2022-02-20 18:26:58,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:58,389 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2022-02-20 18:26:58,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 18:26:58,390 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:26:58,391 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] [2022-02-20 18:26:58,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:26:58,391 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:26:58,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:26:58,392 INFO L85 PathProgramCache]: Analyzing trace with hash 2033327635, now seen corresponding path program 1 times [2022-02-20 18:26:58,392 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:26:58,392 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35982930] [2022-02-20 18:26:58,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:26:58,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:26:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:26:58,505 INFO L290 TraceCheckUtils]: 0: Hoare triple {999#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; {999#true} is VALID [2022-02-20 18:26:58,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {999#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~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~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive3~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; {999#true} is VALID [2022-02-20 18:26:58,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {999#true} assume 0 == ~r1~0 % 256; {999#true} is VALID [2022-02-20 18:26:58,506 INFO L290 TraceCheckUtils]: 3: Hoare triple {999#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {999#true} is VALID [2022-02-20 18:26:58,507 INFO L290 TraceCheckUtils]: 4: Hoare triple {999#true} assume ~id1~0 >= 0; {999#true} is VALID [2022-02-20 18:26:58,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {999#true} assume 0 == ~st1~0; {999#true} is VALID [2022-02-20 18:26:58,507 INFO L290 TraceCheckUtils]: 6: Hoare triple {999#true} assume ~send1~0 == ~id1~0; {999#true} is VALID [2022-02-20 18:26:58,507 INFO L290 TraceCheckUtils]: 7: Hoare triple {999#true} assume 0 == ~mode1~0 % 256; {999#true} is VALID [2022-02-20 18:26:58,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {999#true} assume ~id2~0 >= 0; {999#true} is VALID [2022-02-20 18:26:58,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {999#true} assume 0 == ~st2~0; {999#true} is VALID [2022-02-20 18:26:58,508 INFO L290 TraceCheckUtils]: 10: Hoare triple {999#true} assume ~send2~0 == ~id2~0; {999#true} is VALID [2022-02-20 18:26:58,508 INFO L290 TraceCheckUtils]: 11: Hoare triple {999#true} assume 0 == ~mode2~0 % 256; {999#true} is VALID [2022-02-20 18:26:58,509 INFO L290 TraceCheckUtils]: 12: Hoare triple {999#true} assume ~id3~0 >= 0; {999#true} is VALID [2022-02-20 18:26:58,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {999#true} assume 0 == ~st3~0; {999#true} is VALID [2022-02-20 18:26:58,509 INFO L290 TraceCheckUtils]: 14: Hoare triple {999#true} assume ~send3~0 == ~id3~0; {999#true} is VALID [2022-02-20 18:26:58,510 INFO L290 TraceCheckUtils]: 15: Hoare triple {999#true} assume 0 == ~mode3~0 % 256; {1001#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:58,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {1001#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {1001#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:58,511 INFO L290 TraceCheckUtils]: 17: Hoare triple {1001#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {1001#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:58,511 INFO L290 TraceCheckUtils]: 18: Hoare triple {1001#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {1001#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:58,512 INFO L290 TraceCheckUtils]: 19: Hoare triple {1001#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {1001#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:58,512 INFO L290 TraceCheckUtils]: 20: Hoare triple {1001#(= (+ (* (- 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; {1001#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:58,513 INFO L290 TraceCheckUtils]: 21: Hoare triple {1001#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1001#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:58,514 INFO L290 TraceCheckUtils]: 22: Hoare triple {1001#(= (+ (* (- 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;main_~i2~0#1 := 0; {1001#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:58,514 INFO L290 TraceCheckUtils]: 23: Hoare triple {1001#(= (+ (* (- 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; {1001#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:58,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {1001#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {1001#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:58,515 INFO L290 TraceCheckUtils]: 25: Hoare triple {1001#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~alive1~0 % 256); {1001#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:58,516 INFO L290 TraceCheckUtils]: 26: Hoare triple {1001#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {1001#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:58,516 INFO L290 TraceCheckUtils]: 27: Hoare triple {1001#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1001#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:58,517 INFO L290 TraceCheckUtils]: 28: Hoare triple {1001#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {1001#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:58,517 INFO L290 TraceCheckUtils]: 29: Hoare triple {1001#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~alive2~0 % 256); {1001#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:58,518 INFO L290 TraceCheckUtils]: 30: Hoare triple {1001#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~id2~0); {1001#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:58,518 INFO L290 TraceCheckUtils]: 31: Hoare triple {1001#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {1001#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:58,519 INFO L290 TraceCheckUtils]: 32: Hoare triple {1001#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1001#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:58,520 INFO L290 TraceCheckUtils]: 33: Hoare triple {1001#(= (+ (* (- 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; {1000#false} is VALID [2022-02-20 18:26:58,520 INFO L290 TraceCheckUtils]: 34: Hoare triple {1000#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1000#false} is VALID [2022-02-20 18:26:58,520 INFO L290 TraceCheckUtils]: 35: Hoare triple {1000#false} ~mode3~0 := 0; {1000#false} is VALID [2022-02-20 18:26:58,520 INFO L290 TraceCheckUtils]: 36: Hoare triple {1000#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1000#false} is VALID [2022-02-20 18:26:58,521 INFO L290 TraceCheckUtils]: 37: Hoare triple {1000#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {1000#false} is VALID [2022-02-20 18:26:58,521 INFO L290 TraceCheckUtils]: 38: Hoare triple {1000#false} check_#res#1 := check_~tmp~1#1; {1000#false} is VALID [2022-02-20 18:26:58,521 INFO L290 TraceCheckUtils]: 39: Hoare triple {1000#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; {1000#false} is VALID [2022-02-20 18:26:58,521 INFO L290 TraceCheckUtils]: 40: Hoare triple {1000#false} assume 0 == assert_~arg#1 % 256; {1000#false} is VALID [2022-02-20 18:26:58,522 INFO L290 TraceCheckUtils]: 41: Hoare triple {1000#false} assume !false; {1000#false} is VALID [2022-02-20 18:26:58,522 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:26:58,522 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:26:58,523 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35982930] [2022-02-20 18:26:58,523 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35982930] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:26:58,523 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:26:58,523 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:26:58,523 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271778027] [2022-02-20 18:26:58,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:26:58,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2022-02-20 18:26:58,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:26:58,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:58,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:26:58,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:26:58,562 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:26:58,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:26:58,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:26:58,564 INFO L87 Difference]: Start difference. First operand 111 states and 161 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:58,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:58,708 INFO L93 Difference]: Finished difference Result 263 states and 397 transitions. [2022-02-20 18:26:58,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:26:58,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2022-02-20 18:26:58,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:26:58,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:58,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 243 transitions. [2022-02-20 18:26:58,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:58,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 243 transitions. [2022-02-20 18:26:58,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 243 transitions. [2022-02-20 18:26:58,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:26:58,904 INFO L225 Difference]: With dead ends: 263 [2022-02-20 18:26:58,904 INFO L226 Difference]: Without dead ends: 175 [2022-02-20 18:26:58,905 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:26:58,906 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 59 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 204 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:26:58,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 204 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:26:58,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-02-20 18:26:58,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173. [2022-02-20 18:26:58,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:26:58,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 175 states. Second operand has 173 states, 172 states have (on average 1.4883720930232558) internal successors, (256), 172 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:58,917 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand has 173 states, 172 states have (on average 1.4883720930232558) internal successors, (256), 172 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:58,917 INFO L87 Difference]: Start difference. First operand 175 states. Second operand has 173 states, 172 states have (on average 1.4883720930232558) internal successors, (256), 172 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:58,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:58,923 INFO L93 Difference]: Finished difference Result 175 states and 257 transitions. [2022-02-20 18:26:58,923 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 257 transitions. [2022-02-20 18:26:58,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:26:58,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:26:58,924 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 172 states have (on average 1.4883720930232558) internal successors, (256), 172 states have internal predecessors, (256), 0 states have call successors, (0), 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 175 states. [2022-02-20 18:26:58,925 INFO L87 Difference]: Start difference. First operand has 173 states, 172 states have (on average 1.4883720930232558) internal successors, (256), 172 states have internal predecessors, (256), 0 states have call successors, (0), 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 175 states. [2022-02-20 18:26:58,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:58,930 INFO L93 Difference]: Finished difference Result 175 states and 257 transitions. [2022-02-20 18:26:58,930 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 257 transitions. [2022-02-20 18:26:58,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:26:58,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:26:58,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:26:58,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:26:58,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 172 states have (on average 1.4883720930232558) internal successors, (256), 172 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:58,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 256 transitions. [2022-02-20 18:26:58,937 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 256 transitions. Word has length 42 [2022-02-20 18:26:58,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:26:58,937 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 256 transitions. [2022-02-20 18:26:58,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:58,938 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 256 transitions. [2022-02-20 18:26:58,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 18:26:58,938 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:26:58,939 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] [2022-02-20 18:26:58,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:26:58,939 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:26:58,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:26:58,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1819327886, now seen corresponding path program 1 times [2022-02-20 18:26:58,940 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:26:58,940 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381146094] [2022-02-20 18:26:58,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:26:58,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:26:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:26:59,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {1842#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; {1842#true} is VALID [2022-02-20 18:26:59,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {1842#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~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~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive3~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; {1842#true} is VALID [2022-02-20 18:26:59,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {1842#true} assume 0 == ~r1~0 % 256; {1842#true} is VALID [2022-02-20 18:26:59,036 INFO L290 TraceCheckUtils]: 3: Hoare triple {1842#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {1842#true} is VALID [2022-02-20 18:26:59,036 INFO L290 TraceCheckUtils]: 4: Hoare triple {1842#true} assume ~id1~0 >= 0; {1842#true} is VALID [2022-02-20 18:26:59,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {1842#true} assume 0 == ~st1~0; {1844#(<= ~st1~0 0)} is VALID [2022-02-20 18:26:59,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {1844#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {1844#(<= ~st1~0 0)} is VALID [2022-02-20 18:26:59,037 INFO L290 TraceCheckUtils]: 7: Hoare triple {1844#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {1844#(<= ~st1~0 0)} is VALID [2022-02-20 18:26:59,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {1844#(<= ~st1~0 0)} assume ~id2~0 >= 0; {1844#(<= ~st1~0 0)} is VALID [2022-02-20 18:26:59,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {1844#(<= ~st1~0 0)} assume 0 == ~st2~0; {1845#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:59,038 INFO L290 TraceCheckUtils]: 10: Hoare triple {1845#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {1845#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:59,039 INFO L290 TraceCheckUtils]: 11: Hoare triple {1845#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {1845#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:59,039 INFO L290 TraceCheckUtils]: 12: Hoare triple {1845#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {1845#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:59,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {1845#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:59,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:59,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:59,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:59,041 INFO L290 TraceCheckUtils]: 17: Hoare triple {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:59,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:59,042 INFO L290 TraceCheckUtils]: 19: Hoare triple {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:59,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {1846#(<= (+ ~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; {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:59,043 INFO L290 TraceCheckUtils]: 21: Hoare triple {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:59,043 INFO L290 TraceCheckUtils]: 22: Hoare triple {1846#(<= (+ ~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;main_~i2~0#1 := 0; {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:59,044 INFO L290 TraceCheckUtils]: 23: Hoare triple {1846#(<= (+ ~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; {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:59,044 INFO L290 TraceCheckUtils]: 24: Hoare triple {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:59,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive1~0 % 256); {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:59,045 INFO L290 TraceCheckUtils]: 26: Hoare triple {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:59,046 INFO L290 TraceCheckUtils]: 27: Hoare triple {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:59,046 INFO L290 TraceCheckUtils]: 28: Hoare triple {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:59,046 INFO L290 TraceCheckUtils]: 29: Hoare triple {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive2~0 % 256); {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:59,047 INFO L290 TraceCheckUtils]: 30: Hoare triple {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:59,047 INFO L290 TraceCheckUtils]: 31: Hoare triple {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:59,048 INFO L290 TraceCheckUtils]: 32: Hoare triple {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:59,048 INFO L290 TraceCheckUtils]: 33: Hoare triple {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:59,048 INFO L290 TraceCheckUtils]: 34: Hoare triple {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive3~0 % 256); {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:59,049 INFO L290 TraceCheckUtils]: 35: Hoare triple {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:59,049 INFO L290 TraceCheckUtils]: 36: Hoare triple {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:59,050 INFO L290 TraceCheckUtils]: 37: Hoare triple {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:59,050 INFO L290 TraceCheckUtils]: 38: Hoare triple {1846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {1843#false} is VALID [2022-02-20 18:26:59,050 INFO L290 TraceCheckUtils]: 39: Hoare triple {1843#false} check_#res#1 := check_~tmp~1#1; {1843#false} is VALID [2022-02-20 18:26:59,051 INFO L290 TraceCheckUtils]: 40: Hoare triple {1843#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; {1843#false} is VALID [2022-02-20 18:26:59,051 INFO L290 TraceCheckUtils]: 41: Hoare triple {1843#false} assume 0 == assert_~arg#1 % 256; {1843#false} is VALID [2022-02-20 18:26:59,051 INFO L290 TraceCheckUtils]: 42: Hoare triple {1843#false} assume !false; {1843#false} is VALID [2022-02-20 18:26:59,051 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:26:59,052 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:26:59,052 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381146094] [2022-02-20 18:26:59,052 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381146094] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:26:59,052 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:26:59,052 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:26:59,053 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041800434] [2022-02-20 18:26:59,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:26:59,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 18:26:59,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:26:59,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:59,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:26:59,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:26:59,083 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:26:59,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:26:59,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:26:59,084 INFO L87 Difference]: Start difference. First operand 173 states and 256 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:59,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:59,667 INFO L93 Difference]: Finished difference Result 773 states and 1188 transitions. [2022-02-20 18:26:59,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:26:59,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 18:26:59,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:26:59,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:59,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 423 transitions. [2022-02-20 18:26:59,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:59,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 423 transitions. [2022-02-20 18:26:59,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 423 transitions. [2022-02-20 18:26:59,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 423 edges. 423 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:00,014 INFO L225 Difference]: With dead ends: 773 [2022-02-20 18:27:00,014 INFO L226 Difference]: Without dead ends: 623 [2022-02-20 18:27:00,018 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:27:00,026 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 403 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:27:00,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [403 Valid, 532 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:00,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2022-02-20 18:27:00,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 321. [2022-02-20 18:27:00,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:00,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 623 states. Second operand has 321 states, 320 states have (on average 1.5) internal successors, (480), 320 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:00,108 INFO L74 IsIncluded]: Start isIncluded. First operand 623 states. Second operand has 321 states, 320 states have (on average 1.5) internal successors, (480), 320 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:00,109 INFO L87 Difference]: Start difference. First operand 623 states. Second operand has 321 states, 320 states have (on average 1.5) internal successors, (480), 320 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:00,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:00,142 INFO L93 Difference]: Finished difference Result 623 states and 947 transitions. [2022-02-20 18:27:00,142 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 947 transitions. [2022-02-20 18:27:00,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:00,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:00,153 INFO L74 IsIncluded]: Start isIncluded. First operand has 321 states, 320 states have (on average 1.5) internal successors, (480), 320 states have internal predecessors, (480), 0 states have call successors, (0), 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 623 states. [2022-02-20 18:27:00,154 INFO L87 Difference]: Start difference. First operand has 321 states, 320 states have (on average 1.5) internal successors, (480), 320 states have internal predecessors, (480), 0 states have call successors, (0), 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 623 states. [2022-02-20 18:27:00,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:00,182 INFO L93 Difference]: Finished difference Result 623 states and 947 transitions. [2022-02-20 18:27:00,182 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 947 transitions. [2022-02-20 18:27:00,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:00,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:00,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:00,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:00,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 320 states have (on average 1.5) internal successors, (480), 320 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:00,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 480 transitions. [2022-02-20 18:27:00,193 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 480 transitions. Word has length 43 [2022-02-20 18:27:00,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:00,194 INFO L470 AbstractCegarLoop]: Abstraction has 321 states and 480 transitions. [2022-02-20 18:27:00,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:00,194 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 480 transitions. [2022-02-20 18:27:00,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 18:27:00,195 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:00,195 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] [2022-02-20 18:27:00,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:27:00,195 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:00,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:00,196 INFO L85 PathProgramCache]: Analyzing trace with hash -947913043, now seen corresponding path program 1 times [2022-02-20 18:27:00,196 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:00,196 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017158046] [2022-02-20 18:27:00,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:00,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:00,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {4336#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; {4336#true} is VALID [2022-02-20 18:27:00,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {4336#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~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~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive3~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; {4336#true} is VALID [2022-02-20 18:27:00,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {4336#true} assume 0 == ~r1~0 % 256; {4336#true} is VALID [2022-02-20 18:27:00,288 INFO L290 TraceCheckUtils]: 3: Hoare triple {4336#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:00,289 INFO L290 TraceCheckUtils]: 4: Hoare triple {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 >= 0; {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:00,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st1~0; {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:00,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send1~0 == ~id1~0; {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:00,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode1~0 % 256; {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:00,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 >= 0; {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:00,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st2~0; {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:00,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send2~0 == ~id2~0; {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:00,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode2~0 % 256; {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:00,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 >= 0; {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:00,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st3~0; {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:00,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send3~0 == ~id3~0; {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:00,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode3~0 % 256; {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:00,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id2~0; {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:00,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id3~0; {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:00,298 INFO L290 TraceCheckUtils]: 18: Hoare triple {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:00,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} init_#res#1 := init_~tmp~0#1; {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:00,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~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; {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:00,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume !(0 == assume_abort_if_not_~cond#1); {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:00,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~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;main_~i2~0#1 := 0; {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:00,300 INFO L290 TraceCheckUtils]: 23: Hoare triple {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~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; {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:00,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume !(0 != ~mode1~0 % 256); {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:00,303 INFO L290 TraceCheckUtils]: 25: Hoare triple {4338#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume !(0 != ~alive1~0 % 256); {4339#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:27:00,304 INFO L290 TraceCheckUtils]: 26: Hoare triple {4339#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} ~mode1~0 := 1; {4339#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:27:00,304 INFO L290 TraceCheckUtils]: 27: Hoare triple {4339#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {4339#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:27:00,305 INFO L290 TraceCheckUtils]: 28: Hoare triple {4339#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} assume !(0 != ~mode2~0 % 256); {4339#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:27:00,305 INFO L290 TraceCheckUtils]: 29: Hoare triple {4339#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} assume !(0 != ~alive2~0 % 256); {4340#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} is VALID [2022-02-20 18:27:00,307 INFO L290 TraceCheckUtils]: 30: Hoare triple {4340#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} assume !(~send2~0 != ~id2~0); {4340#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} is VALID [2022-02-20 18:27:00,308 INFO L290 TraceCheckUtils]: 31: Hoare triple {4340#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} ~mode2~0 := 1; {4340#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} is VALID [2022-02-20 18:27:00,308 INFO L290 TraceCheckUtils]: 32: Hoare triple {4340#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {4340#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} is VALID [2022-02-20 18:27:00,309 INFO L290 TraceCheckUtils]: 33: Hoare triple {4340#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} assume !(0 != ~mode3~0 % 256); {4340#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} is VALID [2022-02-20 18:27:00,309 INFO L290 TraceCheckUtils]: 34: Hoare triple {4340#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} assume !(0 != ~alive3~0 % 256); {4337#false} is VALID [2022-02-20 18:27:00,309 INFO L290 TraceCheckUtils]: 35: Hoare triple {4337#false} assume !(~send3~0 != ~id3~0); {4337#false} is VALID [2022-02-20 18:27:00,310 INFO L290 TraceCheckUtils]: 36: Hoare triple {4337#false} ~mode3~0 := 1; {4337#false} is VALID [2022-02-20 18:27:00,310 INFO L290 TraceCheckUtils]: 37: Hoare triple {4337#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {4337#false} is VALID [2022-02-20 18:27:00,310 INFO L290 TraceCheckUtils]: 38: Hoare triple {4337#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {4337#false} is VALID [2022-02-20 18:27:00,310 INFO L290 TraceCheckUtils]: 39: Hoare triple {4337#false} assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; {4337#false} is VALID [2022-02-20 18:27:00,310 INFO L290 TraceCheckUtils]: 40: Hoare triple {4337#false} check_#res#1 := check_~tmp~1#1; {4337#false} is VALID [2022-02-20 18:27:00,311 INFO L290 TraceCheckUtils]: 41: Hoare triple {4337#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; {4337#false} is VALID [2022-02-20 18:27:00,311 INFO L290 TraceCheckUtils]: 42: Hoare triple {4337#false} assume 0 == assert_~arg#1 % 256; {4337#false} is VALID [2022-02-20 18:27:00,311 INFO L290 TraceCheckUtils]: 43: Hoare triple {4337#false} assume !false; {4337#false} is VALID [2022-02-20 18:27:00,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:27:00,312 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:00,312 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017158046] [2022-02-20 18:27:00,312 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017158046] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:00,312 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:00,312 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:27:00,312 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870813434] [2022-02-20 18:27:00,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:00,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-02-20 18:27:00,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:00,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:00,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:00,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:27:00,345 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:00,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:27:00,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:27:00,346 INFO L87 Difference]: Start difference. First operand 321 states and 480 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:01,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:01,046 INFO L93 Difference]: Finished difference Result 1143 states and 1727 transitions. [2022-02-20 18:27:01,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:27:01,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-02-20 18:27:01,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:01,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:01,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 312 transitions. [2022-02-20 18:27:01,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:01,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 312 transitions. [2022-02-20 18:27:01,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 312 transitions. [2022-02-20 18:27:01,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 312 edges. 312 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:01,335 INFO L225 Difference]: With dead ends: 1143 [2022-02-20 18:27:01,335 INFO L226 Difference]: Without dead ends: 845 [2022-02-20 18:27:01,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:27:01,337 INFO L933 BasicCegarLoop]: 169 mSDtfsCounter, 256 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:27:01,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [256 Valid, 345 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:01,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2022-02-20 18:27:01,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 841. [2022-02-20 18:27:01,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:01,565 INFO L82 GeneralOperation]: Start isEquivalent. First operand 845 states. Second operand has 841 states, 840 states have (on average 1.5) internal successors, (1260), 840 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:01,566 INFO L74 IsIncluded]: Start isIncluded. First operand 845 states. Second operand has 841 states, 840 states have (on average 1.5) internal successors, (1260), 840 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:01,568 INFO L87 Difference]: Start difference. First operand 845 states. Second operand has 841 states, 840 states have (on average 1.5) internal successors, (1260), 840 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:01,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:01,617 INFO L93 Difference]: Finished difference Result 845 states and 1262 transitions. [2022-02-20 18:27:01,617 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1262 transitions. [2022-02-20 18:27:01,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:01,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:01,620 INFO L74 IsIncluded]: Start isIncluded. First operand has 841 states, 840 states have (on average 1.5) internal successors, (1260), 840 states have internal predecessors, (1260), 0 states have call successors, (0), 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 845 states. [2022-02-20 18:27:01,622 INFO L87 Difference]: Start difference. First operand has 841 states, 840 states have (on average 1.5) internal successors, (1260), 840 states have internal predecessors, (1260), 0 states have call successors, (0), 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 845 states. [2022-02-20 18:27:01,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:01,664 INFO L93 Difference]: Finished difference Result 845 states and 1262 transitions. [2022-02-20 18:27:01,664 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1262 transitions. [2022-02-20 18:27:01,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:01,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:01,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:01,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:01,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 840 states have (on average 1.5) internal successors, (1260), 840 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:01,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1260 transitions. [2022-02-20 18:27:01,709 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1260 transitions. Word has length 44 [2022-02-20 18:27:01,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:01,709 INFO L470 AbstractCegarLoop]: Abstraction has 841 states and 1260 transitions. [2022-02-20 18:27:01,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:01,709 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1260 transitions. [2022-02-20 18:27:01,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 18:27:01,710 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:01,710 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] [2022-02-20 18:27:01,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:27:01,711 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:01,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:01,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1382364025, now seen corresponding path program 1 times [2022-02-20 18:27:01,711 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:01,712 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786364215] [2022-02-20 18:27:01,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:01,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:01,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {8299#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; {8299#true} is VALID [2022-02-20 18:27:01,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {8299#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~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~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive3~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; {8299#true} is VALID [2022-02-20 18:27:01,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {8299#true} assume 0 == ~r1~0 % 256; {8299#true} is VALID [2022-02-20 18:27:01,827 INFO L290 TraceCheckUtils]: 3: Hoare triple {8299#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {8299#true} is VALID [2022-02-20 18:27:01,828 INFO L290 TraceCheckUtils]: 4: Hoare triple {8299#true} assume ~id1~0 >= 0; {8299#true} is VALID [2022-02-20 18:27:01,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {8299#true} assume 0 == ~st1~0; {8299#true} is VALID [2022-02-20 18:27:01,828 INFO L290 TraceCheckUtils]: 6: Hoare triple {8299#true} assume ~send1~0 == ~id1~0; {8299#true} is VALID [2022-02-20 18:27:01,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {8299#true} assume 0 == ~mode1~0 % 256; {8299#true} is VALID [2022-02-20 18:27:01,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {8299#true} assume ~id2~0 >= 0; {8299#true} is VALID [2022-02-20 18:27:01,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {8299#true} assume 0 == ~st2~0; {8299#true} is VALID [2022-02-20 18:27:01,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {8299#true} assume ~send2~0 == ~id2~0; {8299#true} is VALID [2022-02-20 18:27:01,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {8299#true} assume 0 == ~mode2~0 % 256; {8299#true} is VALID [2022-02-20 18:27:01,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {8299#true} assume ~id3~0 >= 0; {8299#true} is VALID [2022-02-20 18:27:01,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {8299#true} assume 0 == ~st3~0; {8299#true} is VALID [2022-02-20 18:27:01,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {8299#true} assume ~send3~0 == ~id3~0; {8299#true} is VALID [2022-02-20 18:27:01,832 INFO L290 TraceCheckUtils]: 15: Hoare triple {8299#true} assume 0 == ~mode3~0 % 256; {8299#true} is VALID [2022-02-20 18:27:01,833 INFO L290 TraceCheckUtils]: 16: Hoare triple {8299#true} assume ~id1~0 != ~id2~0; {8299#true} is VALID [2022-02-20 18:27:01,833 INFO L290 TraceCheckUtils]: 17: Hoare triple {8299#true} assume ~id1~0 != ~id3~0; {8299#true} is VALID [2022-02-20 18:27:01,833 INFO L290 TraceCheckUtils]: 18: Hoare triple {8299#true} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {8301#(= |ULTIMATE.start_init_~tmp~0#1| 1)} is VALID [2022-02-20 18:27:01,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {8301#(= |ULTIMATE.start_init_~tmp~0#1| 1)} init_#res#1 := init_~tmp~0#1; {8302#(= |ULTIMATE.start_init_#res#1| 1)} is VALID [2022-02-20 18:27:01,834 INFO L290 TraceCheckUtils]: 20: Hoare triple {8302#(= |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; {8303#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)} is VALID [2022-02-20 18:27:01,834 INFO L290 TraceCheckUtils]: 21: Hoare triple {8303#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)} assume !(0 == assume_abort_if_not_~cond#1); {8299#true} is VALID [2022-02-20 18:27:01,835 INFO L290 TraceCheckUtils]: 22: Hoare triple {8299#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;main_~i2~0#1 := 0; {8299#true} is VALID [2022-02-20 18:27:01,835 INFO L290 TraceCheckUtils]: 23: Hoare triple {8299#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; {8299#true} is VALID [2022-02-20 18:27:01,835 INFO L290 TraceCheckUtils]: 24: Hoare triple {8299#true} assume !(0 != ~mode1~0 % 256); {8299#true} is VALID [2022-02-20 18:27:01,835 INFO L290 TraceCheckUtils]: 25: Hoare triple {8299#true} assume !(0 != ~alive1~0 % 256); {8299#true} is VALID [2022-02-20 18:27:01,835 INFO L290 TraceCheckUtils]: 26: Hoare triple {8299#true} ~mode1~0 := 1; {8299#true} is VALID [2022-02-20 18:27:01,835 INFO L290 TraceCheckUtils]: 27: Hoare triple {8299#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {8299#true} is VALID [2022-02-20 18:27:01,836 INFO L290 TraceCheckUtils]: 28: Hoare triple {8299#true} assume !(0 != ~mode2~0 % 256); {8299#true} is VALID [2022-02-20 18:27:01,836 INFO L290 TraceCheckUtils]: 29: Hoare triple {8299#true} assume 0 != ~alive2~0 % 256; {8299#true} is VALID [2022-02-20 18:27:01,836 INFO L290 TraceCheckUtils]: 30: Hoare triple {8299#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {8299#true} is VALID [2022-02-20 18:27:01,836 INFO L290 TraceCheckUtils]: 31: Hoare triple {8299#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; {8299#true} is VALID [2022-02-20 18:27:01,836 INFO L290 TraceCheckUtils]: 32: Hoare triple {8299#true} ~mode2~0 := 1; {8299#true} is VALID [2022-02-20 18:27:01,837 INFO L290 TraceCheckUtils]: 33: Hoare triple {8299#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {8299#true} is VALID [2022-02-20 18:27:01,837 INFO L290 TraceCheckUtils]: 34: Hoare triple {8299#true} assume !(0 != ~mode3~0 % 256); {8299#true} is VALID [2022-02-20 18:27:01,837 INFO L290 TraceCheckUtils]: 35: Hoare triple {8299#true} assume !(0 != ~alive3~0 % 256); {8299#true} is VALID [2022-02-20 18:27:01,837 INFO L290 TraceCheckUtils]: 36: Hoare triple {8299#true} assume !(~send3~0 != ~id3~0); {8299#true} is VALID [2022-02-20 18:27:01,837 INFO L290 TraceCheckUtils]: 37: Hoare triple {8299#true} ~mode3~0 := 1; {8299#true} is VALID [2022-02-20 18:27:01,837 INFO L290 TraceCheckUtils]: 38: Hoare triple {8299#true} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {8299#true} is VALID [2022-02-20 18:27:01,838 INFO L290 TraceCheckUtils]: 39: Hoare triple {8299#true} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {8299#true} is VALID [2022-02-20 18:27:01,838 INFO L290 TraceCheckUtils]: 40: Hoare triple {8299#true} assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; {8304#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} is VALID [2022-02-20 18:27:01,839 INFO L290 TraceCheckUtils]: 41: Hoare triple {8304#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} check_#res#1 := check_~tmp~1#1; {8305#(not (= 0 |ULTIMATE.start_check_#res#1|))} is VALID [2022-02-20 18:27:01,839 INFO L290 TraceCheckUtils]: 42: Hoare triple {8305#(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; {8306#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} is VALID [2022-02-20 18:27:01,840 INFO L290 TraceCheckUtils]: 43: Hoare triple {8306#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} assume 0 == assert_~arg#1 % 256; {8300#false} is VALID [2022-02-20 18:27:01,844 INFO L290 TraceCheckUtils]: 44: Hoare triple {8300#false} assume !false; {8300#false} is VALID [2022-02-20 18:27:01,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:27:01,845 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:01,845 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786364215] [2022-02-20 18:27:01,845 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786364215] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:01,846 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:01,846 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:27:01,846 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428425621] [2022-02-20 18:27:01,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:01,846 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2022-02-20 18:27:01,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:01,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:01,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:01,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:27:01,877 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:01,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:27:01,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:27:01,880 INFO L87 Difference]: Start difference. First operand 841 states and 1260 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:03,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:03,236 INFO L93 Difference]: Finished difference Result 1755 states and 2593 transitions. [2022-02-20 18:27:03,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 18:27:03,237 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2022-02-20 18:27:03,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:03,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:03,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions. [2022-02-20 18:27:03,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:03,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions. [2022-02-20 18:27:03,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 187 transitions. [2022-02-20 18:27:03,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:03,536 INFO L225 Difference]: With dead ends: 1755 [2022-02-20 18:27:03,536 INFO L226 Difference]: Without dead ends: 1753 [2022-02-20 18:27:03,537 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:27:03,537 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 540 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:27:03,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [540 Valid, 501 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:03,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1753 states. [2022-02-20 18:27:03,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1753 to 913. [2022-02-20 18:27:03,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:03,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1753 states. Second operand has 913 states, 912 states have (on average 1.4605263157894737) internal successors, (1332), 912 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:03,938 INFO L74 IsIncluded]: Start isIncluded. First operand 1753 states. Second operand has 913 states, 912 states have (on average 1.4605263157894737) internal successors, (1332), 912 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:03,940 INFO L87 Difference]: Start difference. First operand 1753 states. Second operand has 913 states, 912 states have (on average 1.4605263157894737) internal successors, (1332), 912 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:04,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:04,099 INFO L93 Difference]: Finished difference Result 1753 states and 2568 transitions. [2022-02-20 18:27:04,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2568 transitions. [2022-02-20 18:27:04,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:04,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:04,104 INFO L74 IsIncluded]: Start isIncluded. First operand has 913 states, 912 states have (on average 1.4605263157894737) internal successors, (1332), 912 states have internal predecessors, (1332), 0 states have call successors, (0), 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 1753 states. [2022-02-20 18:27:04,106 INFO L87 Difference]: Start difference. First operand has 913 states, 912 states have (on average 1.4605263157894737) internal successors, (1332), 912 states have internal predecessors, (1332), 0 states have call successors, (0), 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 1753 states. [2022-02-20 18:27:04,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:04,261 INFO L93 Difference]: Finished difference Result 1753 states and 2568 transitions. [2022-02-20 18:27:04,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2568 transitions. [2022-02-20 18:27:04,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:04,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:04,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:04,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:04,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 912 states have (on average 1.4605263157894737) internal successors, (1332), 912 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:04,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1332 transitions. [2022-02-20 18:27:04,310 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1332 transitions. Word has length 45 [2022-02-20 18:27:04,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:04,310 INFO L470 AbstractCegarLoop]: Abstraction has 913 states and 1332 transitions. [2022-02-20 18:27:04,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:04,311 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1332 transitions. [2022-02-20 18:27:04,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 18:27:04,311 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:04,311 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] [2022-02-20 18:27:04,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:27:04,312 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:04,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:04,312 INFO L85 PathProgramCache]: Analyzing trace with hash 148966672, now seen corresponding path program 1 times [2022-02-20 18:27:04,313 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:04,313 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665577682] [2022-02-20 18:27:04,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:04,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:04,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {14934#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; {14934#true} is VALID [2022-02-20 18:27:04,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {14934#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~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~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive3~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; {14934#true} is VALID [2022-02-20 18:27:04,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {14934#true} assume 0 == ~r1~0 % 256; {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:04,372 INFO L290 TraceCheckUtils]: 3: Hoare triple {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:04,372 INFO L290 TraceCheckUtils]: 4: Hoare triple {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 >= 0; {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:04,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:04,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 == ~id1~0; {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:04,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:04,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 >= 0; {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:04,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:04,377 INFO L290 TraceCheckUtils]: 10: Hoare triple {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 == ~id2~0; {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:04,377 INFO L290 TraceCheckUtils]: 11: Hoare triple {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:04,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 >= 0; {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:04,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:04,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 == ~id3~0; {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:04,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:04,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id2~0; {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:04,383 INFO L290 TraceCheckUtils]: 17: Hoare triple {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id3~0; {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:04,383 INFO L290 TraceCheckUtils]: 18: Hoare triple {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:04,383 INFO L290 TraceCheckUtils]: 19: Hoare triple {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} init_#res#1 := init_~tmp~0#1; {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:04,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {14936#(<= ~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; {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:04,384 INFO L290 TraceCheckUtils]: 21: Hoare triple {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == assume_abort_if_not_~cond#1); {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:04,385 INFO L290 TraceCheckUtils]: 22: Hoare triple {14936#(<= ~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;main_~i2~0#1 := 0; {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:04,385 INFO L290 TraceCheckUtils]: 23: Hoare triple {14936#(<= ~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; {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:04,386 INFO L290 TraceCheckUtils]: 24: Hoare triple {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode1~0 % 256); {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:04,387 INFO L290 TraceCheckUtils]: 25: Hoare triple {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~alive1~0 % 256); {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:04,387 INFO L290 TraceCheckUtils]: 26: Hoare triple {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~mode1~0 := 1; {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:04,387 INFO L290 TraceCheckUtils]: 27: Hoare triple {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:04,388 INFO L290 TraceCheckUtils]: 28: Hoare triple {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode2~0 % 256); {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:04,388 INFO L290 TraceCheckUtils]: 29: Hoare triple {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != ~alive2~0 % 256; {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:04,389 INFO L290 TraceCheckUtils]: 30: Hoare triple {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:04,389 INFO L290 TraceCheckUtils]: 31: Hoare triple {14936#(<= ~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; {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:04,389 INFO L290 TraceCheckUtils]: 32: Hoare triple {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~mode2~0 := 1; {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:04,390 INFO L290 TraceCheckUtils]: 33: Hoare triple {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:04,390 INFO L290 TraceCheckUtils]: 34: Hoare triple {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode3~0 % 256); {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:04,391 INFO L290 TraceCheckUtils]: 35: Hoare triple {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~alive3~0 % 256); {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:04,391 INFO L290 TraceCheckUtils]: 36: Hoare triple {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~send3~0 != ~id3~0); {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:04,392 INFO L290 TraceCheckUtils]: 37: Hoare triple {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~mode3~0 := 1; {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:04,392 INFO L290 TraceCheckUtils]: 38: Hoare triple {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:04,393 INFO L290 TraceCheckUtils]: 39: Hoare triple {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:04,393 INFO L290 TraceCheckUtils]: 40: Hoare triple {14936#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~r1~0 % 256 < 3); {14935#false} is VALID [2022-02-20 18:27:04,394 INFO L290 TraceCheckUtils]: 41: Hoare triple {14935#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0);check_~tmp~1#1 := 0; {14935#false} is VALID [2022-02-20 18:27:04,394 INFO L290 TraceCheckUtils]: 42: Hoare triple {14935#false} check_#res#1 := check_~tmp~1#1; {14935#false} is VALID [2022-02-20 18:27:04,394 INFO L290 TraceCheckUtils]: 43: Hoare triple {14935#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; {14935#false} is VALID [2022-02-20 18:27:04,394 INFO L290 TraceCheckUtils]: 44: Hoare triple {14935#false} assume 0 == assert_~arg#1 % 256; {14935#false} is VALID [2022-02-20 18:27:04,394 INFO L290 TraceCheckUtils]: 45: Hoare triple {14935#false} assume !false; {14935#false} is VALID [2022-02-20 18:27:04,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:27:04,395 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:04,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665577682] [2022-02-20 18:27:04,395 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665577682] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:04,395 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:04,395 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:27:04,395 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898972449] [2022-02-20 18:27:04,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:04,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2022-02-20 18:27:04,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:04,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:04,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:04,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:27:04,435 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:04,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:27:04,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:27:04,436 INFO L87 Difference]: Start difference. First operand 913 states and 1332 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:05,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:05,604 INFO L93 Difference]: Finished difference Result 2393 states and 3478 transitions. [2022-02-20 18:27:05,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:27:05,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2022-02-20 18:27:05,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:05,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:05,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2022-02-20 18:27:05,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:05,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2022-02-20 18:27:05,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 252 transitions. [2022-02-20 18:27:05,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:05,892 INFO L225 Difference]: With dead ends: 2393 [2022-02-20 18:27:05,893 INFO L226 Difference]: Without dead ends: 1503 [2022-02-20 18:27:05,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:27:05,896 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 49 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 178 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:27:05,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 178 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:05,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2022-02-20 18:27:06,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1481. [2022-02-20 18:27:06,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:06,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1503 states. Second operand has 1481 states, 1480 states have (on average 1.4243243243243244) internal successors, (2108), 1480 states have internal predecessors, (2108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:06,639 INFO L74 IsIncluded]: Start isIncluded. First operand 1503 states. Second operand has 1481 states, 1480 states have (on average 1.4243243243243244) internal successors, (2108), 1480 states have internal predecessors, (2108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:06,642 INFO L87 Difference]: Start difference. First operand 1503 states. Second operand has 1481 states, 1480 states have (on average 1.4243243243243244) internal successors, (2108), 1480 states have internal predecessors, (2108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:06,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:06,745 INFO L93 Difference]: Finished difference Result 1503 states and 2129 transitions. [2022-02-20 18:27:06,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 2129 transitions. [2022-02-20 18:27:06,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:06,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:06,751 INFO L74 IsIncluded]: Start isIncluded. First operand has 1481 states, 1480 states have (on average 1.4243243243243244) internal successors, (2108), 1480 states have internal predecessors, (2108), 0 states have call successors, (0), 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 1503 states. [2022-02-20 18:27:06,753 INFO L87 Difference]: Start difference. First operand has 1481 states, 1480 states have (on average 1.4243243243243244) internal successors, (2108), 1480 states have internal predecessors, (2108), 0 states have call successors, (0), 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 1503 states. [2022-02-20 18:27:06,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:06,859 INFO L93 Difference]: Finished difference Result 1503 states and 2129 transitions. [2022-02-20 18:27:06,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 2129 transitions. [2022-02-20 18:27:06,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:06,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:06,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:06,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:06,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1481 states, 1480 states have (on average 1.4243243243243244) internal successors, (2108), 1480 states have internal predecessors, (2108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:06,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2108 transitions. [2022-02-20 18:27:06,986 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2108 transitions. Word has length 46 [2022-02-20 18:27:06,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:06,986 INFO L470 AbstractCegarLoop]: Abstraction has 1481 states and 2108 transitions. [2022-02-20 18:27:06,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:06,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2108 transitions. [2022-02-20 18:27:06,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 18:27:06,987 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:06,987 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] [2022-02-20 18:27:06,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:27:06,987 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:06,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:06,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1623386325, now seen corresponding path program 1 times [2022-02-20 18:27:06,988 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:06,988 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664995958] [2022-02-20 18:27:06,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:06,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:07,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:07,023 INFO L290 TraceCheckUtils]: 0: Hoare triple {22469#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; {22469#true} is VALID [2022-02-20 18:27:07,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {22469#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~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~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive3~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; {22469#true} is VALID [2022-02-20 18:27:07,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {22469#true} assume 0 == ~r1~0 % 256; {22469#true} is VALID [2022-02-20 18:27:07,024 INFO L290 TraceCheckUtils]: 3: Hoare triple {22469#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {22469#true} is VALID [2022-02-20 18:27:07,024 INFO L290 TraceCheckUtils]: 4: Hoare triple {22469#true} assume ~id1~0 >= 0; {22469#true} is VALID [2022-02-20 18:27:07,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {22469#true} assume 0 == ~st1~0; {22469#true} is VALID [2022-02-20 18:27:07,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {22469#true} assume ~send1~0 == ~id1~0; {22469#true} is VALID [2022-02-20 18:27:07,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {22469#true} assume 0 == ~mode1~0 % 256; {22471#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:07,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {22471#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {22471#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:07,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {22471#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {22471#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:07,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {22471#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {22471#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:07,026 INFO L290 TraceCheckUtils]: 11: Hoare triple {22471#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {22471#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:07,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {22471#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {22471#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:07,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {22471#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {22471#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:07,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {22471#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {22471#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:07,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {22471#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {22471#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:07,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {22471#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {22471#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:07,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {22471#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {22471#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:07,029 INFO L290 TraceCheckUtils]: 18: Hoare triple {22471#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {22471#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:07,030 INFO L290 TraceCheckUtils]: 19: Hoare triple {22471#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {22471#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:07,030 INFO L290 TraceCheckUtils]: 20: Hoare triple {22471#(= (+ (* (- 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; {22471#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:07,030 INFO L290 TraceCheckUtils]: 21: Hoare triple {22471#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {22471#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:07,031 INFO L290 TraceCheckUtils]: 22: Hoare triple {22471#(= (+ (* (- 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;main_~i2~0#1 := 0; {22471#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:07,031 INFO L290 TraceCheckUtils]: 23: Hoare triple {22471#(= (+ (* (- 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; {22471#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:07,032 INFO L290 TraceCheckUtils]: 24: Hoare triple {22471#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256; {22470#false} is VALID [2022-02-20 18:27:07,032 INFO L290 TraceCheckUtils]: 25: Hoare triple {22470#false} assume !(255 == ~r1~0 % 256); {22470#false} is VALID [2022-02-20 18:27:07,032 INFO L290 TraceCheckUtils]: 26: Hoare triple {22470#false} ~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {22470#false} is VALID [2022-02-20 18:27:07,032 INFO L290 TraceCheckUtils]: 27: Hoare triple {22470#false} assume !(node1_~m1~0#1 != ~nomsg~0); {22470#false} is VALID [2022-02-20 18:27:07,032 INFO L290 TraceCheckUtils]: 28: Hoare triple {22470#false} ~mode1~0 := 0; {22470#false} is VALID [2022-02-20 18:27:07,033 INFO L290 TraceCheckUtils]: 29: Hoare triple {22470#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {22470#false} is VALID [2022-02-20 18:27:07,033 INFO L290 TraceCheckUtils]: 30: Hoare triple {22470#false} assume !(0 != ~mode2~0 % 256); {22470#false} is VALID [2022-02-20 18:27:07,033 INFO L290 TraceCheckUtils]: 31: Hoare triple {22470#false} assume !(0 != ~alive2~0 % 256); {22470#false} is VALID [2022-02-20 18:27:07,033 INFO L290 TraceCheckUtils]: 32: Hoare triple {22470#false} assume !(~send2~0 != ~id2~0); {22470#false} is VALID [2022-02-20 18:27:07,033 INFO L290 TraceCheckUtils]: 33: Hoare triple {22470#false} ~mode2~0 := 1; {22470#false} is VALID [2022-02-20 18:27:07,033 INFO L290 TraceCheckUtils]: 34: Hoare triple {22470#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {22470#false} is VALID [2022-02-20 18:27:07,033 INFO L290 TraceCheckUtils]: 35: Hoare triple {22470#false} assume !(0 != ~mode3~0 % 256); {22470#false} is VALID [2022-02-20 18:27:07,034 INFO L290 TraceCheckUtils]: 36: Hoare triple {22470#false} assume !(0 != ~alive3~0 % 256); {22470#false} is VALID [2022-02-20 18:27:07,034 INFO L290 TraceCheckUtils]: 37: Hoare triple {22470#false} assume !(~send3~0 != ~id3~0); {22470#false} is VALID [2022-02-20 18:27:07,034 INFO L290 TraceCheckUtils]: 38: Hoare triple {22470#false} ~mode3~0 := 1; {22470#false} is VALID [2022-02-20 18:27:07,034 INFO L290 TraceCheckUtils]: 39: Hoare triple {22470#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {22470#false} is VALID [2022-02-20 18:27:07,034 INFO L290 TraceCheckUtils]: 40: Hoare triple {22470#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {22470#false} is VALID [2022-02-20 18:27:07,034 INFO L290 TraceCheckUtils]: 41: Hoare triple {22470#false} assume !(~r1~0 % 256 < 3); {22470#false} is VALID [2022-02-20 18:27:07,034 INFO L290 TraceCheckUtils]: 42: Hoare triple {22470#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0);check_~tmp~1#1 := 0; {22470#false} is VALID [2022-02-20 18:27:07,035 INFO L290 TraceCheckUtils]: 43: Hoare triple {22470#false} check_#res#1 := check_~tmp~1#1; {22470#false} is VALID [2022-02-20 18:27:07,035 INFO L290 TraceCheckUtils]: 44: Hoare triple {22470#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; {22470#false} is VALID [2022-02-20 18:27:07,035 INFO L290 TraceCheckUtils]: 45: Hoare triple {22470#false} assume 0 == assert_~arg#1 % 256; {22470#false} is VALID [2022-02-20 18:27:07,035 INFO L290 TraceCheckUtils]: 46: Hoare triple {22470#false} assume !false; {22470#false} is VALID [2022-02-20 18:27:07,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:27:07,036 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:07,036 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664995958] [2022-02-20 18:27:07,036 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664995958] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:07,036 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:07,036 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:27:07,036 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735557087] [2022-02-20 18:27:07,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:07,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2022-02-20 18:27:07,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:07,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:07,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:07,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:27:07,068 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:07,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:27:07,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:27:07,069 INFO L87 Difference]: Start difference. First operand 1481 states and 2108 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:08,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:08,687 INFO L93 Difference]: Finished difference Result 3000 states and 4298 transitions. [2022-02-20 18:27:08,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:27:08,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2022-02-20 18:27:08,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:08,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:08,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2022-02-20 18:27:08,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:08,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2022-02-20 18:27:08,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 245 transitions. [2022-02-20 18:27:08,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 245 edges. 245 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:09,006 INFO L225 Difference]: With dead ends: 3000 [2022-02-20 18:27:09,006 INFO L226 Difference]: Without dead ends: 2109 [2022-02-20 18:27:09,007 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:27:09,007 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 65 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:27:09,007 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 234 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:09,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2109 states. [2022-02-20 18:27:10,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2109 to 2107. [2022-02-20 18:27:10,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:10,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2109 states. Second operand has 2107 states, 2106 states have (on average 1.4064577397910731) internal successors, (2962), 2106 states have internal predecessors, (2962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:10,154 INFO L74 IsIncluded]: Start isIncluded. First operand 2109 states. Second operand has 2107 states, 2106 states have (on average 1.4064577397910731) internal successors, (2962), 2106 states have internal predecessors, (2962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:10,158 INFO L87 Difference]: Start difference. First operand 2109 states. Second operand has 2107 states, 2106 states have (on average 1.4064577397910731) internal successors, (2962), 2106 states have internal predecessors, (2962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:10,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:10,330 INFO L93 Difference]: Finished difference Result 2109 states and 2963 transitions. [2022-02-20 18:27:10,330 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 2963 transitions. [2022-02-20 18:27:10,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:10,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:10,337 INFO L74 IsIncluded]: Start isIncluded. First operand has 2107 states, 2106 states have (on average 1.4064577397910731) internal successors, (2962), 2106 states have internal predecessors, (2962), 0 states have call successors, (0), 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 2109 states. [2022-02-20 18:27:10,339 INFO L87 Difference]: Start difference. First operand has 2107 states, 2106 states have (on average 1.4064577397910731) internal successors, (2962), 2106 states have internal predecessors, (2962), 0 states have call successors, (0), 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 2109 states. [2022-02-20 18:27:10,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:10,496 INFO L93 Difference]: Finished difference Result 2109 states and 2963 transitions. [2022-02-20 18:27:10,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 2963 transitions. [2022-02-20 18:27:10,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:10,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:10,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:10,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:10,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2107 states, 2106 states have (on average 1.4064577397910731) internal successors, (2962), 2106 states have internal predecessors, (2962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:10,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2107 states to 2107 states and 2962 transitions. [2022-02-20 18:27:10,690 INFO L78 Accepts]: Start accepts. Automaton has 2107 states and 2962 transitions. Word has length 47 [2022-02-20 18:27:10,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:10,690 INFO L470 AbstractCegarLoop]: Abstraction has 2107 states and 2962 transitions. [2022-02-20 18:27:10,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:10,690 INFO L276 IsEmpty]: Start isEmpty. Operand 2107 states and 2962 transitions. [2022-02-20 18:27:10,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:27:10,691 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:10,692 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:27:10,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:27:10,692 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:10,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:10,693 INFO L85 PathProgramCache]: Analyzing trace with hash 876819086, now seen corresponding path program 1 times [2022-02-20 18:27:10,693 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:10,693 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84073831] [2022-02-20 18:27:10,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:10,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:10,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {32739#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; {32739#true} is VALID [2022-02-20 18:27:10,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {32739#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~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~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive3~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; {32739#true} is VALID [2022-02-20 18:27:10,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {32739#true} assume 0 == ~r1~0 % 256; {32739#true} is VALID [2022-02-20 18:27:10,771 INFO L290 TraceCheckUtils]: 3: Hoare triple {32739#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {32739#true} is VALID [2022-02-20 18:27:10,771 INFO L290 TraceCheckUtils]: 4: Hoare triple {32739#true} assume ~id1~0 >= 0; {32739#true} is VALID [2022-02-20 18:27:10,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {32739#true} assume 0 == ~st1~0; {32741#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:10,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {32741#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {32741#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:10,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {32741#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {32741#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:10,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {32741#(<= ~st1~0 0)} assume ~id2~0 >= 0; {32741#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:10,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {32741#(<= ~st1~0 0)} assume 0 == ~st2~0; {32741#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:10,773 INFO L290 TraceCheckUtils]: 10: Hoare triple {32741#(<= ~st1~0 0)} assume ~send2~0 == ~id2~0; {32741#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:10,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {32741#(<= ~st1~0 0)} assume 0 == ~mode2~0 % 256; {32741#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:10,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {32741#(<= ~st1~0 0)} assume ~id3~0 >= 0; {32741#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:10,775 INFO L290 TraceCheckUtils]: 13: Hoare triple {32741#(<= ~st1~0 0)} assume 0 == ~st3~0; {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,775 INFO L290 TraceCheckUtils]: 14: Hoare triple {32742#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {32742#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,776 INFO L290 TraceCheckUtils]: 16: Hoare triple {32742#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,776 INFO L290 TraceCheckUtils]: 17: Hoare triple {32742#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,776 INFO L290 TraceCheckUtils]: 18: Hoare triple {32742#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {32742#(<= (+ ~st3~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,777 INFO L290 TraceCheckUtils]: 20: Hoare triple {32742#(<= (+ ~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; {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,777 INFO L290 TraceCheckUtils]: 21: Hoare triple {32742#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,778 INFO L290 TraceCheckUtils]: 22: Hoare triple {32742#(<= (+ ~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;main_~i2~0#1 := 0; {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,778 INFO L290 TraceCheckUtils]: 23: Hoare triple {32742#(<= (+ ~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; {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,778 INFO L290 TraceCheckUtils]: 24: Hoare triple {32742#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,779 INFO L290 TraceCheckUtils]: 25: Hoare triple {32742#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 != ~alive1~0 % 256); {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,779 INFO L290 TraceCheckUtils]: 26: Hoare triple {32742#(<= (+ ~st3~0 ~st1~0) 0)} ~mode1~0 := 1; {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,780 INFO L290 TraceCheckUtils]: 27: Hoare triple {32742#(<= (+ ~st3~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,780 INFO L290 TraceCheckUtils]: 28: Hoare triple {32742#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,780 INFO L290 TraceCheckUtils]: 29: Hoare triple {32742#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 != ~alive2~0 % 256; {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,781 INFO L290 TraceCheckUtils]: 30: Hoare triple {32742#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,781 INFO L290 TraceCheckUtils]: 31: Hoare triple {32742#(<= (+ ~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; {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,781 INFO L290 TraceCheckUtils]: 32: Hoare triple {32742#(<= (+ ~st3~0 ~st1~0) 0)} ~mode2~0 := 1; {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,782 INFO L290 TraceCheckUtils]: 33: Hoare triple {32742#(<= (+ ~st3~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,782 INFO L290 TraceCheckUtils]: 34: Hoare triple {32742#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,782 INFO L290 TraceCheckUtils]: 35: Hoare triple {32742#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 != ~alive3~0 % 256); {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,783 INFO L290 TraceCheckUtils]: 36: Hoare triple {32742#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,783 INFO L290 TraceCheckUtils]: 37: Hoare triple {32742#(<= (+ ~st3~0 ~st1~0) 0)} ~mode3~0 := 1; {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,783 INFO L290 TraceCheckUtils]: 38: Hoare triple {32742#(<= (+ ~st3~0 ~st1~0) 0)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,784 INFO L290 TraceCheckUtils]: 39: Hoare triple {32742#(<= (+ ~st3~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,784 INFO L290 TraceCheckUtils]: 40: Hoare triple {32742#(<= (+ ~st3~0 ~st1~0) 0)} assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,784 INFO L290 TraceCheckUtils]: 41: Hoare triple {32742#(<= (+ ~st3~0 ~st1~0) 0)} check_#res#1 := check_~tmp~1#1; {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,785 INFO L290 TraceCheckUtils]: 42: Hoare triple {32742#(<= (+ ~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; {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,785 INFO L290 TraceCheckUtils]: 43: Hoare triple {32742#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == assert_~arg#1 % 256); {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,785 INFO L290 TraceCheckUtils]: 44: Hoare triple {32742#(<= (+ ~st3~0 ~st1~0) 0)} assume { :end_inline_assert } true; {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,786 INFO L290 TraceCheckUtils]: 45: Hoare triple {32742#(<= (+ ~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; {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,786 INFO L290 TraceCheckUtils]: 46: Hoare triple {32742#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,786 INFO L290 TraceCheckUtils]: 47: Hoare triple {32742#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 != ~alive1~0 % 256); {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,787 INFO L290 TraceCheckUtils]: 48: Hoare triple {32742#(<= (+ ~st3~0 ~st1~0) 0)} ~mode1~0 := 1; {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,787 INFO L290 TraceCheckUtils]: 49: Hoare triple {32742#(<= (+ ~st3~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,787 INFO L290 TraceCheckUtils]: 50: Hoare triple {32742#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,788 INFO L290 TraceCheckUtils]: 51: Hoare triple {32742#(<= (+ ~st3~0 ~st1~0) 0)} assume node2_~m2~0#1 != ~nomsg~0; {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,788 INFO L290 TraceCheckUtils]: 52: Hoare triple {32742#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 != ~alive2~0 % 256; {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,788 INFO L290 TraceCheckUtils]: 53: Hoare triple {32742#(<= (+ ~st3~0 ~st1~0) 0)} assume !(node2_~m2~0#1 > ~id2~0); {32742#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:10,789 INFO L290 TraceCheckUtils]: 54: Hoare triple {32742#(<= (+ ~st3~0 ~st1~0) 0)} assume node2_~m2~0#1 == ~id2~0;~st2~0 := 1; {32743#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:27:10,789 INFO L290 TraceCheckUtils]: 55: Hoare triple {32743#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode2~0 := 0; {32743#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:27:10,790 INFO L290 TraceCheckUtils]: 56: Hoare triple {32743#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {32743#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:27:10,790 INFO L290 TraceCheckUtils]: 57: Hoare triple {32743#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {32743#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:27:10,791 INFO L290 TraceCheckUtils]: 58: Hoare triple {32743#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(node3_~m3~0#1 != ~nomsg~0); {32743#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:27:10,791 INFO L290 TraceCheckUtils]: 59: Hoare triple {32743#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode3~0 := 0; {32743#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:27:10,792 INFO L290 TraceCheckUtils]: 60: Hoare triple {32743#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {32743#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:27:10,792 INFO L290 TraceCheckUtils]: 61: Hoare triple {32743#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {32740#false} is VALID [2022-02-20 18:27:10,792 INFO L290 TraceCheckUtils]: 62: Hoare triple {32740#false} check_#res#1 := check_~tmp~1#1; {32740#false} is VALID [2022-02-20 18:27:10,792 INFO L290 TraceCheckUtils]: 63: Hoare triple {32740#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; {32740#false} is VALID [2022-02-20 18:27:10,792 INFO L290 TraceCheckUtils]: 64: Hoare triple {32740#false} assume 0 == assert_~arg#1 % 256; {32740#false} is VALID [2022-02-20 18:27:10,792 INFO L290 TraceCheckUtils]: 65: Hoare triple {32740#false} assume !false; {32740#false} is VALID [2022-02-20 18:27:10,793 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:27:10,793 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:10,793 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84073831] [2022-02-20 18:27:10,793 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84073831] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:10,793 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:10,794 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:27:10,794 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708865166] [2022-02-20 18:27:10,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:10,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:27:10,795 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:10,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:10,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:10,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:27:10,841 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:10,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:27:10,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:27:10,841 INFO L87 Difference]: Start difference. First operand 2107 states and 2962 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:13,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:13,273 INFO L93 Difference]: Finished difference Result 3749 states and 5326 transitions. [2022-02-20 18:27:13,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:27:13,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:27:13,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:13,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:13,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 414 transitions. [2022-02-20 18:27:13,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:13,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 414 transitions. [2022-02-20 18:27:13,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 414 transitions. [2022-02-20 18:27:13,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 414 edges. 414 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:13,851 INFO L225 Difference]: With dead ends: 3749 [2022-02-20 18:27:13,851 INFO L226 Difference]: Without dead ends: 2991 [2022-02-20 18:27:13,852 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:27:13,853 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 278 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:27:13,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 473 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:13,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2991 states. [2022-02-20 18:27:15,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2991 to 2721. [2022-02-20 18:27:15,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:15,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2991 states. Second operand has 2721 states, 2720 states have (on average 1.4073529411764707) internal successors, (3828), 2720 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:15,396 INFO L74 IsIncluded]: Start isIncluded. First operand 2991 states. Second operand has 2721 states, 2720 states have (on average 1.4073529411764707) internal successors, (3828), 2720 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:15,398 INFO L87 Difference]: Start difference. First operand 2991 states. Second operand has 2721 states, 2720 states have (on average 1.4073529411764707) internal successors, (3828), 2720 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:15,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:15,694 INFO L93 Difference]: Finished difference Result 2991 states and 4215 transitions. [2022-02-20 18:27:15,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2991 states and 4215 transitions. [2022-02-20 18:27:15,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:15,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:15,700 INFO L74 IsIncluded]: Start isIncluded. First operand has 2721 states, 2720 states have (on average 1.4073529411764707) internal successors, (3828), 2720 states have internal predecessors, (3828), 0 states have call successors, (0), 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 2991 states. [2022-02-20 18:27:15,703 INFO L87 Difference]: Start difference. First operand has 2721 states, 2720 states have (on average 1.4073529411764707) internal successors, (3828), 2720 states have internal predecessors, (3828), 0 states have call successors, (0), 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 2991 states. [2022-02-20 18:27:16,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:16,031 INFO L93 Difference]: Finished difference Result 2991 states and 4215 transitions. [2022-02-20 18:27:16,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2991 states and 4215 transitions. [2022-02-20 18:27:16,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:16,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:16,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:16,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:16,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2721 states, 2720 states have (on average 1.4073529411764707) internal successors, (3828), 2720 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:16,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2721 states to 2721 states and 3828 transitions. [2022-02-20 18:27:16,310 INFO L78 Accepts]: Start accepts. Automaton has 2721 states and 3828 transitions. Word has length 66 [2022-02-20 18:27:16,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:16,310 INFO L470 AbstractCegarLoop]: Abstraction has 2721 states and 3828 transitions. [2022-02-20 18:27:16,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:16,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2721 states and 3828 transitions. [2022-02-20 18:27:16,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:27:16,311 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:16,312 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:27:16,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:27:16,312 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:16,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:16,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1304165150, now seen corresponding path program 1 times [2022-02-20 18:27:16,312 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:16,312 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552368599] [2022-02-20 18:27:16,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:16,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:16,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {46415#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; {46415#true} is VALID [2022-02-20 18:27:16,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {46415#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~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~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive3~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; {46415#true} is VALID [2022-02-20 18:27:16,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {46415#true} assume 0 == ~r1~0 % 256; {46415#true} is VALID [2022-02-20 18:27:16,393 INFO L290 TraceCheckUtils]: 3: Hoare triple {46415#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {46415#true} is VALID [2022-02-20 18:27:16,393 INFO L290 TraceCheckUtils]: 4: Hoare triple {46415#true} assume ~id1~0 >= 0; {46415#true} is VALID [2022-02-20 18:27:16,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {46415#true} assume 0 == ~st1~0; {46415#true} is VALID [2022-02-20 18:27:16,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {46415#true} assume ~send1~0 == ~id1~0; {46415#true} is VALID [2022-02-20 18:27:16,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {46415#true} assume 0 == ~mode1~0 % 256; {46415#true} is VALID [2022-02-20 18:27:16,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {46415#true} assume ~id2~0 >= 0; {46415#true} is VALID [2022-02-20 18:27:16,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {46415#true} assume 0 == ~st2~0; {46415#true} is VALID [2022-02-20 18:27:16,394 INFO L290 TraceCheckUtils]: 10: Hoare triple {46415#true} assume ~send2~0 == ~id2~0; {46415#true} is VALID [2022-02-20 18:27:16,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {46415#true} assume 0 == ~mode2~0 % 256; {46415#true} is VALID [2022-02-20 18:27:16,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {46415#true} assume ~id3~0 >= 0; {46415#true} is VALID [2022-02-20 18:27:16,394 INFO L290 TraceCheckUtils]: 13: Hoare triple {46415#true} assume 0 == ~st3~0; {46415#true} is VALID [2022-02-20 18:27:16,394 INFO L290 TraceCheckUtils]: 14: Hoare triple {46415#true} assume ~send3~0 == ~id3~0; {46415#true} is VALID [2022-02-20 18:27:16,394 INFO L290 TraceCheckUtils]: 15: Hoare triple {46415#true} assume 0 == ~mode3~0 % 256; {46415#true} is VALID [2022-02-20 18:27:16,394 INFO L290 TraceCheckUtils]: 16: Hoare triple {46415#true} assume ~id1~0 != ~id2~0; {46415#true} is VALID [2022-02-20 18:27:16,395 INFO L290 TraceCheckUtils]: 17: Hoare triple {46415#true} assume ~id1~0 != ~id3~0; {46415#true} is VALID [2022-02-20 18:27:16,395 INFO L290 TraceCheckUtils]: 18: Hoare triple {46415#true} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {46415#true} is VALID [2022-02-20 18:27:16,395 INFO L290 TraceCheckUtils]: 19: Hoare triple {46415#true} init_#res#1 := init_~tmp~0#1; {46415#true} is VALID [2022-02-20 18:27:16,395 INFO L290 TraceCheckUtils]: 20: Hoare triple {46415#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; {46415#true} is VALID [2022-02-20 18:27:16,395 INFO L290 TraceCheckUtils]: 21: Hoare triple {46415#true} assume !(0 == assume_abort_if_not_~cond#1); {46415#true} is VALID [2022-02-20 18:27:16,395 INFO L290 TraceCheckUtils]: 22: Hoare triple {46415#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;main_~i2~0#1 := 0; {46415#true} is VALID [2022-02-20 18:27:16,395 INFO L290 TraceCheckUtils]: 23: Hoare triple {46415#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; {46415#true} is VALID [2022-02-20 18:27:16,395 INFO L290 TraceCheckUtils]: 24: Hoare triple {46415#true} assume !(0 != ~mode1~0 % 256); {46415#true} is VALID [2022-02-20 18:27:16,396 INFO L290 TraceCheckUtils]: 25: Hoare triple {46415#true} assume !(0 != ~alive1~0 % 256); {46415#true} is VALID [2022-02-20 18:27:16,396 INFO L290 TraceCheckUtils]: 26: Hoare triple {46415#true} ~mode1~0 := 1; {46415#true} is VALID [2022-02-20 18:27:16,396 INFO L290 TraceCheckUtils]: 27: Hoare triple {46415#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {46415#true} is VALID [2022-02-20 18:27:16,396 INFO L290 TraceCheckUtils]: 28: Hoare triple {46415#true} assume !(0 != ~mode2~0 % 256); {46415#true} is VALID [2022-02-20 18:27:16,396 INFO L290 TraceCheckUtils]: 29: Hoare triple {46415#true} assume 0 != ~alive2~0 % 256; {46415#true} is VALID [2022-02-20 18:27:16,396 INFO L290 TraceCheckUtils]: 30: Hoare triple {46415#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {46415#true} is VALID [2022-02-20 18:27:16,396 INFO L290 TraceCheckUtils]: 31: Hoare triple {46415#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; {46415#true} is VALID [2022-02-20 18:27:16,397 INFO L290 TraceCheckUtils]: 32: Hoare triple {46415#true} ~mode2~0 := 1; {46415#true} is VALID [2022-02-20 18:27:16,397 INFO L290 TraceCheckUtils]: 33: Hoare triple {46415#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {46415#true} is VALID [2022-02-20 18:27:16,397 INFO L290 TraceCheckUtils]: 34: Hoare triple {46415#true} assume !(0 != ~mode3~0 % 256); {46415#true} is VALID [2022-02-20 18:27:16,397 INFO L290 TraceCheckUtils]: 35: Hoare triple {46415#true} assume !(0 != ~alive3~0 % 256); {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:27:16,398 INFO L290 TraceCheckUtils]: 36: Hoare triple {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(~send3~0 != ~id3~0); {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:27:16,398 INFO L290 TraceCheckUtils]: 37: Hoare triple {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} ~mode3~0 := 1; {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:27:16,399 INFO L290 TraceCheckUtils]: 38: Hoare triple {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:27:16,399 INFO L290 TraceCheckUtils]: 39: Hoare triple {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:27:16,400 INFO L290 TraceCheckUtils]: 40: Hoare triple {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:27:16,400 INFO L290 TraceCheckUtils]: 41: Hoare triple {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} check_#res#1 := check_~tmp~1#1; {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:27:16,400 INFO L290 TraceCheckUtils]: 42: Hoare triple {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~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; {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:27:16,401 INFO L290 TraceCheckUtils]: 43: Hoare triple {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == assert_~arg#1 % 256); {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:27:16,401 INFO L290 TraceCheckUtils]: 44: Hoare triple {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume { :end_inline_assert } true; {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:27:16,402 INFO L290 TraceCheckUtils]: 45: Hoare triple {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~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; {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:27:16,402 INFO L290 TraceCheckUtils]: 46: Hoare triple {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 != ~mode1~0 % 256); {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:27:16,403 INFO L290 TraceCheckUtils]: 47: Hoare triple {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 != ~alive1~0 % 256); {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:27:16,403 INFO L290 TraceCheckUtils]: 48: Hoare triple {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} ~mode1~0 := 1; {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:27:16,403 INFO L290 TraceCheckUtils]: 49: Hoare triple {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:27:16,404 INFO L290 TraceCheckUtils]: 50: Hoare triple {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:27:16,404 INFO L290 TraceCheckUtils]: 51: Hoare triple {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(node2_~m2~0#1 != ~nomsg~0); {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:27:16,405 INFO L290 TraceCheckUtils]: 52: Hoare triple {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} ~mode2~0 := 0; {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:27:16,405 INFO L290 TraceCheckUtils]: 53: Hoare triple {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:27:16,407 INFO L290 TraceCheckUtils]: 54: Hoare triple {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:27:16,407 INFO L290 TraceCheckUtils]: 55: Hoare triple {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume node3_~m3~0#1 != ~nomsg~0; {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:27:16,408 INFO L290 TraceCheckUtils]: 56: Hoare triple {46417#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume 0 != ~alive3~0 % 256; {46416#false} is VALID [2022-02-20 18:27:16,408 INFO L290 TraceCheckUtils]: 57: Hoare triple {46416#false} assume !(node3_~m3~0#1 > ~id3~0); {46416#false} is VALID [2022-02-20 18:27:16,408 INFO L290 TraceCheckUtils]: 58: Hoare triple {46416#false} assume node3_~m3~0#1 == ~id3~0;~st3~0 := 1; {46416#false} is VALID [2022-02-20 18:27:16,408 INFO L290 TraceCheckUtils]: 59: Hoare triple {46416#false} ~mode3~0 := 0; {46416#false} is VALID [2022-02-20 18:27:16,408 INFO L290 TraceCheckUtils]: 60: Hoare triple {46416#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {46416#false} is VALID [2022-02-20 18:27:16,408 INFO L290 TraceCheckUtils]: 61: Hoare triple {46416#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {46416#false} is VALID [2022-02-20 18:27:16,409 INFO L290 TraceCheckUtils]: 62: Hoare triple {46416#false} check_#res#1 := check_~tmp~1#1; {46416#false} is VALID [2022-02-20 18:27:16,409 INFO L290 TraceCheckUtils]: 63: Hoare triple {46416#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; {46416#false} is VALID [2022-02-20 18:27:16,409 INFO L290 TraceCheckUtils]: 64: Hoare triple {46416#false} assume 0 == assert_~arg#1 % 256; {46416#false} is VALID [2022-02-20 18:27:16,409 INFO L290 TraceCheckUtils]: 65: Hoare triple {46416#false} assume !false; {46416#false} is VALID [2022-02-20 18:27:16,409 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:27:16,409 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:16,410 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552368599] [2022-02-20 18:27:16,410 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552368599] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:16,410 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:16,410 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:27:16,410 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210439394] [2022-02-20 18:27:16,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:16,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:27:16,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:16,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:16,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:16,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:27:16,454 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:16,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:27:16,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:27:16,454 INFO L87 Difference]: Start difference. First operand 2721 states and 3828 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:19,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:19,023 INFO L93 Difference]: Finished difference Result 4469 states and 6263 transitions. [2022-02-20 18:27:19,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:27:19,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:27:19,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:19,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:19,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 243 transitions. [2022-02-20 18:27:19,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:19,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 243 transitions. [2022-02-20 18:27:19,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 243 transitions. [2022-02-20 18:27:19,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:19,475 INFO L225 Difference]: With dead ends: 4469 [2022-02-20 18:27:19,475 INFO L226 Difference]: Without dead ends: 2909 [2022-02-20 18:27:19,476 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:27:19,477 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 50 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:27:19,477 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 219 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:19,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2909 states. [2022-02-20 18:27:21,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2909 to 2772. [2022-02-20 18:27:21,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:21,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2909 states. Second operand has 2772 states, 2771 states have (on average 1.3789245759653554) internal successors, (3821), 2771 states have internal predecessors, (3821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:21,008 INFO L74 IsIncluded]: Start isIncluded. First operand 2909 states. Second operand has 2772 states, 2771 states have (on average 1.3789245759653554) internal successors, (3821), 2771 states have internal predecessors, (3821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:21,009 INFO L87 Difference]: Start difference. First operand 2909 states. Second operand has 2772 states, 2771 states have (on average 1.3789245759653554) internal successors, (3821), 2771 states have internal predecessors, (3821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:21,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:21,248 INFO L93 Difference]: Finished difference Result 2909 states and 3968 transitions. [2022-02-20 18:27:21,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2909 states and 3968 transitions. [2022-02-20 18:27:21,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:21,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:21,253 INFO L74 IsIncluded]: Start isIncluded. First operand has 2772 states, 2771 states have (on average 1.3789245759653554) internal successors, (3821), 2771 states have internal predecessors, (3821), 0 states have call successors, (0), 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 2909 states. [2022-02-20 18:27:21,255 INFO L87 Difference]: Start difference. First operand has 2772 states, 2771 states have (on average 1.3789245759653554) internal successors, (3821), 2771 states have internal predecessors, (3821), 0 states have call successors, (0), 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 2909 states. [2022-02-20 18:27:21,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:21,495 INFO L93 Difference]: Finished difference Result 2909 states and 3968 transitions. [2022-02-20 18:27:21,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2909 states and 3968 transitions. [2022-02-20 18:27:21,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:21,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:21,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:21,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:21,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2772 states, 2771 states have (on average 1.3789245759653554) internal successors, (3821), 2771 states have internal predecessors, (3821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:21,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2772 states to 2772 states and 3821 transitions. [2022-02-20 18:27:21,765 INFO L78 Accepts]: Start accepts. Automaton has 2772 states and 3821 transitions. Word has length 66 [2022-02-20 18:27:21,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:21,765 INFO L470 AbstractCegarLoop]: Abstraction has 2772 states and 3821 transitions. [2022-02-20 18:27:21,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:21,765 INFO L276 IsEmpty]: Start isEmpty. Operand 2772 states and 3821 transitions. [2022-02-20 18:27:21,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:27:21,766 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:21,767 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:27:21,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:27:21,767 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:21,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:21,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1558535868, now seen corresponding path program 1 times [2022-02-20 18:27:21,767 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:21,768 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190428957] [2022-02-20 18:27:21,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:21,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:21,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {60828#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; {60828#true} is VALID [2022-02-20 18:27:21,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {60828#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~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~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive3~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; {60828#true} is VALID [2022-02-20 18:27:21,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {60828#true} assume 0 == ~r1~0 % 256; {60828#true} is VALID [2022-02-20 18:27:21,835 INFO L290 TraceCheckUtils]: 3: Hoare triple {60828#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {60828#true} is VALID [2022-02-20 18:27:21,835 INFO L290 TraceCheckUtils]: 4: Hoare triple {60828#true} assume ~id1~0 >= 0; {60828#true} is VALID [2022-02-20 18:27:21,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {60828#true} assume 0 == ~st1~0; {60830#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:21,836 INFO L290 TraceCheckUtils]: 6: Hoare triple {60830#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {60830#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:21,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {60830#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {60830#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:21,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {60830#(<= ~st1~0 0)} assume ~id2~0 >= 0; {60830#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:21,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {60830#(<= ~st1~0 0)} assume 0 == ~st2~0; {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,837 INFO L290 TraceCheckUtils]: 10: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,837 INFO L290 TraceCheckUtils]: 11: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,837 INFO L290 TraceCheckUtils]: 12: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,838 INFO L290 TraceCheckUtils]: 14: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,838 INFO L290 TraceCheckUtils]: 15: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,839 INFO L290 TraceCheckUtils]: 16: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,839 INFO L290 TraceCheckUtils]: 17: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,839 INFO L290 TraceCheckUtils]: 18: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,840 INFO L290 TraceCheckUtils]: 19: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,840 INFO L290 TraceCheckUtils]: 20: Hoare triple {60831#(<= (+ ~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; {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,840 INFO L290 TraceCheckUtils]: 21: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,841 INFO L290 TraceCheckUtils]: 22: Hoare triple {60831#(<= (+ ~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;main_~i2~0#1 := 0; {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,841 INFO L290 TraceCheckUtils]: 23: Hoare triple {60831#(<= (+ ~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; {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,841 INFO L290 TraceCheckUtils]: 24: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,842 INFO L290 TraceCheckUtils]: 25: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~alive1~0 % 256); {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,842 INFO L290 TraceCheckUtils]: 26: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,842 INFO L290 TraceCheckUtils]: 27: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,843 INFO L290 TraceCheckUtils]: 28: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,843 INFO L290 TraceCheckUtils]: 29: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~alive2~0 % 256); {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,843 INFO L290 TraceCheckUtils]: 30: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,844 INFO L290 TraceCheckUtils]: 31: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,844 INFO L290 TraceCheckUtils]: 32: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,844 INFO L290 TraceCheckUtils]: 33: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,845 INFO L290 TraceCheckUtils]: 34: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 != ~alive3~0 % 256; {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,845 INFO L290 TraceCheckUtils]: 35: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,845 INFO L290 TraceCheckUtils]: 36: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1; {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,846 INFO L290 TraceCheckUtils]: 37: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,846 INFO L290 TraceCheckUtils]: 38: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,846 INFO L290 TraceCheckUtils]: 39: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,846 INFO L290 TraceCheckUtils]: 40: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,847 INFO L290 TraceCheckUtils]: 41: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} check_#res#1 := check_~tmp~1#1; {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,847 INFO L290 TraceCheckUtils]: 42: Hoare triple {60831#(<= (+ ~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; {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,847 INFO L290 TraceCheckUtils]: 43: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == assert_~arg#1 % 256); {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,848 INFO L290 TraceCheckUtils]: 44: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} assume { :end_inline_assert } true; {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,848 INFO L290 TraceCheckUtils]: 45: Hoare triple {60831#(<= (+ ~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; {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,848 INFO L290 TraceCheckUtils]: 46: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,849 INFO L290 TraceCheckUtils]: 47: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~alive1~0 % 256); {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,849 INFO L290 TraceCheckUtils]: 48: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,849 INFO L290 TraceCheckUtils]: 49: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,850 INFO L290 TraceCheckUtils]: 50: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,850 INFO L290 TraceCheckUtils]: 51: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} assume !(node2_~m2~0#1 != ~nomsg~0); {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,850 INFO L290 TraceCheckUtils]: 52: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} ~mode2~0 := 0; {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,851 INFO L290 TraceCheckUtils]: 53: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,851 INFO L290 TraceCheckUtils]: 54: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,851 INFO L290 TraceCheckUtils]: 55: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} assume node3_~m3~0#1 != ~nomsg~0; {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,852 INFO L290 TraceCheckUtils]: 56: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 != ~alive3~0 % 256; {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,852 INFO L290 TraceCheckUtils]: 57: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} assume !(node3_~m3~0#1 > ~id3~0); {60831#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,852 INFO L290 TraceCheckUtils]: 58: Hoare triple {60831#(<= (+ ~st2~0 ~st1~0) 0)} assume node3_~m3~0#1 == ~id3~0;~st3~0 := 1; {60832#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:27:21,853 INFO L290 TraceCheckUtils]: 59: Hoare triple {60832#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} ~mode3~0 := 0; {60832#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:27:21,853 INFO L290 TraceCheckUtils]: 60: Hoare triple {60832#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {60832#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:27:21,854 INFO L290 TraceCheckUtils]: 61: Hoare triple {60832#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {60829#false} is VALID [2022-02-20 18:27:21,854 INFO L290 TraceCheckUtils]: 62: Hoare triple {60829#false} check_#res#1 := check_~tmp~1#1; {60829#false} is VALID [2022-02-20 18:27:21,854 INFO L290 TraceCheckUtils]: 63: Hoare triple {60829#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; {60829#false} is VALID [2022-02-20 18:27:21,854 INFO L290 TraceCheckUtils]: 64: Hoare triple {60829#false} assume 0 == assert_~arg#1 % 256; {60829#false} is VALID [2022-02-20 18:27:21,854 INFO L290 TraceCheckUtils]: 65: Hoare triple {60829#false} assume !false; {60829#false} is VALID [2022-02-20 18:27:21,854 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:27:21,855 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:21,855 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190428957] [2022-02-20 18:27:21,855 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190428957] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:21,855 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:21,855 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:27:21,855 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511612682] [2022-02-20 18:27:21,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:21,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:27:21,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:21,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:21,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:21,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:27:21,894 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:21,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:27:21,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:27:21,895 INFO L87 Difference]: Start difference. First operand 2772 states and 3821 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:24,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:24,503 INFO L93 Difference]: Finished difference Result 3833 states and 5332 transitions. [2022-02-20 18:27:24,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:27:24,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:27:24,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:24,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:24,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 407 transitions. [2022-02-20 18:27:24,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:24,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 407 transitions. [2022-02-20 18:27:24,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 407 transitions. [2022-02-20 18:27:24,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 407 edges. 407 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:25,140 INFO L225 Difference]: With dead ends: 3833 [2022-02-20 18:27:25,140 INFO L226 Difference]: Without dead ends: 3441 [2022-02-20 18:27:25,140 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:27:25,141 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 285 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:27:25,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [285 Valid, 439 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:25,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3441 states. [2022-02-20 18:27:26,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3441 to 3150. [2022-02-20 18:27:26,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:26,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3441 states. Second operand has 3150 states, 3149 states have (on average 1.3817084788821847) internal successors, (4351), 3149 states have internal predecessors, (4351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:26,826 INFO L74 IsIncluded]: Start isIncluded. First operand 3441 states. Second operand has 3150 states, 3149 states have (on average 1.3817084788821847) internal successors, (4351), 3149 states have internal predecessors, (4351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:26,828 INFO L87 Difference]: Start difference. First operand 3441 states. Second operand has 3150 states, 3149 states have (on average 1.3817084788821847) internal successors, (4351), 3149 states have internal predecessors, (4351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:27,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:27,191 INFO L93 Difference]: Finished difference Result 3441 states and 4761 transitions. [2022-02-20 18:27:27,192 INFO L276 IsEmpty]: Start isEmpty. Operand 3441 states and 4761 transitions. [2022-02-20 18:27:27,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:27,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:27,215 INFO L74 IsIncluded]: Start isIncluded. First operand has 3150 states, 3149 states have (on average 1.3817084788821847) internal successors, (4351), 3149 states have internal predecessors, (4351), 0 states have call successors, (0), 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 3441 states. [2022-02-20 18:27:27,218 INFO L87 Difference]: Start difference. First operand has 3150 states, 3149 states have (on average 1.3817084788821847) internal successors, (4351), 3149 states have internal predecessors, (4351), 0 states have call successors, (0), 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 3441 states. [2022-02-20 18:27:27,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:27,615 INFO L93 Difference]: Finished difference Result 3441 states and 4761 transitions. [2022-02-20 18:27:27,615 INFO L276 IsEmpty]: Start isEmpty. Operand 3441 states and 4761 transitions. [2022-02-20 18:27:27,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:27,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:27,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:27,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:27,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3150 states, 3149 states have (on average 1.3817084788821847) internal successors, (4351), 3149 states have internal predecessors, (4351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:28,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3150 states to 3150 states and 4351 transitions. [2022-02-20 18:27:28,003 INFO L78 Accepts]: Start accepts. Automaton has 3150 states and 4351 transitions. Word has length 66 [2022-02-20 18:27:28,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:28,003 INFO L470 AbstractCegarLoop]: Abstraction has 3150 states and 4351 transitions. [2022-02-20 18:27:28,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:28,004 INFO L276 IsEmpty]: Start isEmpty. Operand 3150 states and 4351 transitions. [2022-02-20 18:27:28,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:27:28,005 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:28,005 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] [2022-02-20 18:27:28,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:27:28,005 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:28,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:28,006 INFO L85 PathProgramCache]: Analyzing trace with hash -333777212, now seen corresponding path program 1 times [2022-02-20 18:27:28,006 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:28,006 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246952093] [2022-02-20 18:27:28,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:28,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:28,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:28,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {76003#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; {76005#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:27:28,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {76005#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~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~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive3~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; {76006#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:27:28,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {76006#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~r1~0 % 256; {76006#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:27:28,207 INFO L290 TraceCheckUtils]: 3: Hoare triple {76006#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {76006#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:27:28,208 INFO L290 TraceCheckUtils]: 4: Hoare triple {76006#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id1~0 >= 0; {76006#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:27:28,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {76006#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~st1~0; {76006#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:27:28,208 INFO L290 TraceCheckUtils]: 6: Hoare triple {76006#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~send1~0 == ~id1~0; {76006#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:27:28,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {76006#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~mode1~0 % 256; {76006#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:27:28,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {76006#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id2~0 >= 0; {76007#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:27:28,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {76007#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} assume 0 == ~st2~0; {76007#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:27:28,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {76007#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} assume ~send2~0 == ~id2~0; {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:27:28,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:27:28,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:27:28,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:27:28,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:27:28,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:27:28,212 INFO L290 TraceCheckUtils]: 16: Hoare triple {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:27:28,212 INFO L290 TraceCheckUtils]: 17: Hoare triple {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:27:28,213 INFO L290 TraceCheckUtils]: 18: Hoare triple {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:27:28,213 INFO L290 TraceCheckUtils]: 19: Hoare triple {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} init_#res#1 := init_~tmp~0#1; {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:27:28,213 INFO L290 TraceCheckUtils]: 20: Hoare triple {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 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; {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:27:28,214 INFO L290 TraceCheckUtils]: 21: Hoare triple {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !(0 == assume_abort_if_not_~cond#1); {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:27:28,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 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;main_~i2~0#1 := 0; {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:27:28,215 INFO L290 TraceCheckUtils]: 23: Hoare triple {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 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; {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:27:28,215 INFO L290 TraceCheckUtils]: 24: Hoare triple {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !(0 != ~mode1~0 % 256); {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:27:28,215 INFO L290 TraceCheckUtils]: 25: Hoare triple {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !(0 != ~alive1~0 % 256); {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:27:28,216 INFO L290 TraceCheckUtils]: 26: Hoare triple {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} ~mode1~0 := 1; {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:27:28,216 INFO L290 TraceCheckUtils]: 27: Hoare triple {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:27:28,217 INFO L290 TraceCheckUtils]: 28: Hoare triple {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !(0 != ~mode2~0 % 256); {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:27:28,217 INFO L290 TraceCheckUtils]: 29: Hoare triple {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 != ~alive2~0 % 256; {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:27:28,218 INFO L290 TraceCheckUtils]: 30: Hoare triple {76008#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {76009#(and (< 0 (+ 1 (div |ULTIMATE.start_node2_#t~ite5#1| 256))) (<= |ULTIMATE.start_node2_#t~ite5#1| 127) (not (= |ULTIMATE.start_node2_#t~ite5#1| (+ ~nomsg~0 (* 256 (div |ULTIMATE.start_node2_#t~ite5#1| 256))))))} is VALID [2022-02-20 18:27:28,218 INFO L290 TraceCheckUtils]: 31: Hoare triple {76009#(and (< 0 (+ 1 (div |ULTIMATE.start_node2_#t~ite5#1| 256))) (<= |ULTIMATE.start_node2_#t~ite5#1| 127) (not (= |ULTIMATE.start_node2_#t~ite5#1| (+ ~nomsg~0 (* 256 (div |ULTIMATE.start_node2_#t~ite5#1| 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; {76010#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:27:28,219 INFO L290 TraceCheckUtils]: 32: Hoare triple {76010#(not (= ~nomsg~0 ~p2_new~0))} ~mode2~0 := 1; {76010#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:27:28,219 INFO L290 TraceCheckUtils]: 33: Hoare triple {76010#(not (= ~nomsg~0 ~p2_new~0))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {76010#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:27:28,219 INFO L290 TraceCheckUtils]: 34: Hoare triple {76010#(not (= ~nomsg~0 ~p2_new~0))} assume !(0 != ~mode3~0 % 256); {76010#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:27:28,220 INFO L290 TraceCheckUtils]: 35: Hoare triple {76010#(not (= ~nomsg~0 ~p2_new~0))} assume !(0 != ~alive3~0 % 256); {76010#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:27:28,220 INFO L290 TraceCheckUtils]: 36: Hoare triple {76010#(not (= ~nomsg~0 ~p2_new~0))} assume !(~send3~0 != ~id3~0); {76010#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:27:28,220 INFO L290 TraceCheckUtils]: 37: Hoare triple {76010#(not (= ~nomsg~0 ~p2_new~0))} ~mode3~0 := 1; {76010#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:27:28,220 INFO L290 TraceCheckUtils]: 38: Hoare triple {76010#(not (= ~nomsg~0 ~p2_new~0))} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {76011#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:27:28,221 INFO L290 TraceCheckUtils]: 39: Hoare triple {76011#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {76011#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:27:28,221 INFO L290 TraceCheckUtils]: 40: Hoare triple {76011#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; {76011#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:27:28,221 INFO L290 TraceCheckUtils]: 41: Hoare triple {76011#(not (= ~nomsg~0 ~p2_old~0))} check_#res#1 := check_~tmp~1#1; {76011#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:27:28,222 INFO L290 TraceCheckUtils]: 42: Hoare triple {76011#(not (= ~nomsg~0 ~p2_old~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; {76011#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:27:28,222 INFO L290 TraceCheckUtils]: 43: Hoare triple {76011#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == assert_~arg#1 % 256); {76011#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:27:28,222 INFO L290 TraceCheckUtils]: 44: Hoare triple {76011#(not (= ~nomsg~0 ~p2_old~0))} assume { :end_inline_assert } true; {76011#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:27:28,223 INFO L290 TraceCheckUtils]: 45: Hoare triple {76011#(not (= ~nomsg~0 ~p2_old~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; {76011#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:27:28,228 INFO L290 TraceCheckUtils]: 46: Hoare triple {76011#(not (= ~nomsg~0 ~p2_old~0))} assume 0 != ~mode1~0 % 256; {76011#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:27:28,228 INFO L290 TraceCheckUtils]: 47: Hoare triple {76011#(not (= ~nomsg~0 ~p2_old~0))} assume !(255 == ~r1~0 % 256); {76011#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:27:28,229 INFO L290 TraceCheckUtils]: 48: Hoare triple {76011#(not (= ~nomsg~0 ~p2_old~0))} ~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {76011#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:27:28,229 INFO L290 TraceCheckUtils]: 49: Hoare triple {76011#(not (= ~nomsg~0 ~p2_old~0))} assume !(node1_~m1~0#1 != ~nomsg~0); {76011#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:27:28,230 INFO L290 TraceCheckUtils]: 50: Hoare triple {76011#(not (= ~nomsg~0 ~p2_old~0))} ~mode1~0 := 0; {76011#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:27:28,230 INFO L290 TraceCheckUtils]: 51: Hoare triple {76011#(not (= ~nomsg~0 ~p2_old~0))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {76011#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:27:28,231 INFO L290 TraceCheckUtils]: 52: Hoare triple {76011#(not (= ~nomsg~0 ~p2_old~0))} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {76011#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:27:28,231 INFO L290 TraceCheckUtils]: 53: Hoare triple {76011#(not (= ~nomsg~0 ~p2_old~0))} assume !(node2_~m2~0#1 != ~nomsg~0); {76011#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:27:28,231 INFO L290 TraceCheckUtils]: 54: Hoare triple {76011#(not (= ~nomsg~0 ~p2_old~0))} ~mode2~0 := 0; {76011#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:27:28,232 INFO L290 TraceCheckUtils]: 55: Hoare triple {76011#(not (= ~nomsg~0 ~p2_old~0))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {76011#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:27:28,232 INFO L290 TraceCheckUtils]: 56: Hoare triple {76011#(not (= ~nomsg~0 ~p2_old~0))} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {76012#(not (= ~nomsg~0 |ULTIMATE.start_node3_~m3~0#1|))} is VALID [2022-02-20 18:27:28,232 INFO L290 TraceCheckUtils]: 57: Hoare triple {76012#(not (= ~nomsg~0 |ULTIMATE.start_node3_~m3~0#1|))} assume !(node3_~m3~0#1 != ~nomsg~0); {76004#false} is VALID [2022-02-20 18:27:28,232 INFO L290 TraceCheckUtils]: 58: Hoare triple {76004#false} ~mode3~0 := 0; {76004#false} is VALID [2022-02-20 18:27:28,232 INFO L290 TraceCheckUtils]: 59: Hoare triple {76004#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {76004#false} is VALID [2022-02-20 18:27:28,232 INFO L290 TraceCheckUtils]: 60: Hoare triple {76004#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {76004#false} is VALID [2022-02-20 18:27:28,232 INFO L290 TraceCheckUtils]: 61: Hoare triple {76004#false} assume !(~r1~0 % 256 < 3); {76004#false} is VALID [2022-02-20 18:27:28,232 INFO L290 TraceCheckUtils]: 62: Hoare triple {76004#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0);check_~tmp~1#1 := 0; {76004#false} is VALID [2022-02-20 18:27:28,233 INFO L290 TraceCheckUtils]: 63: Hoare triple {76004#false} check_#res#1 := check_~tmp~1#1; {76004#false} is VALID [2022-02-20 18:27:28,233 INFO L290 TraceCheckUtils]: 64: Hoare triple {76004#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; {76004#false} is VALID [2022-02-20 18:27:28,233 INFO L290 TraceCheckUtils]: 65: Hoare triple {76004#false} assume 0 == assert_~arg#1 % 256; {76004#false} is VALID [2022-02-20 18:27:28,233 INFO L290 TraceCheckUtils]: 66: Hoare triple {76004#false} assume !false; {76004#false} is VALID [2022-02-20 18:27:28,233 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:27:28,233 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:28,233 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246952093] [2022-02-20 18:27:28,233 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246952093] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:27:28,233 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742419588] [2022-02-20 18:27:28,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:28,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:27:28,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:27:28,235 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 18:27:28,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 18:27:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:28,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 18:27:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:28,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:27:29,777 INFO L290 TraceCheckUtils]: 0: Hoare triple {76003#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; {76003#true} is VALID [2022-02-20 18:27:29,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {76003#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~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~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive3~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; {76003#true} is VALID [2022-02-20 18:27:29,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {76003#true} assume 0 == ~r1~0 % 256; {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,778 INFO L290 TraceCheckUtils]: 3: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,778 INFO L290 TraceCheckUtils]: 4: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} assume ~id1~0 >= 0; {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} assume 0 == ~st1~0; {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,779 INFO L290 TraceCheckUtils]: 6: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} assume ~send1~0 == ~id1~0; {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} assume 0 == ~mode1~0 % 256; {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} assume ~id2~0 >= 0; {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} assume 0 == ~st2~0; {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,780 INFO L290 TraceCheckUtils]: 10: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} assume ~send2~0 == ~id2~0; {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,781 INFO L290 TraceCheckUtils]: 11: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} assume 0 == ~mode2~0 % 256; {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,781 INFO L290 TraceCheckUtils]: 12: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} assume ~id3~0 >= 0; {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,781 INFO L290 TraceCheckUtils]: 13: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} assume 0 == ~st3~0; {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} assume ~send3~0 == ~id3~0; {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,782 INFO L290 TraceCheckUtils]: 15: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} assume 0 == ~mode3~0 % 256; {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,782 INFO L290 TraceCheckUtils]: 16: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} assume ~id1~0 != ~id2~0; {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,783 INFO L290 TraceCheckUtils]: 17: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} assume ~id1~0 != ~id3~0; {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,783 INFO L290 TraceCheckUtils]: 18: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,783 INFO L290 TraceCheckUtils]: 19: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} init_#res#1 := init_~tmp~0#1; {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,784 INFO L290 TraceCheckUtils]: 20: Hoare triple {76022#(<= (mod ~r1~0 256) 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; {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,785 INFO L290 TraceCheckUtils]: 21: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} assume !(0 == assume_abort_if_not_~cond#1); {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,785 INFO L290 TraceCheckUtils]: 22: Hoare triple {76022#(<= (mod ~r1~0 256) 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;main_~i2~0#1 := 0; {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,785 INFO L290 TraceCheckUtils]: 23: Hoare triple {76022#(<= (mod ~r1~0 256) 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; {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,786 INFO L290 TraceCheckUtils]: 24: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} assume !(0 != ~mode1~0 % 256); {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,786 INFO L290 TraceCheckUtils]: 25: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} assume !(0 != ~alive1~0 % 256); {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,786 INFO L290 TraceCheckUtils]: 26: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} ~mode1~0 := 1; {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,787 INFO L290 TraceCheckUtils]: 27: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,787 INFO L290 TraceCheckUtils]: 28: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} assume !(0 != ~mode2~0 % 256); {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,787 INFO L290 TraceCheckUtils]: 29: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} assume 0 != ~alive2~0 % 256; {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,788 INFO L290 TraceCheckUtils]: 30: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,788 INFO L290 TraceCheckUtils]: 31: Hoare triple {76022#(<= (mod ~r1~0 256) 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; {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,788 INFO L290 TraceCheckUtils]: 32: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} ~mode2~0 := 1; {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,789 INFO L290 TraceCheckUtils]: 33: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,789 INFO L290 TraceCheckUtils]: 34: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} assume !(0 != ~mode3~0 % 256); {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,789 INFO L290 TraceCheckUtils]: 35: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} assume !(0 != ~alive3~0 % 256); {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,790 INFO L290 TraceCheckUtils]: 36: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} assume !(~send3~0 != ~id3~0); {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,790 INFO L290 TraceCheckUtils]: 37: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} ~mode3~0 := 1; {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,790 INFO L290 TraceCheckUtils]: 38: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,791 INFO L290 TraceCheckUtils]: 39: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,791 INFO L290 TraceCheckUtils]: 40: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,791 INFO L290 TraceCheckUtils]: 41: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} check_#res#1 := check_~tmp~1#1; {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,792 INFO L290 TraceCheckUtils]: 42: Hoare triple {76022#(<= (mod ~r1~0 256) 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; {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,792 INFO L290 TraceCheckUtils]: 43: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} assume !(0 == assert_~arg#1 % 256); {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,792 INFO L290 TraceCheckUtils]: 44: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} assume { :end_inline_assert } true; {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,793 INFO L290 TraceCheckUtils]: 45: Hoare triple {76022#(<= (mod ~r1~0 256) 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; {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,793 INFO L290 TraceCheckUtils]: 46: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} assume 0 != ~mode1~0 % 256; {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,793 INFO L290 TraceCheckUtils]: 47: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} assume !(255 == ~r1~0 % 256); {76022#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:27:29,794 INFO L290 TraceCheckUtils]: 48: Hoare triple {76022#(<= (mod ~r1~0 256) 0)} ~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {76161#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} is VALID [2022-02-20 18:27:29,795 INFO L290 TraceCheckUtils]: 49: Hoare triple {76161#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} assume !(node1_~m1~0#1 != ~nomsg~0); {76161#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} is VALID [2022-02-20 18:27:29,795 INFO L290 TraceCheckUtils]: 50: Hoare triple {76161#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} ~mode1~0 := 0; {76161#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} is VALID [2022-02-20 18:27:29,796 INFO L290 TraceCheckUtils]: 51: Hoare triple {76161#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {76161#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} is VALID [2022-02-20 18:27:29,796 INFO L290 TraceCheckUtils]: 52: Hoare triple {76161#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {76161#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} is VALID [2022-02-20 18:27:29,797 INFO L290 TraceCheckUtils]: 53: Hoare triple {76161#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} assume !(node2_~m2~0#1 != ~nomsg~0); {76161#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} is VALID [2022-02-20 18:27:29,797 INFO L290 TraceCheckUtils]: 54: Hoare triple {76161#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} ~mode2~0 := 0; {76161#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} is VALID [2022-02-20 18:27:29,798 INFO L290 TraceCheckUtils]: 55: Hoare triple {76161#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {76161#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} is VALID [2022-02-20 18:27:29,798 INFO L290 TraceCheckUtils]: 56: Hoare triple {76161#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {76161#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} is VALID [2022-02-20 18:27:29,798 INFO L290 TraceCheckUtils]: 57: Hoare triple {76161#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} assume !(node3_~m3~0#1 != ~nomsg~0); {76161#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} is VALID [2022-02-20 18:27:29,799 INFO L290 TraceCheckUtils]: 58: Hoare triple {76161#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} ~mode3~0 := 0; {76161#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} is VALID [2022-02-20 18:27:29,799 INFO L290 TraceCheckUtils]: 59: Hoare triple {76161#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {76161#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} is VALID [2022-02-20 18:27:29,800 INFO L290 TraceCheckUtils]: 60: Hoare triple {76161#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {76161#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} is VALID [2022-02-20 18:27:29,800 INFO L290 TraceCheckUtils]: 61: Hoare triple {76161#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} assume !(~r1~0 % 256 < 3); {76004#false} is VALID [2022-02-20 18:27:29,800 INFO L290 TraceCheckUtils]: 62: Hoare triple {76004#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0);check_~tmp~1#1 := 0; {76004#false} is VALID [2022-02-20 18:27:29,800 INFO L290 TraceCheckUtils]: 63: Hoare triple {76004#false} check_#res#1 := check_~tmp~1#1; {76004#false} is VALID [2022-02-20 18:27:29,800 INFO L290 TraceCheckUtils]: 64: Hoare triple {76004#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; {76004#false} is VALID [2022-02-20 18:27:29,800 INFO L290 TraceCheckUtils]: 65: Hoare triple {76004#false} assume 0 == assert_~arg#1 % 256; {76004#false} is VALID [2022-02-20 18:27:29,801 INFO L290 TraceCheckUtils]: 66: Hoare triple {76004#false} assume !false; {76004#false} is VALID [2022-02-20 18:27:29,802 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:27:29,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:27:38,420 INFO L290 TraceCheckUtils]: 66: Hoare triple {76004#false} assume !false; {76004#false} is VALID [2022-02-20 18:27:38,421 INFO L290 TraceCheckUtils]: 65: Hoare triple {76004#false} assume 0 == assert_~arg#1 % 256; {76004#false} is VALID [2022-02-20 18:27:38,421 INFO L290 TraceCheckUtils]: 64: Hoare triple {76004#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; {76004#false} is VALID [2022-02-20 18:27:38,421 INFO L290 TraceCheckUtils]: 63: Hoare triple {76004#false} check_#res#1 := check_~tmp~1#1; {76004#false} is VALID [2022-02-20 18:27:38,421 INFO L290 TraceCheckUtils]: 62: Hoare triple {76004#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0);check_~tmp~1#1 := 0; {76004#false} is VALID [2022-02-20 18:27:38,421 INFO L290 TraceCheckUtils]: 61: Hoare triple {76231#(< (mod ~r1~0 256) 3)} assume !(~r1~0 % 256 < 3); {76004#false} is VALID [2022-02-20 18:27:38,422 INFO L290 TraceCheckUtils]: 60: Hoare triple {76231#(< (mod ~r1~0 256) 3)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {76231#(< (mod ~r1~0 256) 3)} is VALID [2022-02-20 18:27:38,422 INFO L290 TraceCheckUtils]: 59: Hoare triple {76231#(< (mod ~r1~0 256) 3)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {76231#(< (mod ~r1~0 256) 3)} is VALID [2022-02-20 18:27:38,423 INFO L290 TraceCheckUtils]: 58: Hoare triple {76231#(< (mod ~r1~0 256) 3)} ~mode3~0 := 0; {76231#(< (mod ~r1~0 256) 3)} is VALID [2022-02-20 18:27:38,423 INFO L290 TraceCheckUtils]: 57: Hoare triple {76231#(< (mod ~r1~0 256) 3)} assume !(node3_~m3~0#1 != ~nomsg~0); {76231#(< (mod ~r1~0 256) 3)} is VALID [2022-02-20 18:27:38,423 INFO L290 TraceCheckUtils]: 56: Hoare triple {76231#(< (mod ~r1~0 256) 3)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {76231#(< (mod ~r1~0 256) 3)} is VALID [2022-02-20 18:27:38,424 INFO L290 TraceCheckUtils]: 55: Hoare triple {76231#(< (mod ~r1~0 256) 3)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {76231#(< (mod ~r1~0 256) 3)} is VALID [2022-02-20 18:27:38,424 INFO L290 TraceCheckUtils]: 54: Hoare triple {76231#(< (mod ~r1~0 256) 3)} ~mode2~0 := 0; {76231#(< (mod ~r1~0 256) 3)} is VALID [2022-02-20 18:27:38,424 INFO L290 TraceCheckUtils]: 53: Hoare triple {76231#(< (mod ~r1~0 256) 3)} assume !(node2_~m2~0#1 != ~nomsg~0); {76231#(< (mod ~r1~0 256) 3)} is VALID [2022-02-20 18:27:38,425 INFO L290 TraceCheckUtils]: 52: Hoare triple {76231#(< (mod ~r1~0 256) 3)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {76231#(< (mod ~r1~0 256) 3)} is VALID [2022-02-20 18:27:38,425 INFO L290 TraceCheckUtils]: 51: Hoare triple {76231#(< (mod ~r1~0 256) 3)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {76231#(< (mod ~r1~0 256) 3)} is VALID [2022-02-20 18:27:38,426 INFO L290 TraceCheckUtils]: 50: Hoare triple {76231#(< (mod ~r1~0 256) 3)} ~mode1~0 := 0; {76231#(< (mod ~r1~0 256) 3)} is VALID [2022-02-20 18:27:38,428 INFO L290 TraceCheckUtils]: 49: Hoare triple {76231#(< (mod ~r1~0 256) 3)} assume !(node1_~m1~0#1 != ~nomsg~0); {76231#(< (mod ~r1~0 256) 3)} is VALID [2022-02-20 18:27:38,432 INFO L290 TraceCheckUtils]: 48: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} ~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {76231#(< (mod ~r1~0 256) 3)} is VALID [2022-02-20 18:27:38,432 INFO L290 TraceCheckUtils]: 47: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} assume !(255 == ~r1~0 % 256); {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,432 INFO L290 TraceCheckUtils]: 46: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} assume 0 != ~mode1~0 % 256; {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,433 INFO L290 TraceCheckUtils]: 45: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} 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; {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,433 INFO L290 TraceCheckUtils]: 44: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} assume { :end_inline_assert } true; {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,433 INFO L290 TraceCheckUtils]: 43: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} assume !(0 == assert_~arg#1 % 256); {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,434 INFO L290 TraceCheckUtils]: 42: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} 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; {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,434 INFO L290 TraceCheckUtils]: 41: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} check_#res#1 := check_~tmp~1#1; {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,434 INFO L290 TraceCheckUtils]: 40: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,435 INFO L290 TraceCheckUtils]: 39: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,435 INFO L290 TraceCheckUtils]: 38: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,436 INFO L290 TraceCheckUtils]: 37: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} ~mode3~0 := 1; {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,436 INFO L290 TraceCheckUtils]: 36: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} assume !(~send3~0 != ~id3~0); {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,436 INFO L290 TraceCheckUtils]: 35: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} assume !(0 != ~alive3~0 % 256); {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,437 INFO L290 TraceCheckUtils]: 34: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} assume !(0 != ~mode3~0 % 256); {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,437 INFO L290 TraceCheckUtils]: 33: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,437 INFO L290 TraceCheckUtils]: 32: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} ~mode2~0 := 1; {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,438 INFO L290 TraceCheckUtils]: 31: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} ~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; {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,438 INFO L290 TraceCheckUtils]: 30: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,439 INFO L290 TraceCheckUtils]: 29: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} assume 0 != ~alive2~0 % 256; {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,439 INFO L290 TraceCheckUtils]: 28: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} assume !(0 != ~mode2~0 % 256); {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,439 INFO L290 TraceCheckUtils]: 27: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,440 INFO L290 TraceCheckUtils]: 26: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} ~mode1~0 := 1; {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,440 INFO L290 TraceCheckUtils]: 25: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} assume !(0 != ~alive1~0 % 256); {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,440 INFO L290 TraceCheckUtils]: 24: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} assume !(0 != ~mode1~0 % 256); {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} 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; {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,441 INFO L290 TraceCheckUtils]: 22: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} 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;main_~i2~0#1 := 0; {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} assume !(0 == assume_abort_if_not_~cond#1); {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} 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; {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,442 INFO L290 TraceCheckUtils]: 19: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} init_#res#1 := init_~tmp~0#1; {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} assume ~id1~0 != ~id3~0; {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} assume ~id1~0 != ~id2~0; {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} assume 0 == ~mode3~0 % 256; {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} assume ~send3~0 == ~id3~0; {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} assume 0 == ~st3~0; {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} assume ~id3~0 >= 0; {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} assume 0 == ~mode2~0 % 256; {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,446 INFO L290 TraceCheckUtils]: 10: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} assume ~send2~0 == ~id2~0; {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} assume 0 == ~st2~0; {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} assume ~id2~0 >= 0; {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} assume 0 == ~mode1~0 % 256; {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,447 INFO L290 TraceCheckUtils]: 6: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} assume ~send1~0 == ~id1~0; {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} assume 0 == ~st1~0; {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,448 INFO L290 TraceCheckUtils]: 4: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} assume ~id1~0 >= 0; {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,448 INFO L290 TraceCheckUtils]: 3: Hoare triple {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {76003#true} assume 0 == ~r1~0 % 256; {76271#(< (mod (+ (mod ~r1~0 256) 1) 256) 3)} is VALID [2022-02-20 18:27:38,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {76003#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~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~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive3~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; {76003#true} is VALID [2022-02-20 18:27:38,449 INFO L290 TraceCheckUtils]: 0: Hoare triple {76003#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; {76003#true} is VALID [2022-02-20 18:27:38,450 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:27:38,450 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742419588] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:27:38,450 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:27:38,450 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 14 [2022-02-20 18:27:38,450 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600266739] [2022-02-20 18:27:38,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:27:38,451 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 13.357142857142858) internal successors, (187), 14 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-02-20 18:27:38,451 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:38,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 13.357142857142858) internal successors, (187), 14 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:38,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:38,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 18:27:38,613 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:38,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 18:27:38,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-02-20 18:27:38,614 INFO L87 Difference]: Start difference. First operand 3150 states and 4351 transitions. Second operand has 14 states, 14 states have (on average 13.357142857142858) internal successors, (187), 14 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)