./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.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-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.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 9fc8deb48660011a55df6a125b576e7008308183eeefddcba409d6b7b87cd69f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:38:20,828 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:38:20,830 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:38:20,865 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:38:20,865 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:38:20,868 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:38:20,870 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:38:20,875 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:38:20,876 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:38:20,880 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:38:20,881 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:38:20,882 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:38:20,883 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:38:20,885 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:38:20,886 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:38:20,888 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:38:20,890 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:38:20,890 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:38:20,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:38:20,897 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:38:20,898 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:38:20,899 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:38:20,901 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:38:20,901 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:38:20,907 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:38:20,907 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:38:20,908 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:38:20,909 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:38:20,909 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:38:20,910 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:38:20,911 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:38:20,912 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:38:20,913 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:38:20,914 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:38:20,915 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:38:20,916 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:38:20,917 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:38:20,917 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:38:20,917 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:38:20,918 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:38:20,919 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:38:20,920 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:38:20,951 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:38:20,952 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:38:20,952 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:38:20,952 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:38:20,953 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:38:20,953 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:38:20,954 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:38:20,954 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:38:20,954 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:38:20,955 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:38:20,955 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:38:20,955 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:38:20,956 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:38:20,956 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:38:20,956 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:38:20,956 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:38:20,956 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:38:20,957 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:38:20,957 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:38:20,957 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:38:20,957 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:38:20,957 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:38:20,958 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:38:20,958 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:38:20,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:38:20,958 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:38:20,958 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:38:20,959 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:38:20,959 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:38:20,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:38:20,959 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:38:20,959 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:38:20,960 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:38:20,960 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 -> 9fc8deb48660011a55df6a125b576e7008308183eeefddcba409d6b7b87cd69f [2022-02-20 18:38:21,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:38:21,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:38:21,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:38:21,209 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:38:21,209 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:38:21,210 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2022-02-20 18:38:21,281 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45e99ec33/30d0925819244000995b45b6aac83d77/FLAG35946e375 [2022-02-20 18:38:21,639 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:38:21,640 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2022-02-20 18:38:21,657 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45e99ec33/30d0925819244000995b45b6aac83d77/FLAG35946e375 [2022-02-20 18:38:22,021 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45e99ec33/30d0925819244000995b45b6aac83d77 [2022-02-20 18:38:22,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:38:22,025 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:38:22,026 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:38:22,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:38:22,029 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:38:22,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:38:22" (1/1) ... [2022-02-20 18:38:22,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47a0877f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:22, skipping insertion in model container [2022-02-20 18:38:22,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:38:22" (1/1) ... [2022-02-20 18:38:22,036 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:38:22,091 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:38:22,321 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-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[9863,9876] [2022-02-20 18:38:22,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:38:22,386 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:38:22,474 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-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[9863,9876] [2022-02-20 18:38:22,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:38:22,554 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:38:22,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:22 WrapperNode [2022-02-20 18:38:22,555 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:38:22,556 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:38:22,556 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:38:22,556 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:38:22,565 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:38:22" (1/1) ... [2022-02-20 18:38:22,577 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:38:22" (1/1) ... [2022-02-20 18:38:22,637 INFO L137 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 875 [2022-02-20 18:38:22,637 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:38:22,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:38:22,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:38:22,638 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:38:22,650 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:22" (1/1) ... [2022-02-20 18:38:22,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:22" (1/1) ... [2022-02-20 18:38:22,654 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:22" (1/1) ... [2022-02-20 18:38:22,654 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:22" (1/1) ... [2022-02-20 18:38:22,665 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:22" (1/1) ... [2022-02-20 18:38:22,671 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:22" (1/1) ... [2022-02-20 18:38:22,674 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:22" (1/1) ... [2022-02-20 18:38:22,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:38:22,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:38:22,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:38:22,680 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:38:22,681 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:22" (1/1) ... [2022-02-20 18:38:22,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:38:22,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:38:22,707 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:38:22,757 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:38:22,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:38:22,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:38:22,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:38:22,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:38:22,900 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:38:22,901 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:38:23,778 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:38:23,786 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:38:23,789 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:38:23,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:38:23 BoogieIcfgContainer [2022-02-20 18:38:23,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:38:23,793 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:38:23,793 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:38:23,797 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:38:23,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:38:22" (1/3) ... [2022-02-20 18:38:23,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b8fc940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:38:23, skipping insertion in model container [2022-02-20 18:38:23,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:22" (2/3) ... [2022-02-20 18:38:23,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b8fc940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:38:23, skipping insertion in model container [2022-02-20 18:38:23,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:38:23" (3/3) ... [2022-02-20 18:38:23,803 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2022-02-20 18:38:23,808 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:38:23,808 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:38:23,860 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:38:23,866 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:38:23,867 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:38:23,901 INFO L276 IsEmpty]: Start isEmpty. Operand has 218 states, 216 states have (on average 1.7777777777777777) internal successors, (384), 217 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:23,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-02-20 18:38:23,913 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:23,914 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:23,915 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:23,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:23,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1207420229, now seen corresponding path program 1 times [2022-02-20 18:38:23,928 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:23,928 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504100522] [2022-02-20 18:38:23,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:23,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:24,332 INFO L290 TraceCheckUtils]: 0: Hoare triple {221#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(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1131~0 := 0;~__return_1259~0 := 0;~__return_1378~0 := 0;~__tmp_1379_0~0 := 0;~__return_1487~0 := 0;~__return_1392~0 := 0; {221#true} is VALID [2022-02-20 18:38:24,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {221#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~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;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {221#true} is VALID [2022-02-20 18:38:24,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {221#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {221#true} is VALID [2022-02-20 18:38:24,337 INFO L290 TraceCheckUtils]: 3: Hoare triple {221#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {221#true} is VALID [2022-02-20 18:38:24,337 INFO L290 TraceCheckUtils]: 4: Hoare triple {221#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {221#true} is VALID [2022-02-20 18:38:24,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {221#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {221#true} is VALID [2022-02-20 18:38:24,338 INFO L290 TraceCheckUtils]: 6: Hoare triple {221#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {221#true} is VALID [2022-02-20 18:38:24,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {221#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {221#true} is VALID [2022-02-20 18:38:24,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {221#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {221#true} is VALID [2022-02-20 18:38:24,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {221#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {221#true} is VALID [2022-02-20 18:38:24,340 INFO L290 TraceCheckUtils]: 10: Hoare triple {221#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {221#true} is VALID [2022-02-20 18:38:24,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {221#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {221#true} is VALID [2022-02-20 18:38:24,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {221#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {221#true} is VALID [2022-02-20 18:38:24,341 INFO L290 TraceCheckUtils]: 13: Hoare triple {221#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {221#true} is VALID [2022-02-20 18:38:24,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {221#true} assume ~id1~0 != ~id2~0; {221#true} is VALID [2022-02-20 18:38:24,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {221#true} assume ~id1~0 != ~id3~0; {221#true} is VALID [2022-02-20 18:38:24,341 INFO L290 TraceCheckUtils]: 16: Hoare triple {221#true} assume ~id2~0 != ~id3~0; {221#true} is VALID [2022-02-20 18:38:24,342 INFO L290 TraceCheckUtils]: 17: Hoare triple {221#true} assume ~id1~0 >= 0; {221#true} is VALID [2022-02-20 18:38:24,342 INFO L290 TraceCheckUtils]: 18: Hoare triple {221#true} assume ~id2~0 >= 0; {221#true} is VALID [2022-02-20 18:38:24,343 INFO L290 TraceCheckUtils]: 19: Hoare triple {221#true} assume ~id3~0 >= 0; {221#true} is VALID [2022-02-20 18:38:24,343 INFO L290 TraceCheckUtils]: 20: Hoare triple {221#true} assume 0 == ~r1~0; {221#true} is VALID [2022-02-20 18:38:24,344 INFO L290 TraceCheckUtils]: 21: Hoare triple {221#true} assume 0 == ~r2~0; {221#true} is VALID [2022-02-20 18:38:24,344 INFO L290 TraceCheckUtils]: 22: Hoare triple {221#true} assume 0 == ~r3~0; {221#true} is VALID [2022-02-20 18:38:24,344 INFO L290 TraceCheckUtils]: 23: Hoare triple {221#true} assume !(0 == main_~init__r122~0#1 % 256); {221#true} is VALID [2022-02-20 18:38:24,344 INFO L290 TraceCheckUtils]: 24: Hoare triple {221#true} assume !(0 == main_~init__r132~0#1 % 256); {221#true} is VALID [2022-02-20 18:38:24,345 INFO L290 TraceCheckUtils]: 25: Hoare triple {221#true} assume !(0 == main_~init__r212~0#1 % 256); {221#true} is VALID [2022-02-20 18:38:24,345 INFO L290 TraceCheckUtils]: 26: Hoare triple {221#true} assume !(0 == main_~init__r232~0#1 % 256); {221#true} is VALID [2022-02-20 18:38:24,346 INFO L290 TraceCheckUtils]: 27: Hoare triple {221#true} assume !(0 == main_~init__r312~0#1 % 256); {221#true} is VALID [2022-02-20 18:38:24,347 INFO L290 TraceCheckUtils]: 28: Hoare triple {221#true} assume !(0 == main_~init__r322~0#1 % 256); {221#true} is VALID [2022-02-20 18:38:24,351 INFO L290 TraceCheckUtils]: 29: Hoare triple {221#true} assume ~max1~0 == ~id1~0; {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,352 INFO L290 TraceCheckUtils]: 30: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume ~max2~0 == ~id2~0; {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,353 INFO L290 TraceCheckUtils]: 31: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume ~max3~0 == ~id3~0; {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,353 INFO L290 TraceCheckUtils]: 32: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume 0 == ~st1~0; {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,354 INFO L290 TraceCheckUtils]: 33: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume 0 == ~st2~0; {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,354 INFO L290 TraceCheckUtils]: 34: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume 0 == ~st3~0; {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,355 INFO L290 TraceCheckUtils]: 35: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume 0 == ~nl1~0; {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,355 INFO L290 TraceCheckUtils]: 36: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume 0 == ~nl2~0; {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,356 INFO L290 TraceCheckUtils]: 37: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume 0 == ~nl3~0; {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,357 INFO L290 TraceCheckUtils]: 38: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume 0 == ~mode1~0 % 256; {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,357 INFO L290 TraceCheckUtils]: 39: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume 0 == ~mode2~0 % 256; {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,358 INFO L290 TraceCheckUtils]: 40: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1131~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1131~0; {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,359 INFO L290 TraceCheckUtils]: 41: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,359 INFO L290 TraceCheckUtils]: 42: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume main_~main__i2~0#1 < 6; {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,360 INFO L290 TraceCheckUtils]: 43: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !!(0 == ~mode1~0 % 256); {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,361 INFO L290 TraceCheckUtils]: 44: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume ~r1~0 < 2; {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,361 INFO L290 TraceCheckUtils]: 45: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !!(0 == ~ep12~0 % 256); {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,362 INFO L290 TraceCheckUtils]: 46: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !!(0 == ~ep13~0 % 256); {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,363 INFO L290 TraceCheckUtils]: 47: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} ~mode1~0 := 1; {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,363 INFO L290 TraceCheckUtils]: 48: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !!(0 == ~mode2~0 % 256); {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,364 INFO L290 TraceCheckUtils]: 49: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume ~r2~0 < 2; {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,367 INFO L290 TraceCheckUtils]: 50: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !!(0 == ~ep21~0 % 256); {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,367 INFO L290 TraceCheckUtils]: 51: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !!(0 == ~ep23~0 % 256); {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,368 INFO L290 TraceCheckUtils]: 52: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} ~mode2~0 := 1; {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,369 INFO L290 TraceCheckUtils]: 53: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !!(0 == ~mode3~0 % 256); {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,369 INFO L290 TraceCheckUtils]: 54: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume ~r3~0 < 2; {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,370 INFO L290 TraceCheckUtils]: 55: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !!(0 == ~ep31~0 % 256); {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,370 INFO L290 TraceCheckUtils]: 56: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !!(0 == ~ep32~0 % 256); {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,372 INFO L290 TraceCheckUtils]: 57: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} ~mode3~0 := 1;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,374 INFO L290 TraceCheckUtils]: 58: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,375 INFO L290 TraceCheckUtils]: 59: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,379 INFO L290 TraceCheckUtils]: 60: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume ~st2~0 + ~nl2~0 <= 1; {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,380 INFO L290 TraceCheckUtils]: 61: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume ~st3~0 + ~nl3~0 <= 1; {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,381 INFO L290 TraceCheckUtils]: 62: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !(~r1~0 >= 2); {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,381 INFO L290 TraceCheckUtils]: 63: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,382 INFO L290 TraceCheckUtils]: 64: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume ~r1~0 < 2; {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,383 INFO L290 TraceCheckUtils]: 65: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !(~r1~0 >= 2); {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,383 INFO L290 TraceCheckUtils]: 66: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,384 INFO L290 TraceCheckUtils]: 67: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume ~r1~0 < 2;main_~check__tmp~0#1 := 1;~__return_1259~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1259~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,387 INFO L290 TraceCheckUtils]: 68: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,388 INFO L290 TraceCheckUtils]: 69: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume main_~main__i2~0#1 < 6; {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,388 INFO L290 TraceCheckUtils]: 70: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,389 INFO L290 TraceCheckUtils]: 71: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !!(0 == ~ep21~0 % 256); {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,389 INFO L290 TraceCheckUtils]: 72: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !!(0 == ~ep31~0 % 256); {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,390 INFO L290 TraceCheckUtils]: 73: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume 1 == ~r1~0; {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:24,391 INFO L290 TraceCheckUtils]: 74: Hoare triple {223#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !(~max1~0 == ~id1~0);~nl1~0 := 1; {222#false} is VALID [2022-02-20 18:38:24,391 INFO L290 TraceCheckUtils]: 75: Hoare triple {222#false} ~mode1~0 := 0; {222#false} is VALID [2022-02-20 18:38:24,391 INFO L290 TraceCheckUtils]: 76: Hoare triple {222#false} assume !(0 == ~mode2~0 % 256);~r2~0 := (if (1 + ~r2~0) % 256 <= 127 then (1 + ~r2~0) % 256 else (1 + ~r2~0) % 256 - 256); {222#false} is VALID [2022-02-20 18:38:24,392 INFO L290 TraceCheckUtils]: 77: Hoare triple {222#false} assume !!(0 == ~ep12~0 % 256); {222#false} is VALID [2022-02-20 18:38:24,393 INFO L290 TraceCheckUtils]: 78: Hoare triple {222#false} assume !!(0 == ~ep32~0 % 256); {222#false} is VALID [2022-02-20 18:38:24,394 INFO L290 TraceCheckUtils]: 79: Hoare triple {222#false} assume !(2 == ~r2~0);~mode2~0 := 0; {222#false} is VALID [2022-02-20 18:38:24,396 INFO L290 TraceCheckUtils]: 80: Hoare triple {222#false} assume !(0 == ~mode3~0 % 256);~r3~0 := (if (1 + ~r3~0) % 256 <= 127 then (1 + ~r3~0) % 256 else (1 + ~r3~0) % 256 - 256); {222#false} is VALID [2022-02-20 18:38:24,396 INFO L290 TraceCheckUtils]: 81: Hoare triple {222#false} assume !!(0 == ~ep13~0 % 256); {222#false} is VALID [2022-02-20 18:38:24,396 INFO L290 TraceCheckUtils]: 82: Hoare triple {222#false} assume !!(0 == ~ep23~0 % 256); {222#false} is VALID [2022-02-20 18:38:24,397 INFO L290 TraceCheckUtils]: 83: Hoare triple {222#false} assume !(2 == ~r3~0);~mode3~0 := 0;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {222#false} is VALID [2022-02-20 18:38:24,397 INFO L290 TraceCheckUtils]: 84: Hoare triple {222#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {222#false} is VALID [2022-02-20 18:38:24,397 INFO L290 TraceCheckUtils]: 85: Hoare triple {222#false} assume ~st1~0 + ~nl1~0 <= 1; {222#false} is VALID [2022-02-20 18:38:24,398 INFO L290 TraceCheckUtils]: 86: Hoare triple {222#false} assume ~st2~0 + ~nl2~0 <= 1; {222#false} is VALID [2022-02-20 18:38:24,398 INFO L290 TraceCheckUtils]: 87: Hoare triple {222#false} assume ~st3~0 + ~nl3~0 <= 1; {222#false} is VALID [2022-02-20 18:38:24,398 INFO L290 TraceCheckUtils]: 88: Hoare triple {222#false} assume !(~r1~0 >= 2); {222#false} is VALID [2022-02-20 18:38:24,399 INFO L290 TraceCheckUtils]: 89: Hoare triple {222#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {222#false} is VALID [2022-02-20 18:38:24,399 INFO L290 TraceCheckUtils]: 90: Hoare triple {222#false} ~__return_1378~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1378~0;~__tmp_1379_0~0 := main_~main____CPAchecker_TMP_0~0#1; {222#false} is VALID [2022-02-20 18:38:24,399 INFO L290 TraceCheckUtils]: 91: Hoare triple {222#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1379_0~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {222#false} is VALID [2022-02-20 18:38:24,400 INFO L290 TraceCheckUtils]: 92: Hoare triple {222#false} assume 0 == main_~assert__arg~1#1 % 256; {222#false} is VALID [2022-02-20 18:38:24,400 INFO L290 TraceCheckUtils]: 93: Hoare triple {222#false} assume !false; {222#false} is VALID [2022-02-20 18:38:24,403 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:38:24,404 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:24,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504100522] [2022-02-20 18:38:24,404 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504100522] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:24,405 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:24,405 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:38:24,409 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092944731] [2022-02-20 18:38:24,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:24,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2022-02-20 18:38:24,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:24,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:24,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:24,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:38:24,509 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:24,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:38:24,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:38:24,534 INFO L87 Difference]: Start difference. First operand has 218 states, 216 states have (on average 1.7777777777777777) internal successors, (384), 217 states have internal predecessors, (384), 0 states have call successors, (0), 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 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:25,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:25,146 INFO L93 Difference]: Finished difference Result 432 states and 754 transitions. [2022-02-20 18:38:25,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:38:25,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2022-02-20 18:38:25,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:25,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:25,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 754 transitions. [2022-02-20 18:38:25,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:25,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 754 transitions. [2022-02-20 18:38:25,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 754 transitions. [2022-02-20 18:38:25,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 754 edges. 754 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:25,757 INFO L225 Difference]: With dead ends: 432 [2022-02-20 18:38:25,757 INFO L226 Difference]: Without dead ends: 321 [2022-02-20 18:38:25,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:38:25,763 INFO L933 BasicCegarLoop]: 363 mSDtfsCounter, 257 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:38:25,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 601 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:25,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-02-20 18:38:25,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 319. [2022-02-20 18:38:25,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:25,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 321 states. Second operand has 319 states, 318 states have (on average 1.5345911949685536) internal successors, (488), 318 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:25,811 INFO L74 IsIncluded]: Start isIncluded. First operand 321 states. Second operand has 319 states, 318 states have (on average 1.5345911949685536) internal successors, (488), 318 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:25,812 INFO L87 Difference]: Start difference. First operand 321 states. Second operand has 319 states, 318 states have (on average 1.5345911949685536) internal successors, (488), 318 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:25,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:25,826 INFO L93 Difference]: Finished difference Result 321 states and 489 transitions. [2022-02-20 18:38:25,826 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 489 transitions. [2022-02-20 18:38:25,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:25,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:25,829 INFO L74 IsIncluded]: Start isIncluded. First operand has 319 states, 318 states have (on average 1.5345911949685536) internal successors, (488), 318 states have internal predecessors, (488), 0 states have call successors, (0), 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 321 states. [2022-02-20 18:38:25,830 INFO L87 Difference]: Start difference. First operand has 319 states, 318 states have (on average 1.5345911949685536) internal successors, (488), 318 states have internal predecessors, (488), 0 states have call successors, (0), 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 321 states. [2022-02-20 18:38:25,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:25,843 INFO L93 Difference]: Finished difference Result 321 states and 489 transitions. [2022-02-20 18:38:25,843 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 489 transitions. [2022-02-20 18:38:25,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:25,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:25,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:25,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:25,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 318 states have (on average 1.5345911949685536) internal successors, (488), 318 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:25,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 488 transitions. [2022-02-20 18:38:25,858 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 488 transitions. Word has length 94 [2022-02-20 18:38:25,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:25,859 INFO L470 AbstractCegarLoop]: Abstraction has 319 states and 488 transitions. [2022-02-20 18:38:25,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:25,860 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 488 transitions. [2022-02-20 18:38:25,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-02-20 18:38:25,861 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:25,862 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:25,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:38:25,862 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:25,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:25,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1721200426, now seen corresponding path program 1 times [2022-02-20 18:38:25,863 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:25,864 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584787510] [2022-02-20 18:38:25,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:25,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:26,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {1883#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(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1131~0 := 0;~__return_1259~0 := 0;~__return_1378~0 := 0;~__tmp_1379_0~0 := 0;~__return_1487~0 := 0;~__return_1392~0 := 0; {1883#true} is VALID [2022-02-20 18:38:26,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {1883#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~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;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {1885#(= (+ (* (- 1) ~ep12~0) |ULTIMATE.start_main_~init__r121~0#1|) 0)} is VALID [2022-02-20 18:38:26,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {1885#(= (+ (* (- 1) ~ep12~0) |ULTIMATE.start_main_~init__r121~0#1|) 0)} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,079 INFO L290 TraceCheckUtils]: 3: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,079 INFO L290 TraceCheckUtils]: 4: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,080 INFO L290 TraceCheckUtils]: 6: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,082 INFO L290 TraceCheckUtils]: 10: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,086 INFO L290 TraceCheckUtils]: 13: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,086 INFO L290 TraceCheckUtils]: 14: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id1~0 != ~id2~0; {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id1~0 != ~id3~0; {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,087 INFO L290 TraceCheckUtils]: 16: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id2~0 != ~id3~0; {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,088 INFO L290 TraceCheckUtils]: 17: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id1~0 >= 0; {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,088 INFO L290 TraceCheckUtils]: 18: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id2~0 >= 0; {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id3~0 >= 0; {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~r1~0; {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,090 INFO L290 TraceCheckUtils]: 21: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~r2~0; {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,090 INFO L290 TraceCheckUtils]: 22: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~r3~0; {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,091 INFO L290 TraceCheckUtils]: 23: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r122~0#1 % 256); {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,092 INFO L290 TraceCheckUtils]: 24: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r132~0#1 % 256); {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,092 INFO L290 TraceCheckUtils]: 25: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r212~0#1 % 256); {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,094 INFO L290 TraceCheckUtils]: 26: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r232~0#1 % 256); {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,094 INFO L290 TraceCheckUtils]: 27: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r312~0#1 % 256); {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,095 INFO L290 TraceCheckUtils]: 28: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r322~0#1 % 256); {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,096 INFO L290 TraceCheckUtils]: 29: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~max1~0 == ~id1~0; {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,096 INFO L290 TraceCheckUtils]: 30: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~max2~0 == ~id2~0; {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,097 INFO L290 TraceCheckUtils]: 31: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~max3~0 == ~id3~0; {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,097 INFO L290 TraceCheckUtils]: 32: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~st1~0; {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,098 INFO L290 TraceCheckUtils]: 33: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~st2~0; {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,098 INFO L290 TraceCheckUtils]: 34: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~st3~0; {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,098 INFO L290 TraceCheckUtils]: 35: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~nl1~0; {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,099 INFO L290 TraceCheckUtils]: 36: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~nl2~0; {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,099 INFO L290 TraceCheckUtils]: 37: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~nl3~0; {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,100 INFO L290 TraceCheckUtils]: 38: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~mode1~0 % 256; {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,100 INFO L290 TraceCheckUtils]: 39: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~mode2~0 % 256; {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,110 INFO L290 TraceCheckUtils]: 40: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1131~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1131~0; {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,116 INFO L290 TraceCheckUtils]: 41: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,117 INFO L290 TraceCheckUtils]: 42: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume main_~main__i2~0#1 < 6; {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,118 INFO L290 TraceCheckUtils]: 43: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !!(0 == ~mode1~0 % 256); {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,118 INFO L290 TraceCheckUtils]: 44: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~r1~0 < 2; {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:26,119 INFO L290 TraceCheckUtils]: 45: Hoare triple {1886#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !!(0 == ~ep12~0 % 256); {1884#false} is VALID [2022-02-20 18:38:26,119 INFO L290 TraceCheckUtils]: 46: Hoare triple {1884#false} assume !!(0 == ~ep13~0 % 256); {1884#false} is VALID [2022-02-20 18:38:26,119 INFO L290 TraceCheckUtils]: 47: Hoare triple {1884#false} ~mode1~0 := 1; {1884#false} is VALID [2022-02-20 18:38:26,119 INFO L290 TraceCheckUtils]: 48: Hoare triple {1884#false} assume !!(0 == ~mode2~0 % 256); {1884#false} is VALID [2022-02-20 18:38:26,120 INFO L290 TraceCheckUtils]: 49: Hoare triple {1884#false} assume ~r2~0 < 2; {1884#false} is VALID [2022-02-20 18:38:26,120 INFO L290 TraceCheckUtils]: 50: Hoare triple {1884#false} assume !!(0 == ~ep21~0 % 256); {1884#false} is VALID [2022-02-20 18:38:26,123 INFO L290 TraceCheckUtils]: 51: Hoare triple {1884#false} assume !!(0 == ~ep23~0 % 256); {1884#false} is VALID [2022-02-20 18:38:26,123 INFO L290 TraceCheckUtils]: 52: Hoare triple {1884#false} ~mode2~0 := 1; {1884#false} is VALID [2022-02-20 18:38:26,123 INFO L290 TraceCheckUtils]: 53: Hoare triple {1884#false} assume !!(0 == ~mode3~0 % 256); {1884#false} is VALID [2022-02-20 18:38:26,123 INFO L290 TraceCheckUtils]: 54: Hoare triple {1884#false} assume ~r3~0 < 2; {1884#false} is VALID [2022-02-20 18:38:26,124 INFO L290 TraceCheckUtils]: 55: Hoare triple {1884#false} assume !!(0 == ~ep31~0 % 256); {1884#false} is VALID [2022-02-20 18:38:26,124 INFO L290 TraceCheckUtils]: 56: Hoare triple {1884#false} assume !!(0 == ~ep32~0 % 256); {1884#false} is VALID [2022-02-20 18:38:26,124 INFO L290 TraceCheckUtils]: 57: Hoare triple {1884#false} ~mode3~0 := 1;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {1884#false} is VALID [2022-02-20 18:38:26,124 INFO L290 TraceCheckUtils]: 58: Hoare triple {1884#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {1884#false} is VALID [2022-02-20 18:38:26,124 INFO L290 TraceCheckUtils]: 59: Hoare triple {1884#false} assume ~st1~0 + ~nl1~0 <= 1; {1884#false} is VALID [2022-02-20 18:38:26,125 INFO L290 TraceCheckUtils]: 60: Hoare triple {1884#false} assume ~st2~0 + ~nl2~0 <= 1; {1884#false} is VALID [2022-02-20 18:38:26,125 INFO L290 TraceCheckUtils]: 61: Hoare triple {1884#false} assume ~st3~0 + ~nl3~0 <= 1; {1884#false} is VALID [2022-02-20 18:38:26,125 INFO L290 TraceCheckUtils]: 62: Hoare triple {1884#false} assume !(~r1~0 >= 2); {1884#false} is VALID [2022-02-20 18:38:26,125 INFO L290 TraceCheckUtils]: 63: Hoare triple {1884#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {1884#false} is VALID [2022-02-20 18:38:26,125 INFO L290 TraceCheckUtils]: 64: Hoare triple {1884#false} assume ~r1~0 < 2; {1884#false} is VALID [2022-02-20 18:38:26,126 INFO L290 TraceCheckUtils]: 65: Hoare triple {1884#false} assume !(~r1~0 >= 2); {1884#false} is VALID [2022-02-20 18:38:26,126 INFO L290 TraceCheckUtils]: 66: Hoare triple {1884#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {1884#false} is VALID [2022-02-20 18:38:26,126 INFO L290 TraceCheckUtils]: 67: Hoare triple {1884#false} assume ~r1~0 < 2;main_~check__tmp~0#1 := 1;~__return_1259~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1259~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {1884#false} is VALID [2022-02-20 18:38:26,126 INFO L290 TraceCheckUtils]: 68: Hoare triple {1884#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {1884#false} is VALID [2022-02-20 18:38:26,127 INFO L290 TraceCheckUtils]: 69: Hoare triple {1884#false} assume main_~main__i2~0#1 < 6; {1884#false} is VALID [2022-02-20 18:38:26,127 INFO L290 TraceCheckUtils]: 70: Hoare triple {1884#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); {1884#false} is VALID [2022-02-20 18:38:26,127 INFO L290 TraceCheckUtils]: 71: Hoare triple {1884#false} assume !!(0 == ~ep21~0 % 256); {1884#false} is VALID [2022-02-20 18:38:26,127 INFO L290 TraceCheckUtils]: 72: Hoare triple {1884#false} assume !!(0 == ~ep31~0 % 256); {1884#false} is VALID [2022-02-20 18:38:26,127 INFO L290 TraceCheckUtils]: 73: Hoare triple {1884#false} assume 1 == ~r1~0; {1884#false} is VALID [2022-02-20 18:38:26,128 INFO L290 TraceCheckUtils]: 74: Hoare triple {1884#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {1884#false} is VALID [2022-02-20 18:38:26,128 INFO L290 TraceCheckUtils]: 75: Hoare triple {1884#false} ~mode1~0 := 0; {1884#false} is VALID [2022-02-20 18:38:26,128 INFO L290 TraceCheckUtils]: 76: Hoare triple {1884#false} assume !(0 == ~mode2~0 % 256);~r2~0 := (if (1 + ~r2~0) % 256 <= 127 then (1 + ~r2~0) % 256 else (1 + ~r2~0) % 256 - 256); {1884#false} is VALID [2022-02-20 18:38:26,128 INFO L290 TraceCheckUtils]: 77: Hoare triple {1884#false} assume !!(0 == ~ep12~0 % 256); {1884#false} is VALID [2022-02-20 18:38:26,128 INFO L290 TraceCheckUtils]: 78: Hoare triple {1884#false} assume !!(0 == ~ep32~0 % 256); {1884#false} is VALID [2022-02-20 18:38:26,129 INFO L290 TraceCheckUtils]: 79: Hoare triple {1884#false} assume !(2 == ~r2~0);~mode2~0 := 0; {1884#false} is VALID [2022-02-20 18:38:26,129 INFO L290 TraceCheckUtils]: 80: Hoare triple {1884#false} assume !(0 == ~mode3~0 % 256);~r3~0 := (if (1 + ~r3~0) % 256 <= 127 then (1 + ~r3~0) % 256 else (1 + ~r3~0) % 256 - 256); {1884#false} is VALID [2022-02-20 18:38:26,129 INFO L290 TraceCheckUtils]: 81: Hoare triple {1884#false} assume !!(0 == ~ep13~0 % 256); {1884#false} is VALID [2022-02-20 18:38:26,129 INFO L290 TraceCheckUtils]: 82: Hoare triple {1884#false} assume !!(0 == ~ep23~0 % 256); {1884#false} is VALID [2022-02-20 18:38:26,129 INFO L290 TraceCheckUtils]: 83: Hoare triple {1884#false} assume !(2 == ~r3~0);~mode3~0 := 0;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {1884#false} is VALID [2022-02-20 18:38:26,130 INFO L290 TraceCheckUtils]: 84: Hoare triple {1884#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {1884#false} is VALID [2022-02-20 18:38:26,130 INFO L290 TraceCheckUtils]: 85: Hoare triple {1884#false} assume ~st1~0 + ~nl1~0 <= 1; {1884#false} is VALID [2022-02-20 18:38:26,130 INFO L290 TraceCheckUtils]: 86: Hoare triple {1884#false} assume ~st2~0 + ~nl2~0 <= 1; {1884#false} is VALID [2022-02-20 18:38:26,130 INFO L290 TraceCheckUtils]: 87: Hoare triple {1884#false} assume ~st3~0 + ~nl3~0 <= 1; {1884#false} is VALID [2022-02-20 18:38:26,130 INFO L290 TraceCheckUtils]: 88: Hoare triple {1884#false} assume !(~r1~0 >= 2); {1884#false} is VALID [2022-02-20 18:38:26,131 INFO L290 TraceCheckUtils]: 89: Hoare triple {1884#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {1884#false} is VALID [2022-02-20 18:38:26,131 INFO L290 TraceCheckUtils]: 90: Hoare triple {1884#false} ~__return_1378~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1378~0;~__tmp_1379_0~0 := main_~main____CPAchecker_TMP_0~0#1; {1884#false} is VALID [2022-02-20 18:38:26,131 INFO L290 TraceCheckUtils]: 91: Hoare triple {1884#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1379_0~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {1884#false} is VALID [2022-02-20 18:38:26,131 INFO L290 TraceCheckUtils]: 92: Hoare triple {1884#false} assume 0 == main_~assert__arg~1#1 % 256; {1884#false} is VALID [2022-02-20 18:38:26,131 INFO L290 TraceCheckUtils]: 93: Hoare triple {1884#false} assume !false; {1884#false} is VALID [2022-02-20 18:38:26,132 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:38:26,132 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:26,133 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584787510] [2022-02-20 18:38:26,133 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584787510] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:26,133 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:26,133 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:38:26,133 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435649985] [2022-02-20 18:38:26,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:26,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2022-02-20 18:38:26,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:26,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:26,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:26,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:38:26,208 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:26,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:38:26,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:38:26,209 INFO L87 Difference]: Start difference. First operand 319 states and 488 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:27,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:27,056 INFO L93 Difference]: Finished difference Result 926 states and 1413 transitions. [2022-02-20 18:38:27,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:38:27,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2022-02-20 18:38:27,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:27,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:27,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 916 transitions. [2022-02-20 18:38:27,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:27,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 916 transitions. [2022-02-20 18:38:27,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 916 transitions. [2022-02-20 18:38:27,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 916 edges. 916 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:27,869 INFO L225 Difference]: With dead ends: 926 [2022-02-20 18:38:27,869 INFO L226 Difference]: Without dead ends: 616 [2022-02-20 18:38:27,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:38:27,871 INFO L933 BasicCegarLoop]: 525 mSDtfsCounter, 641 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:38:27,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [641 Valid, 810 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:27,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2022-02-20 18:38:27,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 614. [2022-02-20 18:38:27,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:27,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 616 states. Second operand has 614 states, 613 states have (on average 1.5171288743882545) internal successors, (930), 613 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:27,978 INFO L74 IsIncluded]: Start isIncluded. First operand 616 states. Second operand has 614 states, 613 states have (on average 1.5171288743882545) internal successors, (930), 613 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:27,979 INFO L87 Difference]: Start difference. First operand 616 states. Second operand has 614 states, 613 states have (on average 1.5171288743882545) internal successors, (930), 613 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:28,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:28,001 INFO L93 Difference]: Finished difference Result 616 states and 931 transitions. [2022-02-20 18:38:28,001 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 931 transitions. [2022-02-20 18:38:28,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:28,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:28,004 INFO L74 IsIncluded]: Start isIncluded. First operand has 614 states, 613 states have (on average 1.5171288743882545) internal successors, (930), 613 states have internal predecessors, (930), 0 states have call successors, (0), 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 616 states. [2022-02-20 18:38:28,006 INFO L87 Difference]: Start difference. First operand has 614 states, 613 states have (on average 1.5171288743882545) internal successors, (930), 613 states have internal predecessors, (930), 0 states have call successors, (0), 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 616 states. [2022-02-20 18:38:28,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:28,029 INFO L93 Difference]: Finished difference Result 616 states and 931 transitions. [2022-02-20 18:38:28,029 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 931 transitions. [2022-02-20 18:38:28,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:28,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:28,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:28,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:28,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 613 states have (on average 1.5171288743882545) internal successors, (930), 613 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:28,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 930 transitions. [2022-02-20 18:38:28,056 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 930 transitions. Word has length 94 [2022-02-20 18:38:28,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:28,056 INFO L470 AbstractCegarLoop]: Abstraction has 614 states and 930 transitions. [2022-02-20 18:38:28,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:28,057 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 930 transitions. [2022-02-20 18:38:28,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-02-20 18:38:28,058 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:28,058 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:28,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:38:28,059 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:28,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:28,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1731479778, now seen corresponding path program 1 times [2022-02-20 18:38:28,059 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:28,060 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272641609] [2022-02-20 18:38:28,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:28,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:28,139 INFO L290 TraceCheckUtils]: 0: Hoare triple {5200#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(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1131~0 := 0;~__return_1259~0 := 0;~__return_1378~0 := 0;~__tmp_1379_0~0 := 0;~__return_1487~0 := 0;~__return_1392~0 := 0; {5200#true} is VALID [2022-02-20 18:38:28,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {5200#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~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;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {5200#true} is VALID [2022-02-20 18:38:28,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {5200#true} assume !!(0 == main_~init__r121~0#1 % 256); {5200#true} is VALID [2022-02-20 18:38:28,140 INFO L290 TraceCheckUtils]: 3: Hoare triple {5200#true} assume !!(0 == main_~init__r131~0#1 % 256);main_~init__tmp~0#1 := 0; {5202#(= (+ (* (- 256) (div |ULTIMATE.start_main_~init__r131~0#1| 256)) |ULTIMATE.start_main_~init__r131~0#1|) 0)} is VALID [2022-02-20 18:38:28,141 INFO L290 TraceCheckUtils]: 4: Hoare triple {5202#(= (+ (* (- 256) (div |ULTIMATE.start_main_~init__r131~0#1| 256)) |ULTIMATE.start_main_~init__r131~0#1|) 0)} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {5202#(= (+ (* (- 256) (div |ULTIMATE.start_main_~init__r131~0#1| 256)) |ULTIMATE.start_main_~init__r131~0#1|) 0)} is VALID [2022-02-20 18:38:28,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {5202#(= (+ (* (- 256) (div |ULTIMATE.start_main_~init__r131~0#1| 256)) |ULTIMATE.start_main_~init__r131~0#1|) 0)} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {5201#false} is VALID [2022-02-20 18:38:28,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {5201#false} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {5201#false} is VALID [2022-02-20 18:38:28,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {5201#false} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {5201#false} is VALID [2022-02-20 18:38:28,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {5201#false} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {5201#false} is VALID [2022-02-20 18:38:28,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {5201#false} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {5201#false} is VALID [2022-02-20 18:38:28,142 INFO L290 TraceCheckUtils]: 10: Hoare triple {5201#false} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {5201#false} is VALID [2022-02-20 18:38:28,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {5201#false} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {5201#false} is VALID [2022-02-20 18:38:28,143 INFO L290 TraceCheckUtils]: 12: Hoare triple {5201#false} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {5201#false} is VALID [2022-02-20 18:38:28,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {5201#false} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {5201#false} is VALID [2022-02-20 18:38:28,143 INFO L290 TraceCheckUtils]: 14: Hoare triple {5201#false} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {5201#false} is VALID [2022-02-20 18:38:28,143 INFO L290 TraceCheckUtils]: 15: Hoare triple {5201#false} assume ~id1~0 != ~id2~0; {5201#false} is VALID [2022-02-20 18:38:28,143 INFO L290 TraceCheckUtils]: 16: Hoare triple {5201#false} assume ~id1~0 != ~id3~0; {5201#false} is VALID [2022-02-20 18:38:28,143 INFO L290 TraceCheckUtils]: 17: Hoare triple {5201#false} assume ~id2~0 != ~id3~0; {5201#false} is VALID [2022-02-20 18:38:28,144 INFO L290 TraceCheckUtils]: 18: Hoare triple {5201#false} assume ~id1~0 >= 0; {5201#false} is VALID [2022-02-20 18:38:28,144 INFO L290 TraceCheckUtils]: 19: Hoare triple {5201#false} assume ~id2~0 >= 0; {5201#false} is VALID [2022-02-20 18:38:28,144 INFO L290 TraceCheckUtils]: 20: Hoare triple {5201#false} assume ~id3~0 >= 0; {5201#false} is VALID [2022-02-20 18:38:28,144 INFO L290 TraceCheckUtils]: 21: Hoare triple {5201#false} assume 0 == ~r1~0; {5201#false} is VALID [2022-02-20 18:38:28,144 INFO L290 TraceCheckUtils]: 22: Hoare triple {5201#false} assume 0 == ~r2~0; {5201#false} is VALID [2022-02-20 18:38:28,144 INFO L290 TraceCheckUtils]: 23: Hoare triple {5201#false} assume 0 == ~r3~0; {5201#false} is VALID [2022-02-20 18:38:28,145 INFO L290 TraceCheckUtils]: 24: Hoare triple {5201#false} assume !(0 == main_~init__r122~0#1 % 256); {5201#false} is VALID [2022-02-20 18:38:28,145 INFO L290 TraceCheckUtils]: 25: Hoare triple {5201#false} assume !(0 == main_~init__r132~0#1 % 256); {5201#false} is VALID [2022-02-20 18:38:28,145 INFO L290 TraceCheckUtils]: 26: Hoare triple {5201#false} assume !(0 == main_~init__r212~0#1 % 256); {5201#false} is VALID [2022-02-20 18:38:28,145 INFO L290 TraceCheckUtils]: 27: Hoare triple {5201#false} assume !(0 == main_~init__r232~0#1 % 256); {5201#false} is VALID [2022-02-20 18:38:28,145 INFO L290 TraceCheckUtils]: 28: Hoare triple {5201#false} assume !(0 == main_~init__r312~0#1 % 256); {5201#false} is VALID [2022-02-20 18:38:28,145 INFO L290 TraceCheckUtils]: 29: Hoare triple {5201#false} assume !(0 == main_~init__r322~0#1 % 256); {5201#false} is VALID [2022-02-20 18:38:28,146 INFO L290 TraceCheckUtils]: 30: Hoare triple {5201#false} assume ~max1~0 == ~id1~0; {5201#false} is VALID [2022-02-20 18:38:28,146 INFO L290 TraceCheckUtils]: 31: Hoare triple {5201#false} assume ~max2~0 == ~id2~0; {5201#false} is VALID [2022-02-20 18:38:28,146 INFO L290 TraceCheckUtils]: 32: Hoare triple {5201#false} assume ~max3~0 == ~id3~0; {5201#false} is VALID [2022-02-20 18:38:28,146 INFO L290 TraceCheckUtils]: 33: Hoare triple {5201#false} assume 0 == ~st1~0; {5201#false} is VALID [2022-02-20 18:38:28,146 INFO L290 TraceCheckUtils]: 34: Hoare triple {5201#false} assume 0 == ~st2~0; {5201#false} is VALID [2022-02-20 18:38:28,146 INFO L290 TraceCheckUtils]: 35: Hoare triple {5201#false} assume 0 == ~st3~0; {5201#false} is VALID [2022-02-20 18:38:28,147 INFO L290 TraceCheckUtils]: 36: Hoare triple {5201#false} assume 0 == ~nl1~0; {5201#false} is VALID [2022-02-20 18:38:28,147 INFO L290 TraceCheckUtils]: 37: Hoare triple {5201#false} assume 0 == ~nl2~0; {5201#false} is VALID [2022-02-20 18:38:28,147 INFO L290 TraceCheckUtils]: 38: Hoare triple {5201#false} assume 0 == ~nl3~0; {5201#false} is VALID [2022-02-20 18:38:28,147 INFO L290 TraceCheckUtils]: 39: Hoare triple {5201#false} assume 0 == ~mode1~0 % 256; {5201#false} is VALID [2022-02-20 18:38:28,147 INFO L290 TraceCheckUtils]: 40: Hoare triple {5201#false} assume 0 == ~mode2~0 % 256; {5201#false} is VALID [2022-02-20 18:38:28,147 INFO L290 TraceCheckUtils]: 41: Hoare triple {5201#false} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1131~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1131~0; {5201#false} is VALID [2022-02-20 18:38:28,148 INFO L290 TraceCheckUtils]: 42: Hoare triple {5201#false} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {5201#false} is VALID [2022-02-20 18:38:28,148 INFO L290 TraceCheckUtils]: 43: Hoare triple {5201#false} assume main_~main__i2~0#1 < 6; {5201#false} is VALID [2022-02-20 18:38:28,148 INFO L290 TraceCheckUtils]: 44: Hoare triple {5201#false} assume !!(0 == ~mode1~0 % 256); {5201#false} is VALID [2022-02-20 18:38:28,148 INFO L290 TraceCheckUtils]: 45: Hoare triple {5201#false} assume ~r1~0 < 2; {5201#false} is VALID [2022-02-20 18:38:28,148 INFO L290 TraceCheckUtils]: 46: Hoare triple {5201#false} assume !!(0 == ~ep12~0 % 256); {5201#false} is VALID [2022-02-20 18:38:28,149 INFO L290 TraceCheckUtils]: 47: Hoare triple {5201#false} assume !!(0 == ~ep13~0 % 256); {5201#false} is VALID [2022-02-20 18:38:28,149 INFO L290 TraceCheckUtils]: 48: Hoare triple {5201#false} ~mode1~0 := 1; {5201#false} is VALID [2022-02-20 18:38:28,149 INFO L290 TraceCheckUtils]: 49: Hoare triple {5201#false} assume !!(0 == ~mode2~0 % 256); {5201#false} is VALID [2022-02-20 18:38:28,149 INFO L290 TraceCheckUtils]: 50: Hoare triple {5201#false} assume ~r2~0 < 2; {5201#false} is VALID [2022-02-20 18:38:28,149 INFO L290 TraceCheckUtils]: 51: Hoare triple {5201#false} assume !!(0 == ~ep21~0 % 256); {5201#false} is VALID [2022-02-20 18:38:28,149 INFO L290 TraceCheckUtils]: 52: Hoare triple {5201#false} assume !!(0 == ~ep23~0 % 256); {5201#false} is VALID [2022-02-20 18:38:28,150 INFO L290 TraceCheckUtils]: 53: Hoare triple {5201#false} ~mode2~0 := 1; {5201#false} is VALID [2022-02-20 18:38:28,150 INFO L290 TraceCheckUtils]: 54: Hoare triple {5201#false} assume !!(0 == ~mode3~0 % 256); {5201#false} is VALID [2022-02-20 18:38:28,150 INFO L290 TraceCheckUtils]: 55: Hoare triple {5201#false} assume ~r3~0 < 2; {5201#false} is VALID [2022-02-20 18:38:28,150 INFO L290 TraceCheckUtils]: 56: Hoare triple {5201#false} assume !!(0 == ~ep31~0 % 256); {5201#false} is VALID [2022-02-20 18:38:28,150 INFO L290 TraceCheckUtils]: 57: Hoare triple {5201#false} assume !!(0 == ~ep32~0 % 256); {5201#false} is VALID [2022-02-20 18:38:28,150 INFO L290 TraceCheckUtils]: 58: Hoare triple {5201#false} ~mode3~0 := 1;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {5201#false} is VALID [2022-02-20 18:38:28,151 INFO L290 TraceCheckUtils]: 59: Hoare triple {5201#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {5201#false} is VALID [2022-02-20 18:38:28,151 INFO L290 TraceCheckUtils]: 60: Hoare triple {5201#false} assume ~st1~0 + ~nl1~0 <= 1; {5201#false} is VALID [2022-02-20 18:38:28,151 INFO L290 TraceCheckUtils]: 61: Hoare triple {5201#false} assume ~st2~0 + ~nl2~0 <= 1; {5201#false} is VALID [2022-02-20 18:38:28,151 INFO L290 TraceCheckUtils]: 62: Hoare triple {5201#false} assume ~st3~0 + ~nl3~0 <= 1; {5201#false} is VALID [2022-02-20 18:38:28,151 INFO L290 TraceCheckUtils]: 63: Hoare triple {5201#false} assume !(~r1~0 >= 2); {5201#false} is VALID [2022-02-20 18:38:28,151 INFO L290 TraceCheckUtils]: 64: Hoare triple {5201#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {5201#false} is VALID [2022-02-20 18:38:28,152 INFO L290 TraceCheckUtils]: 65: Hoare triple {5201#false} assume ~r1~0 < 2; {5201#false} is VALID [2022-02-20 18:38:28,152 INFO L290 TraceCheckUtils]: 66: Hoare triple {5201#false} assume !(~r1~0 >= 2); {5201#false} is VALID [2022-02-20 18:38:28,152 INFO L290 TraceCheckUtils]: 67: Hoare triple {5201#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {5201#false} is VALID [2022-02-20 18:38:28,152 INFO L290 TraceCheckUtils]: 68: Hoare triple {5201#false} assume ~r1~0 < 2;main_~check__tmp~0#1 := 1;~__return_1259~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1259~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {5201#false} is VALID [2022-02-20 18:38:28,152 INFO L290 TraceCheckUtils]: 69: Hoare triple {5201#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {5201#false} is VALID [2022-02-20 18:38:28,152 INFO L290 TraceCheckUtils]: 70: Hoare triple {5201#false} assume main_~main__i2~0#1 < 6; {5201#false} is VALID [2022-02-20 18:38:28,153 INFO L290 TraceCheckUtils]: 71: Hoare triple {5201#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); {5201#false} is VALID [2022-02-20 18:38:28,153 INFO L290 TraceCheckUtils]: 72: Hoare triple {5201#false} assume !!(0 == ~ep21~0 % 256); {5201#false} is VALID [2022-02-20 18:38:28,153 INFO L290 TraceCheckUtils]: 73: Hoare triple {5201#false} assume !!(0 == ~ep31~0 % 256); {5201#false} is VALID [2022-02-20 18:38:28,153 INFO L290 TraceCheckUtils]: 74: Hoare triple {5201#false} assume 1 == ~r1~0; {5201#false} is VALID [2022-02-20 18:38:28,153 INFO L290 TraceCheckUtils]: 75: Hoare triple {5201#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {5201#false} is VALID [2022-02-20 18:38:28,153 INFO L290 TraceCheckUtils]: 76: Hoare triple {5201#false} ~mode1~0 := 0; {5201#false} is VALID [2022-02-20 18:38:28,154 INFO L290 TraceCheckUtils]: 77: Hoare triple {5201#false} assume !(0 == ~mode2~0 % 256);~r2~0 := (if (1 + ~r2~0) % 256 <= 127 then (1 + ~r2~0) % 256 else (1 + ~r2~0) % 256 - 256); {5201#false} is VALID [2022-02-20 18:38:28,154 INFO L290 TraceCheckUtils]: 78: Hoare triple {5201#false} assume !!(0 == ~ep12~0 % 256); {5201#false} is VALID [2022-02-20 18:38:28,154 INFO L290 TraceCheckUtils]: 79: Hoare triple {5201#false} assume !!(0 == ~ep32~0 % 256); {5201#false} is VALID [2022-02-20 18:38:28,154 INFO L290 TraceCheckUtils]: 80: Hoare triple {5201#false} assume !(2 == ~r2~0);~mode2~0 := 0; {5201#false} is VALID [2022-02-20 18:38:28,154 INFO L290 TraceCheckUtils]: 81: Hoare triple {5201#false} assume !(0 == ~mode3~0 % 256);~r3~0 := (if (1 + ~r3~0) % 256 <= 127 then (1 + ~r3~0) % 256 else (1 + ~r3~0) % 256 - 256); {5201#false} is VALID [2022-02-20 18:38:28,154 INFO L290 TraceCheckUtils]: 82: Hoare triple {5201#false} assume !!(0 == ~ep13~0 % 256); {5201#false} is VALID [2022-02-20 18:38:28,155 INFO L290 TraceCheckUtils]: 83: Hoare triple {5201#false} assume !!(0 == ~ep23~0 % 256); {5201#false} is VALID [2022-02-20 18:38:28,155 INFO L290 TraceCheckUtils]: 84: Hoare triple {5201#false} assume !(2 == ~r3~0);~mode3~0 := 0;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {5201#false} is VALID [2022-02-20 18:38:28,155 INFO L290 TraceCheckUtils]: 85: Hoare triple {5201#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {5201#false} is VALID [2022-02-20 18:38:28,155 INFO L290 TraceCheckUtils]: 86: Hoare triple {5201#false} assume ~st1~0 + ~nl1~0 <= 1; {5201#false} is VALID [2022-02-20 18:38:28,155 INFO L290 TraceCheckUtils]: 87: Hoare triple {5201#false} assume ~st2~0 + ~nl2~0 <= 1; {5201#false} is VALID [2022-02-20 18:38:28,156 INFO L290 TraceCheckUtils]: 88: Hoare triple {5201#false} assume ~st3~0 + ~nl3~0 <= 1; {5201#false} is VALID [2022-02-20 18:38:28,156 INFO L290 TraceCheckUtils]: 89: Hoare triple {5201#false} assume !(~r1~0 >= 2); {5201#false} is VALID [2022-02-20 18:38:28,156 INFO L290 TraceCheckUtils]: 90: Hoare triple {5201#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {5201#false} is VALID [2022-02-20 18:38:28,156 INFO L290 TraceCheckUtils]: 91: Hoare triple {5201#false} ~__return_1378~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1378~0;~__tmp_1379_0~0 := main_~main____CPAchecker_TMP_0~0#1; {5201#false} is VALID [2022-02-20 18:38:28,156 INFO L290 TraceCheckUtils]: 92: Hoare triple {5201#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1379_0~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {5201#false} is VALID [2022-02-20 18:38:28,156 INFO L290 TraceCheckUtils]: 93: Hoare triple {5201#false} assume 0 == main_~assert__arg~1#1 % 256; {5201#false} is VALID [2022-02-20 18:38:28,157 INFO L290 TraceCheckUtils]: 94: Hoare triple {5201#false} assume !false; {5201#false} is VALID [2022-02-20 18:38:28,157 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:38:28,157 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:28,157 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272641609] [2022-02-20 18:38:28,158 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272641609] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:28,158 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:28,158 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:38:28,158 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202970205] [2022-02-20 18:38:28,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:28,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2022-02-20 18:38:28,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:28,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:28,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:28,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:38:28,221 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:28,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:38:28,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:38:28,222 INFO L87 Difference]: Start difference. First operand 614 states and 930 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:29,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:29,118 INFO L93 Difference]: Finished difference Result 1804 states and 2728 transitions. [2022-02-20 18:38:29,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:38:29,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2022-02-20 18:38:29,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:29,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:29,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 930 transitions. [2022-02-20 18:38:29,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:29,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 930 transitions. [2022-02-20 18:38:29,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 930 transitions. [2022-02-20 18:38:29,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 930 edges. 930 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:29,827 INFO L225 Difference]: With dead ends: 1804 [2022-02-20 18:38:29,827 INFO L226 Difference]: Without dead ends: 1218 [2022-02-20 18:38:29,828 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:38:29,829 INFO L933 BasicCegarLoop]: 624 mSDtfsCounter, 308 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:38:29,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [308 Valid, 934 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:29,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2022-02-20 18:38:29,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 616. [2022-02-20 18:38:29,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:29,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1218 states. Second operand has 616 states, 615 states have (on average 1.5154471544715447) internal successors, (932), 615 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:29,930 INFO L74 IsIncluded]: Start isIncluded. First operand 1218 states. Second operand has 616 states, 615 states have (on average 1.5154471544715447) internal successors, (932), 615 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:29,931 INFO L87 Difference]: Start difference. First operand 1218 states. Second operand has 616 states, 615 states have (on average 1.5154471544715447) internal successors, (932), 615 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:29,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:29,994 INFO L93 Difference]: Finished difference Result 1218 states and 1843 transitions. [2022-02-20 18:38:29,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1843 transitions. [2022-02-20 18:38:29,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:29,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:29,998 INFO L74 IsIncluded]: Start isIncluded. First operand has 616 states, 615 states have (on average 1.5154471544715447) internal successors, (932), 615 states have internal predecessors, (932), 0 states have call successors, (0), 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 1218 states. [2022-02-20 18:38:29,999 INFO L87 Difference]: Start difference. First operand has 616 states, 615 states have (on average 1.5154471544715447) internal successors, (932), 615 states have internal predecessors, (932), 0 states have call successors, (0), 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 1218 states. [2022-02-20 18:38:30,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:30,059 INFO L93 Difference]: Finished difference Result 1218 states and 1843 transitions. [2022-02-20 18:38:30,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1843 transitions. [2022-02-20 18:38:30,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:30,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:30,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:30,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:30,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 615 states have (on average 1.5154471544715447) internal successors, (932), 615 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:30,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 932 transitions. [2022-02-20 18:38:30,085 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 932 transitions. Word has length 95 [2022-02-20 18:38:30,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:30,086 INFO L470 AbstractCegarLoop]: Abstraction has 616 states and 932 transitions. [2022-02-20 18:38:30,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:30,086 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 932 transitions. [2022-02-20 18:38:30,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-02-20 18:38:30,087 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:30,088 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:30,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:38:30,088 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:30,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:30,089 INFO L85 PathProgramCache]: Analyzing trace with hash 852300571, now seen corresponding path program 1 times [2022-02-20 18:38:30,089 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:30,089 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404451461] [2022-02-20 18:38:30,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:30,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:30,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:30,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {10911#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(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1131~0 := 0;~__return_1259~0 := 0;~__return_1378~0 := 0;~__tmp_1379_0~0 := 0;~__return_1487~0 := 0;~__return_1392~0 := 0; {10911#true} is VALID [2022-02-20 18:38:30,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {10911#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~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;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {10911#true} is VALID [2022-02-20 18:38:30,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {10911#true} assume !!(0 == main_~init__r121~0#1 % 256); {10911#true} is VALID [2022-02-20 18:38:30,185 INFO L290 TraceCheckUtils]: 3: Hoare triple {10911#true} assume !(0 == main_~init__r131~0#1 % 256); {10911#true} is VALID [2022-02-20 18:38:30,185 INFO L290 TraceCheckUtils]: 4: Hoare triple {10911#true} assume !(0 == ~ep32~0 % 256);main_~init__tmp~0#1 := 1; {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,187 INFO L290 TraceCheckUtils]: 8: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,188 INFO L290 TraceCheckUtils]: 10: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,189 INFO L290 TraceCheckUtils]: 11: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,189 INFO L290 TraceCheckUtils]: 12: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,191 INFO L290 TraceCheckUtils]: 15: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,191 INFO L290 TraceCheckUtils]: 16: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~id1~0 != ~id2~0; {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,192 INFO L290 TraceCheckUtils]: 17: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~id1~0 != ~id3~0; {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,192 INFO L290 TraceCheckUtils]: 18: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~id2~0 != ~id3~0; {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,192 INFO L290 TraceCheckUtils]: 19: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~id1~0 >= 0; {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,193 INFO L290 TraceCheckUtils]: 20: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~id2~0 >= 0; {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,193 INFO L290 TraceCheckUtils]: 21: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~id3~0 >= 0; {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,195 INFO L290 TraceCheckUtils]: 22: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~r1~0; {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,196 INFO L290 TraceCheckUtils]: 23: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~r2~0; {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,196 INFO L290 TraceCheckUtils]: 24: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~r3~0; {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,197 INFO L290 TraceCheckUtils]: 25: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r122~0#1 % 256); {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,197 INFO L290 TraceCheckUtils]: 26: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r132~0#1 % 256); {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,197 INFO L290 TraceCheckUtils]: 27: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r212~0#1 % 256); {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,198 INFO L290 TraceCheckUtils]: 28: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r232~0#1 % 256); {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,198 INFO L290 TraceCheckUtils]: 29: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r312~0#1 % 256); {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,199 INFO L290 TraceCheckUtils]: 30: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r322~0#1 % 256); {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,199 INFO L290 TraceCheckUtils]: 31: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~max1~0 == ~id1~0; {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,200 INFO L290 TraceCheckUtils]: 32: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~max2~0 == ~id2~0; {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,200 INFO L290 TraceCheckUtils]: 33: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~max3~0 == ~id3~0; {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,201 INFO L290 TraceCheckUtils]: 34: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~st1~0; {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,201 INFO L290 TraceCheckUtils]: 35: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~st2~0; {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,202 INFO L290 TraceCheckUtils]: 36: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~st3~0; {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,202 INFO L290 TraceCheckUtils]: 37: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~nl1~0; {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,202 INFO L290 TraceCheckUtils]: 38: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~nl2~0; {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,203 INFO L290 TraceCheckUtils]: 39: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~nl3~0; {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,203 INFO L290 TraceCheckUtils]: 40: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~mode1~0 % 256; {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,204 INFO L290 TraceCheckUtils]: 41: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~mode2~0 % 256; {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,204 INFO L290 TraceCheckUtils]: 42: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1131~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1131~0; {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,218 INFO L290 TraceCheckUtils]: 43: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,219 INFO L290 TraceCheckUtils]: 44: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume main_~main__i2~0#1 < 6; {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,222 INFO L290 TraceCheckUtils]: 45: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !!(0 == ~mode1~0 % 256); {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,222 INFO L290 TraceCheckUtils]: 46: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~r1~0 < 2; {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,223 INFO L290 TraceCheckUtils]: 47: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !!(0 == ~ep12~0 % 256); {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,223 INFO L290 TraceCheckUtils]: 48: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !!(0 == ~ep13~0 % 256); {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,224 INFO L290 TraceCheckUtils]: 49: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} ~mode1~0 := 1; {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,224 INFO L290 TraceCheckUtils]: 50: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !!(0 == ~mode2~0 % 256); {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,225 INFO L290 TraceCheckUtils]: 51: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~r2~0 < 2; {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,225 INFO L290 TraceCheckUtils]: 52: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !!(0 == ~ep21~0 % 256); {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,226 INFO L290 TraceCheckUtils]: 53: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !!(0 == ~ep23~0 % 256); {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,226 INFO L290 TraceCheckUtils]: 54: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} ~mode2~0 := 1; {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,227 INFO L290 TraceCheckUtils]: 55: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !!(0 == ~mode3~0 % 256); {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,227 INFO L290 TraceCheckUtils]: 56: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~r3~0 < 2; {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,228 INFO L290 TraceCheckUtils]: 57: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !!(0 == ~ep31~0 % 256); {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:30,233 INFO L290 TraceCheckUtils]: 58: Hoare triple {10913#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !!(0 == ~ep32~0 % 256); {10912#false} is VALID [2022-02-20 18:38:30,234 INFO L290 TraceCheckUtils]: 59: Hoare triple {10912#false} ~mode3~0 := 1;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {10912#false} is VALID [2022-02-20 18:38:30,234 INFO L290 TraceCheckUtils]: 60: Hoare triple {10912#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {10912#false} is VALID [2022-02-20 18:38:30,234 INFO L290 TraceCheckUtils]: 61: Hoare triple {10912#false} assume ~st1~0 + ~nl1~0 <= 1; {10912#false} is VALID [2022-02-20 18:38:30,234 INFO L290 TraceCheckUtils]: 62: Hoare triple {10912#false} assume ~st2~0 + ~nl2~0 <= 1; {10912#false} is VALID [2022-02-20 18:38:30,234 INFO L290 TraceCheckUtils]: 63: Hoare triple {10912#false} assume ~st3~0 + ~nl3~0 <= 1; {10912#false} is VALID [2022-02-20 18:38:30,235 INFO L290 TraceCheckUtils]: 64: Hoare triple {10912#false} assume !(~r1~0 >= 2); {10912#false} is VALID [2022-02-20 18:38:30,235 INFO L290 TraceCheckUtils]: 65: Hoare triple {10912#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {10912#false} is VALID [2022-02-20 18:38:30,235 INFO L290 TraceCheckUtils]: 66: Hoare triple {10912#false} assume ~r1~0 < 2; {10912#false} is VALID [2022-02-20 18:38:30,235 INFO L290 TraceCheckUtils]: 67: Hoare triple {10912#false} assume !(~r1~0 >= 2); {10912#false} is VALID [2022-02-20 18:38:30,235 INFO L290 TraceCheckUtils]: 68: Hoare triple {10912#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {10912#false} is VALID [2022-02-20 18:38:30,235 INFO L290 TraceCheckUtils]: 69: Hoare triple {10912#false} assume ~r1~0 < 2;main_~check__tmp~0#1 := 1;~__return_1259~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1259~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {10912#false} is VALID [2022-02-20 18:38:30,236 INFO L290 TraceCheckUtils]: 70: Hoare triple {10912#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {10912#false} is VALID [2022-02-20 18:38:30,236 INFO L290 TraceCheckUtils]: 71: Hoare triple {10912#false} assume main_~main__i2~0#1 < 6; {10912#false} is VALID [2022-02-20 18:38:30,236 INFO L290 TraceCheckUtils]: 72: Hoare triple {10912#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); {10912#false} is VALID [2022-02-20 18:38:30,236 INFO L290 TraceCheckUtils]: 73: Hoare triple {10912#false} assume !!(0 == ~ep21~0 % 256); {10912#false} is VALID [2022-02-20 18:38:30,236 INFO L290 TraceCheckUtils]: 74: Hoare triple {10912#false} assume !!(0 == ~ep31~0 % 256); {10912#false} is VALID [2022-02-20 18:38:30,236 INFO L290 TraceCheckUtils]: 75: Hoare triple {10912#false} assume 1 == ~r1~0; {10912#false} is VALID [2022-02-20 18:38:30,237 INFO L290 TraceCheckUtils]: 76: Hoare triple {10912#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {10912#false} is VALID [2022-02-20 18:38:30,237 INFO L290 TraceCheckUtils]: 77: Hoare triple {10912#false} ~mode1~0 := 0; {10912#false} is VALID [2022-02-20 18:38:30,237 INFO L290 TraceCheckUtils]: 78: Hoare triple {10912#false} assume !(0 == ~mode2~0 % 256);~r2~0 := (if (1 + ~r2~0) % 256 <= 127 then (1 + ~r2~0) % 256 else (1 + ~r2~0) % 256 - 256); {10912#false} is VALID [2022-02-20 18:38:30,237 INFO L290 TraceCheckUtils]: 79: Hoare triple {10912#false} assume !!(0 == ~ep12~0 % 256); {10912#false} is VALID [2022-02-20 18:38:30,237 INFO L290 TraceCheckUtils]: 80: Hoare triple {10912#false} assume !!(0 == ~ep32~0 % 256); {10912#false} is VALID [2022-02-20 18:38:30,238 INFO L290 TraceCheckUtils]: 81: Hoare triple {10912#false} assume !(2 == ~r2~0);~mode2~0 := 0; {10912#false} is VALID [2022-02-20 18:38:30,238 INFO L290 TraceCheckUtils]: 82: Hoare triple {10912#false} assume !(0 == ~mode3~0 % 256);~r3~0 := (if (1 + ~r3~0) % 256 <= 127 then (1 + ~r3~0) % 256 else (1 + ~r3~0) % 256 - 256); {10912#false} is VALID [2022-02-20 18:38:30,238 INFO L290 TraceCheckUtils]: 83: Hoare triple {10912#false} assume !!(0 == ~ep13~0 % 256); {10912#false} is VALID [2022-02-20 18:38:30,238 INFO L290 TraceCheckUtils]: 84: Hoare triple {10912#false} assume !!(0 == ~ep23~0 % 256); {10912#false} is VALID [2022-02-20 18:38:30,238 INFO L290 TraceCheckUtils]: 85: Hoare triple {10912#false} assume !(2 == ~r3~0);~mode3~0 := 0;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {10912#false} is VALID [2022-02-20 18:38:30,238 INFO L290 TraceCheckUtils]: 86: Hoare triple {10912#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {10912#false} is VALID [2022-02-20 18:38:30,239 INFO L290 TraceCheckUtils]: 87: Hoare triple {10912#false} assume ~st1~0 + ~nl1~0 <= 1; {10912#false} is VALID [2022-02-20 18:38:30,239 INFO L290 TraceCheckUtils]: 88: Hoare triple {10912#false} assume ~st2~0 + ~nl2~0 <= 1; {10912#false} is VALID [2022-02-20 18:38:30,239 INFO L290 TraceCheckUtils]: 89: Hoare triple {10912#false} assume ~st3~0 + ~nl3~0 <= 1; {10912#false} is VALID [2022-02-20 18:38:30,239 INFO L290 TraceCheckUtils]: 90: Hoare triple {10912#false} assume !(~r1~0 >= 2); {10912#false} is VALID [2022-02-20 18:38:30,239 INFO L290 TraceCheckUtils]: 91: Hoare triple {10912#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {10912#false} is VALID [2022-02-20 18:38:30,240 INFO L290 TraceCheckUtils]: 92: Hoare triple {10912#false} ~__return_1378~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1378~0;~__tmp_1379_0~0 := main_~main____CPAchecker_TMP_0~0#1; {10912#false} is VALID [2022-02-20 18:38:30,240 INFO L290 TraceCheckUtils]: 93: Hoare triple {10912#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1379_0~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {10912#false} is VALID [2022-02-20 18:38:30,243 INFO L290 TraceCheckUtils]: 94: Hoare triple {10912#false} assume 0 == main_~assert__arg~1#1 % 256; {10912#false} is VALID [2022-02-20 18:38:30,244 INFO L290 TraceCheckUtils]: 95: Hoare triple {10912#false} assume !false; {10912#false} is VALID [2022-02-20 18:38:30,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:38:30,246 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:30,246 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404451461] [2022-02-20 18:38:30,246 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404451461] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:30,246 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:30,246 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:38:30,247 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791004493] [2022-02-20 18:38:30,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:30,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-02-20 18:38:30,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:30,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:30,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:30,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:38:30,323 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:30,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:38:30,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:38:30,324 INFO L87 Difference]: Start difference. First operand 616 states and 932 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:31,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:31,199 INFO L93 Difference]: Finished difference Result 1628 states and 2489 transitions. [2022-02-20 18:38:31,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:38:31,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-02-20 18:38:31,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:31,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:31,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 804 transitions. [2022-02-20 18:38:31,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:31,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 804 transitions. [2022-02-20 18:38:31,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 804 transitions. [2022-02-20 18:38:31,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 804 edges. 804 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:31,873 INFO L225 Difference]: With dead ends: 1628 [2022-02-20 18:38:31,874 INFO L226 Difference]: Without dead ends: 1190 [2022-02-20 18:38:31,875 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:38:31,876 INFO L933 BasicCegarLoop]: 565 mSDtfsCounter, 251 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:38:31,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [251 Valid, 856 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:31,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2022-02-20 18:38:32,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1188. [2022-02-20 18:38:32,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:32,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1190 states. Second operand has 1188 states, 1187 states have (on average 1.502106149957877) internal successors, (1783), 1187 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:32,088 INFO L74 IsIncluded]: Start isIncluded. First operand 1190 states. Second operand has 1188 states, 1187 states have (on average 1.502106149957877) internal successors, (1783), 1187 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:32,090 INFO L87 Difference]: Start difference. First operand 1190 states. Second operand has 1188 states, 1187 states have (on average 1.502106149957877) internal successors, (1783), 1187 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:32,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:32,151 INFO L93 Difference]: Finished difference Result 1190 states and 1784 transitions. [2022-02-20 18:38:32,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1784 transitions. [2022-02-20 18:38:32,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:32,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:32,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 1188 states, 1187 states have (on average 1.502106149957877) internal successors, (1783), 1187 states have internal predecessors, (1783), 0 states have call successors, (0), 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 1190 states. [2022-02-20 18:38:32,159 INFO L87 Difference]: Start difference. First operand has 1188 states, 1187 states have (on average 1.502106149957877) internal successors, (1783), 1187 states have internal predecessors, (1783), 0 states have call successors, (0), 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 1190 states. [2022-02-20 18:38:32,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:32,222 INFO L93 Difference]: Finished difference Result 1190 states and 1784 transitions. [2022-02-20 18:38:32,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1784 transitions. [2022-02-20 18:38:32,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:32,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:32,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:32,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:32,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1188 states, 1187 states have (on average 1.502106149957877) internal successors, (1783), 1187 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:32,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1783 transitions. [2022-02-20 18:38:32,309 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1783 transitions. Word has length 96 [2022-02-20 18:38:32,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:32,309 INFO L470 AbstractCegarLoop]: Abstraction has 1188 states and 1783 transitions. [2022-02-20 18:38:32,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:32,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1783 transitions. [2022-02-20 18:38:32,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-02-20 18:38:32,313 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:32,313 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:32,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:38:32,314 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:32,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:32,314 INFO L85 PathProgramCache]: Analyzing trace with hash 809550136, now seen corresponding path program 1 times [2022-02-20 18:38:32,314 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:32,315 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435091183] [2022-02-20 18:38:32,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:32,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:32,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {17114#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(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1131~0 := 0;~__return_1259~0 := 0;~__return_1378~0 := 0;~__tmp_1379_0~0 := 0;~__return_1487~0 := 0;~__return_1392~0 := 0; {17114#true} is VALID [2022-02-20 18:38:32,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {17114#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~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;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {17116#(= (+ (* (- 1) ~ep13~0) |ULTIMATE.start_main_~init__r131~0#1|) 0)} is VALID [2022-02-20 18:38:32,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {17116#(= (+ (* (- 1) ~ep13~0) |ULTIMATE.start_main_~init__r131~0#1|) 0)} assume !!(0 == main_~init__r121~0#1 % 256); {17116#(= (+ (* (- 1) ~ep13~0) |ULTIMATE.start_main_~init__r131~0#1|) 0)} is VALID [2022-02-20 18:38:32,487 INFO L290 TraceCheckUtils]: 3: Hoare triple {17116#(= (+ (* (- 1) ~ep13~0) |ULTIMATE.start_main_~init__r131~0#1|) 0)} assume !(0 == main_~init__r131~0#1 % 256); {17117#(and (< (* 256 (div |ULTIMATE.start_main_~init__r131~0#1| 256)) |ULTIMATE.start_main_~init__r131~0#1|) (= ~ep13~0 |ULTIMATE.start_main_~init__r131~0#1|))} is VALID [2022-02-20 18:38:32,488 INFO L290 TraceCheckUtils]: 4: Hoare triple {17117#(and (< (* 256 (div |ULTIMATE.start_main_~init__r131~0#1| 256)) |ULTIMATE.start_main_~init__r131~0#1|) (= ~ep13~0 |ULTIMATE.start_main_~init__r131~0#1|))} assume !!(0 == ~ep32~0 % 256);main_~init__tmp~0#1 := 0; {17117#(and (< (* 256 (div |ULTIMATE.start_main_~init__r131~0#1| 256)) |ULTIMATE.start_main_~init__r131~0#1|) (= ~ep13~0 |ULTIMATE.start_main_~init__r131~0#1|))} is VALID [2022-02-20 18:38:32,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {17117#(and (< (* 256 (div |ULTIMATE.start_main_~init__r131~0#1| 256)) |ULTIMATE.start_main_~init__r131~0#1|) (= ~ep13~0 |ULTIMATE.start_main_~init__r131~0#1|))} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {17117#(and (< (* 256 (div |ULTIMATE.start_main_~init__r131~0#1| 256)) |ULTIMATE.start_main_~init__r131~0#1|) (= ~ep13~0 |ULTIMATE.start_main_~init__r131~0#1|))} is VALID [2022-02-20 18:38:32,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {17117#(and (< (* 256 (div |ULTIMATE.start_main_~init__r131~0#1| 256)) |ULTIMATE.start_main_~init__r131~0#1|) (= ~ep13~0 |ULTIMATE.start_main_~init__r131~0#1|))} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,490 INFO L290 TraceCheckUtils]: 10: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,492 INFO L290 TraceCheckUtils]: 13: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,492 INFO L290 TraceCheckUtils]: 15: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~id1~0 != ~id2~0; {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,493 INFO L290 TraceCheckUtils]: 17: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~id1~0 != ~id3~0; {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,493 INFO L290 TraceCheckUtils]: 18: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~id2~0 != ~id3~0; {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,494 INFO L290 TraceCheckUtils]: 19: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~id1~0 >= 0; {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,494 INFO L290 TraceCheckUtils]: 20: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~id2~0 >= 0; {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,494 INFO L290 TraceCheckUtils]: 21: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~id3~0 >= 0; {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,495 INFO L290 TraceCheckUtils]: 22: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~r1~0; {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,495 INFO L290 TraceCheckUtils]: 23: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~r2~0; {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~r3~0; {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,496 INFO L290 TraceCheckUtils]: 25: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r122~0#1 % 256); {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,496 INFO L290 TraceCheckUtils]: 26: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r132~0#1 % 256); {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,496 INFO L290 TraceCheckUtils]: 27: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r212~0#1 % 256); {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,497 INFO L290 TraceCheckUtils]: 28: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r232~0#1 % 256); {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,497 INFO L290 TraceCheckUtils]: 29: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r312~0#1 % 256); {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,497 INFO L290 TraceCheckUtils]: 30: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r322~0#1 % 256); {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,498 INFO L290 TraceCheckUtils]: 31: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~max1~0 == ~id1~0; {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,498 INFO L290 TraceCheckUtils]: 32: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~max2~0 == ~id2~0; {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,498 INFO L290 TraceCheckUtils]: 33: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~max3~0 == ~id3~0; {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,499 INFO L290 TraceCheckUtils]: 34: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~st1~0; {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,499 INFO L290 TraceCheckUtils]: 35: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~st2~0; {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,499 INFO L290 TraceCheckUtils]: 36: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~st3~0; {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,500 INFO L290 TraceCheckUtils]: 37: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~nl1~0; {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,500 INFO L290 TraceCheckUtils]: 38: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~nl2~0; {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,500 INFO L290 TraceCheckUtils]: 39: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~nl3~0; {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,501 INFO L290 TraceCheckUtils]: 40: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~mode1~0 % 256; {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,501 INFO L290 TraceCheckUtils]: 41: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~mode2~0 % 256; {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,501 INFO L290 TraceCheckUtils]: 42: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1131~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1131~0; {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,502 INFO L290 TraceCheckUtils]: 43: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,502 INFO L290 TraceCheckUtils]: 44: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume main_~main__i2~0#1 < 6; {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,502 INFO L290 TraceCheckUtils]: 45: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !!(0 == ~mode1~0 % 256); {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,503 INFO L290 TraceCheckUtils]: 46: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~r1~0 < 2; {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,503 INFO L290 TraceCheckUtils]: 47: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !!(0 == ~ep12~0 % 256); {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:32,504 INFO L290 TraceCheckUtils]: 48: Hoare triple {17118#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !!(0 == ~ep13~0 % 256); {17115#false} is VALID [2022-02-20 18:38:32,504 INFO L290 TraceCheckUtils]: 49: Hoare triple {17115#false} ~mode1~0 := 1; {17115#false} is VALID [2022-02-20 18:38:32,504 INFO L290 TraceCheckUtils]: 50: Hoare triple {17115#false} assume !!(0 == ~mode2~0 % 256); {17115#false} is VALID [2022-02-20 18:38:32,504 INFO L290 TraceCheckUtils]: 51: Hoare triple {17115#false} assume ~r2~0 < 2; {17115#false} is VALID [2022-02-20 18:38:32,504 INFO L290 TraceCheckUtils]: 52: Hoare triple {17115#false} assume !!(0 == ~ep21~0 % 256); {17115#false} is VALID [2022-02-20 18:38:32,504 INFO L290 TraceCheckUtils]: 53: Hoare triple {17115#false} assume !!(0 == ~ep23~0 % 256); {17115#false} is VALID [2022-02-20 18:38:32,504 INFO L290 TraceCheckUtils]: 54: Hoare triple {17115#false} ~mode2~0 := 1; {17115#false} is VALID [2022-02-20 18:38:32,505 INFO L290 TraceCheckUtils]: 55: Hoare triple {17115#false} assume !!(0 == ~mode3~0 % 256); {17115#false} is VALID [2022-02-20 18:38:32,505 INFO L290 TraceCheckUtils]: 56: Hoare triple {17115#false} assume ~r3~0 < 2; {17115#false} is VALID [2022-02-20 18:38:32,505 INFO L290 TraceCheckUtils]: 57: Hoare triple {17115#false} assume !!(0 == ~ep31~0 % 256); {17115#false} is VALID [2022-02-20 18:38:32,505 INFO L290 TraceCheckUtils]: 58: Hoare triple {17115#false} assume !!(0 == ~ep32~0 % 256); {17115#false} is VALID [2022-02-20 18:38:32,505 INFO L290 TraceCheckUtils]: 59: Hoare triple {17115#false} ~mode3~0 := 1;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {17115#false} is VALID [2022-02-20 18:38:32,505 INFO L290 TraceCheckUtils]: 60: Hoare triple {17115#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {17115#false} is VALID [2022-02-20 18:38:32,505 INFO L290 TraceCheckUtils]: 61: Hoare triple {17115#false} assume ~st1~0 + ~nl1~0 <= 1; {17115#false} is VALID [2022-02-20 18:38:32,506 INFO L290 TraceCheckUtils]: 62: Hoare triple {17115#false} assume ~st2~0 + ~nl2~0 <= 1; {17115#false} is VALID [2022-02-20 18:38:32,506 INFO L290 TraceCheckUtils]: 63: Hoare triple {17115#false} assume ~st3~0 + ~nl3~0 <= 1; {17115#false} is VALID [2022-02-20 18:38:32,506 INFO L290 TraceCheckUtils]: 64: Hoare triple {17115#false} assume !(~r1~0 >= 2); {17115#false} is VALID [2022-02-20 18:38:32,506 INFO L290 TraceCheckUtils]: 65: Hoare triple {17115#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {17115#false} is VALID [2022-02-20 18:38:32,506 INFO L290 TraceCheckUtils]: 66: Hoare triple {17115#false} assume ~r1~0 < 2; {17115#false} is VALID [2022-02-20 18:38:32,506 INFO L290 TraceCheckUtils]: 67: Hoare triple {17115#false} assume !(~r1~0 >= 2); {17115#false} is VALID [2022-02-20 18:38:32,506 INFO L290 TraceCheckUtils]: 68: Hoare triple {17115#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {17115#false} is VALID [2022-02-20 18:38:32,507 INFO L290 TraceCheckUtils]: 69: Hoare triple {17115#false} assume ~r1~0 < 2;main_~check__tmp~0#1 := 1;~__return_1259~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1259~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {17115#false} is VALID [2022-02-20 18:38:32,507 INFO L290 TraceCheckUtils]: 70: Hoare triple {17115#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {17115#false} is VALID [2022-02-20 18:38:32,507 INFO L290 TraceCheckUtils]: 71: Hoare triple {17115#false} assume main_~main__i2~0#1 < 6; {17115#false} is VALID [2022-02-20 18:38:32,507 INFO L290 TraceCheckUtils]: 72: Hoare triple {17115#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); {17115#false} is VALID [2022-02-20 18:38:32,507 INFO L290 TraceCheckUtils]: 73: Hoare triple {17115#false} assume !!(0 == ~ep21~0 % 256); {17115#false} is VALID [2022-02-20 18:38:32,507 INFO L290 TraceCheckUtils]: 74: Hoare triple {17115#false} assume !!(0 == ~ep31~0 % 256); {17115#false} is VALID [2022-02-20 18:38:32,508 INFO L290 TraceCheckUtils]: 75: Hoare triple {17115#false} assume 1 == ~r1~0; {17115#false} is VALID [2022-02-20 18:38:32,508 INFO L290 TraceCheckUtils]: 76: Hoare triple {17115#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {17115#false} is VALID [2022-02-20 18:38:32,508 INFO L290 TraceCheckUtils]: 77: Hoare triple {17115#false} ~mode1~0 := 0; {17115#false} is VALID [2022-02-20 18:38:32,508 INFO L290 TraceCheckUtils]: 78: Hoare triple {17115#false} assume !(0 == ~mode2~0 % 256);~r2~0 := (if (1 + ~r2~0) % 256 <= 127 then (1 + ~r2~0) % 256 else (1 + ~r2~0) % 256 - 256); {17115#false} is VALID [2022-02-20 18:38:32,508 INFO L290 TraceCheckUtils]: 79: Hoare triple {17115#false} assume !!(0 == ~ep12~0 % 256); {17115#false} is VALID [2022-02-20 18:38:32,508 INFO L290 TraceCheckUtils]: 80: Hoare triple {17115#false} assume !!(0 == ~ep32~0 % 256); {17115#false} is VALID [2022-02-20 18:38:32,508 INFO L290 TraceCheckUtils]: 81: Hoare triple {17115#false} assume !(2 == ~r2~0);~mode2~0 := 0; {17115#false} is VALID [2022-02-20 18:38:32,508 INFO L290 TraceCheckUtils]: 82: Hoare triple {17115#false} assume !(0 == ~mode3~0 % 256);~r3~0 := (if (1 + ~r3~0) % 256 <= 127 then (1 + ~r3~0) % 256 else (1 + ~r3~0) % 256 - 256); {17115#false} is VALID [2022-02-20 18:38:32,509 INFO L290 TraceCheckUtils]: 83: Hoare triple {17115#false} assume !!(0 == ~ep13~0 % 256); {17115#false} is VALID [2022-02-20 18:38:32,509 INFO L290 TraceCheckUtils]: 84: Hoare triple {17115#false} assume !!(0 == ~ep23~0 % 256); {17115#false} is VALID [2022-02-20 18:38:32,509 INFO L290 TraceCheckUtils]: 85: Hoare triple {17115#false} assume !(2 == ~r3~0);~mode3~0 := 0;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {17115#false} is VALID [2022-02-20 18:38:32,509 INFO L290 TraceCheckUtils]: 86: Hoare triple {17115#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {17115#false} is VALID [2022-02-20 18:38:32,509 INFO L290 TraceCheckUtils]: 87: Hoare triple {17115#false} assume ~st1~0 + ~nl1~0 <= 1; {17115#false} is VALID [2022-02-20 18:38:32,509 INFO L290 TraceCheckUtils]: 88: Hoare triple {17115#false} assume ~st2~0 + ~nl2~0 <= 1; {17115#false} is VALID [2022-02-20 18:38:32,509 INFO L290 TraceCheckUtils]: 89: Hoare triple {17115#false} assume ~st3~0 + ~nl3~0 <= 1; {17115#false} is VALID [2022-02-20 18:38:32,510 INFO L290 TraceCheckUtils]: 90: Hoare triple {17115#false} assume !(~r1~0 >= 2); {17115#false} is VALID [2022-02-20 18:38:32,510 INFO L290 TraceCheckUtils]: 91: Hoare triple {17115#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {17115#false} is VALID [2022-02-20 18:38:32,510 INFO L290 TraceCheckUtils]: 92: Hoare triple {17115#false} ~__return_1378~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1378~0;~__tmp_1379_0~0 := main_~main____CPAchecker_TMP_0~0#1; {17115#false} is VALID [2022-02-20 18:38:32,510 INFO L290 TraceCheckUtils]: 93: Hoare triple {17115#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1379_0~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {17115#false} is VALID [2022-02-20 18:38:32,510 INFO L290 TraceCheckUtils]: 94: Hoare triple {17115#false} assume 0 == main_~assert__arg~1#1 % 256; {17115#false} is VALID [2022-02-20 18:38:32,510 INFO L290 TraceCheckUtils]: 95: Hoare triple {17115#false} assume !false; {17115#false} is VALID [2022-02-20 18:38:32,511 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:38:32,511 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:32,511 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435091183] [2022-02-20 18:38:32,511 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435091183] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:32,511 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:32,511 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:38:32,512 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474117065] [2022-02-20 18:38:32,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:32,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-02-20 18:38:32,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:32,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:32,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:32,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:38:32,584 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:32,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:38:32,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:38:32,585 INFO L87 Difference]: Start difference. First operand 1188 states and 1783 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:34,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:34,515 INFO L93 Difference]: Finished difference Result 3302 states and 4972 transitions. [2022-02-20 18:38:34,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:38:34,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-02-20 18:38:34,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:34,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:34,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 918 transitions. [2022-02-20 18:38:34,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:34,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 918 transitions. [2022-02-20 18:38:34,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 918 transitions. [2022-02-20 18:38:35,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 918 edges. 918 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:35,340 INFO L225 Difference]: With dead ends: 3302 [2022-02-20 18:38:35,340 INFO L226 Difference]: Without dead ends: 2128 [2022-02-20 18:38:35,342 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:38:35,344 INFO L933 BasicCegarLoop]: 518 mSDtfsCounter, 848 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:38:35,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [848 Valid, 803 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:35,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2128 states. [2022-02-20 18:38:35,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2128 to 2126. [2022-02-20 18:38:35,905 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:35,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2128 states. Second operand has 2126 states, 2125 states have (on average 1.4941176470588236) internal successors, (3175), 2125 states have internal predecessors, (3175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:35,917 INFO L74 IsIncluded]: Start isIncluded. First operand 2128 states. Second operand has 2126 states, 2125 states have (on average 1.4941176470588236) internal successors, (3175), 2125 states have internal predecessors, (3175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:35,922 INFO L87 Difference]: Start difference. First operand 2128 states. Second operand has 2126 states, 2125 states have (on average 1.4941176470588236) internal successors, (3175), 2125 states have internal predecessors, (3175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:36,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:36,110 INFO L93 Difference]: Finished difference Result 2128 states and 3176 transitions. [2022-02-20 18:38:36,111 INFO L276 IsEmpty]: Start isEmpty. Operand 2128 states and 3176 transitions. [2022-02-20 18:38:36,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:36,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:36,119 INFO L74 IsIncluded]: Start isIncluded. First operand has 2126 states, 2125 states have (on average 1.4941176470588236) internal successors, (3175), 2125 states have internal predecessors, (3175), 0 states have call successors, (0), 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 2128 states. [2022-02-20 18:38:36,124 INFO L87 Difference]: Start difference. First operand has 2126 states, 2125 states have (on average 1.4941176470588236) internal successors, (3175), 2125 states have internal predecessors, (3175), 0 states have call successors, (0), 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 2128 states. [2022-02-20 18:38:36,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:36,314 INFO L93 Difference]: Finished difference Result 2128 states and 3176 transitions. [2022-02-20 18:38:36,314 INFO L276 IsEmpty]: Start isEmpty. Operand 2128 states and 3176 transitions. [2022-02-20 18:38:36,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:36,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:36,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:36,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:36,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2126 states, 2125 states have (on average 1.4941176470588236) internal successors, (3175), 2125 states have internal predecessors, (3175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:36,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 2126 states and 3175 transitions. [2022-02-20 18:38:36,574 INFO L78 Accepts]: Start accepts. Automaton has 2126 states and 3175 transitions. Word has length 96 [2022-02-20 18:38:36,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:36,575 INFO L470 AbstractCegarLoop]: Abstraction has 2126 states and 3175 transitions. [2022-02-20 18:38:36,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:36,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 3175 transitions. [2022-02-20 18:38:36,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-02-20 18:38:36,578 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:36,578 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:36,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:38:36,578 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:36,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:36,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1786118699, now seen corresponding path program 1 times [2022-02-20 18:38:36,580 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:36,580 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301556022] [2022-02-20 18:38:36,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:36,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:36,692 INFO L290 TraceCheckUtils]: 0: Hoare triple {28749#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(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1131~0 := 0;~__return_1259~0 := 0;~__return_1378~0 := 0;~__tmp_1379_0~0 := 0;~__return_1487~0 := 0;~__return_1392~0 := 0; {28749#true} is VALID [2022-02-20 18:38:36,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {28749#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~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;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {28751#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:38:36,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {28751#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} assume !!(0 == main_~init__r121~0#1 % 256); {28751#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:38:36,694 INFO L290 TraceCheckUtils]: 3: Hoare triple {28751#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} assume !!(0 == main_~init__r131~0#1 % 256);main_~init__tmp~0#1 := 0; {28751#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:38:36,694 INFO L290 TraceCheckUtils]: 4: Hoare triple {28751#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {28751#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:38:36,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {28751#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} assume !!(0 == main_~init__r131~0#1 % 256); {28751#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:38:36,695 INFO L290 TraceCheckUtils]: 6: Hoare triple {28751#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} assume !!(0 == main_~init__r121~0#1 % 256);main_~init__tmp___0~0#1 := 0; {28751#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:38:36,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {28751#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {28751#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:38:36,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {28751#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,697 INFO L290 TraceCheckUtils]: 10: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,698 INFO L290 TraceCheckUtils]: 12: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id1~0 != ~id2~0; {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,700 INFO L290 TraceCheckUtils]: 17: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id1~0 != ~id3~0; {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,700 INFO L290 TraceCheckUtils]: 18: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id2~0 != ~id3~0; {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id1~0 >= 0; {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,701 INFO L290 TraceCheckUtils]: 20: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id2~0 >= 0; {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,702 INFO L290 TraceCheckUtils]: 21: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id3~0 >= 0; {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,702 INFO L290 TraceCheckUtils]: 22: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~r1~0; {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,702 INFO L290 TraceCheckUtils]: 23: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~r2~0; {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,703 INFO L290 TraceCheckUtils]: 24: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~r3~0; {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,703 INFO L290 TraceCheckUtils]: 25: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r122~0#1 % 256); {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,704 INFO L290 TraceCheckUtils]: 26: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r132~0#1 % 256); {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,704 INFO L290 TraceCheckUtils]: 27: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r212~0#1 % 256); {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,705 INFO L290 TraceCheckUtils]: 28: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r232~0#1 % 256); {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,707 INFO L290 TraceCheckUtils]: 29: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r312~0#1 % 256); {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,708 INFO L290 TraceCheckUtils]: 30: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r322~0#1 % 256); {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,709 INFO L290 TraceCheckUtils]: 31: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~max1~0 == ~id1~0; {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,709 INFO L290 TraceCheckUtils]: 32: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~max2~0 == ~id2~0; {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,710 INFO L290 TraceCheckUtils]: 33: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~max3~0 == ~id3~0; {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,710 INFO L290 TraceCheckUtils]: 34: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~st1~0; {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,711 INFO L290 TraceCheckUtils]: 35: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~st2~0; {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,712 INFO L290 TraceCheckUtils]: 36: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~st3~0; {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,713 INFO L290 TraceCheckUtils]: 37: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~nl1~0; {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,714 INFO L290 TraceCheckUtils]: 38: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~nl2~0; {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,714 INFO L290 TraceCheckUtils]: 39: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~nl3~0; {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,714 INFO L290 TraceCheckUtils]: 40: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~mode1~0 % 256; {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,715 INFO L290 TraceCheckUtils]: 41: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~mode2~0 % 256; {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,715 INFO L290 TraceCheckUtils]: 42: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1131~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1131~0; {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,716 INFO L290 TraceCheckUtils]: 43: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,716 INFO L290 TraceCheckUtils]: 44: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume main_~main__i2~0#1 < 6; {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,717 INFO L290 TraceCheckUtils]: 45: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !!(0 == ~mode1~0 % 256); {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,717 INFO L290 TraceCheckUtils]: 46: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~r1~0 < 2; {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,718 INFO L290 TraceCheckUtils]: 47: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !!(0 == ~ep12~0 % 256); {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,718 INFO L290 TraceCheckUtils]: 48: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !!(0 == ~ep13~0 % 256); {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,718 INFO L290 TraceCheckUtils]: 49: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} ~mode1~0 := 1; {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,719 INFO L290 TraceCheckUtils]: 50: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !!(0 == ~mode2~0 % 256); {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,719 INFO L290 TraceCheckUtils]: 51: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~r2~0 < 2; {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:36,720 INFO L290 TraceCheckUtils]: 52: Hoare triple {28752#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !!(0 == ~ep21~0 % 256); {28750#false} is VALID [2022-02-20 18:38:36,720 INFO L290 TraceCheckUtils]: 53: Hoare triple {28750#false} assume !!(0 == ~ep23~0 % 256); {28750#false} is VALID [2022-02-20 18:38:36,720 INFO L290 TraceCheckUtils]: 54: Hoare triple {28750#false} ~mode2~0 := 1; {28750#false} is VALID [2022-02-20 18:38:36,720 INFO L290 TraceCheckUtils]: 55: Hoare triple {28750#false} assume !!(0 == ~mode3~0 % 256); {28750#false} is VALID [2022-02-20 18:38:36,720 INFO L290 TraceCheckUtils]: 56: Hoare triple {28750#false} assume ~r3~0 < 2; {28750#false} is VALID [2022-02-20 18:38:36,721 INFO L290 TraceCheckUtils]: 57: Hoare triple {28750#false} assume !!(0 == ~ep31~0 % 256); {28750#false} is VALID [2022-02-20 18:38:36,721 INFO L290 TraceCheckUtils]: 58: Hoare triple {28750#false} assume !!(0 == ~ep32~0 % 256); {28750#false} is VALID [2022-02-20 18:38:36,721 INFO L290 TraceCheckUtils]: 59: Hoare triple {28750#false} ~mode3~0 := 1;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {28750#false} is VALID [2022-02-20 18:38:36,721 INFO L290 TraceCheckUtils]: 60: Hoare triple {28750#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {28750#false} is VALID [2022-02-20 18:38:36,721 INFO L290 TraceCheckUtils]: 61: Hoare triple {28750#false} assume ~st1~0 + ~nl1~0 <= 1; {28750#false} is VALID [2022-02-20 18:38:36,721 INFO L290 TraceCheckUtils]: 62: Hoare triple {28750#false} assume ~st2~0 + ~nl2~0 <= 1; {28750#false} is VALID [2022-02-20 18:38:36,721 INFO L290 TraceCheckUtils]: 63: Hoare triple {28750#false} assume ~st3~0 + ~nl3~0 <= 1; {28750#false} is VALID [2022-02-20 18:38:36,721 INFO L290 TraceCheckUtils]: 64: Hoare triple {28750#false} assume !(~r1~0 >= 2); {28750#false} is VALID [2022-02-20 18:38:36,722 INFO L290 TraceCheckUtils]: 65: Hoare triple {28750#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {28750#false} is VALID [2022-02-20 18:38:36,722 INFO L290 TraceCheckUtils]: 66: Hoare triple {28750#false} assume ~r1~0 < 2; {28750#false} is VALID [2022-02-20 18:38:36,722 INFO L290 TraceCheckUtils]: 67: Hoare triple {28750#false} assume !(~r1~0 >= 2); {28750#false} is VALID [2022-02-20 18:38:36,722 INFO L290 TraceCheckUtils]: 68: Hoare triple {28750#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {28750#false} is VALID [2022-02-20 18:38:36,722 INFO L290 TraceCheckUtils]: 69: Hoare triple {28750#false} assume ~r1~0 < 2;main_~check__tmp~0#1 := 1;~__return_1259~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1259~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {28750#false} is VALID [2022-02-20 18:38:36,722 INFO L290 TraceCheckUtils]: 70: Hoare triple {28750#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {28750#false} is VALID [2022-02-20 18:38:36,722 INFO L290 TraceCheckUtils]: 71: Hoare triple {28750#false} assume main_~main__i2~0#1 < 6; {28750#false} is VALID [2022-02-20 18:38:36,723 INFO L290 TraceCheckUtils]: 72: Hoare triple {28750#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); {28750#false} is VALID [2022-02-20 18:38:36,723 INFO L290 TraceCheckUtils]: 73: Hoare triple {28750#false} assume !!(0 == ~ep21~0 % 256); {28750#false} is VALID [2022-02-20 18:38:36,723 INFO L290 TraceCheckUtils]: 74: Hoare triple {28750#false} assume !!(0 == ~ep31~0 % 256); {28750#false} is VALID [2022-02-20 18:38:36,723 INFO L290 TraceCheckUtils]: 75: Hoare triple {28750#false} assume 1 == ~r1~0; {28750#false} is VALID [2022-02-20 18:38:36,723 INFO L290 TraceCheckUtils]: 76: Hoare triple {28750#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {28750#false} is VALID [2022-02-20 18:38:36,723 INFO L290 TraceCheckUtils]: 77: Hoare triple {28750#false} ~mode1~0 := 0; {28750#false} is VALID [2022-02-20 18:38:36,723 INFO L290 TraceCheckUtils]: 78: Hoare triple {28750#false} assume !(0 == ~mode2~0 % 256);~r2~0 := (if (1 + ~r2~0) % 256 <= 127 then (1 + ~r2~0) % 256 else (1 + ~r2~0) % 256 - 256); {28750#false} is VALID [2022-02-20 18:38:36,723 INFO L290 TraceCheckUtils]: 79: Hoare triple {28750#false} assume !!(0 == ~ep12~0 % 256); {28750#false} is VALID [2022-02-20 18:38:36,724 INFO L290 TraceCheckUtils]: 80: Hoare triple {28750#false} assume !!(0 == ~ep32~0 % 256); {28750#false} is VALID [2022-02-20 18:38:36,724 INFO L290 TraceCheckUtils]: 81: Hoare triple {28750#false} assume !(2 == ~r2~0);~mode2~0 := 0; {28750#false} is VALID [2022-02-20 18:38:36,724 INFO L290 TraceCheckUtils]: 82: Hoare triple {28750#false} assume !(0 == ~mode3~0 % 256);~r3~0 := (if (1 + ~r3~0) % 256 <= 127 then (1 + ~r3~0) % 256 else (1 + ~r3~0) % 256 - 256); {28750#false} is VALID [2022-02-20 18:38:36,724 INFO L290 TraceCheckUtils]: 83: Hoare triple {28750#false} assume !!(0 == ~ep13~0 % 256); {28750#false} is VALID [2022-02-20 18:38:36,724 INFO L290 TraceCheckUtils]: 84: Hoare triple {28750#false} assume !!(0 == ~ep23~0 % 256); {28750#false} is VALID [2022-02-20 18:38:36,724 INFO L290 TraceCheckUtils]: 85: Hoare triple {28750#false} assume !(2 == ~r3~0);~mode3~0 := 0;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {28750#false} is VALID [2022-02-20 18:38:36,724 INFO L290 TraceCheckUtils]: 86: Hoare triple {28750#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {28750#false} is VALID [2022-02-20 18:38:36,725 INFO L290 TraceCheckUtils]: 87: Hoare triple {28750#false} assume ~st1~0 + ~nl1~0 <= 1; {28750#false} is VALID [2022-02-20 18:38:36,725 INFO L290 TraceCheckUtils]: 88: Hoare triple {28750#false} assume ~st2~0 + ~nl2~0 <= 1; {28750#false} is VALID [2022-02-20 18:38:36,725 INFO L290 TraceCheckUtils]: 89: Hoare triple {28750#false} assume ~st3~0 + ~nl3~0 <= 1; {28750#false} is VALID [2022-02-20 18:38:36,725 INFO L290 TraceCheckUtils]: 90: Hoare triple {28750#false} assume !(~r1~0 >= 2); {28750#false} is VALID [2022-02-20 18:38:36,725 INFO L290 TraceCheckUtils]: 91: Hoare triple {28750#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {28750#false} is VALID [2022-02-20 18:38:36,725 INFO L290 TraceCheckUtils]: 92: Hoare triple {28750#false} ~__return_1378~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1378~0;~__tmp_1379_0~0 := main_~main____CPAchecker_TMP_0~0#1; {28750#false} is VALID [2022-02-20 18:38:36,725 INFO L290 TraceCheckUtils]: 93: Hoare triple {28750#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1379_0~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {28750#false} is VALID [2022-02-20 18:38:36,725 INFO L290 TraceCheckUtils]: 94: Hoare triple {28750#false} assume 0 == main_~assert__arg~1#1 % 256; {28750#false} is VALID [2022-02-20 18:38:36,726 INFO L290 TraceCheckUtils]: 95: Hoare triple {28750#false} assume !false; {28750#false} is VALID [2022-02-20 18:38:36,726 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:38:36,734 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:36,734 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301556022] [2022-02-20 18:38:36,734 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301556022] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:36,734 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:36,735 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:38:36,735 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511443580] [2022-02-20 18:38:36,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:36,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-02-20 18:38:36,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:36,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:36,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:36,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:38:36,804 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:36,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:38:36,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:38:36,805 INFO L87 Difference]: Start difference. First operand 2126 states and 3175 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:40,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:40,662 INFO L93 Difference]: Finished difference Result 6153 states and 9160 transitions. [2022-02-20 18:38:40,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:38:40,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-02-20 18:38:40,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:40,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:40,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 888 transitions. [2022-02-20 18:38:40,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:40,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 888 transitions. [2022-02-20 18:38:40,671 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 888 transitions. [2022-02-20 18:38:41,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 888 edges. 888 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:41,940 INFO L225 Difference]: With dead ends: 6153 [2022-02-20 18:38:41,940 INFO L226 Difference]: Without dead ends: 4083 [2022-02-20 18:38:41,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:38:41,943 INFO L933 BasicCegarLoop]: 505 mSDtfsCounter, 626 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:38:41,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [626 Valid, 790 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:41,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4083 states. [2022-02-20 18:38:43,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4083 to 4081. [2022-02-20 18:38:43,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:43,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4083 states. Second operand has 4081 states, 4080 states have (on average 1.4747549019607844) internal successors, (6017), 4080 states have internal predecessors, (6017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:43,395 INFO L74 IsIncluded]: Start isIncluded. First operand 4083 states. Second operand has 4081 states, 4080 states have (on average 1.4747549019607844) internal successors, (6017), 4080 states have internal predecessors, (6017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:43,398 INFO L87 Difference]: Start difference. First operand 4083 states. Second operand has 4081 states, 4080 states have (on average 1.4747549019607844) internal successors, (6017), 4080 states have internal predecessors, (6017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:43,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:43,880 INFO L93 Difference]: Finished difference Result 4083 states and 6018 transitions. [2022-02-20 18:38:43,880 INFO L276 IsEmpty]: Start isEmpty. Operand 4083 states and 6018 transitions. [2022-02-20 18:38:43,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:43,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:43,893 INFO L74 IsIncluded]: Start isIncluded. First operand has 4081 states, 4080 states have (on average 1.4747549019607844) internal successors, (6017), 4080 states have internal predecessors, (6017), 0 states have call successors, (0), 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 4083 states. [2022-02-20 18:38:43,898 INFO L87 Difference]: Start difference. First operand has 4081 states, 4080 states have (on average 1.4747549019607844) internal successors, (6017), 4080 states have internal predecessors, (6017), 0 states have call successors, (0), 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 4083 states. [2022-02-20 18:38:44,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:44,402 INFO L93 Difference]: Finished difference Result 4083 states and 6018 transitions. [2022-02-20 18:38:44,402 INFO L276 IsEmpty]: Start isEmpty. Operand 4083 states and 6018 transitions. [2022-02-20 18:38:44,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:44,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:44,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:44,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:44,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4081 states, 4080 states have (on average 1.4747549019607844) internal successors, (6017), 4080 states have internal predecessors, (6017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:45,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4081 states to 4081 states and 6017 transitions. [2022-02-20 18:38:45,123 INFO L78 Accepts]: Start accepts. Automaton has 4081 states and 6017 transitions. Word has length 96 [2022-02-20 18:38:45,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:45,123 INFO L470 AbstractCegarLoop]: Abstraction has 4081 states and 6017 transitions. [2022-02-20 18:38:45,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:45,123 INFO L276 IsEmpty]: Start isEmpty. Operand 4081 states and 6017 transitions. [2022-02-20 18:38:45,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-02-20 18:38:45,126 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:45,126 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:45,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:38:45,126 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:45,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:45,127 INFO L85 PathProgramCache]: Analyzing trace with hash -770610817, now seen corresponding path program 1 times [2022-02-20 18:38:45,127 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:45,127 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312902340] [2022-02-20 18:38:45,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:45,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:45,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {50851#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(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1131~0 := 0;~__return_1259~0 := 0;~__return_1378~0 := 0;~__tmp_1379_0~0 := 0;~__return_1487~0 := 0;~__return_1392~0 := 0; {50851#true} is VALID [2022-02-20 18:38:45,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {50851#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~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;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {50851#true} is VALID [2022-02-20 18:38:45,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {50851#true} assume !!(0 == main_~init__r121~0#1 % 256); {50851#true} is VALID [2022-02-20 18:38:45,191 INFO L290 TraceCheckUtils]: 3: Hoare triple {50851#true} assume !!(0 == main_~init__r131~0#1 % 256);main_~init__tmp~0#1 := 0; {50851#true} is VALID [2022-02-20 18:38:45,191 INFO L290 TraceCheckUtils]: 4: Hoare triple {50851#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {50851#true} is VALID [2022-02-20 18:38:45,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {50851#true} assume !!(0 == main_~init__r131~0#1 % 256); {50851#true} is VALID [2022-02-20 18:38:45,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {50851#true} assume !!(0 == main_~init__r121~0#1 % 256);main_~init__tmp___0~0#1 := 0; {50851#true} is VALID [2022-02-20 18:38:45,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {50851#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {50851#true} is VALID [2022-02-20 18:38:45,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {50851#true} assume !!(0 == main_~init__r211~0#1 % 256); {50851#true} is VALID [2022-02-20 18:38:45,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {50851#true} assume !!(0 == main_~init__r231~0#1 % 256);main_~init__tmp___1~0#1 := 0; {50853#(= (+ |ULTIMATE.start_main_~init__r231~0#1| (* (- 256) (div |ULTIMATE.start_main_~init__r231~0#1| 256))) 0)} is VALID [2022-02-20 18:38:45,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {50853#(= (+ |ULTIMATE.start_main_~init__r231~0#1| (* (- 256) (div |ULTIMATE.start_main_~init__r231~0#1| 256))) 0)} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {50853#(= (+ |ULTIMATE.start_main_~init__r231~0#1| (* (- 256) (div |ULTIMATE.start_main_~init__r231~0#1| 256))) 0)} is VALID [2022-02-20 18:38:45,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {50853#(= (+ |ULTIMATE.start_main_~init__r231~0#1| (* (- 256) (div |ULTIMATE.start_main_~init__r231~0#1| 256))) 0)} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {50852#false} is VALID [2022-02-20 18:38:45,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {50852#false} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {50852#false} is VALID [2022-02-20 18:38:45,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {50852#false} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {50852#false} is VALID [2022-02-20 18:38:45,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {50852#false} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {50852#false} is VALID [2022-02-20 18:38:45,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {50852#false} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {50852#false} is VALID [2022-02-20 18:38:45,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {50852#false} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {50852#false} is VALID [2022-02-20 18:38:45,194 INFO L290 TraceCheckUtils]: 17: Hoare triple {50852#false} assume ~id1~0 != ~id2~0; {50852#false} is VALID [2022-02-20 18:38:45,194 INFO L290 TraceCheckUtils]: 18: Hoare triple {50852#false} assume ~id1~0 != ~id3~0; {50852#false} is VALID [2022-02-20 18:38:45,194 INFO L290 TraceCheckUtils]: 19: Hoare triple {50852#false} assume ~id2~0 != ~id3~0; {50852#false} is VALID [2022-02-20 18:38:45,195 INFO L290 TraceCheckUtils]: 20: Hoare triple {50852#false} assume ~id1~0 >= 0; {50852#false} is VALID [2022-02-20 18:38:45,195 INFO L290 TraceCheckUtils]: 21: Hoare triple {50852#false} assume ~id2~0 >= 0; {50852#false} is VALID [2022-02-20 18:38:45,195 INFO L290 TraceCheckUtils]: 22: Hoare triple {50852#false} assume ~id3~0 >= 0; {50852#false} is VALID [2022-02-20 18:38:45,195 INFO L290 TraceCheckUtils]: 23: Hoare triple {50852#false} assume 0 == ~r1~0; {50852#false} is VALID [2022-02-20 18:38:45,195 INFO L290 TraceCheckUtils]: 24: Hoare triple {50852#false} assume 0 == ~r2~0; {50852#false} is VALID [2022-02-20 18:38:45,195 INFO L290 TraceCheckUtils]: 25: Hoare triple {50852#false} assume 0 == ~r3~0; {50852#false} is VALID [2022-02-20 18:38:45,195 INFO L290 TraceCheckUtils]: 26: Hoare triple {50852#false} assume !(0 == main_~init__r122~0#1 % 256); {50852#false} is VALID [2022-02-20 18:38:45,196 INFO L290 TraceCheckUtils]: 27: Hoare triple {50852#false} assume !(0 == main_~init__r132~0#1 % 256); {50852#false} is VALID [2022-02-20 18:38:45,196 INFO L290 TraceCheckUtils]: 28: Hoare triple {50852#false} assume !(0 == main_~init__r212~0#1 % 256); {50852#false} is VALID [2022-02-20 18:38:45,196 INFO L290 TraceCheckUtils]: 29: Hoare triple {50852#false} assume !(0 == main_~init__r232~0#1 % 256); {50852#false} is VALID [2022-02-20 18:38:45,196 INFO L290 TraceCheckUtils]: 30: Hoare triple {50852#false} assume !(0 == main_~init__r312~0#1 % 256); {50852#false} is VALID [2022-02-20 18:38:45,196 INFO L290 TraceCheckUtils]: 31: Hoare triple {50852#false} assume !(0 == main_~init__r322~0#1 % 256); {50852#false} is VALID [2022-02-20 18:38:45,196 INFO L290 TraceCheckUtils]: 32: Hoare triple {50852#false} assume ~max1~0 == ~id1~0; {50852#false} is VALID [2022-02-20 18:38:45,196 INFO L290 TraceCheckUtils]: 33: Hoare triple {50852#false} assume ~max2~0 == ~id2~0; {50852#false} is VALID [2022-02-20 18:38:45,197 INFO L290 TraceCheckUtils]: 34: Hoare triple {50852#false} assume ~max3~0 == ~id3~0; {50852#false} is VALID [2022-02-20 18:38:45,197 INFO L290 TraceCheckUtils]: 35: Hoare triple {50852#false} assume 0 == ~st1~0; {50852#false} is VALID [2022-02-20 18:38:45,197 INFO L290 TraceCheckUtils]: 36: Hoare triple {50852#false} assume 0 == ~st2~0; {50852#false} is VALID [2022-02-20 18:38:45,197 INFO L290 TraceCheckUtils]: 37: Hoare triple {50852#false} assume 0 == ~st3~0; {50852#false} is VALID [2022-02-20 18:38:45,197 INFO L290 TraceCheckUtils]: 38: Hoare triple {50852#false} assume 0 == ~nl1~0; {50852#false} is VALID [2022-02-20 18:38:45,197 INFO L290 TraceCheckUtils]: 39: Hoare triple {50852#false} assume 0 == ~nl2~0; {50852#false} is VALID [2022-02-20 18:38:45,197 INFO L290 TraceCheckUtils]: 40: Hoare triple {50852#false} assume 0 == ~nl3~0; {50852#false} is VALID [2022-02-20 18:38:45,197 INFO L290 TraceCheckUtils]: 41: Hoare triple {50852#false} assume 0 == ~mode1~0 % 256; {50852#false} is VALID [2022-02-20 18:38:45,198 INFO L290 TraceCheckUtils]: 42: Hoare triple {50852#false} assume 0 == ~mode2~0 % 256; {50852#false} is VALID [2022-02-20 18:38:45,198 INFO L290 TraceCheckUtils]: 43: Hoare triple {50852#false} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1131~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1131~0; {50852#false} is VALID [2022-02-20 18:38:45,198 INFO L290 TraceCheckUtils]: 44: Hoare triple {50852#false} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {50852#false} is VALID [2022-02-20 18:38:45,198 INFO L290 TraceCheckUtils]: 45: Hoare triple {50852#false} assume main_~main__i2~0#1 < 6; {50852#false} is VALID [2022-02-20 18:38:45,198 INFO L290 TraceCheckUtils]: 46: Hoare triple {50852#false} assume !!(0 == ~mode1~0 % 256); {50852#false} is VALID [2022-02-20 18:38:45,198 INFO L290 TraceCheckUtils]: 47: Hoare triple {50852#false} assume ~r1~0 < 2; {50852#false} is VALID [2022-02-20 18:38:45,198 INFO L290 TraceCheckUtils]: 48: Hoare triple {50852#false} assume !!(0 == ~ep12~0 % 256); {50852#false} is VALID [2022-02-20 18:38:45,199 INFO L290 TraceCheckUtils]: 49: Hoare triple {50852#false} assume !!(0 == ~ep13~0 % 256); {50852#false} is VALID [2022-02-20 18:38:45,199 INFO L290 TraceCheckUtils]: 50: Hoare triple {50852#false} ~mode1~0 := 1; {50852#false} is VALID [2022-02-20 18:38:45,199 INFO L290 TraceCheckUtils]: 51: Hoare triple {50852#false} assume !!(0 == ~mode2~0 % 256); {50852#false} is VALID [2022-02-20 18:38:45,199 INFO L290 TraceCheckUtils]: 52: Hoare triple {50852#false} assume ~r2~0 < 2; {50852#false} is VALID [2022-02-20 18:38:45,199 INFO L290 TraceCheckUtils]: 53: Hoare triple {50852#false} assume !!(0 == ~ep21~0 % 256); {50852#false} is VALID [2022-02-20 18:38:45,199 INFO L290 TraceCheckUtils]: 54: Hoare triple {50852#false} assume !!(0 == ~ep23~0 % 256); {50852#false} is VALID [2022-02-20 18:38:45,199 INFO L290 TraceCheckUtils]: 55: Hoare triple {50852#false} ~mode2~0 := 1; {50852#false} is VALID [2022-02-20 18:38:45,199 INFO L290 TraceCheckUtils]: 56: Hoare triple {50852#false} assume !!(0 == ~mode3~0 % 256); {50852#false} is VALID [2022-02-20 18:38:45,200 INFO L290 TraceCheckUtils]: 57: Hoare triple {50852#false} assume ~r3~0 < 2; {50852#false} is VALID [2022-02-20 18:38:45,200 INFO L290 TraceCheckUtils]: 58: Hoare triple {50852#false} assume !!(0 == ~ep31~0 % 256); {50852#false} is VALID [2022-02-20 18:38:45,200 INFO L290 TraceCheckUtils]: 59: Hoare triple {50852#false} assume !!(0 == ~ep32~0 % 256); {50852#false} is VALID [2022-02-20 18:38:45,200 INFO L290 TraceCheckUtils]: 60: Hoare triple {50852#false} ~mode3~0 := 1;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {50852#false} is VALID [2022-02-20 18:38:45,200 INFO L290 TraceCheckUtils]: 61: Hoare triple {50852#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {50852#false} is VALID [2022-02-20 18:38:45,200 INFO L290 TraceCheckUtils]: 62: Hoare triple {50852#false} assume ~st1~0 + ~nl1~0 <= 1; {50852#false} is VALID [2022-02-20 18:38:45,200 INFO L290 TraceCheckUtils]: 63: Hoare triple {50852#false} assume ~st2~0 + ~nl2~0 <= 1; {50852#false} is VALID [2022-02-20 18:38:45,201 INFO L290 TraceCheckUtils]: 64: Hoare triple {50852#false} assume ~st3~0 + ~nl3~0 <= 1; {50852#false} is VALID [2022-02-20 18:38:45,201 INFO L290 TraceCheckUtils]: 65: Hoare triple {50852#false} assume !(~r1~0 >= 2); {50852#false} is VALID [2022-02-20 18:38:45,201 INFO L290 TraceCheckUtils]: 66: Hoare triple {50852#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {50852#false} is VALID [2022-02-20 18:38:45,202 INFO L290 TraceCheckUtils]: 67: Hoare triple {50852#false} assume ~r1~0 < 2; {50852#false} is VALID [2022-02-20 18:38:45,202 INFO L290 TraceCheckUtils]: 68: Hoare triple {50852#false} assume !(~r1~0 >= 2); {50852#false} is VALID [2022-02-20 18:38:45,202 INFO L290 TraceCheckUtils]: 69: Hoare triple {50852#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {50852#false} is VALID [2022-02-20 18:38:45,202 INFO L290 TraceCheckUtils]: 70: Hoare triple {50852#false} assume ~r1~0 < 2;main_~check__tmp~0#1 := 1;~__return_1259~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1259~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {50852#false} is VALID [2022-02-20 18:38:45,202 INFO L290 TraceCheckUtils]: 71: Hoare triple {50852#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {50852#false} is VALID [2022-02-20 18:38:45,202 INFO L290 TraceCheckUtils]: 72: Hoare triple {50852#false} assume main_~main__i2~0#1 < 6; {50852#false} is VALID [2022-02-20 18:38:45,202 INFO L290 TraceCheckUtils]: 73: Hoare triple {50852#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); {50852#false} is VALID [2022-02-20 18:38:45,202 INFO L290 TraceCheckUtils]: 74: Hoare triple {50852#false} assume !!(0 == ~ep21~0 % 256); {50852#false} is VALID [2022-02-20 18:38:45,203 INFO L290 TraceCheckUtils]: 75: Hoare triple {50852#false} assume !!(0 == ~ep31~0 % 256); {50852#false} is VALID [2022-02-20 18:38:45,203 INFO L290 TraceCheckUtils]: 76: Hoare triple {50852#false} assume 1 == ~r1~0; {50852#false} is VALID [2022-02-20 18:38:45,203 INFO L290 TraceCheckUtils]: 77: Hoare triple {50852#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {50852#false} is VALID [2022-02-20 18:38:45,203 INFO L290 TraceCheckUtils]: 78: Hoare triple {50852#false} ~mode1~0 := 0; {50852#false} is VALID [2022-02-20 18:38:45,203 INFO L290 TraceCheckUtils]: 79: Hoare triple {50852#false} assume !(0 == ~mode2~0 % 256);~r2~0 := (if (1 + ~r2~0) % 256 <= 127 then (1 + ~r2~0) % 256 else (1 + ~r2~0) % 256 - 256); {50852#false} is VALID [2022-02-20 18:38:45,203 INFO L290 TraceCheckUtils]: 80: Hoare triple {50852#false} assume !!(0 == ~ep12~0 % 256); {50852#false} is VALID [2022-02-20 18:38:45,203 INFO L290 TraceCheckUtils]: 81: Hoare triple {50852#false} assume !!(0 == ~ep32~0 % 256); {50852#false} is VALID [2022-02-20 18:38:45,204 INFO L290 TraceCheckUtils]: 82: Hoare triple {50852#false} assume !(2 == ~r2~0);~mode2~0 := 0; {50852#false} is VALID [2022-02-20 18:38:45,204 INFO L290 TraceCheckUtils]: 83: Hoare triple {50852#false} assume !(0 == ~mode3~0 % 256);~r3~0 := (if (1 + ~r3~0) % 256 <= 127 then (1 + ~r3~0) % 256 else (1 + ~r3~0) % 256 - 256); {50852#false} is VALID [2022-02-20 18:38:45,204 INFO L290 TraceCheckUtils]: 84: Hoare triple {50852#false} assume !!(0 == ~ep13~0 % 256); {50852#false} is VALID [2022-02-20 18:38:45,204 INFO L290 TraceCheckUtils]: 85: Hoare triple {50852#false} assume !!(0 == ~ep23~0 % 256); {50852#false} is VALID [2022-02-20 18:38:45,204 INFO L290 TraceCheckUtils]: 86: Hoare triple {50852#false} assume !(2 == ~r3~0);~mode3~0 := 0;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {50852#false} is VALID [2022-02-20 18:38:45,204 INFO L290 TraceCheckUtils]: 87: Hoare triple {50852#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {50852#false} is VALID [2022-02-20 18:38:45,204 INFO L290 TraceCheckUtils]: 88: Hoare triple {50852#false} assume ~st1~0 + ~nl1~0 <= 1; {50852#false} is VALID [2022-02-20 18:38:45,205 INFO L290 TraceCheckUtils]: 89: Hoare triple {50852#false} assume ~st2~0 + ~nl2~0 <= 1; {50852#false} is VALID [2022-02-20 18:38:45,205 INFO L290 TraceCheckUtils]: 90: Hoare triple {50852#false} assume ~st3~0 + ~nl3~0 <= 1; {50852#false} is VALID [2022-02-20 18:38:45,205 INFO L290 TraceCheckUtils]: 91: Hoare triple {50852#false} assume !(~r1~0 >= 2); {50852#false} is VALID [2022-02-20 18:38:45,205 INFO L290 TraceCheckUtils]: 92: Hoare triple {50852#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {50852#false} is VALID [2022-02-20 18:38:45,205 INFO L290 TraceCheckUtils]: 93: Hoare triple {50852#false} ~__return_1378~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1378~0;~__tmp_1379_0~0 := main_~main____CPAchecker_TMP_0~0#1; {50852#false} is VALID [2022-02-20 18:38:45,205 INFO L290 TraceCheckUtils]: 94: Hoare triple {50852#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1379_0~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {50852#false} is VALID [2022-02-20 18:38:45,205 INFO L290 TraceCheckUtils]: 95: Hoare triple {50852#false} assume 0 == main_~assert__arg~1#1 % 256; {50852#false} is VALID [2022-02-20 18:38:45,205 INFO L290 TraceCheckUtils]: 96: Hoare triple {50852#false} assume !false; {50852#false} is VALID [2022-02-20 18:38:45,206 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:38:45,206 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:45,206 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312902340] [2022-02-20 18:38:45,206 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312902340] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:45,206 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:45,206 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:38:45,207 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599371488] [2022-02-20 18:38:45,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:45,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2022-02-20 18:38:45,208 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:45,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:45,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:45,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:38:45,267 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:45,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:38:45,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:38:45,267 INFO L87 Difference]: Start difference. First operand 4081 states and 6017 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:53,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:53,693 INFO L93 Difference]: Finished difference Result 12091 states and 17818 transitions. [2022-02-20 18:38:53,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:38:53,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2022-02-20 18:38:53,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:53,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:53,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 902 transitions. [2022-02-20 18:38:53,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:53,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 902 transitions. [2022-02-20 18:38:53,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 902 transitions. [2022-02-20 18:38:54,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 902 edges. 902 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:56,904 INFO L225 Difference]: With dead ends: 12091 [2022-02-20 18:38:56,905 INFO L226 Difference]: Without dead ends: 8101 [2022-02-20 18:38:56,909 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:38:56,910 INFO L933 BasicCegarLoop]: 391 mSDtfsCounter, 294 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:38:56,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 701 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:56,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8101 states. [2022-02-20 18:38:58,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8101 to 4091. [2022-02-20 18:38:58,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:58,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8101 states. Second operand has 4091 states, 4090 states have (on average 1.4735941320293398) internal successors, (6027), 4090 states have internal predecessors, (6027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:58,409 INFO L74 IsIncluded]: Start isIncluded. First operand 8101 states. Second operand has 4091 states, 4090 states have (on average 1.4735941320293398) internal successors, (6027), 4090 states have internal predecessors, (6027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:58,412 INFO L87 Difference]: Start difference. First operand 8101 states. Second operand has 4091 states, 4090 states have (on average 1.4735941320293398) internal successors, (6027), 4090 states have internal predecessors, (6027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:00,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:00,134 INFO L93 Difference]: Finished difference Result 8101 states and 11935 transitions. [2022-02-20 18:39:00,134 INFO L276 IsEmpty]: Start isEmpty. Operand 8101 states and 11935 transitions. [2022-02-20 18:39:00,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:00,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:00,146 INFO L74 IsIncluded]: Start isIncluded. First operand has 4091 states, 4090 states have (on average 1.4735941320293398) internal successors, (6027), 4090 states have internal predecessors, (6027), 0 states have call successors, (0), 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 8101 states. [2022-02-20 18:39:00,149 INFO L87 Difference]: Start difference. First operand has 4091 states, 4090 states have (on average 1.4735941320293398) internal successors, (6027), 4090 states have internal predecessors, (6027), 0 states have call successors, (0), 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 8101 states. [2022-02-20 18:39:02,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:02,016 INFO L93 Difference]: Finished difference Result 8101 states and 11935 transitions. [2022-02-20 18:39:02,016 INFO L276 IsEmpty]: Start isEmpty. Operand 8101 states and 11935 transitions. [2022-02-20 18:39:02,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:02,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:02,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:39:02,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:39:02,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4091 states, 4090 states have (on average 1.4735941320293398) internal successors, (6027), 4090 states have internal predecessors, (6027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:02,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4091 states to 4091 states and 6027 transitions. [2022-02-20 18:39:02,730 INFO L78 Accepts]: Start accepts. Automaton has 4091 states and 6027 transitions. Word has length 97 [2022-02-20 18:39:02,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:39:02,730 INFO L470 AbstractCegarLoop]: Abstraction has 4091 states and 6027 transitions. [2022-02-20 18:39:02,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:02,730 INFO L276 IsEmpty]: Start isEmpty. Operand 4091 states and 6027 transitions. [2022-02-20 18:39:02,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-02-20 18:39:02,733 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:39:02,733 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:02,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:39:02,733 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:39:02,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:39:02,734 INFO L85 PathProgramCache]: Analyzing trace with hash -2136208980, now seen corresponding path program 1 times [2022-02-20 18:39:02,734 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:39:02,734 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825474796] [2022-02-20 18:39:02,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:39:02,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:39:02,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:39:02,865 INFO L290 TraceCheckUtils]: 0: Hoare triple {89091#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(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1131~0 := 0;~__return_1259~0 := 0;~__return_1378~0 := 0;~__tmp_1379_0~0 := 0;~__return_1487~0 := 0;~__return_1392~0 := 0; {89091#true} is VALID [2022-02-20 18:39:02,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {89091#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~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;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {89093#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:39:02,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {89093#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r121~0#1 % 256); {89093#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:39:02,867 INFO L290 TraceCheckUtils]: 3: Hoare triple {89093#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r131~0#1 % 256);main_~init__tmp~0#1 := 0; {89093#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:39:02,867 INFO L290 TraceCheckUtils]: 4: Hoare triple {89093#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {89093#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:39:02,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {89093#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r131~0#1 % 256); {89093#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:39:02,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {89093#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r121~0#1 % 256);main_~init__tmp___0~0#1 := 0; {89093#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:39:02,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {89093#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {89093#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:39:02,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {89093#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r211~0#1 % 256); {89093#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:39:02,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {89093#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r231~0#1 % 256);main_~init__tmp___1~0#1 := 0; {89093#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:39:02,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {89093#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {89093#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:39:02,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {89093#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r231~0#1 % 256); {89093#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:39:02,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {89093#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r211~0#1 % 256);main_~init__tmp___2~0#1 := 0; {89093#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:39:02,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {89093#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {89093#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:39:02,871 INFO L290 TraceCheckUtils]: 14: Hoare triple {89093#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,872 INFO L290 TraceCheckUtils]: 15: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,872 INFO L290 TraceCheckUtils]: 17: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,873 INFO L290 TraceCheckUtils]: 18: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id1~0 != ~id2~0; {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id1~0 != ~id3~0; {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id2~0 != ~id3~0; {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,874 INFO L290 TraceCheckUtils]: 21: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id1~0 >= 0; {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,874 INFO L290 TraceCheckUtils]: 22: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id2~0 >= 0; {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,875 INFO L290 TraceCheckUtils]: 23: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id3~0 >= 0; {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,875 INFO L290 TraceCheckUtils]: 24: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~r1~0; {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,875 INFO L290 TraceCheckUtils]: 25: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~r2~0; {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,876 INFO L290 TraceCheckUtils]: 26: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~r3~0; {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,876 INFO L290 TraceCheckUtils]: 27: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r122~0#1 % 256); {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,876 INFO L290 TraceCheckUtils]: 28: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r132~0#1 % 256); {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,877 INFO L290 TraceCheckUtils]: 29: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r212~0#1 % 256); {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,877 INFO L290 TraceCheckUtils]: 30: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r232~0#1 % 256); {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,877 INFO L290 TraceCheckUtils]: 31: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r312~0#1 % 256); {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,878 INFO L290 TraceCheckUtils]: 32: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r322~0#1 % 256); {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,878 INFO L290 TraceCheckUtils]: 33: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~max1~0 == ~id1~0; {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,879 INFO L290 TraceCheckUtils]: 34: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~max2~0 == ~id2~0; {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,879 INFO L290 TraceCheckUtils]: 35: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~max3~0 == ~id3~0; {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,879 INFO L290 TraceCheckUtils]: 36: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~st1~0; {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,880 INFO L290 TraceCheckUtils]: 37: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~st2~0; {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,880 INFO L290 TraceCheckUtils]: 38: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~st3~0; {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,880 INFO L290 TraceCheckUtils]: 39: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~nl1~0; {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,881 INFO L290 TraceCheckUtils]: 40: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~nl2~0; {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,881 INFO L290 TraceCheckUtils]: 41: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~nl3~0; {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,881 INFO L290 TraceCheckUtils]: 42: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~mode1~0 % 256; {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,882 INFO L290 TraceCheckUtils]: 43: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~mode2~0 % 256; {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,882 INFO L290 TraceCheckUtils]: 44: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1131~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1131~0; {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,882 INFO L290 TraceCheckUtils]: 45: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,883 INFO L290 TraceCheckUtils]: 46: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume main_~main__i2~0#1 < 6; {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,883 INFO L290 TraceCheckUtils]: 47: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~mode1~0 % 256); {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,883 INFO L290 TraceCheckUtils]: 48: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~r1~0 < 2; {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,884 INFO L290 TraceCheckUtils]: 49: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~ep12~0 % 256); {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,884 INFO L290 TraceCheckUtils]: 50: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~ep13~0 % 256); {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,897 INFO L290 TraceCheckUtils]: 51: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} ~mode1~0 := 1; {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,909 INFO L290 TraceCheckUtils]: 52: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~mode2~0 % 256); {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,909 INFO L290 TraceCheckUtils]: 53: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~r2~0 < 2; {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,910 INFO L290 TraceCheckUtils]: 54: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~ep21~0 % 256); {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,910 INFO L290 TraceCheckUtils]: 55: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~ep23~0 % 256); {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,910 INFO L290 TraceCheckUtils]: 56: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} ~mode2~0 := 1; {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,911 INFO L290 TraceCheckUtils]: 57: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~mode3~0 % 256); {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,911 INFO L290 TraceCheckUtils]: 58: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~r3~0 < 2; {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:02,912 INFO L290 TraceCheckUtils]: 59: Hoare triple {89094#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~ep31~0 % 256); {89092#false} is VALID [2022-02-20 18:39:02,912 INFO L290 TraceCheckUtils]: 60: Hoare triple {89092#false} assume !!(0 == ~ep32~0 % 256); {89092#false} is VALID [2022-02-20 18:39:02,912 INFO L290 TraceCheckUtils]: 61: Hoare triple {89092#false} ~mode3~0 := 1;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {89092#false} is VALID [2022-02-20 18:39:02,912 INFO L290 TraceCheckUtils]: 62: Hoare triple {89092#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {89092#false} is VALID [2022-02-20 18:39:02,912 INFO L290 TraceCheckUtils]: 63: Hoare triple {89092#false} assume ~st1~0 + ~nl1~0 <= 1; {89092#false} is VALID [2022-02-20 18:39:02,912 INFO L290 TraceCheckUtils]: 64: Hoare triple {89092#false} assume ~st2~0 + ~nl2~0 <= 1; {89092#false} is VALID [2022-02-20 18:39:02,912 INFO L290 TraceCheckUtils]: 65: Hoare triple {89092#false} assume ~st3~0 + ~nl3~0 <= 1; {89092#false} is VALID [2022-02-20 18:39:02,912 INFO L290 TraceCheckUtils]: 66: Hoare triple {89092#false} assume !(~r1~0 >= 2); {89092#false} is VALID [2022-02-20 18:39:02,913 INFO L290 TraceCheckUtils]: 67: Hoare triple {89092#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {89092#false} is VALID [2022-02-20 18:39:02,913 INFO L290 TraceCheckUtils]: 68: Hoare triple {89092#false} assume ~r1~0 < 2; {89092#false} is VALID [2022-02-20 18:39:02,913 INFO L290 TraceCheckUtils]: 69: Hoare triple {89092#false} assume !(~r1~0 >= 2); {89092#false} is VALID [2022-02-20 18:39:02,913 INFO L290 TraceCheckUtils]: 70: Hoare triple {89092#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {89092#false} is VALID [2022-02-20 18:39:02,913 INFO L290 TraceCheckUtils]: 71: Hoare triple {89092#false} assume ~r1~0 < 2;main_~check__tmp~0#1 := 1;~__return_1259~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1259~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {89092#false} is VALID [2022-02-20 18:39:02,913 INFO L290 TraceCheckUtils]: 72: Hoare triple {89092#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {89092#false} is VALID [2022-02-20 18:39:02,913 INFO L290 TraceCheckUtils]: 73: Hoare triple {89092#false} assume main_~main__i2~0#1 < 6; {89092#false} is VALID [2022-02-20 18:39:02,913 INFO L290 TraceCheckUtils]: 74: Hoare triple {89092#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); {89092#false} is VALID [2022-02-20 18:39:02,914 INFO L290 TraceCheckUtils]: 75: Hoare triple {89092#false} assume !!(0 == ~ep21~0 % 256); {89092#false} is VALID [2022-02-20 18:39:02,914 INFO L290 TraceCheckUtils]: 76: Hoare triple {89092#false} assume !!(0 == ~ep31~0 % 256); {89092#false} is VALID [2022-02-20 18:39:02,914 INFO L290 TraceCheckUtils]: 77: Hoare triple {89092#false} assume 1 == ~r1~0; {89092#false} is VALID [2022-02-20 18:39:02,914 INFO L290 TraceCheckUtils]: 78: Hoare triple {89092#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {89092#false} is VALID [2022-02-20 18:39:02,914 INFO L290 TraceCheckUtils]: 79: Hoare triple {89092#false} ~mode1~0 := 0; {89092#false} is VALID [2022-02-20 18:39:02,914 INFO L290 TraceCheckUtils]: 80: Hoare triple {89092#false} assume !(0 == ~mode2~0 % 256);~r2~0 := (if (1 + ~r2~0) % 256 <= 127 then (1 + ~r2~0) % 256 else (1 + ~r2~0) % 256 - 256); {89092#false} is VALID [2022-02-20 18:39:02,914 INFO L290 TraceCheckUtils]: 81: Hoare triple {89092#false} assume !!(0 == ~ep12~0 % 256); {89092#false} is VALID [2022-02-20 18:39:02,914 INFO L290 TraceCheckUtils]: 82: Hoare triple {89092#false} assume !!(0 == ~ep32~0 % 256); {89092#false} is VALID [2022-02-20 18:39:02,915 INFO L290 TraceCheckUtils]: 83: Hoare triple {89092#false} assume !(2 == ~r2~0);~mode2~0 := 0; {89092#false} is VALID [2022-02-20 18:39:02,915 INFO L290 TraceCheckUtils]: 84: Hoare triple {89092#false} assume !(0 == ~mode3~0 % 256);~r3~0 := (if (1 + ~r3~0) % 256 <= 127 then (1 + ~r3~0) % 256 else (1 + ~r3~0) % 256 - 256); {89092#false} is VALID [2022-02-20 18:39:02,915 INFO L290 TraceCheckUtils]: 85: Hoare triple {89092#false} assume !!(0 == ~ep13~0 % 256); {89092#false} is VALID [2022-02-20 18:39:02,915 INFO L290 TraceCheckUtils]: 86: Hoare triple {89092#false} assume !!(0 == ~ep23~0 % 256); {89092#false} is VALID [2022-02-20 18:39:02,915 INFO L290 TraceCheckUtils]: 87: Hoare triple {89092#false} assume !(2 == ~r3~0);~mode3~0 := 0;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {89092#false} is VALID [2022-02-20 18:39:02,915 INFO L290 TraceCheckUtils]: 88: Hoare triple {89092#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {89092#false} is VALID [2022-02-20 18:39:02,915 INFO L290 TraceCheckUtils]: 89: Hoare triple {89092#false} assume ~st1~0 + ~nl1~0 <= 1; {89092#false} is VALID [2022-02-20 18:39:02,915 INFO L290 TraceCheckUtils]: 90: Hoare triple {89092#false} assume ~st2~0 + ~nl2~0 <= 1; {89092#false} is VALID [2022-02-20 18:39:02,916 INFO L290 TraceCheckUtils]: 91: Hoare triple {89092#false} assume ~st3~0 + ~nl3~0 <= 1; {89092#false} is VALID [2022-02-20 18:39:02,916 INFO L290 TraceCheckUtils]: 92: Hoare triple {89092#false} assume !(~r1~0 >= 2); {89092#false} is VALID [2022-02-20 18:39:02,916 INFO L290 TraceCheckUtils]: 93: Hoare triple {89092#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {89092#false} is VALID [2022-02-20 18:39:02,916 INFO L290 TraceCheckUtils]: 94: Hoare triple {89092#false} ~__return_1378~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1378~0;~__tmp_1379_0~0 := main_~main____CPAchecker_TMP_0~0#1; {89092#false} is VALID [2022-02-20 18:39:02,916 INFO L290 TraceCheckUtils]: 95: Hoare triple {89092#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1379_0~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {89092#false} is VALID [2022-02-20 18:39:02,916 INFO L290 TraceCheckUtils]: 96: Hoare triple {89092#false} assume 0 == main_~assert__arg~1#1 % 256; {89092#false} is VALID [2022-02-20 18:39:02,916 INFO L290 TraceCheckUtils]: 97: Hoare triple {89092#false} assume !false; {89092#false} is VALID [2022-02-20 18:39:02,917 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:39:02,917 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:39:02,917 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825474796] [2022-02-20 18:39:02,917 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825474796] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:39:02,917 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:39:02,918 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:39:02,918 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435401030] [2022-02-20 18:39:02,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:39:02,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2022-02-20 18:39:02,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:39:02,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:02,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:02,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:39:02,998 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:39:02,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:39:02,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:39:02,999 INFO L87 Difference]: Start difference. First operand 4091 states and 6027 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:11,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:11,208 INFO L93 Difference]: Finished difference Result 11119 states and 16300 transitions. [2022-02-20 18:39:11,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:39:11,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2022-02-20 18:39:11,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:39:11,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:11,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 881 transitions. [2022-02-20 18:39:11,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:11,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 881 transitions. [2022-02-20 18:39:11,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 881 transitions. [2022-02-20 18:39:11,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 881 edges. 881 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:13,863 INFO L225 Difference]: With dead ends: 11119 [2022-02-20 18:39:13,864 INFO L226 Difference]: Without dead ends: 7129 [2022-02-20 18:39:13,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:39:13,868 INFO L933 BasicCegarLoop]: 494 mSDtfsCounter, 620 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:39:13,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [620 Valid, 779 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:39:13,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7129 states. [2022-02-20 18:39:16,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7129 to 7127. [2022-02-20 18:39:16,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:39:16,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7129 states. Second operand has 7127 states, 7126 states have (on average 1.445551501543643) internal successors, (10301), 7126 states have internal predecessors, (10301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:16,935 INFO L74 IsIncluded]: Start isIncluded. First operand 7129 states. Second operand has 7127 states, 7126 states have (on average 1.445551501543643) internal successors, (10301), 7126 states have internal predecessors, (10301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:16,941 INFO L87 Difference]: Start difference. First operand 7129 states. Second operand has 7127 states, 7126 states have (on average 1.445551501543643) internal successors, (10301), 7126 states have internal predecessors, (10301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:18,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:18,369 INFO L93 Difference]: Finished difference Result 7129 states and 10302 transitions. [2022-02-20 18:39:18,369 INFO L276 IsEmpty]: Start isEmpty. Operand 7129 states and 10302 transitions. [2022-02-20 18:39:18,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:18,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:18,381 INFO L74 IsIncluded]: Start isIncluded. First operand has 7127 states, 7126 states have (on average 1.445551501543643) internal successors, (10301), 7126 states have internal predecessors, (10301), 0 states have call successors, (0), 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 7129 states. [2022-02-20 18:39:18,385 INFO L87 Difference]: Start difference. First operand has 7127 states, 7126 states have (on average 1.445551501543643) internal successors, (10301), 7126 states have internal predecessors, (10301), 0 states have call successors, (0), 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 7129 states. [2022-02-20 18:39:19,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:19,796 INFO L93 Difference]: Finished difference Result 7129 states and 10302 transitions. [2022-02-20 18:39:19,796 INFO L276 IsEmpty]: Start isEmpty. Operand 7129 states and 10302 transitions. [2022-02-20 18:39:19,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:19,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:19,803 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:39:19,803 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:39:19,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7127 states, 7126 states have (on average 1.445551501543643) internal successors, (10301), 7126 states have internal predecessors, (10301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:21,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7127 states to 7127 states and 10301 transitions. [2022-02-20 18:39:21,874 INFO L78 Accepts]: Start accepts. Automaton has 7127 states and 10301 transitions. Word has length 98 [2022-02-20 18:39:21,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:39:21,875 INFO L470 AbstractCegarLoop]: Abstraction has 7127 states and 10301 transitions. [2022-02-20 18:39:21,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:21,875 INFO L276 IsEmpty]: Start isEmpty. Operand 7127 states and 10301 transitions. [2022-02-20 18:39:21,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-02-20 18:39:21,879 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:39:21,879 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:21,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:39:21,880 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:39:21,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:39:21,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1436194720, now seen corresponding path program 1 times [2022-02-20 18:39:21,880 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:39:21,880 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588667942] [2022-02-20 18:39:21,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:39:21,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:39:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:39:21,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {128171#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(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1131~0 := 0;~__return_1259~0 := 0;~__return_1378~0 := 0;~__tmp_1379_0~0 := 0;~__return_1487~0 := 0;~__return_1392~0 := 0; {128171#true} is VALID [2022-02-20 18:39:21,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {128171#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~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;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {128171#true} is VALID [2022-02-20 18:39:21,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {128171#true} assume !!(0 == main_~init__r121~0#1 % 256); {128171#true} is VALID [2022-02-20 18:39:21,925 INFO L290 TraceCheckUtils]: 3: Hoare triple {128171#true} assume !!(0 == main_~init__r131~0#1 % 256);main_~init__tmp~0#1 := 0; {128171#true} is VALID [2022-02-20 18:39:21,925 INFO L290 TraceCheckUtils]: 4: Hoare triple {128171#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {128171#true} is VALID [2022-02-20 18:39:21,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {128171#true} assume !!(0 == main_~init__r131~0#1 % 256); {128171#true} is VALID [2022-02-20 18:39:21,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {128171#true} assume !!(0 == main_~init__r121~0#1 % 256);main_~init__tmp___0~0#1 := 0; {128171#true} is VALID [2022-02-20 18:39:21,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {128171#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {128171#true} is VALID [2022-02-20 18:39:21,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {128171#true} assume !!(0 == main_~init__r211~0#1 % 256); {128171#true} is VALID [2022-02-20 18:39:21,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {128171#true} assume !!(0 == main_~init__r231~0#1 % 256);main_~init__tmp___1~0#1 := 0; {128171#true} is VALID [2022-02-20 18:39:21,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {128171#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {128171#true} is VALID [2022-02-20 18:39:21,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {128171#true} assume !!(0 == main_~init__r231~0#1 % 256); {128171#true} is VALID [2022-02-20 18:39:21,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {128171#true} assume !!(0 == main_~init__r211~0#1 % 256);main_~init__tmp___2~0#1 := 0; {128171#true} is VALID [2022-02-20 18:39:21,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {128171#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {128171#true} is VALID [2022-02-20 18:39:21,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {128171#true} assume !!(0 == main_~init__r311~0#1 % 256); {128171#true} is VALID [2022-02-20 18:39:21,927 INFO L290 TraceCheckUtils]: 15: Hoare triple {128171#true} assume !!(0 == main_~init__r321~0#1 % 256);main_~init__tmp___3~0#1 := 0; {128173#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (div |ULTIMATE.start_main_~init__r321~0#1| 256) (- 256))) 0)} is VALID [2022-02-20 18:39:21,927 INFO L290 TraceCheckUtils]: 16: Hoare triple {128173#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (div |ULTIMATE.start_main_~init__r321~0#1| 256) (- 256))) 0)} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {128173#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (div |ULTIMATE.start_main_~init__r321~0#1| 256) (- 256))) 0)} is VALID [2022-02-20 18:39:21,928 INFO L290 TraceCheckUtils]: 17: Hoare triple {128173#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (div |ULTIMATE.start_main_~init__r321~0#1| 256) (- 256))) 0)} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {128172#false} is VALID [2022-02-20 18:39:21,928 INFO L290 TraceCheckUtils]: 18: Hoare triple {128172#false} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {128172#false} is VALID [2022-02-20 18:39:21,928 INFO L290 TraceCheckUtils]: 19: Hoare triple {128172#false} assume ~id1~0 != ~id2~0; {128172#false} is VALID [2022-02-20 18:39:21,928 INFO L290 TraceCheckUtils]: 20: Hoare triple {128172#false} assume ~id1~0 != ~id3~0; {128172#false} is VALID [2022-02-20 18:39:21,929 INFO L290 TraceCheckUtils]: 21: Hoare triple {128172#false} assume ~id2~0 != ~id3~0; {128172#false} is VALID [2022-02-20 18:39:21,929 INFO L290 TraceCheckUtils]: 22: Hoare triple {128172#false} assume ~id1~0 >= 0; {128172#false} is VALID [2022-02-20 18:39:21,929 INFO L290 TraceCheckUtils]: 23: Hoare triple {128172#false} assume ~id2~0 >= 0; {128172#false} is VALID [2022-02-20 18:39:21,929 INFO L290 TraceCheckUtils]: 24: Hoare triple {128172#false} assume ~id3~0 >= 0; {128172#false} is VALID [2022-02-20 18:39:21,929 INFO L290 TraceCheckUtils]: 25: Hoare triple {128172#false} assume 0 == ~r1~0; {128172#false} is VALID [2022-02-20 18:39:21,929 INFO L290 TraceCheckUtils]: 26: Hoare triple {128172#false} assume 0 == ~r2~0; {128172#false} is VALID [2022-02-20 18:39:21,929 INFO L290 TraceCheckUtils]: 27: Hoare triple {128172#false} assume 0 == ~r3~0; {128172#false} is VALID [2022-02-20 18:39:21,929 INFO L290 TraceCheckUtils]: 28: Hoare triple {128172#false} assume !(0 == main_~init__r122~0#1 % 256); {128172#false} is VALID [2022-02-20 18:39:21,930 INFO L290 TraceCheckUtils]: 29: Hoare triple {128172#false} assume !(0 == main_~init__r132~0#1 % 256); {128172#false} is VALID [2022-02-20 18:39:21,930 INFO L290 TraceCheckUtils]: 30: Hoare triple {128172#false} assume !(0 == main_~init__r212~0#1 % 256); {128172#false} is VALID [2022-02-20 18:39:21,930 INFO L290 TraceCheckUtils]: 31: Hoare triple {128172#false} assume !(0 == main_~init__r232~0#1 % 256); {128172#false} is VALID [2022-02-20 18:39:21,930 INFO L290 TraceCheckUtils]: 32: Hoare triple {128172#false} assume !(0 == main_~init__r312~0#1 % 256); {128172#false} is VALID [2022-02-20 18:39:21,930 INFO L290 TraceCheckUtils]: 33: Hoare triple {128172#false} assume !(0 == main_~init__r322~0#1 % 256); {128172#false} is VALID [2022-02-20 18:39:21,930 INFO L290 TraceCheckUtils]: 34: Hoare triple {128172#false} assume ~max1~0 == ~id1~0; {128172#false} is VALID [2022-02-20 18:39:21,930 INFO L290 TraceCheckUtils]: 35: Hoare triple {128172#false} assume ~max2~0 == ~id2~0; {128172#false} is VALID [2022-02-20 18:39:21,931 INFO L290 TraceCheckUtils]: 36: Hoare triple {128172#false} assume ~max3~0 == ~id3~0; {128172#false} is VALID [2022-02-20 18:39:21,931 INFO L290 TraceCheckUtils]: 37: Hoare triple {128172#false} assume 0 == ~st1~0; {128172#false} is VALID [2022-02-20 18:39:21,931 INFO L290 TraceCheckUtils]: 38: Hoare triple {128172#false} assume 0 == ~st2~0; {128172#false} is VALID [2022-02-20 18:39:21,931 INFO L290 TraceCheckUtils]: 39: Hoare triple {128172#false} assume 0 == ~st3~0; {128172#false} is VALID [2022-02-20 18:39:21,931 INFO L290 TraceCheckUtils]: 40: Hoare triple {128172#false} assume 0 == ~nl1~0; {128172#false} is VALID [2022-02-20 18:39:21,931 INFO L290 TraceCheckUtils]: 41: Hoare triple {128172#false} assume 0 == ~nl2~0; {128172#false} is VALID [2022-02-20 18:39:21,931 INFO L290 TraceCheckUtils]: 42: Hoare triple {128172#false} assume 0 == ~nl3~0; {128172#false} is VALID [2022-02-20 18:39:21,931 INFO L290 TraceCheckUtils]: 43: Hoare triple {128172#false} assume 0 == ~mode1~0 % 256; {128172#false} is VALID [2022-02-20 18:39:21,932 INFO L290 TraceCheckUtils]: 44: Hoare triple {128172#false} assume 0 == ~mode2~0 % 256; {128172#false} is VALID [2022-02-20 18:39:21,932 INFO L290 TraceCheckUtils]: 45: Hoare triple {128172#false} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1131~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1131~0; {128172#false} is VALID [2022-02-20 18:39:21,932 INFO L290 TraceCheckUtils]: 46: Hoare triple {128172#false} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {128172#false} is VALID [2022-02-20 18:39:21,932 INFO L290 TraceCheckUtils]: 47: Hoare triple {128172#false} assume main_~main__i2~0#1 < 6; {128172#false} is VALID [2022-02-20 18:39:21,932 INFO L290 TraceCheckUtils]: 48: Hoare triple {128172#false} assume !!(0 == ~mode1~0 % 256); {128172#false} is VALID [2022-02-20 18:39:21,932 INFO L290 TraceCheckUtils]: 49: Hoare triple {128172#false} assume ~r1~0 < 2; {128172#false} is VALID [2022-02-20 18:39:21,932 INFO L290 TraceCheckUtils]: 50: Hoare triple {128172#false} assume !!(0 == ~ep12~0 % 256); {128172#false} is VALID [2022-02-20 18:39:21,933 INFO L290 TraceCheckUtils]: 51: Hoare triple {128172#false} assume !!(0 == ~ep13~0 % 256); {128172#false} is VALID [2022-02-20 18:39:21,933 INFO L290 TraceCheckUtils]: 52: Hoare triple {128172#false} ~mode1~0 := 1; {128172#false} is VALID [2022-02-20 18:39:21,933 INFO L290 TraceCheckUtils]: 53: Hoare triple {128172#false} assume !!(0 == ~mode2~0 % 256); {128172#false} is VALID [2022-02-20 18:39:21,933 INFO L290 TraceCheckUtils]: 54: Hoare triple {128172#false} assume ~r2~0 < 2; {128172#false} is VALID [2022-02-20 18:39:21,933 INFO L290 TraceCheckUtils]: 55: Hoare triple {128172#false} assume !!(0 == ~ep21~0 % 256); {128172#false} is VALID [2022-02-20 18:39:21,933 INFO L290 TraceCheckUtils]: 56: Hoare triple {128172#false} assume !!(0 == ~ep23~0 % 256); {128172#false} is VALID [2022-02-20 18:39:21,933 INFO L290 TraceCheckUtils]: 57: Hoare triple {128172#false} ~mode2~0 := 1; {128172#false} is VALID [2022-02-20 18:39:21,934 INFO L290 TraceCheckUtils]: 58: Hoare triple {128172#false} assume !!(0 == ~mode3~0 % 256); {128172#false} is VALID [2022-02-20 18:39:21,934 INFO L290 TraceCheckUtils]: 59: Hoare triple {128172#false} assume ~r3~0 < 2; {128172#false} is VALID [2022-02-20 18:39:21,934 INFO L290 TraceCheckUtils]: 60: Hoare triple {128172#false} assume !!(0 == ~ep31~0 % 256); {128172#false} is VALID [2022-02-20 18:39:21,934 INFO L290 TraceCheckUtils]: 61: Hoare triple {128172#false} assume !!(0 == ~ep32~0 % 256); {128172#false} is VALID [2022-02-20 18:39:21,934 INFO L290 TraceCheckUtils]: 62: Hoare triple {128172#false} ~mode3~0 := 1;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {128172#false} is VALID [2022-02-20 18:39:21,934 INFO L290 TraceCheckUtils]: 63: Hoare triple {128172#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {128172#false} is VALID [2022-02-20 18:39:21,934 INFO L290 TraceCheckUtils]: 64: Hoare triple {128172#false} assume ~st1~0 + ~nl1~0 <= 1; {128172#false} is VALID [2022-02-20 18:39:21,934 INFO L290 TraceCheckUtils]: 65: Hoare triple {128172#false} assume ~st2~0 + ~nl2~0 <= 1; {128172#false} is VALID [2022-02-20 18:39:21,935 INFO L290 TraceCheckUtils]: 66: Hoare triple {128172#false} assume ~st3~0 + ~nl3~0 <= 1; {128172#false} is VALID [2022-02-20 18:39:21,935 INFO L290 TraceCheckUtils]: 67: Hoare triple {128172#false} assume !(~r1~0 >= 2); {128172#false} is VALID [2022-02-20 18:39:21,935 INFO L290 TraceCheckUtils]: 68: Hoare triple {128172#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {128172#false} is VALID [2022-02-20 18:39:21,935 INFO L290 TraceCheckUtils]: 69: Hoare triple {128172#false} assume ~r1~0 < 2; {128172#false} is VALID [2022-02-20 18:39:21,935 INFO L290 TraceCheckUtils]: 70: Hoare triple {128172#false} assume !(~r1~0 >= 2); {128172#false} is VALID [2022-02-20 18:39:21,935 INFO L290 TraceCheckUtils]: 71: Hoare triple {128172#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {128172#false} is VALID [2022-02-20 18:39:21,935 INFO L290 TraceCheckUtils]: 72: Hoare triple {128172#false} assume ~r1~0 < 2;main_~check__tmp~0#1 := 1;~__return_1259~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1259~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {128172#false} is VALID [2022-02-20 18:39:21,936 INFO L290 TraceCheckUtils]: 73: Hoare triple {128172#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {128172#false} is VALID [2022-02-20 18:39:21,936 INFO L290 TraceCheckUtils]: 74: Hoare triple {128172#false} assume main_~main__i2~0#1 < 6; {128172#false} is VALID [2022-02-20 18:39:21,936 INFO L290 TraceCheckUtils]: 75: Hoare triple {128172#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); {128172#false} is VALID [2022-02-20 18:39:21,936 INFO L290 TraceCheckUtils]: 76: Hoare triple {128172#false} assume !!(0 == ~ep21~0 % 256); {128172#false} is VALID [2022-02-20 18:39:21,936 INFO L290 TraceCheckUtils]: 77: Hoare triple {128172#false} assume !!(0 == ~ep31~0 % 256); {128172#false} is VALID [2022-02-20 18:39:21,936 INFO L290 TraceCheckUtils]: 78: Hoare triple {128172#false} assume 1 == ~r1~0; {128172#false} is VALID [2022-02-20 18:39:21,936 INFO L290 TraceCheckUtils]: 79: Hoare triple {128172#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {128172#false} is VALID [2022-02-20 18:39:21,937 INFO L290 TraceCheckUtils]: 80: Hoare triple {128172#false} ~mode1~0 := 0; {128172#false} is VALID [2022-02-20 18:39:21,937 INFO L290 TraceCheckUtils]: 81: Hoare triple {128172#false} assume !(0 == ~mode2~0 % 256);~r2~0 := (if (1 + ~r2~0) % 256 <= 127 then (1 + ~r2~0) % 256 else (1 + ~r2~0) % 256 - 256); {128172#false} is VALID [2022-02-20 18:39:21,937 INFO L290 TraceCheckUtils]: 82: Hoare triple {128172#false} assume !!(0 == ~ep12~0 % 256); {128172#false} is VALID [2022-02-20 18:39:21,937 INFO L290 TraceCheckUtils]: 83: Hoare triple {128172#false} assume !!(0 == ~ep32~0 % 256); {128172#false} is VALID [2022-02-20 18:39:21,937 INFO L290 TraceCheckUtils]: 84: Hoare triple {128172#false} assume !(2 == ~r2~0);~mode2~0 := 0; {128172#false} is VALID [2022-02-20 18:39:21,937 INFO L290 TraceCheckUtils]: 85: Hoare triple {128172#false} assume !(0 == ~mode3~0 % 256);~r3~0 := (if (1 + ~r3~0) % 256 <= 127 then (1 + ~r3~0) % 256 else (1 + ~r3~0) % 256 - 256); {128172#false} is VALID [2022-02-20 18:39:21,937 INFO L290 TraceCheckUtils]: 86: Hoare triple {128172#false} assume !!(0 == ~ep13~0 % 256); {128172#false} is VALID [2022-02-20 18:39:21,938 INFO L290 TraceCheckUtils]: 87: Hoare triple {128172#false} assume !!(0 == ~ep23~0 % 256); {128172#false} is VALID [2022-02-20 18:39:21,938 INFO L290 TraceCheckUtils]: 88: Hoare triple {128172#false} assume !(2 == ~r3~0);~mode3~0 := 0;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {128172#false} is VALID [2022-02-20 18:39:21,938 INFO L290 TraceCheckUtils]: 89: Hoare triple {128172#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {128172#false} is VALID [2022-02-20 18:39:21,938 INFO L290 TraceCheckUtils]: 90: Hoare triple {128172#false} assume ~st1~0 + ~nl1~0 <= 1; {128172#false} is VALID [2022-02-20 18:39:21,938 INFO L290 TraceCheckUtils]: 91: Hoare triple {128172#false} assume ~st2~0 + ~nl2~0 <= 1; {128172#false} is VALID [2022-02-20 18:39:21,938 INFO L290 TraceCheckUtils]: 92: Hoare triple {128172#false} assume ~st3~0 + ~nl3~0 <= 1; {128172#false} is VALID [2022-02-20 18:39:21,938 INFO L290 TraceCheckUtils]: 93: Hoare triple {128172#false} assume !(~r1~0 >= 2); {128172#false} is VALID [2022-02-20 18:39:21,938 INFO L290 TraceCheckUtils]: 94: Hoare triple {128172#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {128172#false} is VALID [2022-02-20 18:39:21,939 INFO L290 TraceCheckUtils]: 95: Hoare triple {128172#false} ~__return_1378~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1378~0;~__tmp_1379_0~0 := main_~main____CPAchecker_TMP_0~0#1; {128172#false} is VALID [2022-02-20 18:39:21,939 INFO L290 TraceCheckUtils]: 96: Hoare triple {128172#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1379_0~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {128172#false} is VALID [2022-02-20 18:39:21,939 INFO L290 TraceCheckUtils]: 97: Hoare triple {128172#false} assume 0 == main_~assert__arg~1#1 % 256; {128172#false} is VALID [2022-02-20 18:39:21,939 INFO L290 TraceCheckUtils]: 98: Hoare triple {128172#false} assume !false; {128172#false} is VALID [2022-02-20 18:39:21,939 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:39:21,940 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:39:21,940 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588667942] [2022-02-20 18:39:21,940 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588667942] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:39:21,940 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:39:21,940 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:39:21,940 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449338496] [2022-02-20 18:39:21,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:39:21,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-02-20 18:39:21,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:39:21,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:22,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:22,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:39:22,006 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:39:22,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:39:22,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:39:22,007 INFO L87 Difference]: Start difference. First operand 7127 states and 10301 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)