./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-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.UNBOUNDED.pals.c.v+lhb-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 2559d3a6c04b61173c16b2e753022225b6e6ebf2029cdd5907fde2e04c0fda92 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:38:31,705 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:38:31,708 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:38:31,740 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:38:31,742 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:38:31,746 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:38:31,749 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:38:31,752 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:38:31,754 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:38:31,756 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:38:31,757 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:38:31,758 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:38:31,758 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:38:31,759 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:38:31,760 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:38:31,761 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:38:31,761 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:38:31,762 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:38:31,763 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:38:31,764 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:38:31,765 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:38:31,766 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:38:31,767 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:38:31,768 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:38:31,770 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:38:31,770 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:38:31,770 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:38:31,771 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:38:31,772 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:38:31,772 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:38:31,772 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:38:31,773 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:38:31,774 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:38:31,774 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:38:31,775 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:38:31,775 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:38:31,776 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:38:31,776 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:38:31,780 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:38:31,784 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:38:31,785 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:38:31,786 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:31,798 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:38:31,801 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:38:31,802 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:38:31,802 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:38:31,802 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:38:31,803 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:38:31,803 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:38:31,803 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:38:31,803 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:38:31,803 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:38:31,804 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:38:31,804 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:38:31,804 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:38:31,804 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:38:31,805 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:38:31,805 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:38:31,805 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:38:31,805 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:38:31,805 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:38:31,805 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:38:31,805 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:38:31,806 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:38:31,806 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:38:31,806 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:38:31,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:38:31,806 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:38:31,806 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:38:31,807 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:38:31,807 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:38:31,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:38:31,808 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:38:31,808 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:38:31,808 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:38:31,808 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 -> 2559d3a6c04b61173c16b2e753022225b6e6ebf2029cdd5907fde2e04c0fda92 [2022-02-20 18:38:32,067 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:38:32,093 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:38:32,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:38:32,110 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:38:32,110 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:38:32,111 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.UNBOUNDED.pals.c.v+lhb-reducer.c [2022-02-20 18:38:32,196 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7852a1b75/f85a3e68c6f34687ac3d6bd703ba7795/FLAG199f2bf1a [2022-02-20 18:38:32,576 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:38:32,577 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2022-02-20 18:38:32,589 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7852a1b75/f85a3e68c6f34687ac3d6bd703ba7795/FLAG199f2bf1a [2022-02-20 18:38:32,600 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7852a1b75/f85a3e68c6f34687ac3d6bd703ba7795 [2022-02-20 18:38:32,602 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:38:32,604 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:38:32,606 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:38:32,606 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:38:32,608 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:38:32,609 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:38:32" (1/1) ... [2022-02-20 18:38:32,609 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77ca0e29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:32, skipping insertion in model container [2022-02-20 18:38:32,610 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:38:32" (1/1) ... [2022-02-20 18:38:32,614 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:38:32,644 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:38:32,825 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.UNBOUNDED.pals.c.v+lhb-reducer.c[9657,9670] [2022-02-20 18:38:32,841 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.UNBOUNDED.pals.c.v+lhb-reducer.c[12013,12026] [2022-02-20 18:38:32,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:38:32,900 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:38:32,937 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.UNBOUNDED.pals.c.v+lhb-reducer.c[9657,9670] [2022-02-20 18:38:32,947 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.UNBOUNDED.pals.c.v+lhb-reducer.c[12013,12026] [2022-02-20 18:38:32,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:38:32,987 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:38:32,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:32 WrapperNode [2022-02-20 18:38:32,988 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:38:32,989 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:38:32,989 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:38:32,989 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:38:32,993 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:32" (1/1) ... [2022-02-20 18:38:33,001 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:32" (1/1) ... [2022-02-20 18:38:33,041 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 971 [2022-02-20 18:38:33,041 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:38:33,042 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:38:33,042 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:38:33,042 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:38:33,048 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:32" (1/1) ... [2022-02-20 18:38:33,048 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:32" (1/1) ... [2022-02-20 18:38:33,050 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:32" (1/1) ... [2022-02-20 18:38:33,050 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:32" (1/1) ... [2022-02-20 18:38:33,066 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:32" (1/1) ... [2022-02-20 18:38:33,072 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:32" (1/1) ... [2022-02-20 18:38:33,074 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:32" (1/1) ... [2022-02-20 18:38:33,077 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:38:33,077 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:38:33,078 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:38:33,078 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:38:33,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:32" (1/1) ... [2022-02-20 18:38:33,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:38:33,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:38:33,124 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:33,126 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:33,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:38:33,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:38:33,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:38:33,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:38:33,246 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:38:33,247 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:38:34,067 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:38:34,074 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:38:34,074 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:38:34,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:38:34 BoogieIcfgContainer [2022-02-20 18:38:34,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:38:34,077 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:38:34,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:38:34,080 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:38:34,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:38:32" (1/3) ... [2022-02-20 18:38:34,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4139c039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:38:34, skipping insertion in model container [2022-02-20 18:38:34,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:32" (2/3) ... [2022-02-20 18:38:34,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4139c039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:38:34, skipping insertion in model container [2022-02-20 18:38:34,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:38:34" (3/3) ... [2022-02-20 18:38:34,082 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2022-02-20 18:38:34,085 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:38:34,086 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 18:38:34,116 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:38:34,121 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:34,121 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 18:38:34,137 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 242 states have (on average 1.7975206611570247) internal successors, (435), 244 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call 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,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-20 18:38:34,145 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:34,146 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] [2022-02-20 18:38:34,147 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:34,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:34,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1484652330, now seen corresponding path program 1 times [2022-02-20 18:38:34,157 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:34,158 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889111568] [2022-02-20 18:38:34,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:34,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:34,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:34,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {248#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_1142~0 := 0;~__return_1270~0 := 0;~__return_1696~0 := 0;~__return_1389~0 := 0;~__return_1499~0 := 0; {248#true} is VALID [2022-02-20 18:38:34,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {248#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~check__tmp~3#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_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#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;~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;~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;~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; {250#(= (+ (* (- 1) ~ep12~0) |ULTIMATE.start_main_~init__r121~0#1|) 0)} is VALID [2022-02-20 18:38:34,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {250#(= (+ (* (- 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; {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,467 INFO L290 TraceCheckUtils]: 3: Hoare triple {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,467 INFO L290 TraceCheckUtils]: 4: Hoare triple {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {251#(<= (+ (* (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); {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {251#(<= (+ (* (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); {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {251#(<= (+ (* (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); {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,474 INFO L290 TraceCheckUtils]: 10: Hoare triple {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {251#(<= (+ (* (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); {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,476 INFO L290 TraceCheckUtils]: 13: Hoare triple {251#(<= (+ (* (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); {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,476 INFO L290 TraceCheckUtils]: 14: Hoare triple {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id1~0 != ~id2~0; {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,477 INFO L290 TraceCheckUtils]: 15: Hoare triple {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id1~0 != ~id3~0; {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,478 INFO L290 TraceCheckUtils]: 16: Hoare triple {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id2~0 != ~id3~0; {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,478 INFO L290 TraceCheckUtils]: 17: Hoare triple {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id1~0 >= 0; {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,479 INFO L290 TraceCheckUtils]: 18: Hoare triple {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id2~0 >= 0; {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,479 INFO L290 TraceCheckUtils]: 19: Hoare triple {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id3~0 >= 0; {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,480 INFO L290 TraceCheckUtils]: 20: Hoare triple {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~r1~0 % 256; {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,480 INFO L290 TraceCheckUtils]: 21: Hoare triple {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~r2~0 % 256; {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,481 INFO L290 TraceCheckUtils]: 22: Hoare triple {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~r3~0 % 256; {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,482 INFO L290 TraceCheckUtils]: 23: Hoare triple {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r122~0#1 % 256); {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,482 INFO L290 TraceCheckUtils]: 24: Hoare triple {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r132~0#1 % 256); {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,483 INFO L290 TraceCheckUtils]: 25: Hoare triple {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r212~0#1 % 256); {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,483 INFO L290 TraceCheckUtils]: 26: Hoare triple {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r232~0#1 % 256); {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,484 INFO L290 TraceCheckUtils]: 27: Hoare triple {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r312~0#1 % 256); {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,484 INFO L290 TraceCheckUtils]: 28: Hoare triple {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r322~0#1 % 256); {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,485 INFO L290 TraceCheckUtils]: 29: Hoare triple {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~max1~0 == ~id1~0; {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,485 INFO L290 TraceCheckUtils]: 30: Hoare triple {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~max2~0 == ~id2~0; {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,486 INFO L290 TraceCheckUtils]: 31: Hoare triple {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~max3~0 == ~id3~0; {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,486 INFO L290 TraceCheckUtils]: 32: Hoare triple {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~st1~0; {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,487 INFO L290 TraceCheckUtils]: 33: Hoare triple {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~st2~0; {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,487 INFO L290 TraceCheckUtils]: 34: Hoare triple {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~st3~0; {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,488 INFO L290 TraceCheckUtils]: 35: Hoare triple {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~nl1~0; {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,488 INFO L290 TraceCheckUtils]: 36: Hoare triple {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~nl2~0; {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,489 INFO L290 TraceCheckUtils]: 37: Hoare triple {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~nl3~0; {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,490 INFO L290 TraceCheckUtils]: 38: Hoare triple {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~mode1~0 % 256; {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,490 INFO L290 TraceCheckUtils]: 39: Hoare triple {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~mode2~0 % 256; {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,491 INFO L290 TraceCheckUtils]: 40: Hoare triple {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1142~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1142~0; {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,491 INFO L290 TraceCheckUtils]: 41: Hoare triple {251#(<= (+ (* (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; {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,492 INFO L290 TraceCheckUtils]: 42: Hoare triple {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !!(0 == ~mode1~0 % 256); {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,492 INFO L290 TraceCheckUtils]: 43: Hoare triple {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~r1~0 % 256 < 2; {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:34,493 INFO L290 TraceCheckUtils]: 44: Hoare triple {251#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !!(0 == ~ep12~0 % 256); {249#false} is VALID [2022-02-20 18:38:34,493 INFO L290 TraceCheckUtils]: 45: Hoare triple {249#false} assume !!(0 == ~ep13~0 % 256); {249#false} is VALID [2022-02-20 18:38:34,493 INFO L290 TraceCheckUtils]: 46: Hoare triple {249#false} ~mode1~0 := 1; {249#false} is VALID [2022-02-20 18:38:34,494 INFO L290 TraceCheckUtils]: 47: Hoare triple {249#false} assume !!(0 == ~mode2~0 % 256); {249#false} is VALID [2022-02-20 18:38:34,494 INFO L290 TraceCheckUtils]: 48: Hoare triple {249#false} assume ~r2~0 % 256 < 2; {249#false} is VALID [2022-02-20 18:38:34,494 INFO L290 TraceCheckUtils]: 49: Hoare triple {249#false} assume !!(0 == ~ep21~0 % 256); {249#false} is VALID [2022-02-20 18:38:34,494 INFO L290 TraceCheckUtils]: 50: Hoare triple {249#false} assume !!(0 == ~ep23~0 % 256); {249#false} is VALID [2022-02-20 18:38:34,494 INFO L290 TraceCheckUtils]: 51: Hoare triple {249#false} ~mode2~0 := 1; {249#false} is VALID [2022-02-20 18:38:34,495 INFO L290 TraceCheckUtils]: 52: Hoare triple {249#false} assume !!(0 == ~mode3~0 % 256); {249#false} is VALID [2022-02-20 18:38:34,495 INFO L290 TraceCheckUtils]: 53: Hoare triple {249#false} assume ~r3~0 % 256 < 2; {249#false} is VALID [2022-02-20 18:38:34,495 INFO L290 TraceCheckUtils]: 54: Hoare triple {249#false} assume !!(0 == ~ep31~0 % 256); {249#false} is VALID [2022-02-20 18:38:34,495 INFO L290 TraceCheckUtils]: 55: Hoare triple {249#false} assume !!(0 == ~ep32~0 % 256); {249#false} is VALID [2022-02-20 18:38:34,495 INFO L290 TraceCheckUtils]: 56: Hoare triple {249#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; {249#false} is VALID [2022-02-20 18:38:34,496 INFO L290 TraceCheckUtils]: 57: Hoare triple {249#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {249#false} is VALID [2022-02-20 18:38:34,496 INFO L290 TraceCheckUtils]: 58: Hoare triple {249#false} assume ~st1~0 + ~nl1~0 <= 1; {249#false} is VALID [2022-02-20 18:38:34,496 INFO L290 TraceCheckUtils]: 59: Hoare triple {249#false} assume ~st2~0 + ~nl2~0 <= 1; {249#false} is VALID [2022-02-20 18:38:34,496 INFO L290 TraceCheckUtils]: 60: Hoare triple {249#false} assume ~st3~0 + ~nl3~0 <= 1; {249#false} is VALID [2022-02-20 18:38:34,496 INFO L290 TraceCheckUtils]: 61: Hoare triple {249#false} assume !(~r1~0 % 256 >= 2); {249#false} is VALID [2022-02-20 18:38:34,496 INFO L290 TraceCheckUtils]: 62: Hoare triple {249#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {249#false} is VALID [2022-02-20 18:38:34,497 INFO L290 TraceCheckUtils]: 63: Hoare triple {249#false} assume ~r1~0 % 256 < 2; {249#false} is VALID [2022-02-20 18:38:34,497 INFO L290 TraceCheckUtils]: 64: Hoare triple {249#false} assume !(~r1~0 % 256 >= 2); {249#false} is VALID [2022-02-20 18:38:34,497 INFO L290 TraceCheckUtils]: 65: Hoare triple {249#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {249#false} is VALID [2022-02-20 18:38:34,497 INFO L290 TraceCheckUtils]: 66: Hoare triple {249#false} assume ~r1~0 % 256 < 2;main_~check__tmp~0#1 := 1;~__return_1270~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1270~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; {249#false} is VALID [2022-02-20 18:38:34,497 INFO L290 TraceCheckUtils]: 67: Hoare triple {249#false} assume !(0 == main_~assert__arg~0#1 % 256); {249#false} is VALID [2022-02-20 18:38:34,498 INFO L290 TraceCheckUtils]: 68: Hoare triple {249#false} assume !(0 == ~mode1~0 % 256); {249#false} is VALID [2022-02-20 18:38:34,498 INFO L290 TraceCheckUtils]: 69: Hoare triple {249#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {249#false} is VALID [2022-02-20 18:38:34,498 INFO L290 TraceCheckUtils]: 70: Hoare triple {249#false} assume !!(0 == ~ep21~0 % 256); {249#false} is VALID [2022-02-20 18:38:34,498 INFO L290 TraceCheckUtils]: 71: Hoare triple {249#false} assume !!(0 == ~ep31~0 % 256); {249#false} is VALID [2022-02-20 18:38:34,498 INFO L290 TraceCheckUtils]: 72: Hoare triple {249#false} assume 1 == ~r1~0 % 256; {249#false} is VALID [2022-02-20 18:38:34,499 INFO L290 TraceCheckUtils]: 73: Hoare triple {249#false} assume ~max1~0 == ~id1~0;~st1~0 := 1;~mode1~0 := 0; {249#false} is VALID [2022-02-20 18:38:34,499 INFO L290 TraceCheckUtils]: 74: Hoare triple {249#false} assume !(0 == ~mode2~0 % 256); {249#false} is VALID [2022-02-20 18:38:34,499 INFO L290 TraceCheckUtils]: 75: Hoare triple {249#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {249#false} is VALID [2022-02-20 18:38:34,499 INFO L290 TraceCheckUtils]: 76: Hoare triple {249#false} assume !!(0 == ~ep12~0 % 256); {249#false} is VALID [2022-02-20 18:38:34,499 INFO L290 TraceCheckUtils]: 77: Hoare triple {249#false} assume !!(0 == ~ep32~0 % 256); {249#false} is VALID [2022-02-20 18:38:34,500 INFO L290 TraceCheckUtils]: 78: Hoare triple {249#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0; {249#false} is VALID [2022-02-20 18:38:34,500 INFO L290 TraceCheckUtils]: 79: Hoare triple {249#false} assume !(0 == ~mode3~0 % 256); {249#false} is VALID [2022-02-20 18:38:34,500 INFO L290 TraceCheckUtils]: 80: Hoare triple {249#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {249#false} is VALID [2022-02-20 18:38:34,500 INFO L290 TraceCheckUtils]: 81: Hoare triple {249#false} assume !!(0 == ~ep13~0 % 256); {249#false} is VALID [2022-02-20 18:38:34,501 INFO L290 TraceCheckUtils]: 82: Hoare triple {249#false} assume !!(0 == ~ep23~0 % 256); {249#false} is VALID [2022-02-20 18:38:34,501 INFO L290 TraceCheckUtils]: 83: Hoare triple {249#false} assume !(2 == ~r3~0 % 256);~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; {249#false} is VALID [2022-02-20 18:38:34,501 INFO L290 TraceCheckUtils]: 84: Hoare triple {249#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {249#false} is VALID [2022-02-20 18:38:34,501 INFO L290 TraceCheckUtils]: 85: Hoare triple {249#false} assume ~st1~0 + ~nl1~0 <= 1; {249#false} is VALID [2022-02-20 18:38:34,501 INFO L290 TraceCheckUtils]: 86: Hoare triple {249#false} assume ~st2~0 + ~nl2~0 <= 1; {249#false} is VALID [2022-02-20 18:38:34,501 INFO L290 TraceCheckUtils]: 87: Hoare triple {249#false} assume ~st3~0 + ~nl3~0 <= 1; {249#false} is VALID [2022-02-20 18:38:34,502 INFO L290 TraceCheckUtils]: 88: Hoare triple {249#false} assume !(~r1~0 % 256 >= 2); {249#false} is VALID [2022-02-20 18:38:34,502 INFO L290 TraceCheckUtils]: 89: Hoare triple {249#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1696~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1696~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; {249#false} is VALID [2022-02-20 18:38:34,502 INFO L290 TraceCheckUtils]: 90: Hoare triple {249#false} assume 0 == main_~assert__arg~1#1 % 256; {249#false} is VALID [2022-02-20 18:38:34,502 INFO L290 TraceCheckUtils]: 91: Hoare triple {249#false} assume !false; {249#false} is VALID [2022-02-20 18:38:34,504 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:34,504 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:34,504 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889111568] [2022-02-20 18:38:34,505 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889111568] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:34,505 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:34,505 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:38:34,506 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646565822] [2022-02-20 18:38:34,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:34,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2022-02-20 18:38:34,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:34,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call 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,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:34,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:38:34,593 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:34,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:38:34,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:38:34,617 INFO L87 Difference]: Start difference. First operand has 245 states, 242 states have (on average 1.7975206611570247) internal successors, (435), 244 states have internal predecessors, (435), 0 states have call successors, (0), 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 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call 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,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:35,740 INFO L93 Difference]: Finished difference Result 709 states and 1262 transitions. [2022-02-20 18:38:35,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:38:35,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2022-02-20 18:38:35,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:35,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call 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,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1262 transitions. [2022-02-20 18:38:35,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call 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,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1262 transitions. [2022-02-20 18:38:35,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 1262 transitions. [2022-02-20 18:38:36,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1262 edges. 1262 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:36,766 INFO L225 Difference]: With dead ends: 709 [2022-02-20 18:38:36,767 INFO L226 Difference]: Without dead ends: 467 [2022-02-20 18:38:36,770 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:36,774 INFO L933 BasicCegarLoop]: 716 mSDtfsCounter, 899 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:38:36,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [899 Valid, 1111 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:36,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2022-02-20 18:38:36,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 446. [2022-02-20 18:38:36,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:36,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 467 states. Second operand has 446 states, 444 states have (on average 1.4639639639639639) internal successors, (650), 445 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call 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,885 INFO L74 IsIncluded]: Start isIncluded. First operand 467 states. Second operand has 446 states, 444 states have (on average 1.4639639639639639) internal successors, (650), 445 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call 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,886 INFO L87 Difference]: Start difference. First operand 467 states. Second operand has 446 states, 444 states have (on average 1.4639639639639639) internal successors, (650), 445 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call 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,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:36,899 INFO L93 Difference]: Finished difference Result 467 states and 675 transitions. [2022-02-20 18:38:36,899 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 675 transitions. [2022-02-20 18:38:36,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:36,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:36,902 INFO L74 IsIncluded]: Start isIncluded. First operand has 446 states, 444 states have (on average 1.4639639639639639) internal successors, (650), 445 states have internal predecessors, (650), 0 states have call successors, (0), 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 467 states. [2022-02-20 18:38:36,902 INFO L87 Difference]: Start difference. First operand has 446 states, 444 states have (on average 1.4639639639639639) internal successors, (650), 445 states have internal predecessors, (650), 0 states have call successors, (0), 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 467 states. [2022-02-20 18:38:36,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:36,915 INFO L93 Difference]: Finished difference Result 467 states and 675 transitions. [2022-02-20 18:38:36,915 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 675 transitions. [2022-02-20 18:38:36,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:36,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:36,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:36,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:36,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 444 states have (on average 1.4639639639639639) internal successors, (650), 445 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call 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,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 650 transitions. [2022-02-20 18:38:36,931 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 650 transitions. Word has length 92 [2022-02-20 18:38:36,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:36,931 INFO L470 AbstractCegarLoop]: Abstraction has 446 states and 650 transitions. [2022-02-20 18:38:36,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call 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,931 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 650 transitions. [2022-02-20 18:38:36,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-02-20 18:38:36,933 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:36,933 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] [2022-02-20 18:38:36,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:38:36,934 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:36,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:36,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1677829578, now seen corresponding path program 1 times [2022-02-20 18:38:36,934 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:36,935 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274449331] [2022-02-20 18:38:36,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:36,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:37,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {2695#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_1142~0 := 0;~__return_1270~0 := 0;~__return_1696~0 := 0;~__return_1389~0 := 0;~__return_1499~0 := 0; {2695#true} is VALID [2022-02-20 18:38:37,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {2695#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~check__tmp~3#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_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#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;~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;~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;~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; {2695#true} is VALID [2022-02-20 18:38:37,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {2695#true} assume !!(0 == main_~init__r121~0#1 % 256); {2695#true} is VALID [2022-02-20 18:38:37,010 INFO L290 TraceCheckUtils]: 3: Hoare triple {2695#true} assume !!(0 == main_~init__r131~0#1 % 256);main_~init__tmp~0#1 := 0; {2697#(= (+ (* (- 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:37,011 INFO L290 TraceCheckUtils]: 4: Hoare triple {2697#(= (+ (* (- 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); {2697#(= (+ (* (- 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:37,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {2697#(= (+ (* (- 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; {2696#false} is VALID [2022-02-20 18:38:37,012 INFO L290 TraceCheckUtils]: 6: Hoare triple {2696#false} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {2696#false} is VALID [2022-02-20 18:38:37,012 INFO L290 TraceCheckUtils]: 7: Hoare triple {2696#false} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {2696#false} is VALID [2022-02-20 18:38:37,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {2696#false} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {2696#false} is VALID [2022-02-20 18:38:37,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {2696#false} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {2696#false} is VALID [2022-02-20 18:38:37,012 INFO L290 TraceCheckUtils]: 10: Hoare triple {2696#false} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {2696#false} is VALID [2022-02-20 18:38:37,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {2696#false} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {2696#false} is VALID [2022-02-20 18:38:37,013 INFO L290 TraceCheckUtils]: 12: Hoare triple {2696#false} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {2696#false} is VALID [2022-02-20 18:38:37,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {2696#false} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {2696#false} is VALID [2022-02-20 18:38:37,013 INFO L290 TraceCheckUtils]: 14: Hoare triple {2696#false} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {2696#false} is VALID [2022-02-20 18:38:37,013 INFO L290 TraceCheckUtils]: 15: Hoare triple {2696#false} assume ~id1~0 != ~id2~0; {2696#false} is VALID [2022-02-20 18:38:37,013 INFO L290 TraceCheckUtils]: 16: Hoare triple {2696#false} assume ~id1~0 != ~id3~0; {2696#false} is VALID [2022-02-20 18:38:37,013 INFO L290 TraceCheckUtils]: 17: Hoare triple {2696#false} assume ~id2~0 != ~id3~0; {2696#false} is VALID [2022-02-20 18:38:37,014 INFO L290 TraceCheckUtils]: 18: Hoare triple {2696#false} assume ~id1~0 >= 0; {2696#false} is VALID [2022-02-20 18:38:37,014 INFO L290 TraceCheckUtils]: 19: Hoare triple {2696#false} assume ~id2~0 >= 0; {2696#false} is VALID [2022-02-20 18:38:37,014 INFO L290 TraceCheckUtils]: 20: Hoare triple {2696#false} assume ~id3~0 >= 0; {2696#false} is VALID [2022-02-20 18:38:37,014 INFO L290 TraceCheckUtils]: 21: Hoare triple {2696#false} assume 0 == ~r1~0 % 256; {2696#false} is VALID [2022-02-20 18:38:37,014 INFO L290 TraceCheckUtils]: 22: Hoare triple {2696#false} assume 0 == ~r2~0 % 256; {2696#false} is VALID [2022-02-20 18:38:37,014 INFO L290 TraceCheckUtils]: 23: Hoare triple {2696#false} assume 0 == ~r3~0 % 256; {2696#false} is VALID [2022-02-20 18:38:37,014 INFO L290 TraceCheckUtils]: 24: Hoare triple {2696#false} assume !(0 == main_~init__r122~0#1 % 256); {2696#false} is VALID [2022-02-20 18:38:37,015 INFO L290 TraceCheckUtils]: 25: Hoare triple {2696#false} assume !(0 == main_~init__r132~0#1 % 256); {2696#false} is VALID [2022-02-20 18:38:37,015 INFO L290 TraceCheckUtils]: 26: Hoare triple {2696#false} assume !(0 == main_~init__r212~0#1 % 256); {2696#false} is VALID [2022-02-20 18:38:37,015 INFO L290 TraceCheckUtils]: 27: Hoare triple {2696#false} assume !(0 == main_~init__r232~0#1 % 256); {2696#false} is VALID [2022-02-20 18:38:37,015 INFO L290 TraceCheckUtils]: 28: Hoare triple {2696#false} assume !(0 == main_~init__r312~0#1 % 256); {2696#false} is VALID [2022-02-20 18:38:37,015 INFO L290 TraceCheckUtils]: 29: Hoare triple {2696#false} assume !(0 == main_~init__r322~0#1 % 256); {2696#false} is VALID [2022-02-20 18:38:37,015 INFO L290 TraceCheckUtils]: 30: Hoare triple {2696#false} assume ~max1~0 == ~id1~0; {2696#false} is VALID [2022-02-20 18:38:37,016 INFO L290 TraceCheckUtils]: 31: Hoare triple {2696#false} assume ~max2~0 == ~id2~0; {2696#false} is VALID [2022-02-20 18:38:37,016 INFO L290 TraceCheckUtils]: 32: Hoare triple {2696#false} assume ~max3~0 == ~id3~0; {2696#false} is VALID [2022-02-20 18:38:37,016 INFO L290 TraceCheckUtils]: 33: Hoare triple {2696#false} assume 0 == ~st1~0; {2696#false} is VALID [2022-02-20 18:38:37,016 INFO L290 TraceCheckUtils]: 34: Hoare triple {2696#false} assume 0 == ~st2~0; {2696#false} is VALID [2022-02-20 18:38:37,016 INFO L290 TraceCheckUtils]: 35: Hoare triple {2696#false} assume 0 == ~st3~0; {2696#false} is VALID [2022-02-20 18:38:37,016 INFO L290 TraceCheckUtils]: 36: Hoare triple {2696#false} assume 0 == ~nl1~0; {2696#false} is VALID [2022-02-20 18:38:37,016 INFO L290 TraceCheckUtils]: 37: Hoare triple {2696#false} assume 0 == ~nl2~0; {2696#false} is VALID [2022-02-20 18:38:37,017 INFO L290 TraceCheckUtils]: 38: Hoare triple {2696#false} assume 0 == ~nl3~0; {2696#false} is VALID [2022-02-20 18:38:37,017 INFO L290 TraceCheckUtils]: 39: Hoare triple {2696#false} assume 0 == ~mode1~0 % 256; {2696#false} is VALID [2022-02-20 18:38:37,017 INFO L290 TraceCheckUtils]: 40: Hoare triple {2696#false} assume 0 == ~mode2~0 % 256; {2696#false} is VALID [2022-02-20 18:38:37,017 INFO L290 TraceCheckUtils]: 41: Hoare triple {2696#false} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1142~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1142~0; {2696#false} is VALID [2022-02-20 18:38:37,017 INFO L290 TraceCheckUtils]: 42: Hoare triple {2696#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; {2696#false} is VALID [2022-02-20 18:38:37,017 INFO L290 TraceCheckUtils]: 43: Hoare triple {2696#false} assume !!(0 == ~mode1~0 % 256); {2696#false} is VALID [2022-02-20 18:38:37,018 INFO L290 TraceCheckUtils]: 44: Hoare triple {2696#false} assume ~r1~0 % 256 < 2; {2696#false} is VALID [2022-02-20 18:38:37,018 INFO L290 TraceCheckUtils]: 45: Hoare triple {2696#false} assume !!(0 == ~ep12~0 % 256); {2696#false} is VALID [2022-02-20 18:38:37,018 INFO L290 TraceCheckUtils]: 46: Hoare triple {2696#false} assume !!(0 == ~ep13~0 % 256); {2696#false} is VALID [2022-02-20 18:38:37,018 INFO L290 TraceCheckUtils]: 47: Hoare triple {2696#false} ~mode1~0 := 1; {2696#false} is VALID [2022-02-20 18:38:37,018 INFO L290 TraceCheckUtils]: 48: Hoare triple {2696#false} assume !!(0 == ~mode2~0 % 256); {2696#false} is VALID [2022-02-20 18:38:37,018 INFO L290 TraceCheckUtils]: 49: Hoare triple {2696#false} assume ~r2~0 % 256 < 2; {2696#false} is VALID [2022-02-20 18:38:37,018 INFO L290 TraceCheckUtils]: 50: Hoare triple {2696#false} assume !!(0 == ~ep21~0 % 256); {2696#false} is VALID [2022-02-20 18:38:37,019 INFO L290 TraceCheckUtils]: 51: Hoare triple {2696#false} assume !!(0 == ~ep23~0 % 256); {2696#false} is VALID [2022-02-20 18:38:37,019 INFO L290 TraceCheckUtils]: 52: Hoare triple {2696#false} ~mode2~0 := 1; {2696#false} is VALID [2022-02-20 18:38:37,019 INFO L290 TraceCheckUtils]: 53: Hoare triple {2696#false} assume !!(0 == ~mode3~0 % 256); {2696#false} is VALID [2022-02-20 18:38:37,019 INFO L290 TraceCheckUtils]: 54: Hoare triple {2696#false} assume ~r3~0 % 256 < 2; {2696#false} is VALID [2022-02-20 18:38:37,019 INFO L290 TraceCheckUtils]: 55: Hoare triple {2696#false} assume !!(0 == ~ep31~0 % 256); {2696#false} is VALID [2022-02-20 18:38:37,019 INFO L290 TraceCheckUtils]: 56: Hoare triple {2696#false} assume !!(0 == ~ep32~0 % 256); {2696#false} is VALID [2022-02-20 18:38:37,020 INFO L290 TraceCheckUtils]: 57: Hoare triple {2696#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; {2696#false} is VALID [2022-02-20 18:38:37,020 INFO L290 TraceCheckUtils]: 58: Hoare triple {2696#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2696#false} is VALID [2022-02-20 18:38:37,020 INFO L290 TraceCheckUtils]: 59: Hoare triple {2696#false} assume ~st1~0 + ~nl1~0 <= 1; {2696#false} is VALID [2022-02-20 18:38:37,020 INFO L290 TraceCheckUtils]: 60: Hoare triple {2696#false} assume ~st2~0 + ~nl2~0 <= 1; {2696#false} is VALID [2022-02-20 18:38:37,020 INFO L290 TraceCheckUtils]: 61: Hoare triple {2696#false} assume ~st3~0 + ~nl3~0 <= 1; {2696#false} is VALID [2022-02-20 18:38:37,020 INFO L290 TraceCheckUtils]: 62: Hoare triple {2696#false} assume !(~r1~0 % 256 >= 2); {2696#false} is VALID [2022-02-20 18:38:37,020 INFO L290 TraceCheckUtils]: 63: Hoare triple {2696#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {2696#false} is VALID [2022-02-20 18:38:37,021 INFO L290 TraceCheckUtils]: 64: Hoare triple {2696#false} assume ~r1~0 % 256 < 2; {2696#false} is VALID [2022-02-20 18:38:37,021 INFO L290 TraceCheckUtils]: 65: Hoare triple {2696#false} assume !(~r1~0 % 256 >= 2); {2696#false} is VALID [2022-02-20 18:38:37,021 INFO L290 TraceCheckUtils]: 66: Hoare triple {2696#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {2696#false} is VALID [2022-02-20 18:38:37,021 INFO L290 TraceCheckUtils]: 67: Hoare triple {2696#false} assume ~r1~0 % 256 < 2;main_~check__tmp~0#1 := 1;~__return_1270~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1270~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; {2696#false} is VALID [2022-02-20 18:38:37,021 INFO L290 TraceCheckUtils]: 68: Hoare triple {2696#false} assume !(0 == main_~assert__arg~0#1 % 256); {2696#false} is VALID [2022-02-20 18:38:37,021 INFO L290 TraceCheckUtils]: 69: Hoare triple {2696#false} assume !(0 == ~mode1~0 % 256); {2696#false} is VALID [2022-02-20 18:38:37,022 INFO L290 TraceCheckUtils]: 70: Hoare triple {2696#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {2696#false} is VALID [2022-02-20 18:38:37,022 INFO L290 TraceCheckUtils]: 71: Hoare triple {2696#false} assume !!(0 == ~ep21~0 % 256); {2696#false} is VALID [2022-02-20 18:38:37,022 INFO L290 TraceCheckUtils]: 72: Hoare triple {2696#false} assume !!(0 == ~ep31~0 % 256); {2696#false} is VALID [2022-02-20 18:38:37,022 INFO L290 TraceCheckUtils]: 73: Hoare triple {2696#false} assume 1 == ~r1~0 % 256; {2696#false} is VALID [2022-02-20 18:38:37,022 INFO L290 TraceCheckUtils]: 74: Hoare triple {2696#false} assume ~max1~0 == ~id1~0;~st1~0 := 1;~mode1~0 := 0; {2696#false} is VALID [2022-02-20 18:38:37,022 INFO L290 TraceCheckUtils]: 75: Hoare triple {2696#false} assume !(0 == ~mode2~0 % 256); {2696#false} is VALID [2022-02-20 18:38:37,022 INFO L290 TraceCheckUtils]: 76: Hoare triple {2696#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {2696#false} is VALID [2022-02-20 18:38:37,023 INFO L290 TraceCheckUtils]: 77: Hoare triple {2696#false} assume !!(0 == ~ep12~0 % 256); {2696#false} is VALID [2022-02-20 18:38:37,023 INFO L290 TraceCheckUtils]: 78: Hoare triple {2696#false} assume !!(0 == ~ep32~0 % 256); {2696#false} is VALID [2022-02-20 18:38:37,023 INFO L290 TraceCheckUtils]: 79: Hoare triple {2696#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0; {2696#false} is VALID [2022-02-20 18:38:37,023 INFO L290 TraceCheckUtils]: 80: Hoare triple {2696#false} assume !(0 == ~mode3~0 % 256); {2696#false} is VALID [2022-02-20 18:38:37,023 INFO L290 TraceCheckUtils]: 81: Hoare triple {2696#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {2696#false} is VALID [2022-02-20 18:38:37,023 INFO L290 TraceCheckUtils]: 82: Hoare triple {2696#false} assume !!(0 == ~ep13~0 % 256); {2696#false} is VALID [2022-02-20 18:38:37,024 INFO L290 TraceCheckUtils]: 83: Hoare triple {2696#false} assume !!(0 == ~ep23~0 % 256); {2696#false} is VALID [2022-02-20 18:38:37,024 INFO L290 TraceCheckUtils]: 84: Hoare triple {2696#false} assume !(2 == ~r3~0 % 256);~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; {2696#false} is VALID [2022-02-20 18:38:37,024 INFO L290 TraceCheckUtils]: 85: Hoare triple {2696#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2696#false} is VALID [2022-02-20 18:38:37,024 INFO L290 TraceCheckUtils]: 86: Hoare triple {2696#false} assume ~st1~0 + ~nl1~0 <= 1; {2696#false} is VALID [2022-02-20 18:38:37,024 INFO L290 TraceCheckUtils]: 87: Hoare triple {2696#false} assume ~st2~0 + ~nl2~0 <= 1; {2696#false} is VALID [2022-02-20 18:38:37,024 INFO L290 TraceCheckUtils]: 88: Hoare triple {2696#false} assume ~st3~0 + ~nl3~0 <= 1; {2696#false} is VALID [2022-02-20 18:38:37,024 INFO L290 TraceCheckUtils]: 89: Hoare triple {2696#false} assume !(~r1~0 % 256 >= 2); {2696#false} is VALID [2022-02-20 18:38:37,025 INFO L290 TraceCheckUtils]: 90: Hoare triple {2696#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1696~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1696~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; {2696#false} is VALID [2022-02-20 18:38:37,025 INFO L290 TraceCheckUtils]: 91: Hoare triple {2696#false} assume 0 == main_~assert__arg~1#1 % 256; {2696#false} is VALID [2022-02-20 18:38:37,025 INFO L290 TraceCheckUtils]: 92: Hoare triple {2696#false} assume !false; {2696#false} is VALID [2022-02-20 18:38:37,025 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:37,025 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:37,026 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274449331] [2022-02-20 18:38:37,026 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274449331] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:37,026 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:37,026 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:38:37,026 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505136707] [2022-02-20 18:38:37,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:37,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2022-02-20 18:38:37,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:37,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call 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:37,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:37,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:38:37,108 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:37,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:38:37,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:38:37,110 INFO L87 Difference]: Start difference. First operand 446 states and 650 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call 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:37,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:37,786 INFO L93 Difference]: Finished difference Result 1300 states and 1888 transitions. [2022-02-20 18:38:37,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:38:37,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2022-02-20 18:38:37,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:37,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call 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:37,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1038 transitions. [2022-02-20 18:38:37,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call 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:37,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1038 transitions. [2022-02-20 18:38:37,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1038 transitions. [2022-02-20 18:38:38,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1038 edges. 1038 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:38,491 INFO L225 Difference]: With dead ends: 1300 [2022-02-20 18:38:38,491 INFO L226 Difference]: Without dead ends: 882 [2022-02-20 18:38:38,492 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:38,493 INFO L933 BasicCegarLoop]: 696 mSDtfsCounter, 344 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1042 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:38,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [344 Valid, 1042 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:38,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2022-02-20 18:38:38,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 448. [2022-02-20 18:38:38,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:38,552 INFO L82 GeneralOperation]: Start isEquivalent. First operand 882 states. Second operand has 448 states, 446 states have (on average 1.4618834080717489) internal successors, (652), 447 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call 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:38,553 INFO L74 IsIncluded]: Start isIncluded. First operand 882 states. Second operand has 448 states, 446 states have (on average 1.4618834080717489) internal successors, (652), 447 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call 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:38,554 INFO L87 Difference]: Start difference. First operand 882 states. Second operand has 448 states, 446 states have (on average 1.4618834080717489) internal successors, (652), 447 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call 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:38,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:38,580 INFO L93 Difference]: Finished difference Result 882 states and 1283 transitions. [2022-02-20 18:38:38,580 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1283 transitions. [2022-02-20 18:38:38,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:38,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:38,583 INFO L74 IsIncluded]: Start isIncluded. First operand has 448 states, 446 states have (on average 1.4618834080717489) internal successors, (652), 447 states have internal predecessors, (652), 0 states have call successors, (0), 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 882 states. [2022-02-20 18:38:38,583 INFO L87 Difference]: Start difference. First operand has 448 states, 446 states have (on average 1.4618834080717489) internal successors, (652), 447 states have internal predecessors, (652), 0 states have call successors, (0), 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 882 states. [2022-02-20 18:38:38,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:38,611 INFO L93 Difference]: Finished difference Result 882 states and 1283 transitions. [2022-02-20 18:38:38,611 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1283 transitions. [2022-02-20 18:38:38,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:38,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:38,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:38,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:38,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 446 states have (on average 1.4618834080717489) internal successors, (652), 447 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call 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:38,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 652 transitions. [2022-02-20 18:38:38,638 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 652 transitions. Word has length 93 [2022-02-20 18:38:38,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:38,638 INFO L470 AbstractCegarLoop]: Abstraction has 448 states and 652 transitions. [2022-02-20 18:38:38,639 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call 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:38,639 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 652 transitions. [2022-02-20 18:38:38,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-02-20 18:38:38,640 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:38,640 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:38,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:38:38,640 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:38,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:38,641 INFO L85 PathProgramCache]: Analyzing trace with hash 888900743, now seen corresponding path program 1 times [2022-02-20 18:38:38,641 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:38,641 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368639475] [2022-02-20 18:38:38,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:38,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:38,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:38,728 INFO L290 TraceCheckUtils]: 0: Hoare triple {6750#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_1142~0 := 0;~__return_1270~0 := 0;~__return_1696~0 := 0;~__return_1389~0 := 0;~__return_1499~0 := 0; {6750#true} is VALID [2022-02-20 18:38:38,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {6750#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~check__tmp~3#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_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#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;~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;~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;~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; {6750#true} is VALID [2022-02-20 18:38:38,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {6750#true} assume !!(0 == main_~init__r121~0#1 % 256); {6750#true} is VALID [2022-02-20 18:38:38,729 INFO L290 TraceCheckUtils]: 3: Hoare triple {6750#true} assume !(0 == main_~init__r131~0#1 % 256); {6750#true} is VALID [2022-02-20 18:38:38,729 INFO L290 TraceCheckUtils]: 4: Hoare triple {6750#true} assume !(0 == ~ep32~0 % 256);main_~init__tmp~0#1 := 1; {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {6752#(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); {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,730 INFO L290 TraceCheckUtils]: 6: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {6752#(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); {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {6752#(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); {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,732 INFO L290 TraceCheckUtils]: 10: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {6752#(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); {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,733 INFO L290 TraceCheckUtils]: 13: Hoare triple {6752#(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); {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {6752#(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); {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~id1~0 != ~id2~0; {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,735 INFO L290 TraceCheckUtils]: 17: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~id1~0 != ~id3~0; {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,735 INFO L290 TraceCheckUtils]: 18: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~id2~0 != ~id3~0; {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,736 INFO L290 TraceCheckUtils]: 19: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~id1~0 >= 0; {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,736 INFO L290 TraceCheckUtils]: 20: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~id2~0 >= 0; {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,736 INFO L290 TraceCheckUtils]: 21: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~id3~0 >= 0; {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,737 INFO L290 TraceCheckUtils]: 22: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~r1~0 % 256; {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,737 INFO L290 TraceCheckUtils]: 23: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~r2~0 % 256; {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~r3~0 % 256; {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,738 INFO L290 TraceCheckUtils]: 25: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r122~0#1 % 256); {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,738 INFO L290 TraceCheckUtils]: 26: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r132~0#1 % 256); {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,739 INFO L290 TraceCheckUtils]: 27: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r212~0#1 % 256); {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,739 INFO L290 TraceCheckUtils]: 28: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r232~0#1 % 256); {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,739 INFO L290 TraceCheckUtils]: 29: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r312~0#1 % 256); {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,740 INFO L290 TraceCheckUtils]: 30: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r322~0#1 % 256); {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,740 INFO L290 TraceCheckUtils]: 31: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~max1~0 == ~id1~0; {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,741 INFO L290 TraceCheckUtils]: 32: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~max2~0 == ~id2~0; {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,741 INFO L290 TraceCheckUtils]: 33: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~max3~0 == ~id3~0; {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,741 INFO L290 TraceCheckUtils]: 34: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~st1~0; {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,742 INFO L290 TraceCheckUtils]: 35: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~st2~0; {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,742 INFO L290 TraceCheckUtils]: 36: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~st3~0; {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,743 INFO L290 TraceCheckUtils]: 37: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~nl1~0; {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,743 INFO L290 TraceCheckUtils]: 38: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~nl2~0; {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,743 INFO L290 TraceCheckUtils]: 39: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~nl3~0; {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,744 INFO L290 TraceCheckUtils]: 40: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~mode1~0 % 256; {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,744 INFO L290 TraceCheckUtils]: 41: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~mode2~0 % 256; {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,744 INFO L290 TraceCheckUtils]: 42: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1142~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1142~0; {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,745 INFO L290 TraceCheckUtils]: 43: Hoare triple {6752#(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; {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,745 INFO L290 TraceCheckUtils]: 44: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !!(0 == ~mode1~0 % 256); {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,746 INFO L290 TraceCheckUtils]: 45: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~r1~0 % 256 < 2; {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,746 INFO L290 TraceCheckUtils]: 46: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !!(0 == ~ep12~0 % 256); {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,747 INFO L290 TraceCheckUtils]: 47: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !!(0 == ~ep13~0 % 256); {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,747 INFO L290 TraceCheckUtils]: 48: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} ~mode1~0 := 1; {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,747 INFO L290 TraceCheckUtils]: 49: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !!(0 == ~mode2~0 % 256); {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,748 INFO L290 TraceCheckUtils]: 50: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~r2~0 % 256 < 2; {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,748 INFO L290 TraceCheckUtils]: 51: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !!(0 == ~ep21~0 % 256); {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,749 INFO L290 TraceCheckUtils]: 52: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !!(0 == ~ep23~0 % 256); {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,749 INFO L290 TraceCheckUtils]: 53: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} ~mode2~0 := 1; {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,749 INFO L290 TraceCheckUtils]: 54: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !!(0 == ~mode3~0 % 256); {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,750 INFO L290 TraceCheckUtils]: 55: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~r3~0 % 256 < 2; {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,750 INFO L290 TraceCheckUtils]: 56: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !!(0 == ~ep31~0 % 256); {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:38,751 INFO L290 TraceCheckUtils]: 57: Hoare triple {6752#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !!(0 == ~ep32~0 % 256); {6751#false} is VALID [2022-02-20 18:38:38,751 INFO L290 TraceCheckUtils]: 58: Hoare triple {6751#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; {6751#false} is VALID [2022-02-20 18:38:38,751 INFO L290 TraceCheckUtils]: 59: Hoare triple {6751#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {6751#false} is VALID [2022-02-20 18:38:38,751 INFO L290 TraceCheckUtils]: 60: Hoare triple {6751#false} assume ~st1~0 + ~nl1~0 <= 1; {6751#false} is VALID [2022-02-20 18:38:38,751 INFO L290 TraceCheckUtils]: 61: Hoare triple {6751#false} assume ~st2~0 + ~nl2~0 <= 1; {6751#false} is VALID [2022-02-20 18:38:38,752 INFO L290 TraceCheckUtils]: 62: Hoare triple {6751#false} assume ~st3~0 + ~nl3~0 <= 1; {6751#false} is VALID [2022-02-20 18:38:38,752 INFO L290 TraceCheckUtils]: 63: Hoare triple {6751#false} assume !(~r1~0 % 256 >= 2); {6751#false} is VALID [2022-02-20 18:38:38,752 INFO L290 TraceCheckUtils]: 64: Hoare triple {6751#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {6751#false} is VALID [2022-02-20 18:38:38,752 INFO L290 TraceCheckUtils]: 65: Hoare triple {6751#false} assume ~r1~0 % 256 < 2; {6751#false} is VALID [2022-02-20 18:38:38,752 INFO L290 TraceCheckUtils]: 66: Hoare triple {6751#false} assume !(~r1~0 % 256 >= 2); {6751#false} is VALID [2022-02-20 18:38:38,752 INFO L290 TraceCheckUtils]: 67: Hoare triple {6751#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {6751#false} is VALID [2022-02-20 18:38:38,752 INFO L290 TraceCheckUtils]: 68: Hoare triple {6751#false} assume ~r1~0 % 256 < 2;main_~check__tmp~0#1 := 1;~__return_1270~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1270~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; {6751#false} is VALID [2022-02-20 18:38:38,753 INFO L290 TraceCheckUtils]: 69: Hoare triple {6751#false} assume !(0 == main_~assert__arg~0#1 % 256); {6751#false} is VALID [2022-02-20 18:38:38,753 INFO L290 TraceCheckUtils]: 70: Hoare triple {6751#false} assume !(0 == ~mode1~0 % 256); {6751#false} is VALID [2022-02-20 18:38:38,753 INFO L290 TraceCheckUtils]: 71: Hoare triple {6751#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {6751#false} is VALID [2022-02-20 18:38:38,753 INFO L290 TraceCheckUtils]: 72: Hoare triple {6751#false} assume !!(0 == ~ep21~0 % 256); {6751#false} is VALID [2022-02-20 18:38:38,753 INFO L290 TraceCheckUtils]: 73: Hoare triple {6751#false} assume !!(0 == ~ep31~0 % 256); {6751#false} is VALID [2022-02-20 18:38:38,753 INFO L290 TraceCheckUtils]: 74: Hoare triple {6751#false} assume 1 == ~r1~0 % 256; {6751#false} is VALID [2022-02-20 18:38:38,753 INFO L290 TraceCheckUtils]: 75: Hoare triple {6751#false} assume ~max1~0 == ~id1~0;~st1~0 := 1;~mode1~0 := 0; {6751#false} is VALID [2022-02-20 18:38:38,754 INFO L290 TraceCheckUtils]: 76: Hoare triple {6751#false} assume !(0 == ~mode2~0 % 256); {6751#false} is VALID [2022-02-20 18:38:38,754 INFO L290 TraceCheckUtils]: 77: Hoare triple {6751#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {6751#false} is VALID [2022-02-20 18:38:38,754 INFO L290 TraceCheckUtils]: 78: Hoare triple {6751#false} assume !!(0 == ~ep12~0 % 256); {6751#false} is VALID [2022-02-20 18:38:38,754 INFO L290 TraceCheckUtils]: 79: Hoare triple {6751#false} assume !!(0 == ~ep32~0 % 256); {6751#false} is VALID [2022-02-20 18:38:38,754 INFO L290 TraceCheckUtils]: 80: Hoare triple {6751#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0; {6751#false} is VALID [2022-02-20 18:38:38,754 INFO L290 TraceCheckUtils]: 81: Hoare triple {6751#false} assume !(0 == ~mode3~0 % 256); {6751#false} is VALID [2022-02-20 18:38:38,754 INFO L290 TraceCheckUtils]: 82: Hoare triple {6751#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {6751#false} is VALID [2022-02-20 18:38:38,755 INFO L290 TraceCheckUtils]: 83: Hoare triple {6751#false} assume !!(0 == ~ep13~0 % 256); {6751#false} is VALID [2022-02-20 18:38:38,755 INFO L290 TraceCheckUtils]: 84: Hoare triple {6751#false} assume !!(0 == ~ep23~0 % 256); {6751#false} is VALID [2022-02-20 18:38:38,755 INFO L290 TraceCheckUtils]: 85: Hoare triple {6751#false} assume !(2 == ~r3~0 % 256);~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; {6751#false} is VALID [2022-02-20 18:38:38,755 INFO L290 TraceCheckUtils]: 86: Hoare triple {6751#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {6751#false} is VALID [2022-02-20 18:38:38,755 INFO L290 TraceCheckUtils]: 87: Hoare triple {6751#false} assume ~st1~0 + ~nl1~0 <= 1; {6751#false} is VALID [2022-02-20 18:38:38,755 INFO L290 TraceCheckUtils]: 88: Hoare triple {6751#false} assume ~st2~0 + ~nl2~0 <= 1; {6751#false} is VALID [2022-02-20 18:38:38,756 INFO L290 TraceCheckUtils]: 89: Hoare triple {6751#false} assume ~st3~0 + ~nl3~0 <= 1; {6751#false} is VALID [2022-02-20 18:38:38,756 INFO L290 TraceCheckUtils]: 90: Hoare triple {6751#false} assume !(~r1~0 % 256 >= 2); {6751#false} is VALID [2022-02-20 18:38:38,756 INFO L290 TraceCheckUtils]: 91: Hoare triple {6751#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1696~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1696~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; {6751#false} is VALID [2022-02-20 18:38:38,756 INFO L290 TraceCheckUtils]: 92: Hoare triple {6751#false} assume 0 == main_~assert__arg~1#1 % 256; {6751#false} is VALID [2022-02-20 18:38:38,756 INFO L290 TraceCheckUtils]: 93: Hoare triple {6751#false} assume !false; {6751#false} is VALID [2022-02-20 18:38:38,757 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:38,757 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:38,757 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368639475] [2022-02-20 18:38:38,757 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368639475] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:38,757 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:38,757 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:38:38,758 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554096960] [2022-02-20 18:38:38,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:38,758 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:38,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:38,759 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:38,819 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:38,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:38:38,819 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:38,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:38:38,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:38:38,821 INFO L87 Difference]: Start difference. First operand 448 states and 652 transitions. 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:39,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:39,475 INFO L93 Difference]: Finished difference Result 1137 states and 1669 transitions. [2022-02-20 18:38:39,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:38:39,475 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:39,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:39,477 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:39,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 911 transitions. [2022-02-20 18:38:39,480 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:39,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 911 transitions. [2022-02-20 18:38:39,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 911 transitions. [2022-02-20 18:38:40,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 911 edges. 911 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:40,099 INFO L225 Difference]: With dead ends: 1137 [2022-02-20 18:38:40,099 INFO L226 Difference]: Without dead ends: 865 [2022-02-20 18:38:40,102 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:40,106 INFO L933 BasicCegarLoop]: 633 mSDtfsCounter, 286 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:38:40,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [286 Valid, 956 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:40,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2022-02-20 18:38:40,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 846. [2022-02-20 18:38:40,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:40,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 865 states. Second operand has 846 states, 844 states have (on average 1.45260663507109) internal successors, (1226), 845 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call 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,203 INFO L74 IsIncluded]: Start isIncluded. First operand 865 states. Second operand has 846 states, 844 states have (on average 1.45260663507109) internal successors, (1226), 845 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call 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,204 INFO L87 Difference]: Start difference. First operand 865 states. Second operand has 846 states, 844 states have (on average 1.45260663507109) internal successors, (1226), 845 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call 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,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:40,243 INFO L93 Difference]: Finished difference Result 865 states and 1247 transitions. [2022-02-20 18:38:40,243 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1247 transitions. [2022-02-20 18:38:40,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:40,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:40,247 INFO L74 IsIncluded]: Start isIncluded. First operand has 846 states, 844 states have (on average 1.45260663507109) internal successors, (1226), 845 states have internal predecessors, (1226), 0 states have call successors, (0), 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 865 states. [2022-02-20 18:38:40,248 INFO L87 Difference]: Start difference. First operand has 846 states, 844 states have (on average 1.45260663507109) internal successors, (1226), 845 states have internal predecessors, (1226), 0 states have call successors, (0), 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 865 states. [2022-02-20 18:38:40,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:40,273 INFO L93 Difference]: Finished difference Result 865 states and 1247 transitions. [2022-02-20 18:38:40,275 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1247 transitions. [2022-02-20 18:38:40,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:40,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:40,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:40,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:40,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 844 states have (on average 1.45260663507109) internal successors, (1226), 845 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call 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,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1226 transitions. [2022-02-20 18:38:40,305 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1226 transitions. Word has length 94 [2022-02-20 18:38:40,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:40,306 INFO L470 AbstractCegarLoop]: Abstraction has 846 states and 1226 transitions. [2022-02-20 18:38:40,306 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:40,306 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1226 transitions. [2022-02-20 18:38:40,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-02-20 18:38:40,308 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:40,308 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:40,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:38:40,308 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:40,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:40,309 INFO L85 PathProgramCache]: Analyzing trace with hash -590471708, now seen corresponding path program 1 times [2022-02-20 18:38:40,309 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:40,310 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321081794] [2022-02-20 18:38:40,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:40,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:40,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {11085#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_1142~0 := 0;~__return_1270~0 := 0;~__return_1696~0 := 0;~__return_1389~0 := 0;~__return_1499~0 := 0; {11085#true} is VALID [2022-02-20 18:38:40,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {11085#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~check__tmp~3#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_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#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;~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;~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;~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; {11087#(= (+ (* (- 1) ~ep13~0) |ULTIMATE.start_main_~init__r131~0#1|) 0)} is VALID [2022-02-20 18:38:40,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {11087#(= (+ (* (- 1) ~ep13~0) |ULTIMATE.start_main_~init__r131~0#1|) 0)} assume !!(0 == main_~init__r121~0#1 % 256); {11087#(= (+ (* (- 1) ~ep13~0) |ULTIMATE.start_main_~init__r131~0#1|) 0)} is VALID [2022-02-20 18:38:40,478 INFO L290 TraceCheckUtils]: 3: Hoare triple {11087#(= (+ (* (- 1) ~ep13~0) |ULTIMATE.start_main_~init__r131~0#1|) 0)} assume !(0 == main_~init__r131~0#1 % 256); {11088#(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:40,479 INFO L290 TraceCheckUtils]: 4: Hoare triple {11088#(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; {11088#(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:40,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {11088#(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); {11088#(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:40,480 INFO L290 TraceCheckUtils]: 6: Hoare triple {11088#(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; {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {11089#(<= (+ (* 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); {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,481 INFO L290 TraceCheckUtils]: 8: Hoare triple {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {11089#(<= (+ (* 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); {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,481 INFO L290 TraceCheckUtils]: 10: Hoare triple {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {11089#(<= (+ (* 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); {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,482 INFO L290 TraceCheckUtils]: 12: Hoare triple {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,482 INFO L290 TraceCheckUtils]: 13: Hoare triple {11089#(<= (+ (* 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); {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,483 INFO L290 TraceCheckUtils]: 15: Hoare triple {11089#(<= (+ (* 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); {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,483 INFO L290 TraceCheckUtils]: 16: Hoare triple {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~id1~0 != ~id2~0; {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,483 INFO L290 TraceCheckUtils]: 17: Hoare triple {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~id1~0 != ~id3~0; {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,484 INFO L290 TraceCheckUtils]: 18: Hoare triple {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~id2~0 != ~id3~0; {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,484 INFO L290 TraceCheckUtils]: 19: Hoare triple {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~id1~0 >= 0; {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~id2~0 >= 0; {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,485 INFO L290 TraceCheckUtils]: 21: Hoare triple {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~id3~0 >= 0; {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,485 INFO L290 TraceCheckUtils]: 22: Hoare triple {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~r1~0 % 256; {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,485 INFO L290 TraceCheckUtils]: 23: Hoare triple {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~r2~0 % 256; {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,485 INFO L290 TraceCheckUtils]: 24: Hoare triple {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~r3~0 % 256; {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,486 INFO L290 TraceCheckUtils]: 25: Hoare triple {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r122~0#1 % 256); {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,486 INFO L290 TraceCheckUtils]: 26: Hoare triple {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r132~0#1 % 256); {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,486 INFO L290 TraceCheckUtils]: 27: Hoare triple {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r212~0#1 % 256); {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,488 INFO L290 TraceCheckUtils]: 28: Hoare triple {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r232~0#1 % 256); {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,488 INFO L290 TraceCheckUtils]: 29: Hoare triple {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r312~0#1 % 256); {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,489 INFO L290 TraceCheckUtils]: 30: Hoare triple {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r322~0#1 % 256); {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,489 INFO L290 TraceCheckUtils]: 31: Hoare triple {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~max1~0 == ~id1~0; {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,489 INFO L290 TraceCheckUtils]: 32: Hoare triple {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~max2~0 == ~id2~0; {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,491 INFO L290 TraceCheckUtils]: 33: Hoare triple {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~max3~0 == ~id3~0; {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,491 INFO L290 TraceCheckUtils]: 34: Hoare triple {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~st1~0; {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,491 INFO L290 TraceCheckUtils]: 35: Hoare triple {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~st2~0; {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,492 INFO L290 TraceCheckUtils]: 36: Hoare triple {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~st3~0; {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,492 INFO L290 TraceCheckUtils]: 37: Hoare triple {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~nl1~0; {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,492 INFO L290 TraceCheckUtils]: 38: Hoare triple {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~nl2~0; {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,493 INFO L290 TraceCheckUtils]: 39: Hoare triple {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~nl3~0; {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,493 INFO L290 TraceCheckUtils]: 40: Hoare triple {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~mode1~0 % 256; {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,494 INFO L290 TraceCheckUtils]: 41: Hoare triple {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~mode2~0 % 256; {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,494 INFO L290 TraceCheckUtils]: 42: Hoare triple {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1142~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1142~0; {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,494 INFO L290 TraceCheckUtils]: 43: Hoare triple {11089#(<= (+ (* 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; {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,495 INFO L290 TraceCheckUtils]: 44: Hoare triple {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !!(0 == ~mode1~0 % 256); {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,495 INFO L290 TraceCheckUtils]: 45: Hoare triple {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~r1~0 % 256 < 2; {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,495 INFO L290 TraceCheckUtils]: 46: Hoare triple {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !!(0 == ~ep12~0 % 256); {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:40,496 INFO L290 TraceCheckUtils]: 47: Hoare triple {11089#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !!(0 == ~ep13~0 % 256); {11086#false} is VALID [2022-02-20 18:38:40,496 INFO L290 TraceCheckUtils]: 48: Hoare triple {11086#false} ~mode1~0 := 1; {11086#false} is VALID [2022-02-20 18:38:40,496 INFO L290 TraceCheckUtils]: 49: Hoare triple {11086#false} assume !!(0 == ~mode2~0 % 256); {11086#false} is VALID [2022-02-20 18:38:40,496 INFO L290 TraceCheckUtils]: 50: Hoare triple {11086#false} assume ~r2~0 % 256 < 2; {11086#false} is VALID [2022-02-20 18:38:40,496 INFO L290 TraceCheckUtils]: 51: Hoare triple {11086#false} assume !!(0 == ~ep21~0 % 256); {11086#false} is VALID [2022-02-20 18:38:40,496 INFO L290 TraceCheckUtils]: 52: Hoare triple {11086#false} assume !!(0 == ~ep23~0 % 256); {11086#false} is VALID [2022-02-20 18:38:40,496 INFO L290 TraceCheckUtils]: 53: Hoare triple {11086#false} ~mode2~0 := 1; {11086#false} is VALID [2022-02-20 18:38:40,497 INFO L290 TraceCheckUtils]: 54: Hoare triple {11086#false} assume !!(0 == ~mode3~0 % 256); {11086#false} is VALID [2022-02-20 18:38:40,497 INFO L290 TraceCheckUtils]: 55: Hoare triple {11086#false} assume ~r3~0 % 256 < 2; {11086#false} is VALID [2022-02-20 18:38:40,497 INFO L290 TraceCheckUtils]: 56: Hoare triple {11086#false} assume !!(0 == ~ep31~0 % 256); {11086#false} is VALID [2022-02-20 18:38:40,497 INFO L290 TraceCheckUtils]: 57: Hoare triple {11086#false} assume !!(0 == ~ep32~0 % 256); {11086#false} is VALID [2022-02-20 18:38:40,497 INFO L290 TraceCheckUtils]: 58: Hoare triple {11086#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; {11086#false} is VALID [2022-02-20 18:38:40,497 INFO L290 TraceCheckUtils]: 59: Hoare triple {11086#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {11086#false} is VALID [2022-02-20 18:38:40,497 INFO L290 TraceCheckUtils]: 60: Hoare triple {11086#false} assume ~st1~0 + ~nl1~0 <= 1; {11086#false} is VALID [2022-02-20 18:38:40,502 INFO L290 TraceCheckUtils]: 61: Hoare triple {11086#false} assume ~st2~0 + ~nl2~0 <= 1; {11086#false} is VALID [2022-02-20 18:38:40,502 INFO L290 TraceCheckUtils]: 62: Hoare triple {11086#false} assume ~st3~0 + ~nl3~0 <= 1; {11086#false} is VALID [2022-02-20 18:38:40,502 INFO L290 TraceCheckUtils]: 63: Hoare triple {11086#false} assume !(~r1~0 % 256 >= 2); {11086#false} is VALID [2022-02-20 18:38:40,502 INFO L290 TraceCheckUtils]: 64: Hoare triple {11086#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {11086#false} is VALID [2022-02-20 18:38:40,502 INFO L290 TraceCheckUtils]: 65: Hoare triple {11086#false} assume ~r1~0 % 256 < 2; {11086#false} is VALID [2022-02-20 18:38:40,502 INFO L290 TraceCheckUtils]: 66: Hoare triple {11086#false} assume !(~r1~0 % 256 >= 2); {11086#false} is VALID [2022-02-20 18:38:40,502 INFO L290 TraceCheckUtils]: 67: Hoare triple {11086#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {11086#false} is VALID [2022-02-20 18:38:40,503 INFO L290 TraceCheckUtils]: 68: Hoare triple {11086#false} assume ~r1~0 % 256 < 2;main_~check__tmp~0#1 := 1;~__return_1270~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1270~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; {11086#false} is VALID [2022-02-20 18:38:40,503 INFO L290 TraceCheckUtils]: 69: Hoare triple {11086#false} assume !(0 == main_~assert__arg~0#1 % 256); {11086#false} is VALID [2022-02-20 18:38:40,503 INFO L290 TraceCheckUtils]: 70: Hoare triple {11086#false} assume !(0 == ~mode1~0 % 256); {11086#false} is VALID [2022-02-20 18:38:40,503 INFO L290 TraceCheckUtils]: 71: Hoare triple {11086#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {11086#false} is VALID [2022-02-20 18:38:40,503 INFO L290 TraceCheckUtils]: 72: Hoare triple {11086#false} assume !!(0 == ~ep21~0 % 256); {11086#false} is VALID [2022-02-20 18:38:40,503 INFO L290 TraceCheckUtils]: 73: Hoare triple {11086#false} assume !!(0 == ~ep31~0 % 256); {11086#false} is VALID [2022-02-20 18:38:40,503 INFO L290 TraceCheckUtils]: 74: Hoare triple {11086#false} assume 1 == ~r1~0 % 256; {11086#false} is VALID [2022-02-20 18:38:40,503 INFO L290 TraceCheckUtils]: 75: Hoare triple {11086#false} assume ~max1~0 == ~id1~0;~st1~0 := 1;~mode1~0 := 0; {11086#false} is VALID [2022-02-20 18:38:40,504 INFO L290 TraceCheckUtils]: 76: Hoare triple {11086#false} assume !(0 == ~mode2~0 % 256); {11086#false} is VALID [2022-02-20 18:38:40,504 INFO L290 TraceCheckUtils]: 77: Hoare triple {11086#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {11086#false} is VALID [2022-02-20 18:38:40,504 INFO L290 TraceCheckUtils]: 78: Hoare triple {11086#false} assume !!(0 == ~ep12~0 % 256); {11086#false} is VALID [2022-02-20 18:38:40,504 INFO L290 TraceCheckUtils]: 79: Hoare triple {11086#false} assume !!(0 == ~ep32~0 % 256); {11086#false} is VALID [2022-02-20 18:38:40,504 INFO L290 TraceCheckUtils]: 80: Hoare triple {11086#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0; {11086#false} is VALID [2022-02-20 18:38:40,504 INFO L290 TraceCheckUtils]: 81: Hoare triple {11086#false} assume !(0 == ~mode3~0 % 256); {11086#false} is VALID [2022-02-20 18:38:40,504 INFO L290 TraceCheckUtils]: 82: Hoare triple {11086#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {11086#false} is VALID [2022-02-20 18:38:40,504 INFO L290 TraceCheckUtils]: 83: Hoare triple {11086#false} assume !!(0 == ~ep13~0 % 256); {11086#false} is VALID [2022-02-20 18:38:40,505 INFO L290 TraceCheckUtils]: 84: Hoare triple {11086#false} assume !!(0 == ~ep23~0 % 256); {11086#false} is VALID [2022-02-20 18:38:40,505 INFO L290 TraceCheckUtils]: 85: Hoare triple {11086#false} assume !(2 == ~r3~0 % 256);~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; {11086#false} is VALID [2022-02-20 18:38:40,505 INFO L290 TraceCheckUtils]: 86: Hoare triple {11086#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {11086#false} is VALID [2022-02-20 18:38:40,505 INFO L290 TraceCheckUtils]: 87: Hoare triple {11086#false} assume ~st1~0 + ~nl1~0 <= 1; {11086#false} is VALID [2022-02-20 18:38:40,505 INFO L290 TraceCheckUtils]: 88: Hoare triple {11086#false} assume ~st2~0 + ~nl2~0 <= 1; {11086#false} is VALID [2022-02-20 18:38:40,505 INFO L290 TraceCheckUtils]: 89: Hoare triple {11086#false} assume ~st3~0 + ~nl3~0 <= 1; {11086#false} is VALID [2022-02-20 18:38:40,506 INFO L290 TraceCheckUtils]: 90: Hoare triple {11086#false} assume !(~r1~0 % 256 >= 2); {11086#false} is VALID [2022-02-20 18:38:40,507 INFO L290 TraceCheckUtils]: 91: Hoare triple {11086#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1696~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1696~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; {11086#false} is VALID [2022-02-20 18:38:40,509 INFO L290 TraceCheckUtils]: 92: Hoare triple {11086#false} assume 0 == main_~assert__arg~1#1 % 256; {11086#false} is VALID [2022-02-20 18:38:40,509 INFO L290 TraceCheckUtils]: 93: Hoare triple {11086#false} assume !false; {11086#false} is VALID [2022-02-20 18:38:40,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:40,512 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:40,512 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321081794] [2022-02-20 18:38:40,512 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321081794] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:40,512 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:40,512 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:38:40,512 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858456819] [2022-02-20 18:38:40,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:40,513 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 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:40,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:40,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 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:40,572 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:40,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:38:40,574 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:40,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:38:40,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:38:40,575 INFO L87 Difference]: Start difference. First operand 846 states and 1226 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 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:41,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:41,861 INFO L93 Difference]: Finished difference Result 2301 states and 3341 transitions. [2022-02-20 18:38:41,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:38:41,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 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:41,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:41,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 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:41,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1024 transitions. [2022-02-20 18:38:41,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 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:41,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1024 transitions. [2022-02-20 18:38:41,869 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 1024 transitions. [2022-02-20 18:38:42,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1024 edges. 1024 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:42,666 INFO L225 Difference]: With dead ends: 2301 [2022-02-20 18:38:42,667 INFO L226 Difference]: Without dead ends: 1469 [2022-02-20 18:38:42,668 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:42,668 INFO L933 BasicCegarLoop]: 585 mSDtfsCounter, 1043 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1043 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:38:42,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1043 Valid, 902 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:42,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2022-02-20 18:38:42,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1455. [2022-02-20 18:38:42,959 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:42,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1469 states. Second operand has 1455 states, 1453 states have (on average 1.4445973847212663) internal successors, (2099), 1454 states have internal predecessors, (2099), 0 states have call successors, (0), 0 states have call 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:42,964 INFO L74 IsIncluded]: Start isIncluded. First operand 1469 states. Second operand has 1455 states, 1453 states have (on average 1.4445973847212663) internal successors, (2099), 1454 states have internal predecessors, (2099), 0 states have call successors, (0), 0 states have call 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:42,966 INFO L87 Difference]: Start difference. First operand 1469 states. Second operand has 1455 states, 1453 states have (on average 1.4445973847212663) internal successors, (2099), 1454 states have internal predecessors, (2099), 0 states have call successors, (0), 0 states have call 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,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:43,025 INFO L93 Difference]: Finished difference Result 1469 states and 2113 transitions. [2022-02-20 18:38:43,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 2113 transitions. [2022-02-20 18:38:43,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:43,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:43,029 INFO L74 IsIncluded]: Start isIncluded. First operand has 1455 states, 1453 states have (on average 1.4445973847212663) internal successors, (2099), 1454 states have internal predecessors, (2099), 0 states have call successors, (0), 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 1469 states. [2022-02-20 18:38:43,031 INFO L87 Difference]: Start difference. First operand has 1455 states, 1453 states have (on average 1.4445973847212663) internal successors, (2099), 1454 states have internal predecessors, (2099), 0 states have call successors, (0), 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 1469 states. [2022-02-20 18:38:43,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:43,099 INFO L93 Difference]: Finished difference Result 1469 states and 2113 transitions. [2022-02-20 18:38:43,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 2113 transitions. [2022-02-20 18:38:43,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:43,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:43,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:43,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:43,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1455 states, 1453 states have (on average 1.4445973847212663) internal successors, (2099), 1454 states have internal predecessors, (2099), 0 states have call successors, (0), 0 states have call 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,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 2099 transitions. [2022-02-20 18:38:43,178 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 2099 transitions. Word has length 94 [2022-02-20 18:38:43,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:43,179 INFO L470 AbstractCegarLoop]: Abstraction has 1455 states and 2099 transitions. [2022-02-20 18:38:43,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 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:43,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 2099 transitions. [2022-02-20 18:38:43,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-02-20 18:38:43,181 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:43,181 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:43,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:38:43,182 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:43,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:43,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1312120855, now seen corresponding path program 1 times [2022-02-20 18:38:43,182 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:43,183 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982243415] [2022-02-20 18:38:43,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:43,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:43,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {18969#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_1142~0 := 0;~__return_1270~0 := 0;~__return_1696~0 := 0;~__return_1389~0 := 0;~__return_1499~0 := 0; {18969#true} is VALID [2022-02-20 18:38:43,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {18969#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~check__tmp~3#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_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#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;~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;~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;~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; {18971#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:38:43,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {18971#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} assume !!(0 == main_~init__r121~0#1 % 256); {18971#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:38:43,377 INFO L290 TraceCheckUtils]: 3: Hoare triple {18971#(= (+ |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; {18971#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:38:43,378 INFO L290 TraceCheckUtils]: 4: Hoare triple {18971#(= (+ |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); {18971#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:38:43,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {18971#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} assume !!(0 == main_~init__r131~0#1 % 256); {18971#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:38:43,378 INFO L290 TraceCheckUtils]: 6: Hoare triple {18971#(= (+ |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; {18971#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:38:43,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {18971#(= (+ |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); {18971#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:38:43,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {18971#(= (+ |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; {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {18972#(<= (+ (* 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); {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,380 INFO L290 TraceCheckUtils]: 11: Hoare triple {18972#(<= (+ (* 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); {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {18972#(<= (+ (* 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); {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {18972#(<= (+ (* 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); {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id1~0 != ~id2~0; {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id1~0 != ~id3~0; {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,383 INFO L290 TraceCheckUtils]: 18: Hoare triple {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id2~0 != ~id3~0; {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,383 INFO L290 TraceCheckUtils]: 19: Hoare triple {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id1~0 >= 0; {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,383 INFO L290 TraceCheckUtils]: 20: Hoare triple {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id2~0 >= 0; {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,384 INFO L290 TraceCheckUtils]: 21: Hoare triple {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id3~0 >= 0; {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~r1~0 % 256; {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~r2~0 % 256; {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,385 INFO L290 TraceCheckUtils]: 24: Hoare triple {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~r3~0 % 256; {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r122~0#1 % 256); {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,386 INFO L290 TraceCheckUtils]: 26: Hoare triple {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r132~0#1 % 256); {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,386 INFO L290 TraceCheckUtils]: 27: Hoare triple {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r212~0#1 % 256); {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,386 INFO L290 TraceCheckUtils]: 28: Hoare triple {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r232~0#1 % 256); {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,387 INFO L290 TraceCheckUtils]: 29: Hoare triple {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r312~0#1 % 256); {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,387 INFO L290 TraceCheckUtils]: 30: Hoare triple {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r322~0#1 % 256); {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~max1~0 == ~id1~0; {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,388 INFO L290 TraceCheckUtils]: 32: Hoare triple {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~max2~0 == ~id2~0; {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,388 INFO L290 TraceCheckUtils]: 33: Hoare triple {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~max3~0 == ~id3~0; {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,388 INFO L290 TraceCheckUtils]: 34: Hoare triple {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~st1~0; {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,389 INFO L290 TraceCheckUtils]: 35: Hoare triple {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~st2~0; {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,389 INFO L290 TraceCheckUtils]: 36: Hoare triple {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~st3~0; {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,389 INFO L290 TraceCheckUtils]: 37: Hoare triple {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~nl1~0; {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,390 INFO L290 TraceCheckUtils]: 38: Hoare triple {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~nl2~0; {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,390 INFO L290 TraceCheckUtils]: 39: Hoare triple {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~nl3~0; {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,390 INFO L290 TraceCheckUtils]: 40: Hoare triple {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~mode1~0 % 256; {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,391 INFO L290 TraceCheckUtils]: 41: Hoare triple {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~mode2~0 % 256; {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,391 INFO L290 TraceCheckUtils]: 42: Hoare triple {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1142~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1142~0; {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,392 INFO L290 TraceCheckUtils]: 43: Hoare triple {18972#(<= (+ (* 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; {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,392 INFO L290 TraceCheckUtils]: 44: Hoare triple {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !!(0 == ~mode1~0 % 256); {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,392 INFO L290 TraceCheckUtils]: 45: Hoare triple {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~r1~0 % 256 < 2; {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,393 INFO L290 TraceCheckUtils]: 46: Hoare triple {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !!(0 == ~ep12~0 % 256); {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,393 INFO L290 TraceCheckUtils]: 47: Hoare triple {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !!(0 == ~ep13~0 % 256); {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,393 INFO L290 TraceCheckUtils]: 48: Hoare triple {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} ~mode1~0 := 1; {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,394 INFO L290 TraceCheckUtils]: 49: Hoare triple {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !!(0 == ~mode2~0 % 256); {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,394 INFO L290 TraceCheckUtils]: 50: Hoare triple {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~r2~0 % 256 < 2; {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:43,395 INFO L290 TraceCheckUtils]: 51: Hoare triple {18972#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !!(0 == ~ep21~0 % 256); {18970#false} is VALID [2022-02-20 18:38:43,395 INFO L290 TraceCheckUtils]: 52: Hoare triple {18970#false} assume !!(0 == ~ep23~0 % 256); {18970#false} is VALID [2022-02-20 18:38:43,395 INFO L290 TraceCheckUtils]: 53: Hoare triple {18970#false} ~mode2~0 := 1; {18970#false} is VALID [2022-02-20 18:38:43,395 INFO L290 TraceCheckUtils]: 54: Hoare triple {18970#false} assume !!(0 == ~mode3~0 % 256); {18970#false} is VALID [2022-02-20 18:38:43,395 INFO L290 TraceCheckUtils]: 55: Hoare triple {18970#false} assume ~r3~0 % 256 < 2; {18970#false} is VALID [2022-02-20 18:38:43,395 INFO L290 TraceCheckUtils]: 56: Hoare triple {18970#false} assume !!(0 == ~ep31~0 % 256); {18970#false} is VALID [2022-02-20 18:38:43,395 INFO L290 TraceCheckUtils]: 57: Hoare triple {18970#false} assume !!(0 == ~ep32~0 % 256); {18970#false} is VALID [2022-02-20 18:38:43,395 INFO L290 TraceCheckUtils]: 58: Hoare triple {18970#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; {18970#false} is VALID [2022-02-20 18:38:43,396 INFO L290 TraceCheckUtils]: 59: Hoare triple {18970#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {18970#false} is VALID [2022-02-20 18:38:43,396 INFO L290 TraceCheckUtils]: 60: Hoare triple {18970#false} assume ~st1~0 + ~nl1~0 <= 1; {18970#false} is VALID [2022-02-20 18:38:43,396 INFO L290 TraceCheckUtils]: 61: Hoare triple {18970#false} assume ~st2~0 + ~nl2~0 <= 1; {18970#false} is VALID [2022-02-20 18:38:43,396 INFO L290 TraceCheckUtils]: 62: Hoare triple {18970#false} assume ~st3~0 + ~nl3~0 <= 1; {18970#false} is VALID [2022-02-20 18:38:43,396 INFO L290 TraceCheckUtils]: 63: Hoare triple {18970#false} assume !(~r1~0 % 256 >= 2); {18970#false} is VALID [2022-02-20 18:38:43,396 INFO L290 TraceCheckUtils]: 64: Hoare triple {18970#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {18970#false} is VALID [2022-02-20 18:38:43,396 INFO L290 TraceCheckUtils]: 65: Hoare triple {18970#false} assume ~r1~0 % 256 < 2; {18970#false} is VALID [2022-02-20 18:38:43,396 INFO L290 TraceCheckUtils]: 66: Hoare triple {18970#false} assume !(~r1~0 % 256 >= 2); {18970#false} is VALID [2022-02-20 18:38:43,397 INFO L290 TraceCheckUtils]: 67: Hoare triple {18970#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {18970#false} is VALID [2022-02-20 18:38:43,397 INFO L290 TraceCheckUtils]: 68: Hoare triple {18970#false} assume ~r1~0 % 256 < 2;main_~check__tmp~0#1 := 1;~__return_1270~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1270~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; {18970#false} is VALID [2022-02-20 18:38:43,398 INFO L290 TraceCheckUtils]: 69: Hoare triple {18970#false} assume !(0 == main_~assert__arg~0#1 % 256); {18970#false} is VALID [2022-02-20 18:38:43,398 INFO L290 TraceCheckUtils]: 70: Hoare triple {18970#false} assume !(0 == ~mode1~0 % 256); {18970#false} is VALID [2022-02-20 18:38:43,398 INFO L290 TraceCheckUtils]: 71: Hoare triple {18970#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {18970#false} is VALID [2022-02-20 18:38:43,398 INFO L290 TraceCheckUtils]: 72: Hoare triple {18970#false} assume !!(0 == ~ep21~0 % 256); {18970#false} is VALID [2022-02-20 18:38:43,398 INFO L290 TraceCheckUtils]: 73: Hoare triple {18970#false} assume !!(0 == ~ep31~0 % 256); {18970#false} is VALID [2022-02-20 18:38:43,398 INFO L290 TraceCheckUtils]: 74: Hoare triple {18970#false} assume 1 == ~r1~0 % 256; {18970#false} is VALID [2022-02-20 18:38:43,398 INFO L290 TraceCheckUtils]: 75: Hoare triple {18970#false} assume ~max1~0 == ~id1~0;~st1~0 := 1;~mode1~0 := 0; {18970#false} is VALID [2022-02-20 18:38:43,411 INFO L290 TraceCheckUtils]: 76: Hoare triple {18970#false} assume !(0 == ~mode2~0 % 256); {18970#false} is VALID [2022-02-20 18:38:43,411 INFO L290 TraceCheckUtils]: 77: Hoare triple {18970#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {18970#false} is VALID [2022-02-20 18:38:43,411 INFO L290 TraceCheckUtils]: 78: Hoare triple {18970#false} assume !!(0 == ~ep12~0 % 256); {18970#false} is VALID [2022-02-20 18:38:43,412 INFO L290 TraceCheckUtils]: 79: Hoare triple {18970#false} assume !!(0 == ~ep32~0 % 256); {18970#false} is VALID [2022-02-20 18:38:43,412 INFO L290 TraceCheckUtils]: 80: Hoare triple {18970#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0; {18970#false} is VALID [2022-02-20 18:38:43,412 INFO L290 TraceCheckUtils]: 81: Hoare triple {18970#false} assume !(0 == ~mode3~0 % 256); {18970#false} is VALID [2022-02-20 18:38:43,412 INFO L290 TraceCheckUtils]: 82: Hoare triple {18970#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {18970#false} is VALID [2022-02-20 18:38:43,412 INFO L290 TraceCheckUtils]: 83: Hoare triple {18970#false} assume !!(0 == ~ep13~0 % 256); {18970#false} is VALID [2022-02-20 18:38:43,412 INFO L290 TraceCheckUtils]: 84: Hoare triple {18970#false} assume !!(0 == ~ep23~0 % 256); {18970#false} is VALID [2022-02-20 18:38:43,412 INFO L290 TraceCheckUtils]: 85: Hoare triple {18970#false} assume !(2 == ~r3~0 % 256);~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; {18970#false} is VALID [2022-02-20 18:38:43,412 INFO L290 TraceCheckUtils]: 86: Hoare triple {18970#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {18970#false} is VALID [2022-02-20 18:38:43,413 INFO L290 TraceCheckUtils]: 87: Hoare triple {18970#false} assume ~st1~0 + ~nl1~0 <= 1; {18970#false} is VALID [2022-02-20 18:38:43,413 INFO L290 TraceCheckUtils]: 88: Hoare triple {18970#false} assume ~st2~0 + ~nl2~0 <= 1; {18970#false} is VALID [2022-02-20 18:38:43,413 INFO L290 TraceCheckUtils]: 89: Hoare triple {18970#false} assume ~st3~0 + ~nl3~0 <= 1; {18970#false} is VALID [2022-02-20 18:38:43,413 INFO L290 TraceCheckUtils]: 90: Hoare triple {18970#false} assume !(~r1~0 % 256 >= 2); {18970#false} is VALID [2022-02-20 18:38:43,413 INFO L290 TraceCheckUtils]: 91: Hoare triple {18970#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1696~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1696~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; {18970#false} is VALID [2022-02-20 18:38:43,413 INFO L290 TraceCheckUtils]: 92: Hoare triple {18970#false} assume 0 == main_~assert__arg~1#1 % 256; {18970#false} is VALID [2022-02-20 18:38:43,413 INFO L290 TraceCheckUtils]: 93: Hoare triple {18970#false} assume !false; {18970#false} is VALID [2022-02-20 18:38:43,414 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:43,414 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:43,414 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982243415] [2022-02-20 18:38:43,414 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982243415] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:43,414 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:43,414 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:38:43,414 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108004934] [2022-02-20 18:38:43,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:43,415 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:43,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:43,415 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:43,476 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:43,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:38:43,477 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:43,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:38:43,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:38:43,478 INFO L87 Difference]: Start difference. First operand 1455 states and 2099 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:45,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:45,491 INFO L93 Difference]: Finished difference Result 4196 states and 6028 transitions. [2022-02-20 18:38:45,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:38:45,492 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:45,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:45,492 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:45,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 996 transitions. [2022-02-20 18:38:45,495 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:45,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 996 transitions. [2022-02-20 18:38:45,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 996 transitions. [2022-02-20 18:38:46,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 996 edges. 996 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:46,492 INFO L225 Difference]: With dead ends: 4196 [2022-02-20 18:38:46,492 INFO L226 Difference]: Without dead ends: 2797 [2022-02-20 18:38:46,494 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:46,494 INFO L933 BasicCegarLoop]: 579 mSDtfsCounter, 697 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 900 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:46,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [697 Valid, 900 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:46,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2797 states. [2022-02-20 18:38:47,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2797 to 2740. [2022-02-20 18:38:47,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:47,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2797 states. Second operand has 2740 states, 2738 states have (on average 1.4269539810080352) internal successors, (3907), 2739 states have internal predecessors, (3907), 0 states have call successors, (0), 0 states have call 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:47,291 INFO L74 IsIncluded]: Start isIncluded. First operand 2797 states. Second operand has 2740 states, 2738 states have (on average 1.4269539810080352) internal successors, (3907), 2739 states have internal predecessors, (3907), 0 states have call successors, (0), 0 states have call 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:47,294 INFO L87 Difference]: Start difference. First operand 2797 states. Second operand has 2740 states, 2738 states have (on average 1.4269539810080352) internal successors, (3907), 2739 states have internal predecessors, (3907), 0 states have call successors, (0), 0 states have call 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:47,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:47,489 INFO L93 Difference]: Finished difference Result 2797 states and 3978 transitions. [2022-02-20 18:38:47,489 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 3978 transitions. [2022-02-20 18:38:47,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:47,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:47,510 INFO L74 IsIncluded]: Start isIncluded. First operand has 2740 states, 2738 states have (on average 1.4269539810080352) internal successors, (3907), 2739 states have internal predecessors, (3907), 0 states have call successors, (0), 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 2797 states. [2022-02-20 18:38:47,512 INFO L87 Difference]: Start difference. First operand has 2740 states, 2738 states have (on average 1.4269539810080352) internal successors, (3907), 2739 states have internal predecessors, (3907), 0 states have call successors, (0), 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 2797 states. [2022-02-20 18:38:47,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:47,844 INFO L93 Difference]: Finished difference Result 2797 states and 3978 transitions. [2022-02-20 18:38:47,844 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 3978 transitions. [2022-02-20 18:38:47,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:47,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:47,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:47,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:47,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2740 states, 2738 states have (on average 1.4269539810080352) internal successors, (3907), 2739 states have internal predecessors, (3907), 0 states have call successors, (0), 0 states have call 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:48,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2740 states to 2740 states and 3907 transitions. [2022-02-20 18:38:48,177 INFO L78 Accepts]: Start accepts. Automaton has 2740 states and 3907 transitions. Word has length 94 [2022-02-20 18:38:48,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:48,178 INFO L470 AbstractCegarLoop]: Abstraction has 2740 states and 3907 transitions. [2022-02-20 18:38:48,178 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:48,178 INFO L276 IsEmpty]: Start isEmpty. Operand 2740 states and 3907 transitions. [2022-02-20 18:38:48,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-02-20 18:38:48,181 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:48,181 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:48,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:38:48,182 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:48,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:48,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1914667925, now seen corresponding path program 1 times [2022-02-20 18:38:48,183 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:48,183 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478920617] [2022-02-20 18:38:48,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:48,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:48,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:48,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {33721#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_1142~0 := 0;~__return_1270~0 := 0;~__return_1696~0 := 0;~__return_1389~0 := 0;~__return_1499~0 := 0; {33721#true} is VALID [2022-02-20 18:38:48,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {33721#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~check__tmp~3#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_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#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;~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;~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;~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; {33721#true} is VALID [2022-02-20 18:38:48,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {33721#true} assume !!(0 == main_~init__r121~0#1 % 256); {33721#true} is VALID [2022-02-20 18:38:48,264 INFO L290 TraceCheckUtils]: 3: Hoare triple {33721#true} assume !!(0 == main_~init__r131~0#1 % 256);main_~init__tmp~0#1 := 0; {33721#true} is VALID [2022-02-20 18:38:48,264 INFO L290 TraceCheckUtils]: 4: Hoare triple {33721#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {33721#true} is VALID [2022-02-20 18:38:48,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {33721#true} assume !!(0 == main_~init__r131~0#1 % 256); {33721#true} is VALID [2022-02-20 18:38:48,265 INFO L290 TraceCheckUtils]: 6: Hoare triple {33721#true} assume !!(0 == main_~init__r121~0#1 % 256);main_~init__tmp___0~0#1 := 0; {33721#true} is VALID [2022-02-20 18:38:48,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {33721#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {33721#true} is VALID [2022-02-20 18:38:48,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {33721#true} assume !!(0 == main_~init__r211~0#1 % 256); {33721#true} is VALID [2022-02-20 18:38:48,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {33721#true} assume !!(0 == main_~init__r231~0#1 % 256);main_~init__tmp___1~0#1 := 0; {33723#(= (+ |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:48,266 INFO L290 TraceCheckUtils]: 10: Hoare triple {33723#(= (+ |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); {33723#(= (+ |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:48,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {33723#(= (+ |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; {33722#false} is VALID [2022-02-20 18:38:48,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {33722#false} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {33722#false} is VALID [2022-02-20 18:38:48,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {33722#false} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {33722#false} is VALID [2022-02-20 18:38:48,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {33722#false} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {33722#false} is VALID [2022-02-20 18:38:48,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {33722#false} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {33722#false} is VALID [2022-02-20 18:38:48,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {33722#false} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {33722#false} is VALID [2022-02-20 18:38:48,267 INFO L290 TraceCheckUtils]: 17: Hoare triple {33722#false} assume ~id1~0 != ~id2~0; {33722#false} is VALID [2022-02-20 18:38:48,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {33722#false} assume ~id1~0 != ~id3~0; {33722#false} is VALID [2022-02-20 18:38:48,267 INFO L290 TraceCheckUtils]: 19: Hoare triple {33722#false} assume ~id2~0 != ~id3~0; {33722#false} is VALID [2022-02-20 18:38:48,267 INFO L290 TraceCheckUtils]: 20: Hoare triple {33722#false} assume ~id1~0 >= 0; {33722#false} is VALID [2022-02-20 18:38:48,268 INFO L290 TraceCheckUtils]: 21: Hoare triple {33722#false} assume ~id2~0 >= 0; {33722#false} is VALID [2022-02-20 18:38:48,268 INFO L290 TraceCheckUtils]: 22: Hoare triple {33722#false} assume ~id3~0 >= 0; {33722#false} is VALID [2022-02-20 18:38:48,268 INFO L290 TraceCheckUtils]: 23: Hoare triple {33722#false} assume 0 == ~r1~0 % 256; {33722#false} is VALID [2022-02-20 18:38:48,268 INFO L290 TraceCheckUtils]: 24: Hoare triple {33722#false} assume 0 == ~r2~0 % 256; {33722#false} is VALID [2022-02-20 18:38:48,268 INFO L290 TraceCheckUtils]: 25: Hoare triple {33722#false} assume 0 == ~r3~0 % 256; {33722#false} is VALID [2022-02-20 18:38:48,268 INFO L290 TraceCheckUtils]: 26: Hoare triple {33722#false} assume !(0 == main_~init__r122~0#1 % 256); {33722#false} is VALID [2022-02-20 18:38:48,268 INFO L290 TraceCheckUtils]: 27: Hoare triple {33722#false} assume !(0 == main_~init__r132~0#1 % 256); {33722#false} is VALID [2022-02-20 18:38:48,269 INFO L290 TraceCheckUtils]: 28: Hoare triple {33722#false} assume !(0 == main_~init__r212~0#1 % 256); {33722#false} is VALID [2022-02-20 18:38:48,269 INFO L290 TraceCheckUtils]: 29: Hoare triple {33722#false} assume !(0 == main_~init__r232~0#1 % 256); {33722#false} is VALID [2022-02-20 18:38:48,269 INFO L290 TraceCheckUtils]: 30: Hoare triple {33722#false} assume !(0 == main_~init__r312~0#1 % 256); {33722#false} is VALID [2022-02-20 18:38:48,272 INFO L290 TraceCheckUtils]: 31: Hoare triple {33722#false} assume !(0 == main_~init__r322~0#1 % 256); {33722#false} is VALID [2022-02-20 18:38:48,272 INFO L290 TraceCheckUtils]: 32: Hoare triple {33722#false} assume ~max1~0 == ~id1~0; {33722#false} is VALID [2022-02-20 18:38:48,273 INFO L290 TraceCheckUtils]: 33: Hoare triple {33722#false} assume ~max2~0 == ~id2~0; {33722#false} is VALID [2022-02-20 18:38:48,273 INFO L290 TraceCheckUtils]: 34: Hoare triple {33722#false} assume ~max3~0 == ~id3~0; {33722#false} is VALID [2022-02-20 18:38:48,273 INFO L290 TraceCheckUtils]: 35: Hoare triple {33722#false} assume 0 == ~st1~0; {33722#false} is VALID [2022-02-20 18:38:48,273 INFO L290 TraceCheckUtils]: 36: Hoare triple {33722#false} assume 0 == ~st2~0; {33722#false} is VALID [2022-02-20 18:38:48,274 INFO L290 TraceCheckUtils]: 37: Hoare triple {33722#false} assume 0 == ~st3~0; {33722#false} is VALID [2022-02-20 18:38:48,274 INFO L290 TraceCheckUtils]: 38: Hoare triple {33722#false} assume 0 == ~nl1~0; {33722#false} is VALID [2022-02-20 18:38:48,275 INFO L290 TraceCheckUtils]: 39: Hoare triple {33722#false} assume 0 == ~nl2~0; {33722#false} is VALID [2022-02-20 18:38:48,275 INFO L290 TraceCheckUtils]: 40: Hoare triple {33722#false} assume 0 == ~nl3~0; {33722#false} is VALID [2022-02-20 18:38:48,275 INFO L290 TraceCheckUtils]: 41: Hoare triple {33722#false} assume 0 == ~mode1~0 % 256; {33722#false} is VALID [2022-02-20 18:38:48,275 INFO L290 TraceCheckUtils]: 42: Hoare triple {33722#false} assume 0 == ~mode2~0 % 256; {33722#false} is VALID [2022-02-20 18:38:48,276 INFO L290 TraceCheckUtils]: 43: Hoare triple {33722#false} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1142~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1142~0; {33722#false} is VALID [2022-02-20 18:38:48,276 INFO L290 TraceCheckUtils]: 44: Hoare triple {33722#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; {33722#false} is VALID [2022-02-20 18:38:48,280 INFO L290 TraceCheckUtils]: 45: Hoare triple {33722#false} assume !!(0 == ~mode1~0 % 256); {33722#false} is VALID [2022-02-20 18:38:48,280 INFO L290 TraceCheckUtils]: 46: Hoare triple {33722#false} assume ~r1~0 % 256 < 2; {33722#false} is VALID [2022-02-20 18:38:48,280 INFO L290 TraceCheckUtils]: 47: Hoare triple {33722#false} assume !!(0 == ~ep12~0 % 256); {33722#false} is VALID [2022-02-20 18:38:48,280 INFO L290 TraceCheckUtils]: 48: Hoare triple {33722#false} assume !!(0 == ~ep13~0 % 256); {33722#false} is VALID [2022-02-20 18:38:48,280 INFO L290 TraceCheckUtils]: 49: Hoare triple {33722#false} ~mode1~0 := 1; {33722#false} is VALID [2022-02-20 18:38:48,281 INFO L290 TraceCheckUtils]: 50: Hoare triple {33722#false} assume !!(0 == ~mode2~0 % 256); {33722#false} is VALID [2022-02-20 18:38:48,281 INFO L290 TraceCheckUtils]: 51: Hoare triple {33722#false} assume ~r2~0 % 256 < 2; {33722#false} is VALID [2022-02-20 18:38:48,281 INFO L290 TraceCheckUtils]: 52: Hoare triple {33722#false} assume !!(0 == ~ep21~0 % 256); {33722#false} is VALID [2022-02-20 18:38:48,281 INFO L290 TraceCheckUtils]: 53: Hoare triple {33722#false} assume !!(0 == ~ep23~0 % 256); {33722#false} is VALID [2022-02-20 18:38:48,281 INFO L290 TraceCheckUtils]: 54: Hoare triple {33722#false} ~mode2~0 := 1; {33722#false} is VALID [2022-02-20 18:38:48,281 INFO L290 TraceCheckUtils]: 55: Hoare triple {33722#false} assume !!(0 == ~mode3~0 % 256); {33722#false} is VALID [2022-02-20 18:38:48,281 INFO L290 TraceCheckUtils]: 56: Hoare triple {33722#false} assume ~r3~0 % 256 < 2; {33722#false} is VALID [2022-02-20 18:38:48,281 INFO L290 TraceCheckUtils]: 57: Hoare triple {33722#false} assume !!(0 == ~ep31~0 % 256); {33722#false} is VALID [2022-02-20 18:38:48,282 INFO L290 TraceCheckUtils]: 58: Hoare triple {33722#false} assume !!(0 == ~ep32~0 % 256); {33722#false} is VALID [2022-02-20 18:38:48,282 INFO L290 TraceCheckUtils]: 59: Hoare triple {33722#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; {33722#false} is VALID [2022-02-20 18:38:48,282 INFO L290 TraceCheckUtils]: 60: Hoare triple {33722#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {33722#false} is VALID [2022-02-20 18:38:48,282 INFO L290 TraceCheckUtils]: 61: Hoare triple {33722#false} assume ~st1~0 + ~nl1~0 <= 1; {33722#false} is VALID [2022-02-20 18:38:48,282 INFO L290 TraceCheckUtils]: 62: Hoare triple {33722#false} assume ~st2~0 + ~nl2~0 <= 1; {33722#false} is VALID [2022-02-20 18:38:48,282 INFO L290 TraceCheckUtils]: 63: Hoare triple {33722#false} assume ~st3~0 + ~nl3~0 <= 1; {33722#false} is VALID [2022-02-20 18:38:48,282 INFO L290 TraceCheckUtils]: 64: Hoare triple {33722#false} assume !(~r1~0 % 256 >= 2); {33722#false} is VALID [2022-02-20 18:38:48,282 INFO L290 TraceCheckUtils]: 65: Hoare triple {33722#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {33722#false} is VALID [2022-02-20 18:38:48,283 INFO L290 TraceCheckUtils]: 66: Hoare triple {33722#false} assume ~r1~0 % 256 < 2; {33722#false} is VALID [2022-02-20 18:38:48,283 INFO L290 TraceCheckUtils]: 67: Hoare triple {33722#false} assume !(~r1~0 % 256 >= 2); {33722#false} is VALID [2022-02-20 18:38:48,283 INFO L290 TraceCheckUtils]: 68: Hoare triple {33722#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {33722#false} is VALID [2022-02-20 18:38:48,284 INFO L290 TraceCheckUtils]: 69: Hoare triple {33722#false} assume ~r1~0 % 256 < 2;main_~check__tmp~0#1 := 1;~__return_1270~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1270~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; {33722#false} is VALID [2022-02-20 18:38:48,284 INFO L290 TraceCheckUtils]: 70: Hoare triple {33722#false} assume !(0 == main_~assert__arg~0#1 % 256); {33722#false} is VALID [2022-02-20 18:38:48,284 INFO L290 TraceCheckUtils]: 71: Hoare triple {33722#false} assume !(0 == ~mode1~0 % 256); {33722#false} is VALID [2022-02-20 18:38:48,284 INFO L290 TraceCheckUtils]: 72: Hoare triple {33722#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {33722#false} is VALID [2022-02-20 18:38:48,287 INFO L290 TraceCheckUtils]: 73: Hoare triple {33722#false} assume !!(0 == ~ep21~0 % 256); {33722#false} is VALID [2022-02-20 18:38:48,288 INFO L290 TraceCheckUtils]: 74: Hoare triple {33722#false} assume !!(0 == ~ep31~0 % 256); {33722#false} is VALID [2022-02-20 18:38:48,288 INFO L290 TraceCheckUtils]: 75: Hoare triple {33722#false} assume 1 == ~r1~0 % 256; {33722#false} is VALID [2022-02-20 18:38:48,288 INFO L290 TraceCheckUtils]: 76: Hoare triple {33722#false} assume ~max1~0 == ~id1~0;~st1~0 := 1;~mode1~0 := 0; {33722#false} is VALID [2022-02-20 18:38:48,288 INFO L290 TraceCheckUtils]: 77: Hoare triple {33722#false} assume !(0 == ~mode2~0 % 256); {33722#false} is VALID [2022-02-20 18:38:48,288 INFO L290 TraceCheckUtils]: 78: Hoare triple {33722#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {33722#false} is VALID [2022-02-20 18:38:48,288 INFO L290 TraceCheckUtils]: 79: Hoare triple {33722#false} assume !!(0 == ~ep12~0 % 256); {33722#false} is VALID [2022-02-20 18:38:48,288 INFO L290 TraceCheckUtils]: 80: Hoare triple {33722#false} assume !!(0 == ~ep32~0 % 256); {33722#false} is VALID [2022-02-20 18:38:48,288 INFO L290 TraceCheckUtils]: 81: Hoare triple {33722#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0; {33722#false} is VALID [2022-02-20 18:38:48,289 INFO L290 TraceCheckUtils]: 82: Hoare triple {33722#false} assume !(0 == ~mode3~0 % 256); {33722#false} is VALID [2022-02-20 18:38:48,289 INFO L290 TraceCheckUtils]: 83: Hoare triple {33722#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {33722#false} is VALID [2022-02-20 18:38:48,289 INFO L290 TraceCheckUtils]: 84: Hoare triple {33722#false} assume !!(0 == ~ep13~0 % 256); {33722#false} is VALID [2022-02-20 18:38:48,289 INFO L290 TraceCheckUtils]: 85: Hoare triple {33722#false} assume !!(0 == ~ep23~0 % 256); {33722#false} is VALID [2022-02-20 18:38:48,289 INFO L290 TraceCheckUtils]: 86: Hoare triple {33722#false} assume !(2 == ~r3~0 % 256);~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; {33722#false} is VALID [2022-02-20 18:38:48,289 INFO L290 TraceCheckUtils]: 87: Hoare triple {33722#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {33722#false} is VALID [2022-02-20 18:38:48,289 INFO L290 TraceCheckUtils]: 88: Hoare triple {33722#false} assume ~st1~0 + ~nl1~0 <= 1; {33722#false} is VALID [2022-02-20 18:38:48,289 INFO L290 TraceCheckUtils]: 89: Hoare triple {33722#false} assume ~st2~0 + ~nl2~0 <= 1; {33722#false} is VALID [2022-02-20 18:38:48,290 INFO L290 TraceCheckUtils]: 90: Hoare triple {33722#false} assume ~st3~0 + ~nl3~0 <= 1; {33722#false} is VALID [2022-02-20 18:38:48,290 INFO L290 TraceCheckUtils]: 91: Hoare triple {33722#false} assume !(~r1~0 % 256 >= 2); {33722#false} is VALID [2022-02-20 18:38:48,290 INFO L290 TraceCheckUtils]: 92: Hoare triple {33722#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1696~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1696~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; {33722#false} is VALID [2022-02-20 18:38:48,290 INFO L290 TraceCheckUtils]: 93: Hoare triple {33722#false} assume 0 == main_~assert__arg~1#1 % 256; {33722#false} is VALID [2022-02-20 18:38:48,290 INFO L290 TraceCheckUtils]: 94: Hoare triple {33722#false} assume !false; {33722#false} is VALID [2022-02-20 18:38:48,290 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:48,291 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:48,291 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478920617] [2022-02-20 18:38:48,291 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478920617] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:48,291 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:48,291 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:38:48,293 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061188771] [2022-02-20 18:38:48,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:48,294 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:48,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:48,294 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:48,353 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:48,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:38:48,354 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:48,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:38:48,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:38:48,355 INFO L87 Difference]: Start difference. First operand 2740 states and 3907 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:52,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:52,738 INFO L93 Difference]: Finished difference Result 8068 states and 11488 transitions. [2022-02-20 18:38:52,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:38:52,739 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:52,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:52,739 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:52,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1010 transitions. [2022-02-20 18:38:52,742 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:52,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1010 transitions. [2022-02-20 18:38:52,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1010 transitions. [2022-02-20 18:38:53,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1010 edges. 1010 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:54,500 INFO L225 Difference]: With dead ends: 8068 [2022-02-20 18:38:54,500 INFO L226 Difference]: Without dead ends: 5419 [2022-02-20 18:38:54,503 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:54,503 INFO L933 BasicCegarLoop]: 426 mSDtfsCounter, 330 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 772 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:54,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [330 Valid, 772 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:54,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5419 states. [2022-02-20 18:38:55,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5419 to 2750. [2022-02-20 18:38:55,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:55,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5419 states. Second operand has 2750 states, 2748 states have (on average 1.4254002911208152) internal successors, (3917), 2749 states have internal predecessors, (3917), 0 states have call successors, (0), 0 states have call 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:55,238 INFO L74 IsIncluded]: Start isIncluded. First operand 5419 states. Second operand has 2750 states, 2748 states have (on average 1.4254002911208152) internal successors, (3917), 2749 states have internal predecessors, (3917), 0 states have call successors, (0), 0 states have call 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:55,241 INFO L87 Difference]: Start difference. First operand 5419 states. Second operand has 2750 states, 2748 states have (on average 1.4254002911208152) internal successors, (3917), 2749 states have internal predecessors, (3917), 0 states have call successors, (0), 0 states have call 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:55,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:55,968 INFO L93 Difference]: Finished difference Result 5419 states and 7715 transitions. [2022-02-20 18:38:55,968 INFO L276 IsEmpty]: Start isEmpty. Operand 5419 states and 7715 transitions. [2022-02-20 18:38:55,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:55,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:55,976 INFO L74 IsIncluded]: Start isIncluded. First operand has 2750 states, 2748 states have (on average 1.4254002911208152) internal successors, (3917), 2749 states have internal predecessors, (3917), 0 states have call successors, (0), 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 5419 states. [2022-02-20 18:38:55,978 INFO L87 Difference]: Start difference. First operand has 2750 states, 2748 states have (on average 1.4254002911208152) internal successors, (3917), 2749 states have internal predecessors, (3917), 0 states have call successors, (0), 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 5419 states. [2022-02-20 18:38:56,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:56,731 INFO L93 Difference]: Finished difference Result 5419 states and 7715 transitions. [2022-02-20 18:38:56,731 INFO L276 IsEmpty]: Start isEmpty. Operand 5419 states and 7715 transitions. [2022-02-20 18:38:56,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:56,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:56,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:56,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:56,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2750 states, 2748 states have (on average 1.4254002911208152) internal successors, (3917), 2749 states have internal predecessors, (3917), 0 states have call successors, (0), 0 states have call 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:57,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2750 states to 2750 states and 3917 transitions. [2022-02-20 18:38:57,003 INFO L78 Accepts]: Start accepts. Automaton has 2750 states and 3917 transitions. Word has length 95 [2022-02-20 18:38:57,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:57,004 INFO L470 AbstractCegarLoop]: Abstraction has 2750 states and 3917 transitions. [2022-02-20 18:38:57,004 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:57,004 INFO L276 IsEmpty]: Start isEmpty. Operand 2750 states and 3917 transitions. [2022-02-20 18:38:57,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-02-20 18:38:57,006 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:57,006 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:57,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:38:57,006 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:57,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:57,007 INFO L85 PathProgramCache]: Analyzing trace with hash 2115195864, now seen corresponding path program 1 times [2022-02-20 18:38:57,007 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:57,007 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990814631] [2022-02-20 18:38:57,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:57,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:57,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:57,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {58865#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_1142~0 := 0;~__return_1270~0 := 0;~__return_1696~0 := 0;~__return_1389~0 := 0;~__return_1499~0 := 0; {58865#true} is VALID [2022-02-20 18:38:57,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {58865#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~check__tmp~3#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_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#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;~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;~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;~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; {58867#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:38:57,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {58867#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r121~0#1 % 256); {58867#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:38:57,102 INFO L290 TraceCheckUtils]: 3: Hoare triple {58867#(= (+ |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; {58867#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:38:57,102 INFO L290 TraceCheckUtils]: 4: Hoare triple {58867#(= (+ |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); {58867#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:38:57,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {58867#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r131~0#1 % 256); {58867#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:38:57,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {58867#(= (+ |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; {58867#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:38:57,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {58867#(= (+ |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); {58867#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:38:57,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {58867#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r211~0#1 % 256); {58867#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:38:57,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {58867#(= (+ |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; {58867#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:38:57,103 INFO L290 TraceCheckUtils]: 10: Hoare triple {58867#(= (+ |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); {58867#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:38:57,104 INFO L290 TraceCheckUtils]: 11: Hoare triple {58867#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r231~0#1 % 256); {58867#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:38:57,104 INFO L290 TraceCheckUtils]: 12: Hoare triple {58867#(= (+ |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; {58867#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:38:57,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {58867#(= (+ |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); {58867#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:38:57,105 INFO L290 TraceCheckUtils]: 14: Hoare triple {58867#(= (+ |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; {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,105 INFO L290 TraceCheckUtils]: 15: Hoare triple {58868#(<= (+ (* 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); {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,106 INFO L290 TraceCheckUtils]: 17: Hoare triple {58868#(<= (+ (* 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); {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id1~0 != ~id2~0; {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,106 INFO L290 TraceCheckUtils]: 19: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id1~0 != ~id3~0; {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id2~0 != ~id3~0; {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,107 INFO L290 TraceCheckUtils]: 21: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id1~0 >= 0; {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,107 INFO L290 TraceCheckUtils]: 22: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id2~0 >= 0; {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,107 INFO L290 TraceCheckUtils]: 23: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id3~0 >= 0; {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,107 INFO L290 TraceCheckUtils]: 24: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~r1~0 % 256; {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,108 INFO L290 TraceCheckUtils]: 25: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~r2~0 % 256; {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,108 INFO L290 TraceCheckUtils]: 26: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~r3~0 % 256; {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,108 INFO L290 TraceCheckUtils]: 27: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r122~0#1 % 256); {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,109 INFO L290 TraceCheckUtils]: 28: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r132~0#1 % 256); {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,109 INFO L290 TraceCheckUtils]: 29: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r212~0#1 % 256); {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,109 INFO L290 TraceCheckUtils]: 30: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r232~0#1 % 256); {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,109 INFO L290 TraceCheckUtils]: 31: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r312~0#1 % 256); {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,110 INFO L290 TraceCheckUtils]: 32: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r322~0#1 % 256); {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,110 INFO L290 TraceCheckUtils]: 33: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~max1~0 == ~id1~0; {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,110 INFO L290 TraceCheckUtils]: 34: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~max2~0 == ~id2~0; {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,110 INFO L290 TraceCheckUtils]: 35: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~max3~0 == ~id3~0; {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,111 INFO L290 TraceCheckUtils]: 36: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~st1~0; {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,111 INFO L290 TraceCheckUtils]: 37: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~st2~0; {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,111 INFO L290 TraceCheckUtils]: 38: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~st3~0; {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,111 INFO L290 TraceCheckUtils]: 39: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~nl1~0; {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,112 INFO L290 TraceCheckUtils]: 40: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~nl2~0; {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,112 INFO L290 TraceCheckUtils]: 41: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~nl3~0; {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,112 INFO L290 TraceCheckUtils]: 42: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~mode1~0 % 256; {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,113 INFO L290 TraceCheckUtils]: 43: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~mode2~0 % 256; {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,113 INFO L290 TraceCheckUtils]: 44: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1142~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1142~0; {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,113 INFO L290 TraceCheckUtils]: 45: Hoare triple {58868#(<= (+ (* 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; {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,113 INFO L290 TraceCheckUtils]: 46: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~mode1~0 % 256); {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,114 INFO L290 TraceCheckUtils]: 47: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~r1~0 % 256 < 2; {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,114 INFO L290 TraceCheckUtils]: 48: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~ep12~0 % 256); {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,114 INFO L290 TraceCheckUtils]: 49: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~ep13~0 % 256); {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,114 INFO L290 TraceCheckUtils]: 50: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} ~mode1~0 := 1; {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,115 INFO L290 TraceCheckUtils]: 51: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~mode2~0 % 256); {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,115 INFO L290 TraceCheckUtils]: 52: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~r2~0 % 256 < 2; {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,116 INFO L290 TraceCheckUtils]: 53: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~ep21~0 % 256); {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,116 INFO L290 TraceCheckUtils]: 54: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~ep23~0 % 256); {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,116 INFO L290 TraceCheckUtils]: 55: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} ~mode2~0 := 1; {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,117 INFO L290 TraceCheckUtils]: 56: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~mode3~0 % 256); {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,117 INFO L290 TraceCheckUtils]: 57: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~r3~0 % 256 < 2; {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:57,118 INFO L290 TraceCheckUtils]: 58: Hoare triple {58868#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~ep31~0 % 256); {58866#false} is VALID [2022-02-20 18:38:57,118 INFO L290 TraceCheckUtils]: 59: Hoare triple {58866#false} assume !!(0 == ~ep32~0 % 256); {58866#false} is VALID [2022-02-20 18:38:57,118 INFO L290 TraceCheckUtils]: 60: Hoare triple {58866#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; {58866#false} is VALID [2022-02-20 18:38:57,118 INFO L290 TraceCheckUtils]: 61: Hoare triple {58866#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {58866#false} is VALID [2022-02-20 18:38:57,118 INFO L290 TraceCheckUtils]: 62: Hoare triple {58866#false} assume ~st1~0 + ~nl1~0 <= 1; {58866#false} is VALID [2022-02-20 18:38:57,118 INFO L290 TraceCheckUtils]: 63: Hoare triple {58866#false} assume ~st2~0 + ~nl2~0 <= 1; {58866#false} is VALID [2022-02-20 18:38:57,119 INFO L290 TraceCheckUtils]: 64: Hoare triple {58866#false} assume ~st3~0 + ~nl3~0 <= 1; {58866#false} is VALID [2022-02-20 18:38:57,119 INFO L290 TraceCheckUtils]: 65: Hoare triple {58866#false} assume !(~r1~0 % 256 >= 2); {58866#false} is VALID [2022-02-20 18:38:57,119 INFO L290 TraceCheckUtils]: 66: Hoare triple {58866#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {58866#false} is VALID [2022-02-20 18:38:57,119 INFO L290 TraceCheckUtils]: 67: Hoare triple {58866#false} assume ~r1~0 % 256 < 2; {58866#false} is VALID [2022-02-20 18:38:57,120 INFO L290 TraceCheckUtils]: 68: Hoare triple {58866#false} assume !(~r1~0 % 256 >= 2); {58866#false} is VALID [2022-02-20 18:38:57,120 INFO L290 TraceCheckUtils]: 69: Hoare triple {58866#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {58866#false} is VALID [2022-02-20 18:38:57,120 INFO L290 TraceCheckUtils]: 70: Hoare triple {58866#false} assume ~r1~0 % 256 < 2;main_~check__tmp~0#1 := 1;~__return_1270~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1270~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; {58866#false} is VALID [2022-02-20 18:38:57,120 INFO L290 TraceCheckUtils]: 71: Hoare triple {58866#false} assume !(0 == main_~assert__arg~0#1 % 256); {58866#false} is VALID [2022-02-20 18:38:57,120 INFO L290 TraceCheckUtils]: 72: Hoare triple {58866#false} assume !(0 == ~mode1~0 % 256); {58866#false} is VALID [2022-02-20 18:38:57,120 INFO L290 TraceCheckUtils]: 73: Hoare triple {58866#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {58866#false} is VALID [2022-02-20 18:38:57,120 INFO L290 TraceCheckUtils]: 74: Hoare triple {58866#false} assume !!(0 == ~ep21~0 % 256); {58866#false} is VALID [2022-02-20 18:38:57,120 INFO L290 TraceCheckUtils]: 75: Hoare triple {58866#false} assume !!(0 == ~ep31~0 % 256); {58866#false} is VALID [2022-02-20 18:38:57,120 INFO L290 TraceCheckUtils]: 76: Hoare triple {58866#false} assume 1 == ~r1~0 % 256; {58866#false} is VALID [2022-02-20 18:38:57,121 INFO L290 TraceCheckUtils]: 77: Hoare triple {58866#false} assume ~max1~0 == ~id1~0;~st1~0 := 1;~mode1~0 := 0; {58866#false} is VALID [2022-02-20 18:38:57,121 INFO L290 TraceCheckUtils]: 78: Hoare triple {58866#false} assume !(0 == ~mode2~0 % 256); {58866#false} is VALID [2022-02-20 18:38:57,121 INFO L290 TraceCheckUtils]: 79: Hoare triple {58866#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {58866#false} is VALID [2022-02-20 18:38:57,121 INFO L290 TraceCheckUtils]: 80: Hoare triple {58866#false} assume !!(0 == ~ep12~0 % 256); {58866#false} is VALID [2022-02-20 18:38:57,121 INFO L290 TraceCheckUtils]: 81: Hoare triple {58866#false} assume !!(0 == ~ep32~0 % 256); {58866#false} is VALID [2022-02-20 18:38:57,121 INFO L290 TraceCheckUtils]: 82: Hoare triple {58866#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0; {58866#false} is VALID [2022-02-20 18:38:57,121 INFO L290 TraceCheckUtils]: 83: Hoare triple {58866#false} assume !(0 == ~mode3~0 % 256); {58866#false} is VALID [2022-02-20 18:38:57,121 INFO L290 TraceCheckUtils]: 84: Hoare triple {58866#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {58866#false} is VALID [2022-02-20 18:38:57,122 INFO L290 TraceCheckUtils]: 85: Hoare triple {58866#false} assume !!(0 == ~ep13~0 % 256); {58866#false} is VALID [2022-02-20 18:38:57,122 INFO L290 TraceCheckUtils]: 86: Hoare triple {58866#false} assume !!(0 == ~ep23~0 % 256); {58866#false} is VALID [2022-02-20 18:38:57,122 INFO L290 TraceCheckUtils]: 87: Hoare triple {58866#false} assume !(2 == ~r3~0 % 256);~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; {58866#false} is VALID [2022-02-20 18:38:57,122 INFO L290 TraceCheckUtils]: 88: Hoare triple {58866#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {58866#false} is VALID [2022-02-20 18:38:57,122 INFO L290 TraceCheckUtils]: 89: Hoare triple {58866#false} assume ~st1~0 + ~nl1~0 <= 1; {58866#false} is VALID [2022-02-20 18:38:57,122 INFO L290 TraceCheckUtils]: 90: Hoare triple {58866#false} assume ~st2~0 + ~nl2~0 <= 1; {58866#false} is VALID [2022-02-20 18:38:57,122 INFO L290 TraceCheckUtils]: 91: Hoare triple {58866#false} assume ~st3~0 + ~nl3~0 <= 1; {58866#false} is VALID [2022-02-20 18:38:57,122 INFO L290 TraceCheckUtils]: 92: Hoare triple {58866#false} assume !(~r1~0 % 256 >= 2); {58866#false} is VALID [2022-02-20 18:38:57,122 INFO L290 TraceCheckUtils]: 93: Hoare triple {58866#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1696~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1696~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; {58866#false} is VALID [2022-02-20 18:38:57,122 INFO L290 TraceCheckUtils]: 94: Hoare triple {58866#false} assume 0 == main_~assert__arg~1#1 % 256; {58866#false} is VALID [2022-02-20 18:38:57,123 INFO L290 TraceCheckUtils]: 95: Hoare triple {58866#false} assume !false; {58866#false} is VALID [2022-02-20 18:38:57,123 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:57,124 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:57,124 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990814631] [2022-02-20 18:38:57,125 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990814631] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:57,125 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:57,125 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:38:57,125 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935738608] [2022-02-20 18:38:57,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:57,126 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:57,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:57,126 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:57,189 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:57,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:38:57,189 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:57,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:38:57,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:38:57,190 INFO L87 Difference]: Start difference. First operand 2750 states and 3917 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:39:02,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:02,135 INFO L93 Difference]: Finished difference Result 7850 states and 11168 transitions. [2022-02-20 18:39:02,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:39:02,136 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:39:02,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:39:02,137 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:39:02,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 989 transitions. [2022-02-20 18:39:02,140 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:39:02,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 989 transitions. [2022-02-20 18:39:02,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 989 transitions. [2022-02-20 18:39:02,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 989 edges. 989 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:04,186 INFO L225 Difference]: With dead ends: 7850 [2022-02-20 18:39:04,187 INFO L226 Difference]: Without dead ends: 5201 [2022-02-20 18:39:04,190 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:04,190 INFO L933 BasicCegarLoop]: 568 mSDtfsCounter, 691 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 889 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:04,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [691 Valid, 889 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:04,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5201 states. [2022-02-20 18:39:05,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5201 to 5144. [2022-02-20 18:39:05,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:39:05,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5201 states. Second operand has 5144 states, 5142 states have (on average 1.4097627382341502) internal successors, (7249), 5143 states have internal predecessors, (7249), 0 states have call successors, (0), 0 states have call 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:05,970 INFO L74 IsIncluded]: Start isIncluded. First operand 5201 states. Second operand has 5144 states, 5142 states have (on average 1.4097627382341502) internal successors, (7249), 5143 states have internal predecessors, (7249), 0 states have call successors, (0), 0 states have call 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:05,985 INFO L87 Difference]: Start difference. First operand 5201 states. Second operand has 5144 states, 5142 states have (on average 1.4097627382341502) internal successors, (7249), 5143 states have internal predecessors, (7249), 0 states have call successors, (0), 0 states have call 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:06,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:06,665 INFO L93 Difference]: Finished difference Result 5201 states and 7320 transitions. [2022-02-20 18:39:06,665 INFO L276 IsEmpty]: Start isEmpty. Operand 5201 states and 7320 transitions. [2022-02-20 18:39:06,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:06,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:06,674 INFO L74 IsIncluded]: Start isIncluded. First operand has 5144 states, 5142 states have (on average 1.4097627382341502) internal successors, (7249), 5143 states have internal predecessors, (7249), 0 states have call successors, (0), 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 5201 states. [2022-02-20 18:39:06,676 INFO L87 Difference]: Start difference. First operand has 5144 states, 5142 states have (on average 1.4097627382341502) internal successors, (7249), 5143 states have internal predecessors, (7249), 0 states have call successors, (0), 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 5201 states. [2022-02-20 18:39:07,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:07,389 INFO L93 Difference]: Finished difference Result 5201 states and 7320 transitions. [2022-02-20 18:39:07,390 INFO L276 IsEmpty]: Start isEmpty. Operand 5201 states and 7320 transitions. [2022-02-20 18:39:07,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:07,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:07,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:39:07,394 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:39:07,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5144 states, 5142 states have (on average 1.4097627382341502) internal successors, (7249), 5143 states have internal predecessors, (7249), 0 states have call successors, (0), 0 states have call 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:08,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5144 states to 5144 states and 7249 transitions. [2022-02-20 18:39:08,377 INFO L78 Accepts]: Start accepts. Automaton has 5144 states and 7249 transitions. Word has length 96 [2022-02-20 18:39:08,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:39:08,377 INFO L470 AbstractCegarLoop]: Abstraction has 5144 states and 7249 transitions. [2022-02-20 18:39:08,377 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:39:08,377 INFO L276 IsEmpty]: Start isEmpty. Operand 5144 states and 7249 transitions. [2022-02-20 18:39:08,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-02-20 18:39:08,380 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:39:08,381 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:39:08,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:39:08,381 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:39:08,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:39:08,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1669939316, now seen corresponding path program 1 times [2022-02-20 18:39:08,382 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:39:08,382 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880902710] [2022-02-20 18:39:08,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:39:08,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:39:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:39:08,426 INFO L290 TraceCheckUtils]: 0: Hoare triple {86493#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_1142~0 := 0;~__return_1270~0 := 0;~__return_1696~0 := 0;~__return_1389~0 := 0;~__return_1499~0 := 0; {86493#true} is VALID [2022-02-20 18:39:08,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {86493#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~check__tmp~3#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_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#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;~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;~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;~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; {86493#true} is VALID [2022-02-20 18:39:08,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {86493#true} assume !!(0 == main_~init__r121~0#1 % 256); {86493#true} is VALID [2022-02-20 18:39:08,427 INFO L290 TraceCheckUtils]: 3: Hoare triple {86493#true} assume !!(0 == main_~init__r131~0#1 % 256);main_~init__tmp~0#1 := 0; {86493#true} is VALID [2022-02-20 18:39:08,427 INFO L290 TraceCheckUtils]: 4: Hoare triple {86493#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {86493#true} is VALID [2022-02-20 18:39:08,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {86493#true} assume !!(0 == main_~init__r131~0#1 % 256); {86493#true} is VALID [2022-02-20 18:39:08,427 INFO L290 TraceCheckUtils]: 6: Hoare triple {86493#true} assume !!(0 == main_~init__r121~0#1 % 256);main_~init__tmp___0~0#1 := 0; {86493#true} is VALID [2022-02-20 18:39:08,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {86493#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {86493#true} is VALID [2022-02-20 18:39:08,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {86493#true} assume !!(0 == main_~init__r211~0#1 % 256); {86493#true} is VALID [2022-02-20 18:39:08,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {86493#true} assume !!(0 == main_~init__r231~0#1 % 256);main_~init__tmp___1~0#1 := 0; {86493#true} is VALID [2022-02-20 18:39:08,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {86493#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {86493#true} is VALID [2022-02-20 18:39:08,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {86493#true} assume !!(0 == main_~init__r231~0#1 % 256); {86493#true} is VALID [2022-02-20 18:39:08,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {86493#true} assume !!(0 == main_~init__r211~0#1 % 256);main_~init__tmp___2~0#1 := 0; {86493#true} is VALID [2022-02-20 18:39:08,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {86493#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {86493#true} is VALID [2022-02-20 18:39:08,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {86493#true} assume !!(0 == main_~init__r311~0#1 % 256); {86493#true} is VALID [2022-02-20 18:39:08,429 INFO L290 TraceCheckUtils]: 15: Hoare triple {86493#true} assume !!(0 == main_~init__r321~0#1 % 256);main_~init__tmp___3~0#1 := 0; {86495#(= (+ |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:08,429 INFO L290 TraceCheckUtils]: 16: Hoare triple {86495#(= (+ |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); {86495#(= (+ |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:08,430 INFO L290 TraceCheckUtils]: 17: Hoare triple {86495#(= (+ |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; {86494#false} is VALID [2022-02-20 18:39:08,430 INFO L290 TraceCheckUtils]: 18: Hoare triple {86494#false} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {86494#false} is VALID [2022-02-20 18:39:08,430 INFO L290 TraceCheckUtils]: 19: Hoare triple {86494#false} assume ~id1~0 != ~id2~0; {86494#false} is VALID [2022-02-20 18:39:08,430 INFO L290 TraceCheckUtils]: 20: Hoare triple {86494#false} assume ~id1~0 != ~id3~0; {86494#false} is VALID [2022-02-20 18:39:08,430 INFO L290 TraceCheckUtils]: 21: Hoare triple {86494#false} assume ~id2~0 != ~id3~0; {86494#false} is VALID [2022-02-20 18:39:08,430 INFO L290 TraceCheckUtils]: 22: Hoare triple {86494#false} assume ~id1~0 >= 0; {86494#false} is VALID [2022-02-20 18:39:08,430 INFO L290 TraceCheckUtils]: 23: Hoare triple {86494#false} assume ~id2~0 >= 0; {86494#false} is VALID [2022-02-20 18:39:08,431 INFO L290 TraceCheckUtils]: 24: Hoare triple {86494#false} assume ~id3~0 >= 0; {86494#false} is VALID [2022-02-20 18:39:08,431 INFO L290 TraceCheckUtils]: 25: Hoare triple {86494#false} assume 0 == ~r1~0 % 256; {86494#false} is VALID [2022-02-20 18:39:08,431 INFO L290 TraceCheckUtils]: 26: Hoare triple {86494#false} assume 0 == ~r2~0 % 256; {86494#false} is VALID [2022-02-20 18:39:08,431 INFO L290 TraceCheckUtils]: 27: Hoare triple {86494#false} assume 0 == ~r3~0 % 256; {86494#false} is VALID [2022-02-20 18:39:08,431 INFO L290 TraceCheckUtils]: 28: Hoare triple {86494#false} assume !(0 == main_~init__r122~0#1 % 256); {86494#false} is VALID [2022-02-20 18:39:08,431 INFO L290 TraceCheckUtils]: 29: Hoare triple {86494#false} assume !(0 == main_~init__r132~0#1 % 256); {86494#false} is VALID [2022-02-20 18:39:08,431 INFO L290 TraceCheckUtils]: 30: Hoare triple {86494#false} assume !(0 == main_~init__r212~0#1 % 256); {86494#false} is VALID [2022-02-20 18:39:08,432 INFO L290 TraceCheckUtils]: 31: Hoare triple {86494#false} assume !(0 == main_~init__r232~0#1 % 256); {86494#false} is VALID [2022-02-20 18:39:08,432 INFO L290 TraceCheckUtils]: 32: Hoare triple {86494#false} assume !(0 == main_~init__r312~0#1 % 256); {86494#false} is VALID [2022-02-20 18:39:08,432 INFO L290 TraceCheckUtils]: 33: Hoare triple {86494#false} assume !(0 == main_~init__r322~0#1 % 256); {86494#false} is VALID [2022-02-20 18:39:08,432 INFO L290 TraceCheckUtils]: 34: Hoare triple {86494#false} assume ~max1~0 == ~id1~0; {86494#false} is VALID [2022-02-20 18:39:08,432 INFO L290 TraceCheckUtils]: 35: Hoare triple {86494#false} assume ~max2~0 == ~id2~0; {86494#false} is VALID [2022-02-20 18:39:08,432 INFO L290 TraceCheckUtils]: 36: Hoare triple {86494#false} assume ~max3~0 == ~id3~0; {86494#false} is VALID [2022-02-20 18:39:08,432 INFO L290 TraceCheckUtils]: 37: Hoare triple {86494#false} assume 0 == ~st1~0; {86494#false} is VALID [2022-02-20 18:39:08,432 INFO L290 TraceCheckUtils]: 38: Hoare triple {86494#false} assume 0 == ~st2~0; {86494#false} is VALID [2022-02-20 18:39:08,433 INFO L290 TraceCheckUtils]: 39: Hoare triple {86494#false} assume 0 == ~st3~0; {86494#false} is VALID [2022-02-20 18:39:08,433 INFO L290 TraceCheckUtils]: 40: Hoare triple {86494#false} assume 0 == ~nl1~0; {86494#false} is VALID [2022-02-20 18:39:08,433 INFO L290 TraceCheckUtils]: 41: Hoare triple {86494#false} assume 0 == ~nl2~0; {86494#false} is VALID [2022-02-20 18:39:08,433 INFO L290 TraceCheckUtils]: 42: Hoare triple {86494#false} assume 0 == ~nl3~0; {86494#false} is VALID [2022-02-20 18:39:08,433 INFO L290 TraceCheckUtils]: 43: Hoare triple {86494#false} assume 0 == ~mode1~0 % 256; {86494#false} is VALID [2022-02-20 18:39:08,433 INFO L290 TraceCheckUtils]: 44: Hoare triple {86494#false} assume 0 == ~mode2~0 % 256; {86494#false} is VALID [2022-02-20 18:39:08,433 INFO L290 TraceCheckUtils]: 45: Hoare triple {86494#false} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1142~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1142~0; {86494#false} is VALID [2022-02-20 18:39:08,433 INFO L290 TraceCheckUtils]: 46: Hoare triple {86494#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; {86494#false} is VALID [2022-02-20 18:39:08,434 INFO L290 TraceCheckUtils]: 47: Hoare triple {86494#false} assume !!(0 == ~mode1~0 % 256); {86494#false} is VALID [2022-02-20 18:39:08,434 INFO L290 TraceCheckUtils]: 48: Hoare triple {86494#false} assume ~r1~0 % 256 < 2; {86494#false} is VALID [2022-02-20 18:39:08,434 INFO L290 TraceCheckUtils]: 49: Hoare triple {86494#false} assume !!(0 == ~ep12~0 % 256); {86494#false} is VALID [2022-02-20 18:39:08,434 INFO L290 TraceCheckUtils]: 50: Hoare triple {86494#false} assume !!(0 == ~ep13~0 % 256); {86494#false} is VALID [2022-02-20 18:39:08,434 INFO L290 TraceCheckUtils]: 51: Hoare triple {86494#false} ~mode1~0 := 1; {86494#false} is VALID [2022-02-20 18:39:08,434 INFO L290 TraceCheckUtils]: 52: Hoare triple {86494#false} assume !!(0 == ~mode2~0 % 256); {86494#false} is VALID [2022-02-20 18:39:08,434 INFO L290 TraceCheckUtils]: 53: Hoare triple {86494#false} assume ~r2~0 % 256 < 2; {86494#false} is VALID [2022-02-20 18:39:08,435 INFO L290 TraceCheckUtils]: 54: Hoare triple {86494#false} assume !!(0 == ~ep21~0 % 256); {86494#false} is VALID [2022-02-20 18:39:08,435 INFO L290 TraceCheckUtils]: 55: Hoare triple {86494#false} assume !!(0 == ~ep23~0 % 256); {86494#false} is VALID [2022-02-20 18:39:08,435 INFO L290 TraceCheckUtils]: 56: Hoare triple {86494#false} ~mode2~0 := 1; {86494#false} is VALID [2022-02-20 18:39:08,435 INFO L290 TraceCheckUtils]: 57: Hoare triple {86494#false} assume !!(0 == ~mode3~0 % 256); {86494#false} is VALID [2022-02-20 18:39:08,435 INFO L290 TraceCheckUtils]: 58: Hoare triple {86494#false} assume ~r3~0 % 256 < 2; {86494#false} is VALID [2022-02-20 18:39:08,435 INFO L290 TraceCheckUtils]: 59: Hoare triple {86494#false} assume !!(0 == ~ep31~0 % 256); {86494#false} is VALID [2022-02-20 18:39:08,435 INFO L290 TraceCheckUtils]: 60: Hoare triple {86494#false} assume !!(0 == ~ep32~0 % 256); {86494#false} is VALID [2022-02-20 18:39:08,435 INFO L290 TraceCheckUtils]: 61: Hoare triple {86494#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; {86494#false} is VALID [2022-02-20 18:39:08,436 INFO L290 TraceCheckUtils]: 62: Hoare triple {86494#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {86494#false} is VALID [2022-02-20 18:39:08,436 INFO L290 TraceCheckUtils]: 63: Hoare triple {86494#false} assume ~st1~0 + ~nl1~0 <= 1; {86494#false} is VALID [2022-02-20 18:39:08,436 INFO L290 TraceCheckUtils]: 64: Hoare triple {86494#false} assume ~st2~0 + ~nl2~0 <= 1; {86494#false} is VALID [2022-02-20 18:39:08,436 INFO L290 TraceCheckUtils]: 65: Hoare triple {86494#false} assume ~st3~0 + ~nl3~0 <= 1; {86494#false} is VALID [2022-02-20 18:39:08,436 INFO L290 TraceCheckUtils]: 66: Hoare triple {86494#false} assume !(~r1~0 % 256 >= 2); {86494#false} is VALID [2022-02-20 18:39:08,436 INFO L290 TraceCheckUtils]: 67: Hoare triple {86494#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {86494#false} is VALID [2022-02-20 18:39:08,436 INFO L290 TraceCheckUtils]: 68: Hoare triple {86494#false} assume ~r1~0 % 256 < 2; {86494#false} is VALID [2022-02-20 18:39:08,436 INFO L290 TraceCheckUtils]: 69: Hoare triple {86494#false} assume !(~r1~0 % 256 >= 2); {86494#false} is VALID [2022-02-20 18:39:08,437 INFO L290 TraceCheckUtils]: 70: Hoare triple {86494#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {86494#false} is VALID [2022-02-20 18:39:08,437 INFO L290 TraceCheckUtils]: 71: Hoare triple {86494#false} assume ~r1~0 % 256 < 2;main_~check__tmp~0#1 := 1;~__return_1270~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1270~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; {86494#false} is VALID [2022-02-20 18:39:08,437 INFO L290 TraceCheckUtils]: 72: Hoare triple {86494#false} assume !(0 == main_~assert__arg~0#1 % 256); {86494#false} is VALID [2022-02-20 18:39:08,437 INFO L290 TraceCheckUtils]: 73: Hoare triple {86494#false} assume !(0 == ~mode1~0 % 256); {86494#false} is VALID [2022-02-20 18:39:08,437 INFO L290 TraceCheckUtils]: 74: Hoare triple {86494#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {86494#false} is VALID [2022-02-20 18:39:08,437 INFO L290 TraceCheckUtils]: 75: Hoare triple {86494#false} assume !!(0 == ~ep21~0 % 256); {86494#false} is VALID [2022-02-20 18:39:08,437 INFO L290 TraceCheckUtils]: 76: Hoare triple {86494#false} assume !!(0 == ~ep31~0 % 256); {86494#false} is VALID [2022-02-20 18:39:08,438 INFO L290 TraceCheckUtils]: 77: Hoare triple {86494#false} assume 1 == ~r1~0 % 256; {86494#false} is VALID [2022-02-20 18:39:08,438 INFO L290 TraceCheckUtils]: 78: Hoare triple {86494#false} assume ~max1~0 == ~id1~0;~st1~0 := 1;~mode1~0 := 0; {86494#false} is VALID [2022-02-20 18:39:08,438 INFO L290 TraceCheckUtils]: 79: Hoare triple {86494#false} assume !(0 == ~mode2~0 % 256); {86494#false} is VALID [2022-02-20 18:39:08,438 INFO L290 TraceCheckUtils]: 80: Hoare triple {86494#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {86494#false} is VALID [2022-02-20 18:39:08,438 INFO L290 TraceCheckUtils]: 81: Hoare triple {86494#false} assume !!(0 == ~ep12~0 % 256); {86494#false} is VALID [2022-02-20 18:39:08,438 INFO L290 TraceCheckUtils]: 82: Hoare triple {86494#false} assume !!(0 == ~ep32~0 % 256); {86494#false} is VALID [2022-02-20 18:39:08,438 INFO L290 TraceCheckUtils]: 83: Hoare triple {86494#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0; {86494#false} is VALID [2022-02-20 18:39:08,438 INFO L290 TraceCheckUtils]: 84: Hoare triple {86494#false} assume !(0 == ~mode3~0 % 256); {86494#false} is VALID [2022-02-20 18:39:08,439 INFO L290 TraceCheckUtils]: 85: Hoare triple {86494#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {86494#false} is VALID [2022-02-20 18:39:08,439 INFO L290 TraceCheckUtils]: 86: Hoare triple {86494#false} assume !!(0 == ~ep13~0 % 256); {86494#false} is VALID [2022-02-20 18:39:08,439 INFO L290 TraceCheckUtils]: 87: Hoare triple {86494#false} assume !!(0 == ~ep23~0 % 256); {86494#false} is VALID [2022-02-20 18:39:08,439 INFO L290 TraceCheckUtils]: 88: Hoare triple {86494#false} assume !(2 == ~r3~0 % 256);~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; {86494#false} is VALID [2022-02-20 18:39:08,439 INFO L290 TraceCheckUtils]: 89: Hoare triple {86494#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {86494#false} is VALID [2022-02-20 18:39:08,439 INFO L290 TraceCheckUtils]: 90: Hoare triple {86494#false} assume ~st1~0 + ~nl1~0 <= 1; {86494#false} is VALID [2022-02-20 18:39:08,439 INFO L290 TraceCheckUtils]: 91: Hoare triple {86494#false} assume ~st2~0 + ~nl2~0 <= 1; {86494#false} is VALID [2022-02-20 18:39:08,440 INFO L290 TraceCheckUtils]: 92: Hoare triple {86494#false} assume ~st3~0 + ~nl3~0 <= 1; {86494#false} is VALID [2022-02-20 18:39:08,440 INFO L290 TraceCheckUtils]: 93: Hoare triple {86494#false} assume !(~r1~0 % 256 >= 2); {86494#false} is VALID [2022-02-20 18:39:08,440 INFO L290 TraceCheckUtils]: 94: Hoare triple {86494#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1696~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1696~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; {86494#false} is VALID [2022-02-20 18:39:08,440 INFO L290 TraceCheckUtils]: 95: Hoare triple {86494#false} assume 0 == main_~assert__arg~1#1 % 256; {86494#false} is VALID [2022-02-20 18:39:08,440 INFO L290 TraceCheckUtils]: 96: Hoare triple {86494#false} assume !false; {86494#false} is VALID [2022-02-20 18:39:08,440 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:08,441 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:39:08,441 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880902710] [2022-02-20 18:39:08,441 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880902710] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:39:08,441 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:39:08,441 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:39:08,455 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559718909] [2022-02-20 18:39:08,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:39:08,456 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:39:08,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:39:08,456 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:39:08,622 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:39:08,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:39:08,622 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:39:08,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:39:08,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:39:08,623 INFO L87 Difference]: Start difference. First operand 5144 states and 7249 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:39:21,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:21,503 INFO L93 Difference]: Finished difference Result 14294 states and 20305 transitions. [2022-02-20 18:39:21,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:39:21,504 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:39:21,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:39:21,504 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:39:21,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 982 transitions. [2022-02-20 18:39:21,507 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:39:21,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 982 transitions. [2022-02-20 18:39:21,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 982 transitions. [2022-02-20 18:39:22,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 982 edges. 982 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:25,858 INFO L225 Difference]: With dead ends: 14294 [2022-02-20 18:39:25,858 INFO L226 Difference]: Without dead ends: 10013 [2022-02-20 18:39:25,871 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:39:25,872 INFO L933 BasicCegarLoop]: 668 mSDtfsCounter, 316 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1014 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:39:25,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 1014 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:39:25,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10013 states. [2022-02-20 18:39:27,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10013 to 5164. [2022-02-20 18:39:27,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:39:27,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10013 states. Second operand has 5164 states, 5162 states have (on average 1.408175125920186) internal successors, (7269), 5163 states have internal predecessors, (7269), 0 states have call successors, (0), 0 states have call 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:27,722 INFO L74 IsIncluded]: Start isIncluded. First operand 10013 states. Second operand has 5164 states, 5162 states have (on average 1.408175125920186) internal successors, (7269), 5163 states have internal predecessors, (7269), 0 states have call successors, (0), 0 states have call 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:27,726 INFO L87 Difference]: Start difference. First operand 10013 states. Second operand has 5164 states, 5162 states have (on average 1.408175125920186) internal successors, (7269), 5163 states have internal predecessors, (7269), 0 states have call successors, (0), 0 states have call 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:30,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:30,405 INFO L93 Difference]: Finished difference Result 10013 states and 14112 transitions. [2022-02-20 18:39:30,405 INFO L276 IsEmpty]: Start isEmpty. Operand 10013 states and 14112 transitions. [2022-02-20 18:39:30,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:30,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:30,419 INFO L74 IsIncluded]: Start isIncluded. First operand has 5164 states, 5162 states have (on average 1.408175125920186) internal successors, (7269), 5163 states have internal predecessors, (7269), 0 states have call successors, (0), 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 10013 states. [2022-02-20 18:39:30,423 INFO L87 Difference]: Start difference. First operand has 5164 states, 5162 states have (on average 1.408175125920186) internal successors, (7269), 5163 states have internal predecessors, (7269), 0 states have call successors, (0), 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 10013 states. [2022-02-20 18:39:33,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:33,151 INFO L93 Difference]: Finished difference Result 10013 states and 14112 transitions. [2022-02-20 18:39:33,151 INFO L276 IsEmpty]: Start isEmpty. Operand 10013 states and 14112 transitions. [2022-02-20 18:39:33,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:33,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:33,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:39:33,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:39:33,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5164 states, 5162 states have (on average 1.408175125920186) internal successors, (7269), 5163 states have internal predecessors, (7269), 0 states have call successors, (0), 0 states have call 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:34,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5164 states to 5164 states and 7269 transitions. [2022-02-20 18:39:34,225 INFO L78 Accepts]: Start accepts. Automaton has 5164 states and 7269 transitions. Word has length 97 [2022-02-20 18:39:34,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:39:34,226 INFO L470 AbstractCegarLoop]: Abstraction has 5164 states and 7269 transitions. [2022-02-20 18:39:34,226 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:34,226 INFO L276 IsEmpty]: Start isEmpty. Operand 5164 states and 7269 transitions. [2022-02-20 18:39:34,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-02-20 18:39:34,229 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:39:34,229 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:34,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:39:34,229 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:39:34,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:39:34,230 INFO L85 PathProgramCache]: Analyzing trace with hash 325317934, now seen corresponding path program 1 times [2022-02-20 18:39:34,230 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:39:34,230 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502113296] [2022-02-20 18:39:34,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:39:34,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:39:34,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:39:34,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {132470#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_1142~0 := 0;~__return_1270~0 := 0;~__return_1696~0 := 0;~__return_1389~0 := 0;~__return_1499~0 := 0; {132470#true} is VALID [2022-02-20 18:39:34,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {132470#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~check__tmp~3#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_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#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;~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;~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;~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; {132472#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:34,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {132472#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} assume !!(0 == main_~init__r121~0#1 % 256); {132472#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:34,313 INFO L290 TraceCheckUtils]: 3: Hoare triple {132472#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} assume !!(0 == main_~init__r131~0#1 % 256);main_~init__tmp~0#1 := 0; {132472#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:34,313 INFO L290 TraceCheckUtils]: 4: Hoare triple {132472#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {132472#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:34,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {132472#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} assume !!(0 == main_~init__r131~0#1 % 256); {132472#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:34,314 INFO L290 TraceCheckUtils]: 6: Hoare triple {132472#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} assume !!(0 == main_~init__r121~0#1 % 256);main_~init__tmp___0~0#1 := 0; {132472#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:34,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {132472#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {132472#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:34,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {132472#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} assume !!(0 == main_~init__r211~0#1 % 256); {132472#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:34,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {132472#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} assume !!(0 == main_~init__r231~0#1 % 256);main_~init__tmp___1~0#1 := 0; {132472#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:34,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {132472#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {132472#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:34,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {132472#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} assume !!(0 == main_~init__r231~0#1 % 256); {132472#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:34,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {132472#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} assume !!(0 == main_~init__r211~0#1 % 256);main_~init__tmp___2~0#1 := 0; {132472#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:34,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {132472#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {132472#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:34,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {132472#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} assume !!(0 == main_~init__r311~0#1 % 256); {132472#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:34,317 INFO L290 TraceCheckUtils]: 15: Hoare triple {132472#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} assume !(0 == main_~init__r321~0#1 % 256); {132473#(and (< (* (div |ULTIMATE.start_main_~init__r321~0#1| 256) 256) |ULTIMATE.start_main_~init__r321~0#1|) (= ~ep32~0 |ULTIMATE.start_main_~init__r321~0#1|))} is VALID [2022-02-20 18:39:34,317 INFO L290 TraceCheckUtils]: 16: Hoare triple {132473#(and (< (* (div |ULTIMATE.start_main_~init__r321~0#1| 256) 256) |ULTIMATE.start_main_~init__r321~0#1|) (= ~ep32~0 |ULTIMATE.start_main_~init__r321~0#1|))} assume !!(0 == ~ep21~0 % 256);main_~init__tmp___3~0#1 := 0; {132473#(and (< (* (div |ULTIMATE.start_main_~init__r321~0#1| 256) 256) |ULTIMATE.start_main_~init__r321~0#1|) (= ~ep32~0 |ULTIMATE.start_main_~init__r321~0#1|))} is VALID [2022-02-20 18:39:34,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {132473#(and (< (* (div |ULTIMATE.start_main_~init__r321~0#1| 256) 256) |ULTIMATE.start_main_~init__r321~0#1|) (= ~ep32~0 |ULTIMATE.start_main_~init__r321~0#1|))} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {132473#(and (< (* (div |ULTIMATE.start_main_~init__r321~0#1| 256) 256) |ULTIMATE.start_main_~init__r321~0#1|) (= ~ep32~0 |ULTIMATE.start_main_~init__r321~0#1|))} is VALID [2022-02-20 18:39:34,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {132473#(and (< (* (div |ULTIMATE.start_main_~init__r321~0#1| 256) 256) |ULTIMATE.start_main_~init__r321~0#1|) (= ~ep32~0 |ULTIMATE.start_main_~init__r321~0#1|))} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,319 INFO L290 TraceCheckUtils]: 19: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~id1~0 != ~id2~0; {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~id1~0 != ~id3~0; {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,319 INFO L290 TraceCheckUtils]: 22: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~id2~0 != ~id3~0; {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,320 INFO L290 TraceCheckUtils]: 23: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~id1~0 >= 0; {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,320 INFO L290 TraceCheckUtils]: 24: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~id2~0 >= 0; {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,320 INFO L290 TraceCheckUtils]: 25: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~id3~0 >= 0; {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,320 INFO L290 TraceCheckUtils]: 26: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~r1~0 % 256; {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,321 INFO L290 TraceCheckUtils]: 27: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~r2~0 % 256; {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,321 INFO L290 TraceCheckUtils]: 28: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~r3~0 % 256; {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,321 INFO L290 TraceCheckUtils]: 29: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !(0 == main_~init__r122~0#1 % 256); {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,321 INFO L290 TraceCheckUtils]: 30: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !(0 == main_~init__r132~0#1 % 256); {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,322 INFO L290 TraceCheckUtils]: 31: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !(0 == main_~init__r212~0#1 % 256); {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,322 INFO L290 TraceCheckUtils]: 32: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !(0 == main_~init__r232~0#1 % 256); {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,322 INFO L290 TraceCheckUtils]: 33: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !(0 == main_~init__r312~0#1 % 256); {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,322 INFO L290 TraceCheckUtils]: 34: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !(0 == main_~init__r322~0#1 % 256); {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,323 INFO L290 TraceCheckUtils]: 35: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~max1~0 == ~id1~0; {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,323 INFO L290 TraceCheckUtils]: 36: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~max2~0 == ~id2~0; {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,323 INFO L290 TraceCheckUtils]: 37: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~max3~0 == ~id3~0; {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,324 INFO L290 TraceCheckUtils]: 38: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~st1~0; {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,324 INFO L290 TraceCheckUtils]: 39: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~st2~0; {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,324 INFO L290 TraceCheckUtils]: 40: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~st3~0; {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,324 INFO L290 TraceCheckUtils]: 41: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~nl1~0; {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,325 INFO L290 TraceCheckUtils]: 42: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~nl2~0; {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,325 INFO L290 TraceCheckUtils]: 43: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~nl3~0; {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,325 INFO L290 TraceCheckUtils]: 44: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~mode1~0 % 256; {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,325 INFO L290 TraceCheckUtils]: 45: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~mode2~0 % 256; {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,326 INFO L290 TraceCheckUtils]: 46: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1142~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1142~0; {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,326 INFO L290 TraceCheckUtils]: 47: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~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; {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,326 INFO L290 TraceCheckUtils]: 48: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !!(0 == ~mode1~0 % 256); {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,326 INFO L290 TraceCheckUtils]: 49: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~r1~0 % 256 < 2; {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,327 INFO L290 TraceCheckUtils]: 50: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !!(0 == ~ep12~0 % 256); {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,327 INFO L290 TraceCheckUtils]: 51: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !!(0 == ~ep13~0 % 256); {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,327 INFO L290 TraceCheckUtils]: 52: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} ~mode1~0 := 1; {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,328 INFO L290 TraceCheckUtils]: 53: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !!(0 == ~mode2~0 % 256); {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,328 INFO L290 TraceCheckUtils]: 54: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~r2~0 % 256 < 2; {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,328 INFO L290 TraceCheckUtils]: 55: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !!(0 == ~ep21~0 % 256); {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,328 INFO L290 TraceCheckUtils]: 56: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !!(0 == ~ep23~0 % 256); {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,329 INFO L290 TraceCheckUtils]: 57: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} ~mode2~0 := 1; {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,329 INFO L290 TraceCheckUtils]: 58: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !!(0 == ~mode3~0 % 256); {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,329 INFO L290 TraceCheckUtils]: 59: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~r3~0 % 256 < 2; {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,329 INFO L290 TraceCheckUtils]: 60: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !!(0 == ~ep31~0 % 256); {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:34,330 INFO L290 TraceCheckUtils]: 61: Hoare triple {132474#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !!(0 == ~ep32~0 % 256); {132471#false} is VALID [2022-02-20 18:39:34,330 INFO L290 TraceCheckUtils]: 62: Hoare triple {132471#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; {132471#false} is VALID [2022-02-20 18:39:34,330 INFO L290 TraceCheckUtils]: 63: Hoare triple {132471#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {132471#false} is VALID [2022-02-20 18:39:34,330 INFO L290 TraceCheckUtils]: 64: Hoare triple {132471#false} assume ~st1~0 + ~nl1~0 <= 1; {132471#false} is VALID [2022-02-20 18:39:34,330 INFO L290 TraceCheckUtils]: 65: Hoare triple {132471#false} assume ~st2~0 + ~nl2~0 <= 1; {132471#false} is VALID [2022-02-20 18:39:34,330 INFO L290 TraceCheckUtils]: 66: Hoare triple {132471#false} assume ~st3~0 + ~nl3~0 <= 1; {132471#false} is VALID [2022-02-20 18:39:34,330 INFO L290 TraceCheckUtils]: 67: Hoare triple {132471#false} assume !(~r1~0 % 256 >= 2); {132471#false} is VALID [2022-02-20 18:39:34,330 INFO L290 TraceCheckUtils]: 68: Hoare triple {132471#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {132471#false} is VALID [2022-02-20 18:39:34,331 INFO L290 TraceCheckUtils]: 69: Hoare triple {132471#false} assume ~r1~0 % 256 < 2; {132471#false} is VALID [2022-02-20 18:39:34,331 INFO L290 TraceCheckUtils]: 70: Hoare triple {132471#false} assume !(~r1~0 % 256 >= 2); {132471#false} is VALID [2022-02-20 18:39:34,331 INFO L290 TraceCheckUtils]: 71: Hoare triple {132471#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {132471#false} is VALID [2022-02-20 18:39:34,331 INFO L290 TraceCheckUtils]: 72: Hoare triple {132471#false} assume ~r1~0 % 256 < 2;main_~check__tmp~0#1 := 1;~__return_1270~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1270~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; {132471#false} is VALID [2022-02-20 18:39:34,331 INFO L290 TraceCheckUtils]: 73: Hoare triple {132471#false} assume !(0 == main_~assert__arg~0#1 % 256); {132471#false} is VALID [2022-02-20 18:39:34,331 INFO L290 TraceCheckUtils]: 74: Hoare triple {132471#false} assume !(0 == ~mode1~0 % 256); {132471#false} is VALID [2022-02-20 18:39:34,331 INFO L290 TraceCheckUtils]: 75: Hoare triple {132471#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {132471#false} is VALID [2022-02-20 18:39:34,331 INFO L290 TraceCheckUtils]: 76: Hoare triple {132471#false} assume !!(0 == ~ep21~0 % 256); {132471#false} is VALID [2022-02-20 18:39:34,331 INFO L290 TraceCheckUtils]: 77: Hoare triple {132471#false} assume !!(0 == ~ep31~0 % 256); {132471#false} is VALID [2022-02-20 18:39:34,331 INFO L290 TraceCheckUtils]: 78: Hoare triple {132471#false} assume 1 == ~r1~0 % 256; {132471#false} is VALID [2022-02-20 18:39:34,332 INFO L290 TraceCheckUtils]: 79: Hoare triple {132471#false} assume ~max1~0 == ~id1~0;~st1~0 := 1;~mode1~0 := 0; {132471#false} is VALID [2022-02-20 18:39:34,332 INFO L290 TraceCheckUtils]: 80: Hoare triple {132471#false} assume !(0 == ~mode2~0 % 256); {132471#false} is VALID [2022-02-20 18:39:34,332 INFO L290 TraceCheckUtils]: 81: Hoare triple {132471#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {132471#false} is VALID [2022-02-20 18:39:34,332 INFO L290 TraceCheckUtils]: 82: Hoare triple {132471#false} assume !!(0 == ~ep12~0 % 256); {132471#false} is VALID [2022-02-20 18:39:34,332 INFO L290 TraceCheckUtils]: 83: Hoare triple {132471#false} assume !!(0 == ~ep32~0 % 256); {132471#false} is VALID [2022-02-20 18:39:34,332 INFO L290 TraceCheckUtils]: 84: Hoare triple {132471#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0; {132471#false} is VALID [2022-02-20 18:39:34,332 INFO L290 TraceCheckUtils]: 85: Hoare triple {132471#false} assume !(0 == ~mode3~0 % 256); {132471#false} is VALID [2022-02-20 18:39:34,332 INFO L290 TraceCheckUtils]: 86: Hoare triple {132471#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {132471#false} is VALID [2022-02-20 18:39:34,332 INFO L290 TraceCheckUtils]: 87: Hoare triple {132471#false} assume !!(0 == ~ep13~0 % 256); {132471#false} is VALID [2022-02-20 18:39:34,333 INFO L290 TraceCheckUtils]: 88: Hoare triple {132471#false} assume !!(0 == ~ep23~0 % 256); {132471#false} is VALID [2022-02-20 18:39:34,333 INFO L290 TraceCheckUtils]: 89: Hoare triple {132471#false} assume !(2 == ~r3~0 % 256);~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; {132471#false} is VALID [2022-02-20 18:39:34,333 INFO L290 TraceCheckUtils]: 90: Hoare triple {132471#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {132471#false} is VALID [2022-02-20 18:39:34,333 INFO L290 TraceCheckUtils]: 91: Hoare triple {132471#false} assume ~st1~0 + ~nl1~0 <= 1; {132471#false} is VALID [2022-02-20 18:39:34,333 INFO L290 TraceCheckUtils]: 92: Hoare triple {132471#false} assume ~st2~0 + ~nl2~0 <= 1; {132471#false} is VALID [2022-02-20 18:39:34,333 INFO L290 TraceCheckUtils]: 93: Hoare triple {132471#false} assume ~st3~0 + ~nl3~0 <= 1; {132471#false} is VALID [2022-02-20 18:39:34,333 INFO L290 TraceCheckUtils]: 94: Hoare triple {132471#false} assume !(~r1~0 % 256 >= 2); {132471#false} is VALID [2022-02-20 18:39:34,333 INFO L290 TraceCheckUtils]: 95: Hoare triple {132471#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1696~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1696~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; {132471#false} is VALID [2022-02-20 18:39:34,333 INFO L290 TraceCheckUtils]: 96: Hoare triple {132471#false} assume 0 == main_~assert__arg~1#1 % 256; {132471#false} is VALID [2022-02-20 18:39:34,333 INFO L290 TraceCheckUtils]: 97: Hoare triple {132471#false} assume !false; {132471#false} is VALID [2022-02-20 18:39:34,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:39:34,334 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:39:34,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502113296] [2022-02-20 18:39:34,334 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502113296] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:39:34,334 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:39:34,334 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:39:34,335 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909241389] [2022-02-20 18:39:34,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:39:34,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 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:34,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:39:34,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 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:34,398 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:34,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:39:34,398 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:39:34,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:39:34,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:39:34,399 INFO L87 Difference]: Start difference. First operand 5164 states and 7269 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 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:42,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:42,410 INFO L93 Difference]: Finished difference Result 10932 states and 15205 transitions. [2022-02-20 18:39:42,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:39:42,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 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:42,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:39:42,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 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:42,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 986 transitions. [2022-02-20 18:39:42,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 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:42,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 986 transitions. [2022-02-20 18:39:42,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 986 transitions. [2022-02-20 18:39:43,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 986 edges. 986 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.