./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a89ee9f7aa9454ab38fa86354119089629ffb03b95267a7d67f4e51e7c7ae615 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:57:44,689 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:57:44,690 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:57:44,714 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:57:44,715 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:57:44,717 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:57:44,721 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:57:44,723 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:57:44,724 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:57:44,729 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:57:44,729 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:57:44,730 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:57:44,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:57:44,733 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:57:44,734 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:57:44,735 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:57:44,736 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:57:44,736 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:57:44,740 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:57:44,741 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:57:44,741 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:57:44,742 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:57:44,743 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:57:44,743 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:57:44,744 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:57:44,745 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:57:44,745 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:57:44,745 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:57:44,746 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:57:44,746 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:57:44,746 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:57:44,747 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:57:44,747 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:57:44,748 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:57:44,748 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:57:44,748 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:57:44,749 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:57:44,749 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:57:44,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:57:44,750 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:57:44,750 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:57:44,751 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:57:44,776 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:57:44,777 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:57:44,777 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:57:44,777 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:57:44,778 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:57:44,778 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:57:44,778 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:57:44,778 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:57:44,779 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:57:44,779 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:57:44,779 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:57:44,779 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:57:44,779 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:57:44,779 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:57:44,780 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:57:44,780 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:57:44,780 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:57:44,780 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:57:44,780 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:57:44,781 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:57:44,781 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:57:44,781 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:57:44,781 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:57:44,781 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:57:44,781 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:57:44,782 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:57:44,782 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:57:44,782 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:57:44,782 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:57:44,782 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:57:44,782 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:57:44,783 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:57:44,783 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:57:44,783 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 -> a89ee9f7aa9454ab38fa86354119089629ffb03b95267a7d67f4e51e7c7ae615 [2022-02-20 18:57:44,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:57:44,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:57:44,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:57:44,956 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:57:44,957 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:57:44,957 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2022-02-20 18:57:45,018 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec1310042/84d13b00d2d5414dbe852093acff1fa4/FLAG22b3e63ed [2022-02-20 18:57:45,422 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:57:45,424 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2022-02-20 18:57:45,434 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec1310042/84d13b00d2d5414dbe852093acff1fa4/FLAG22b3e63ed [2022-02-20 18:57:45,442 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec1310042/84d13b00d2d5414dbe852093acff1fa4 [2022-02-20 18:57:45,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:57:45,445 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:57:45,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:57:45,447 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:57:45,449 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:57:45,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:57:45" (1/1) ... [2022-02-20 18:57:45,453 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@531b1e71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:45, skipping insertion in model container [2022-02-20 18:57:45,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:57:45" (1/1) ... [2022-02-20 18:57:45,458 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:57:45,499 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:57:45,655 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_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[10710,10723] [2022-02-20 18:57:45,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:57:45,708 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:57:45,747 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_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[10710,10723] [2022-02-20 18:57:45,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:57:45,818 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:57:45,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:45 WrapperNode [2022-02-20 18:57:45,819 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:57:45,820 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:57:45,820 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:57:45,820 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:57:45,826 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:57:45" (1/1) ... [2022-02-20 18:57:45,836 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:57:45" (1/1) ... [2022-02-20 18:57:45,882 INFO L137 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 953 [2022-02-20 18:57:45,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:57:45,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:57:45,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:57:45,883 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:57:45,889 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:45" (1/1) ... [2022-02-20 18:57:45,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:45" (1/1) ... [2022-02-20 18:57:45,892 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:45" (1/1) ... [2022-02-20 18:57:45,892 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:45" (1/1) ... [2022-02-20 18:57:45,900 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:45" (1/1) ... [2022-02-20 18:57:45,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:45" (1/1) ... [2022-02-20 18:57:45,908 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:45" (1/1) ... [2022-02-20 18:57:45,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:57:45,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:57:45,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:57:45,912 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:57:45,931 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:45" (1/1) ... [2022-02-20 18:57:45,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:57:45,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:57:45,973 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:57:45,974 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:57:45,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:57:45,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:57:45,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:57:45,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:57:46,109 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:57:46,111 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:57:46,800 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:57:46,809 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:57:46,810 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:57:46,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:57:46 BoogieIcfgContainer [2022-02-20 18:57:46,811 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:57:46,813 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:57:46,813 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:57:46,815 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:57:46,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:57:45" (1/3) ... [2022-02-20 18:57:46,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@611d7217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:57:46, skipping insertion in model container [2022-02-20 18:57:46,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:45" (2/3) ... [2022-02-20 18:57:46,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@611d7217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:57:46, skipping insertion in model container [2022-02-20 18:57:46,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:57:46" (3/3) ... [2022-02-20 18:57:46,818 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2022-02-20 18:57:46,824 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:57:46,824 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:57:46,874 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:57:46,879 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:57:46,880 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:57:46,894 INFO L276 IsEmpty]: Start isEmpty. Operand has 241 states, 239 states have (on average 1.7656903765690377) internal successors, (422), 240 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:46,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-02-20 18:57:46,902 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:57:46,902 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:57:46,903 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:57:46,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:57:46,906 INFO L85 PathProgramCache]: Analyzing trace with hash -574535014, now seen corresponding path program 1 times [2022-02-20 18:57:46,912 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:57:46,912 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431712369] [2022-02-20 18:57:46,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:57:46,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:57:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:57:47,257 INFO L290 TraceCheckUtils]: 0: Hoare triple {244#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(59, 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;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~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_1237~0 := 0;~__return_1383~0 := 0;~__return_1517~0 := 0;~__tmp_1518_0~0 := 0;~__return_1641~0 := 0;~__return_1531~0 := 0; {244#true} is VALID [2022-02-20 18:57:47,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {244#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_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__newmax~2#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__newmax~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__newmax~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__newmax~1#1, main_~node2__newmax~1#1, main_~node1__newmax~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#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; {244#true} is VALID [2022-02-20 18:57:47,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {244#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {244#true} is VALID [2022-02-20 18:57:47,262 INFO L290 TraceCheckUtils]: 3: Hoare triple {244#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {244#true} is VALID [2022-02-20 18:57:47,262 INFO L290 TraceCheckUtils]: 4: Hoare triple {244#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {244#true} is VALID [2022-02-20 18:57:47,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {244#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {244#true} is VALID [2022-02-20 18:57:47,263 INFO L290 TraceCheckUtils]: 6: Hoare triple {244#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {244#true} is VALID [2022-02-20 18:57:47,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {244#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {244#true} is VALID [2022-02-20 18:57:47,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {244#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {244#true} is VALID [2022-02-20 18:57:47,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {244#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {244#true} is VALID [2022-02-20 18:57:47,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {244#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {244#true} is VALID [2022-02-20 18:57:47,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {244#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {244#true} is VALID [2022-02-20 18:57:47,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {244#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {244#true} is VALID [2022-02-20 18:57:47,265 INFO L290 TraceCheckUtils]: 13: Hoare triple {244#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {244#true} is VALID [2022-02-20 18:57:47,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {244#true} assume ~id1~0 != ~id2~0; {244#true} is VALID [2022-02-20 18:57:47,265 INFO L290 TraceCheckUtils]: 15: Hoare triple {244#true} assume ~id1~0 != ~id3~0; {244#true} is VALID [2022-02-20 18:57:47,265 INFO L290 TraceCheckUtils]: 16: Hoare triple {244#true} assume ~id2~0 != ~id3~0; {244#true} is VALID [2022-02-20 18:57:47,266 INFO L290 TraceCheckUtils]: 17: Hoare triple {244#true} assume ~id1~0 >= 0; {244#true} is VALID [2022-02-20 18:57:47,266 INFO L290 TraceCheckUtils]: 18: Hoare triple {244#true} assume ~id2~0 >= 0; {244#true} is VALID [2022-02-20 18:57:47,266 INFO L290 TraceCheckUtils]: 19: Hoare triple {244#true} assume ~id3~0 >= 0; {244#true} is VALID [2022-02-20 18:57:47,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {244#true} assume 0 == ~r1~0; {244#true} is VALID [2022-02-20 18:57:47,267 INFO L290 TraceCheckUtils]: 21: Hoare triple {244#true} assume 0 == ~r2~0; {244#true} is VALID [2022-02-20 18:57:47,268 INFO L290 TraceCheckUtils]: 22: Hoare triple {244#true} assume 0 == ~r3~0; {244#true} is VALID [2022-02-20 18:57:47,268 INFO L290 TraceCheckUtils]: 23: Hoare triple {244#true} assume !(0 == main_~init__r122~0#1 % 256); {244#true} is VALID [2022-02-20 18:57:47,269 INFO L290 TraceCheckUtils]: 24: Hoare triple {244#true} assume !(0 == main_~init__r132~0#1 % 256); {244#true} is VALID [2022-02-20 18:57:47,269 INFO L290 TraceCheckUtils]: 25: Hoare triple {244#true} assume !(0 == main_~init__r212~0#1 % 256); {244#true} is VALID [2022-02-20 18:57:47,269 INFO L290 TraceCheckUtils]: 26: Hoare triple {244#true} assume !(0 == main_~init__r232~0#1 % 256); {244#true} is VALID [2022-02-20 18:57:47,269 INFO L290 TraceCheckUtils]: 27: Hoare triple {244#true} assume !(0 == main_~init__r312~0#1 % 256); {244#true} is VALID [2022-02-20 18:57:47,269 INFO L290 TraceCheckUtils]: 28: Hoare triple {244#true} assume !(0 == main_~init__r322~0#1 % 256); {244#true} is VALID [2022-02-20 18:57:47,270 INFO L290 TraceCheckUtils]: 29: Hoare triple {244#true} assume ~max1~0 == ~id1~0; {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,271 INFO L290 TraceCheckUtils]: 30: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume ~max2~0 == ~id2~0; {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,271 INFO L290 TraceCheckUtils]: 31: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume ~max3~0 == ~id3~0; {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,272 INFO L290 TraceCheckUtils]: 32: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume 0 == ~st1~0; {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,272 INFO L290 TraceCheckUtils]: 33: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume 0 == ~st2~0; {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,273 INFO L290 TraceCheckUtils]: 34: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume 0 == ~st3~0; {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,273 INFO L290 TraceCheckUtils]: 35: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume 0 == ~nl1~0; {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,274 INFO L290 TraceCheckUtils]: 36: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume 0 == ~nl2~0; {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,274 INFO L290 TraceCheckUtils]: 37: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume 0 == ~nl3~0; {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,274 INFO L290 TraceCheckUtils]: 38: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume 0 == ~mode1~0 % 256; {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,275 INFO L290 TraceCheckUtils]: 39: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume 0 == ~mode2~0 % 256; {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,275 INFO L290 TraceCheckUtils]: 40: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume 0 == ~mode3~0 % 256; {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,276 INFO L290 TraceCheckUtils]: 41: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !(0 == ~newmax1~0 % 256); {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,277 INFO L290 TraceCheckUtils]: 42: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !(0 == ~newmax2~0 % 256); {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,277 INFO L290 TraceCheckUtils]: 43: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1237~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1237~0; {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,278 INFO L290 TraceCheckUtils]: 44: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,278 INFO L290 TraceCheckUtils]: 45: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,279 INFO L290 TraceCheckUtils]: 46: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !!(0 == ~mode1~0 % 256); {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,280 INFO L290 TraceCheckUtils]: 47: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume ~r1~0 < 2; {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,280 INFO L290 TraceCheckUtils]: 48: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !!(0 == ~ep12~0 % 256); {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,281 INFO L290 TraceCheckUtils]: 49: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !!(0 == ~ep13~0 % 256); {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,283 INFO L290 TraceCheckUtils]: 50: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} ~mode1~0 := 1;havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,284 INFO L290 TraceCheckUtils]: 51: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !!(0 == ~mode2~0 % 256); {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,284 INFO L290 TraceCheckUtils]: 52: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume ~r2~0 < 2; {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,286 INFO L290 TraceCheckUtils]: 53: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !!(0 == ~ep21~0 % 256); {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,287 INFO L290 TraceCheckUtils]: 54: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !!(0 == ~ep23~0 % 256); {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,288 INFO L290 TraceCheckUtils]: 55: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} ~mode2~0 := 1;havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,289 INFO L290 TraceCheckUtils]: 56: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !!(0 == ~mode3~0 % 256); {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,290 INFO L290 TraceCheckUtils]: 57: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume ~r3~0 < 2; {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,290 INFO L290 TraceCheckUtils]: 58: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !!(0 == ~ep31~0 % 256); {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,291 INFO L290 TraceCheckUtils]: 59: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !!(0 == ~ep32~0 % 256); {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,292 INFO L290 TraceCheckUtils]: 60: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} ~mode3~0 := 1;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,292 INFO L290 TraceCheckUtils]: 61: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,293 INFO L290 TraceCheckUtils]: 62: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,293 INFO L290 TraceCheckUtils]: 63: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume ~st2~0 + ~nl2~0 <= 1; {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,294 INFO L290 TraceCheckUtils]: 64: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume ~st3~0 + ~nl3~0 <= 1; {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,294 INFO L290 TraceCheckUtils]: 65: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !(~r1~0 >= 2); {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,295 INFO L290 TraceCheckUtils]: 66: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,296 INFO L290 TraceCheckUtils]: 67: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume ~r1~0 < 2; {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,296 INFO L290 TraceCheckUtils]: 68: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !(~r1~0 >= 2); {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,297 INFO L290 TraceCheckUtils]: 69: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,297 INFO L290 TraceCheckUtils]: 70: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume ~r1~0 < 2;main_~check__tmp~0#1 := 1;~__return_1383~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1383~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; {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,298 INFO L290 TraceCheckUtils]: 71: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,298 INFO L290 TraceCheckUtils]: 72: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~1#1;main_~node1__newmax~1#1 := 0; {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,299 INFO L290 TraceCheckUtils]: 73: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,299 INFO L290 TraceCheckUtils]: 74: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !!(0 == ~ep21~0 % 256); {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,300 INFO L290 TraceCheckUtils]: 75: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !!(0 == ~ep31~0 % 256); {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,301 INFO L290 TraceCheckUtils]: 76: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} ~newmax1~0 := main_~node1__newmax~1#1; {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,301 INFO L290 TraceCheckUtils]: 77: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume 1 == ~r1~0; {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:57:47,302 INFO L290 TraceCheckUtils]: 78: Hoare triple {246#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !(~max1~0 == ~id1~0);~nl1~0 := 1; {245#false} is VALID [2022-02-20 18:57:47,303 INFO L290 TraceCheckUtils]: 79: Hoare triple {245#false} ~mode1~0 := 0;havoc main_~node2__newmax~1#1;main_~node2__newmax~1#1 := 0; {245#false} is VALID [2022-02-20 18:57:47,305 INFO L290 TraceCheckUtils]: 80: Hoare triple {245#false} assume !(0 == ~mode2~0 % 256);~r2~0 := (if (1 + ~r2~0) % 256 <= 127 then (1 + ~r2~0) % 256 else (1 + ~r2~0) % 256 - 256); {245#false} is VALID [2022-02-20 18:57:47,305 INFO L290 TraceCheckUtils]: 81: Hoare triple {245#false} assume !!(0 == ~ep12~0 % 256); {245#false} is VALID [2022-02-20 18:57:47,305 INFO L290 TraceCheckUtils]: 82: Hoare triple {245#false} assume !!(0 == ~ep32~0 % 256); {245#false} is VALID [2022-02-20 18:57:47,305 INFO L290 TraceCheckUtils]: 83: Hoare triple {245#false} ~newmax2~0 := main_~node2__newmax~1#1; {245#false} is VALID [2022-02-20 18:57:47,306 INFO L290 TraceCheckUtils]: 84: Hoare triple {245#false} assume !(2 == ~r2~0);~mode2~0 := 0;havoc main_~node3__newmax~1#1;main_~node3__newmax~1#1 := 0; {245#false} is VALID [2022-02-20 18:57:47,306 INFO L290 TraceCheckUtils]: 85: Hoare triple {245#false} assume !(0 == ~mode3~0 % 256);~r3~0 := (if (1 + ~r3~0) % 256 <= 127 then (1 + ~r3~0) % 256 else (1 + ~r3~0) % 256 - 256); {245#false} is VALID [2022-02-20 18:57:47,306 INFO L290 TraceCheckUtils]: 86: Hoare triple {245#false} assume !!(0 == ~ep13~0 % 256); {245#false} is VALID [2022-02-20 18:57:47,306 INFO L290 TraceCheckUtils]: 87: Hoare triple {245#false} assume !!(0 == ~ep23~0 % 256); {245#false} is VALID [2022-02-20 18:57:47,306 INFO L290 TraceCheckUtils]: 88: Hoare triple {245#false} ~newmax3~0 := main_~node3__newmax~1#1; {245#false} is VALID [2022-02-20 18:57:47,310 INFO L290 TraceCheckUtils]: 89: Hoare triple {245#false} assume !(2 == ~r3~0);~mode3~0 := 0;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {245#false} is VALID [2022-02-20 18:57:47,311 INFO L290 TraceCheckUtils]: 90: Hoare triple {245#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {245#false} is VALID [2022-02-20 18:57:47,311 INFO L290 TraceCheckUtils]: 91: Hoare triple {245#false} assume ~st1~0 + ~nl1~0 <= 1; {245#false} is VALID [2022-02-20 18:57:47,311 INFO L290 TraceCheckUtils]: 92: Hoare triple {245#false} assume ~st2~0 + ~nl2~0 <= 1; {245#false} is VALID [2022-02-20 18:57:47,311 INFO L290 TraceCheckUtils]: 93: Hoare triple {245#false} assume ~st3~0 + ~nl3~0 <= 1; {245#false} is VALID [2022-02-20 18:57:47,311 INFO L290 TraceCheckUtils]: 94: Hoare triple {245#false} assume !(~r1~0 >= 2); {245#false} is VALID [2022-02-20 18:57:47,312 INFO L290 TraceCheckUtils]: 95: Hoare triple {245#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {245#false} is VALID [2022-02-20 18:57:47,312 INFO L290 TraceCheckUtils]: 96: Hoare triple {245#false} ~__return_1517~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1517~0;~__tmp_1518_0~0 := main_~main____CPAchecker_TMP_0~0#1; {245#false} is VALID [2022-02-20 18:57:47,312 INFO L290 TraceCheckUtils]: 97: Hoare triple {245#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1518_0~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {245#false} is VALID [2022-02-20 18:57:47,312 INFO L290 TraceCheckUtils]: 98: Hoare triple {245#false} assume 0 == main_~assert__arg~1#1 % 256; {245#false} is VALID [2022-02-20 18:57:47,312 INFO L290 TraceCheckUtils]: 99: Hoare triple {245#false} assume !false; {245#false} is VALID [2022-02-20 18:57:47,315 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:57:47,315 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:57:47,315 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431712369] [2022-02-20 18:57:47,316 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431712369] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:57:47,316 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:57:47,316 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:57:47,319 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807802505] [2022-02-20 18:57:47,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:57:47,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2022-02-20 18:57:47,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:57:47,330 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:47,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:47,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:57:47,413 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:57:47,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:57:47,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:57:47,438 INFO L87 Difference]: Start difference. First operand has 241 states, 239 states have (on average 1.7656903765690377) internal successors, (422), 240 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:48,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:48,004 INFO L93 Difference]: Finished difference Result 482 states and 831 transitions. [2022-02-20 18:57:48,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:57:48,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2022-02-20 18:57:48,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:57:48,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:48,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 831 transitions. [2022-02-20 18:57:48,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:48,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 831 transitions. [2022-02-20 18:57:48,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 831 transitions. [2022-02-20 18:57:48,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 831 edges. 831 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:48,590 INFO L225 Difference]: With dead ends: 482 [2022-02-20 18:57:48,590 INFO L226 Difference]: Without dead ends: 358 [2022-02-20 18:57:48,593 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:57:48,595 INFO L933 BasicCegarLoop]: 401 mSDtfsCounter, 291 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:57:48,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [291 Valid, 659 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:57:48,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-02-20 18:57:48,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2022-02-20 18:57:48,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:57:48,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 358 states. Second operand has 356 states, 355 states have (on average 1.5295774647887324) internal successors, (543), 355 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:48,646 INFO L74 IsIncluded]: Start isIncluded. First operand 358 states. Second operand has 356 states, 355 states have (on average 1.5295774647887324) internal successors, (543), 355 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:48,646 INFO L87 Difference]: Start difference. First operand 358 states. Second operand has 356 states, 355 states have (on average 1.5295774647887324) internal successors, (543), 355 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:48,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:48,665 INFO L93 Difference]: Finished difference Result 358 states and 544 transitions. [2022-02-20 18:57:48,665 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 544 transitions. [2022-02-20 18:57:48,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:48,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:48,667 INFO L74 IsIncluded]: Start isIncluded. First operand has 356 states, 355 states have (on average 1.5295774647887324) internal successors, (543), 355 states have internal predecessors, (543), 0 states have call successors, (0), 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 358 states. [2022-02-20 18:57:48,668 INFO L87 Difference]: Start difference. First operand has 356 states, 355 states have (on average 1.5295774647887324) internal successors, (543), 355 states have internal predecessors, (543), 0 states have call successors, (0), 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 358 states. [2022-02-20 18:57:48,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:48,676 INFO L93 Difference]: Finished difference Result 358 states and 544 transitions. [2022-02-20 18:57:48,677 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 544 transitions. [2022-02-20 18:57:48,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:48,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:48,677 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:57:48,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:57:48,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 355 states have (on average 1.5295774647887324) internal successors, (543), 355 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:48,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 543 transitions. [2022-02-20 18:57:48,689 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 543 transitions. Word has length 100 [2022-02-20 18:57:48,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:57:48,689 INFO L470 AbstractCegarLoop]: Abstraction has 356 states and 543 transitions. [2022-02-20 18:57:48,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:48,689 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 543 transitions. [2022-02-20 18:57:48,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-02-20 18:57:48,691 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:57:48,691 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:57:48,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:57:48,692 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:57:48,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:57:48,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1640633924, now seen corresponding path program 1 times [2022-02-20 18:57:48,692 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:57:48,693 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462127063] [2022-02-20 18:57:48,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:57:48,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:57:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:57:48,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {2067#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(59, 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;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~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_1237~0 := 0;~__return_1383~0 := 0;~__return_1517~0 := 0;~__tmp_1518_0~0 := 0;~__return_1641~0 := 0;~__return_1531~0 := 0; {2067#true} is VALID [2022-02-20 18:57:48,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {2067#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_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__newmax~2#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__newmax~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__newmax~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__newmax~1#1, main_~node2__newmax~1#1, main_~node1__newmax~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#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; {2069#(= (+ (* (- 1) ~ep12~0) |ULTIMATE.start_main_~init__r121~0#1|) 0)} is VALID [2022-02-20 18:57:48,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {2069#(= (+ (* (- 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; {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,858 INFO L290 TraceCheckUtils]: 3: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,859 INFO L290 TraceCheckUtils]: 4: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {2070#(<= (+ (* (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); {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {2070#(<= (+ (* (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); {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {2070#(<= (+ (* (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); {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {2070#(<= (+ (* (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); {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,862 INFO L290 TraceCheckUtils]: 12: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {2070#(<= (+ (* (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); {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,863 INFO L290 TraceCheckUtils]: 14: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id1~0 != ~id2~0; {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id1~0 != ~id3~0; {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,864 INFO L290 TraceCheckUtils]: 16: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id2~0 != ~id3~0; {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id1~0 >= 0; {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,864 INFO L290 TraceCheckUtils]: 18: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id2~0 >= 0; {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,865 INFO L290 TraceCheckUtils]: 19: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id3~0 >= 0; {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,865 INFO L290 TraceCheckUtils]: 20: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~r1~0; {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,866 INFO L290 TraceCheckUtils]: 21: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~r2~0; {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,866 INFO L290 TraceCheckUtils]: 22: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~r3~0; {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,866 INFO L290 TraceCheckUtils]: 23: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r122~0#1 % 256); {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,867 INFO L290 TraceCheckUtils]: 24: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r132~0#1 % 256); {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,867 INFO L290 TraceCheckUtils]: 25: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r212~0#1 % 256); {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,867 INFO L290 TraceCheckUtils]: 26: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r232~0#1 % 256); {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,868 INFO L290 TraceCheckUtils]: 27: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r312~0#1 % 256); {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,868 INFO L290 TraceCheckUtils]: 28: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r322~0#1 % 256); {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,869 INFO L290 TraceCheckUtils]: 29: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~max1~0 == ~id1~0; {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,869 INFO L290 TraceCheckUtils]: 30: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~max2~0 == ~id2~0; {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,869 INFO L290 TraceCheckUtils]: 31: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~max3~0 == ~id3~0; {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,870 INFO L290 TraceCheckUtils]: 32: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~st1~0; {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,870 INFO L290 TraceCheckUtils]: 33: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~st2~0; {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,870 INFO L290 TraceCheckUtils]: 34: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~st3~0; {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,871 INFO L290 TraceCheckUtils]: 35: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~nl1~0; {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,871 INFO L290 TraceCheckUtils]: 36: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~nl2~0; {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,872 INFO L290 TraceCheckUtils]: 37: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~nl3~0; {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,872 INFO L290 TraceCheckUtils]: 38: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~mode1~0 % 256; {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,872 INFO L290 TraceCheckUtils]: 39: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~mode2~0 % 256; {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,873 INFO L290 TraceCheckUtils]: 40: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~mode3~0 % 256; {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,873 INFO L290 TraceCheckUtils]: 41: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == ~newmax1~0 % 256); {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,874 INFO L290 TraceCheckUtils]: 42: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == ~newmax2~0 % 256); {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,874 INFO L290 TraceCheckUtils]: 43: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1237~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1237~0; {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,879 INFO L290 TraceCheckUtils]: 44: Hoare triple {2070#(<= (+ (* (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; {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,879 INFO L290 TraceCheckUtils]: 45: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,880 INFO L290 TraceCheckUtils]: 46: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !!(0 == ~mode1~0 % 256); {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,880 INFO L290 TraceCheckUtils]: 47: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~r1~0 < 2; {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:57:48,881 INFO L290 TraceCheckUtils]: 48: Hoare triple {2070#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !!(0 == ~ep12~0 % 256); {2068#false} is VALID [2022-02-20 18:57:48,881 INFO L290 TraceCheckUtils]: 49: Hoare triple {2068#false} assume !!(0 == ~ep13~0 % 256); {2068#false} is VALID [2022-02-20 18:57:48,881 INFO L290 TraceCheckUtils]: 50: Hoare triple {2068#false} ~mode1~0 := 1;havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {2068#false} is VALID [2022-02-20 18:57:48,881 INFO L290 TraceCheckUtils]: 51: Hoare triple {2068#false} assume !!(0 == ~mode2~0 % 256); {2068#false} is VALID [2022-02-20 18:57:48,881 INFO L290 TraceCheckUtils]: 52: Hoare triple {2068#false} assume ~r2~0 < 2; {2068#false} is VALID [2022-02-20 18:57:48,882 INFO L290 TraceCheckUtils]: 53: Hoare triple {2068#false} assume !!(0 == ~ep21~0 % 256); {2068#false} is VALID [2022-02-20 18:57:48,882 INFO L290 TraceCheckUtils]: 54: Hoare triple {2068#false} assume !!(0 == ~ep23~0 % 256); {2068#false} is VALID [2022-02-20 18:57:48,882 INFO L290 TraceCheckUtils]: 55: Hoare triple {2068#false} ~mode2~0 := 1;havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {2068#false} is VALID [2022-02-20 18:57:48,882 INFO L290 TraceCheckUtils]: 56: Hoare triple {2068#false} assume !!(0 == ~mode3~0 % 256); {2068#false} is VALID [2022-02-20 18:57:48,882 INFO L290 TraceCheckUtils]: 57: Hoare triple {2068#false} assume ~r3~0 < 2; {2068#false} is VALID [2022-02-20 18:57:48,882 INFO L290 TraceCheckUtils]: 58: Hoare triple {2068#false} assume !!(0 == ~ep31~0 % 256); {2068#false} is VALID [2022-02-20 18:57:48,882 INFO L290 TraceCheckUtils]: 59: Hoare triple {2068#false} assume !!(0 == ~ep32~0 % 256); {2068#false} is VALID [2022-02-20 18:57:48,883 INFO L290 TraceCheckUtils]: 60: Hoare triple {2068#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; {2068#false} is VALID [2022-02-20 18:57:48,883 INFO L290 TraceCheckUtils]: 61: Hoare triple {2068#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2068#false} is VALID [2022-02-20 18:57:48,883 INFO L290 TraceCheckUtils]: 62: Hoare triple {2068#false} assume ~st1~0 + ~nl1~0 <= 1; {2068#false} is VALID [2022-02-20 18:57:48,883 INFO L290 TraceCheckUtils]: 63: Hoare triple {2068#false} assume ~st2~0 + ~nl2~0 <= 1; {2068#false} is VALID [2022-02-20 18:57:48,883 INFO L290 TraceCheckUtils]: 64: Hoare triple {2068#false} assume ~st3~0 + ~nl3~0 <= 1; {2068#false} is VALID [2022-02-20 18:57:48,883 INFO L290 TraceCheckUtils]: 65: Hoare triple {2068#false} assume !(~r1~0 >= 2); {2068#false} is VALID [2022-02-20 18:57:48,884 INFO L290 TraceCheckUtils]: 66: Hoare triple {2068#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {2068#false} is VALID [2022-02-20 18:57:48,884 INFO L290 TraceCheckUtils]: 67: Hoare triple {2068#false} assume ~r1~0 < 2; {2068#false} is VALID [2022-02-20 18:57:48,884 INFO L290 TraceCheckUtils]: 68: Hoare triple {2068#false} assume !(~r1~0 >= 2); {2068#false} is VALID [2022-02-20 18:57:48,884 INFO L290 TraceCheckUtils]: 69: Hoare triple {2068#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {2068#false} is VALID [2022-02-20 18:57:48,884 INFO L290 TraceCheckUtils]: 70: Hoare triple {2068#false} assume ~r1~0 < 2;main_~check__tmp~0#1 := 1;~__return_1383~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1383~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; {2068#false} is VALID [2022-02-20 18:57:48,884 INFO L290 TraceCheckUtils]: 71: Hoare triple {2068#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {2068#false} is VALID [2022-02-20 18:57:48,884 INFO L290 TraceCheckUtils]: 72: Hoare triple {2068#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~1#1;main_~node1__newmax~1#1 := 0; {2068#false} is VALID [2022-02-20 18:57:48,885 INFO L290 TraceCheckUtils]: 73: Hoare triple {2068#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); {2068#false} is VALID [2022-02-20 18:57:48,885 INFO L290 TraceCheckUtils]: 74: Hoare triple {2068#false} assume !!(0 == ~ep21~0 % 256); {2068#false} is VALID [2022-02-20 18:57:48,885 INFO L290 TraceCheckUtils]: 75: Hoare triple {2068#false} assume !!(0 == ~ep31~0 % 256); {2068#false} is VALID [2022-02-20 18:57:48,885 INFO L290 TraceCheckUtils]: 76: Hoare triple {2068#false} ~newmax1~0 := main_~node1__newmax~1#1; {2068#false} is VALID [2022-02-20 18:57:48,885 INFO L290 TraceCheckUtils]: 77: Hoare triple {2068#false} assume 1 == ~r1~0; {2068#false} is VALID [2022-02-20 18:57:48,885 INFO L290 TraceCheckUtils]: 78: Hoare triple {2068#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {2068#false} is VALID [2022-02-20 18:57:48,885 INFO L290 TraceCheckUtils]: 79: Hoare triple {2068#false} ~mode1~0 := 0;havoc main_~node2__newmax~1#1;main_~node2__newmax~1#1 := 0; {2068#false} is VALID [2022-02-20 18:57:48,886 INFO L290 TraceCheckUtils]: 80: Hoare triple {2068#false} assume !(0 == ~mode2~0 % 256);~r2~0 := (if (1 + ~r2~0) % 256 <= 127 then (1 + ~r2~0) % 256 else (1 + ~r2~0) % 256 - 256); {2068#false} is VALID [2022-02-20 18:57:48,886 INFO L290 TraceCheckUtils]: 81: Hoare triple {2068#false} assume !!(0 == ~ep12~0 % 256); {2068#false} is VALID [2022-02-20 18:57:48,886 INFO L290 TraceCheckUtils]: 82: Hoare triple {2068#false} assume !!(0 == ~ep32~0 % 256); {2068#false} is VALID [2022-02-20 18:57:48,886 INFO L290 TraceCheckUtils]: 83: Hoare triple {2068#false} ~newmax2~0 := main_~node2__newmax~1#1; {2068#false} is VALID [2022-02-20 18:57:48,886 INFO L290 TraceCheckUtils]: 84: Hoare triple {2068#false} assume !(2 == ~r2~0);~mode2~0 := 0;havoc main_~node3__newmax~1#1;main_~node3__newmax~1#1 := 0; {2068#false} is VALID [2022-02-20 18:57:48,886 INFO L290 TraceCheckUtils]: 85: Hoare triple {2068#false} assume !(0 == ~mode3~0 % 256);~r3~0 := (if (1 + ~r3~0) % 256 <= 127 then (1 + ~r3~0) % 256 else (1 + ~r3~0) % 256 - 256); {2068#false} is VALID [2022-02-20 18:57:48,887 INFO L290 TraceCheckUtils]: 86: Hoare triple {2068#false} assume !!(0 == ~ep13~0 % 256); {2068#false} is VALID [2022-02-20 18:57:48,887 INFO L290 TraceCheckUtils]: 87: Hoare triple {2068#false} assume !!(0 == ~ep23~0 % 256); {2068#false} is VALID [2022-02-20 18:57:48,887 INFO L290 TraceCheckUtils]: 88: Hoare triple {2068#false} ~newmax3~0 := main_~node3__newmax~1#1; {2068#false} is VALID [2022-02-20 18:57:48,887 INFO L290 TraceCheckUtils]: 89: Hoare triple {2068#false} assume !(2 == ~r3~0);~mode3~0 := 0;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {2068#false} is VALID [2022-02-20 18:57:48,887 INFO L290 TraceCheckUtils]: 90: Hoare triple {2068#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2068#false} is VALID [2022-02-20 18:57:48,887 INFO L290 TraceCheckUtils]: 91: Hoare triple {2068#false} assume ~st1~0 + ~nl1~0 <= 1; {2068#false} is VALID [2022-02-20 18:57:48,888 INFO L290 TraceCheckUtils]: 92: Hoare triple {2068#false} assume ~st2~0 + ~nl2~0 <= 1; {2068#false} is VALID [2022-02-20 18:57:48,888 INFO L290 TraceCheckUtils]: 93: Hoare triple {2068#false} assume ~st3~0 + ~nl3~0 <= 1; {2068#false} is VALID [2022-02-20 18:57:48,888 INFO L290 TraceCheckUtils]: 94: Hoare triple {2068#false} assume !(~r1~0 >= 2); {2068#false} is VALID [2022-02-20 18:57:48,888 INFO L290 TraceCheckUtils]: 95: Hoare triple {2068#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {2068#false} is VALID [2022-02-20 18:57:48,889 INFO L290 TraceCheckUtils]: 96: Hoare triple {2068#false} ~__return_1517~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1517~0;~__tmp_1518_0~0 := main_~main____CPAchecker_TMP_0~0#1; {2068#false} is VALID [2022-02-20 18:57:48,889 INFO L290 TraceCheckUtils]: 97: Hoare triple {2068#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1518_0~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {2068#false} is VALID [2022-02-20 18:57:48,889 INFO L290 TraceCheckUtils]: 98: Hoare triple {2068#false} assume 0 == main_~assert__arg~1#1 % 256; {2068#false} is VALID [2022-02-20 18:57:48,889 INFO L290 TraceCheckUtils]: 99: Hoare triple {2068#false} assume !false; {2068#false} is VALID [2022-02-20 18:57:48,890 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:57:48,890 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:57:48,891 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462127063] [2022-02-20 18:57:48,891 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462127063] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:57:48,891 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:57:48,891 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:57:48,891 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596793329] [2022-02-20 18:57:48,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:57:48,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2022-02-20 18:57:48,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:57:48,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:48,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:48,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:57:48,957 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:57:48,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:57:48,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:57:48,958 INFO L87 Difference]: Start difference. First operand 356 states and 543 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:49,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:49,709 INFO L93 Difference]: Finished difference Result 1034 states and 1572 transitions. [2022-02-20 18:57:49,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:57:49,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2022-02-20 18:57:49,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:57:49,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:49,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1017 transitions. [2022-02-20 18:57:49,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:49,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1017 transitions. [2022-02-20 18:57:49,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 1017 transitions. [2022-02-20 18:57:50,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1017 edges. 1017 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:50,407 INFO L225 Difference]: With dead ends: 1034 [2022-02-20 18:57:50,408 INFO L226 Difference]: Without dead ends: 687 [2022-02-20 18:57:50,409 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:57:50,410 INFO L933 BasicCegarLoop]: 588 mSDtfsCounter, 711 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 904 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:57:50,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [711 Valid, 904 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:57:50,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2022-02-20 18:57:50,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 685. [2022-02-20 18:57:50,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:57:50,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 687 states. Second operand has 685 states, 684 states have (on average 1.5116959064327486) internal successors, (1034), 684 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:50,507 INFO L74 IsIncluded]: Start isIncluded. First operand 687 states. Second operand has 685 states, 684 states have (on average 1.5116959064327486) internal successors, (1034), 684 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:50,508 INFO L87 Difference]: Start difference. First operand 687 states. Second operand has 685 states, 684 states have (on average 1.5116959064327486) internal successors, (1034), 684 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:50,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:50,527 INFO L93 Difference]: Finished difference Result 687 states and 1035 transitions. [2022-02-20 18:57:50,527 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1035 transitions. [2022-02-20 18:57:50,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:50,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:50,530 INFO L74 IsIncluded]: Start isIncluded. First operand has 685 states, 684 states have (on average 1.5116959064327486) internal successors, (1034), 684 states have internal predecessors, (1034), 0 states have call successors, (0), 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 687 states. [2022-02-20 18:57:50,531 INFO L87 Difference]: Start difference. First operand has 685 states, 684 states have (on average 1.5116959064327486) internal successors, (1034), 684 states have internal predecessors, (1034), 0 states have call successors, (0), 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 687 states. [2022-02-20 18:57:50,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:50,549 INFO L93 Difference]: Finished difference Result 687 states and 1035 transitions. [2022-02-20 18:57:50,550 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1035 transitions. [2022-02-20 18:57:50,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:50,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:50,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:57:50,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:57:50,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 684 states have (on average 1.5116959064327486) internal successors, (1034), 684 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:50,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1034 transitions. [2022-02-20 18:57:50,571 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1034 transitions. Word has length 100 [2022-02-20 18:57:50,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:57:50,571 INFO L470 AbstractCegarLoop]: Abstraction has 685 states and 1034 transitions. [2022-02-20 18:57:50,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:50,572 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1034 transitions. [2022-02-20 18:57:50,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-02-20 18:57:50,573 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:57:50,573 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:57:50,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:57:50,573 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:57:50,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:57:50,574 INFO L85 PathProgramCache]: Analyzing trace with hash -309110568, now seen corresponding path program 1 times [2022-02-20 18:57:50,574 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:57:50,574 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207009076] [2022-02-20 18:57:50,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:57:50,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:57:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:57:50,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {5705#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(59, 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;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~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_1237~0 := 0;~__return_1383~0 := 0;~__return_1517~0 := 0;~__tmp_1518_0~0 := 0;~__return_1641~0 := 0;~__return_1531~0 := 0; {5705#true} is VALID [2022-02-20 18:57:50,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {5705#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_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__newmax~2#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__newmax~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__newmax~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__newmax~1#1, main_~node2__newmax~1#1, main_~node1__newmax~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#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; {5705#true} is VALID [2022-02-20 18:57:50,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {5705#true} assume !!(0 == main_~init__r121~0#1 % 256); {5705#true} is VALID [2022-02-20 18:57:50,640 INFO L290 TraceCheckUtils]: 3: Hoare triple {5705#true} assume !!(0 == main_~init__r131~0#1 % 256);main_~init__tmp~0#1 := 0; {5707#(= (+ (* (- 256) (div |ULTIMATE.start_main_~init__r131~0#1| 256)) |ULTIMATE.start_main_~init__r131~0#1|) 0)} is VALID [2022-02-20 18:57:50,640 INFO L290 TraceCheckUtils]: 4: Hoare triple {5707#(= (+ (* (- 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); {5707#(= (+ (* (- 256) (div |ULTIMATE.start_main_~init__r131~0#1| 256)) |ULTIMATE.start_main_~init__r131~0#1|) 0)} is VALID [2022-02-20 18:57:50,641 INFO L290 TraceCheckUtils]: 5: Hoare triple {5707#(= (+ (* (- 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; {5706#false} is VALID [2022-02-20 18:57:50,641 INFO L290 TraceCheckUtils]: 6: Hoare triple {5706#false} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {5706#false} is VALID [2022-02-20 18:57:50,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {5706#false} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {5706#false} is VALID [2022-02-20 18:57:50,641 INFO L290 TraceCheckUtils]: 8: Hoare triple {5706#false} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {5706#false} is VALID [2022-02-20 18:57:50,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {5706#false} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {5706#false} is VALID [2022-02-20 18:57:50,641 INFO L290 TraceCheckUtils]: 10: Hoare triple {5706#false} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {5706#false} is VALID [2022-02-20 18:57:50,642 INFO L290 TraceCheckUtils]: 11: Hoare triple {5706#false} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {5706#false} is VALID [2022-02-20 18:57:50,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {5706#false} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {5706#false} is VALID [2022-02-20 18:57:50,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {5706#false} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {5706#false} is VALID [2022-02-20 18:57:50,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {5706#false} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {5706#false} is VALID [2022-02-20 18:57:50,642 INFO L290 TraceCheckUtils]: 15: Hoare triple {5706#false} assume ~id1~0 != ~id2~0; {5706#false} is VALID [2022-02-20 18:57:50,642 INFO L290 TraceCheckUtils]: 16: Hoare triple {5706#false} assume ~id1~0 != ~id3~0; {5706#false} is VALID [2022-02-20 18:57:50,642 INFO L290 TraceCheckUtils]: 17: Hoare triple {5706#false} assume ~id2~0 != ~id3~0; {5706#false} is VALID [2022-02-20 18:57:50,643 INFO L290 TraceCheckUtils]: 18: Hoare triple {5706#false} assume ~id1~0 >= 0; {5706#false} is VALID [2022-02-20 18:57:50,643 INFO L290 TraceCheckUtils]: 19: Hoare triple {5706#false} assume ~id2~0 >= 0; {5706#false} is VALID [2022-02-20 18:57:50,643 INFO L290 TraceCheckUtils]: 20: Hoare triple {5706#false} assume ~id3~0 >= 0; {5706#false} is VALID [2022-02-20 18:57:50,643 INFO L290 TraceCheckUtils]: 21: Hoare triple {5706#false} assume 0 == ~r1~0; {5706#false} is VALID [2022-02-20 18:57:50,643 INFO L290 TraceCheckUtils]: 22: Hoare triple {5706#false} assume 0 == ~r2~0; {5706#false} is VALID [2022-02-20 18:57:50,643 INFO L290 TraceCheckUtils]: 23: Hoare triple {5706#false} assume 0 == ~r3~0; {5706#false} is VALID [2022-02-20 18:57:50,643 INFO L290 TraceCheckUtils]: 24: Hoare triple {5706#false} assume !(0 == main_~init__r122~0#1 % 256); {5706#false} is VALID [2022-02-20 18:57:50,644 INFO L290 TraceCheckUtils]: 25: Hoare triple {5706#false} assume !(0 == main_~init__r132~0#1 % 256); {5706#false} is VALID [2022-02-20 18:57:50,644 INFO L290 TraceCheckUtils]: 26: Hoare triple {5706#false} assume !(0 == main_~init__r212~0#1 % 256); {5706#false} is VALID [2022-02-20 18:57:50,644 INFO L290 TraceCheckUtils]: 27: Hoare triple {5706#false} assume !(0 == main_~init__r232~0#1 % 256); {5706#false} is VALID [2022-02-20 18:57:50,644 INFO L290 TraceCheckUtils]: 28: Hoare triple {5706#false} assume !(0 == main_~init__r312~0#1 % 256); {5706#false} is VALID [2022-02-20 18:57:50,644 INFO L290 TraceCheckUtils]: 29: Hoare triple {5706#false} assume !(0 == main_~init__r322~0#1 % 256); {5706#false} is VALID [2022-02-20 18:57:50,644 INFO L290 TraceCheckUtils]: 30: Hoare triple {5706#false} assume ~max1~0 == ~id1~0; {5706#false} is VALID [2022-02-20 18:57:50,644 INFO L290 TraceCheckUtils]: 31: Hoare triple {5706#false} assume ~max2~0 == ~id2~0; {5706#false} is VALID [2022-02-20 18:57:50,645 INFO L290 TraceCheckUtils]: 32: Hoare triple {5706#false} assume ~max3~0 == ~id3~0; {5706#false} is VALID [2022-02-20 18:57:50,645 INFO L290 TraceCheckUtils]: 33: Hoare triple {5706#false} assume 0 == ~st1~0; {5706#false} is VALID [2022-02-20 18:57:50,645 INFO L290 TraceCheckUtils]: 34: Hoare triple {5706#false} assume 0 == ~st2~0; {5706#false} is VALID [2022-02-20 18:57:50,645 INFO L290 TraceCheckUtils]: 35: Hoare triple {5706#false} assume 0 == ~st3~0; {5706#false} is VALID [2022-02-20 18:57:50,645 INFO L290 TraceCheckUtils]: 36: Hoare triple {5706#false} assume 0 == ~nl1~0; {5706#false} is VALID [2022-02-20 18:57:50,645 INFO L290 TraceCheckUtils]: 37: Hoare triple {5706#false} assume 0 == ~nl2~0; {5706#false} is VALID [2022-02-20 18:57:50,645 INFO L290 TraceCheckUtils]: 38: Hoare triple {5706#false} assume 0 == ~nl3~0; {5706#false} is VALID [2022-02-20 18:57:50,645 INFO L290 TraceCheckUtils]: 39: Hoare triple {5706#false} assume 0 == ~mode1~0 % 256; {5706#false} is VALID [2022-02-20 18:57:50,646 INFO L290 TraceCheckUtils]: 40: Hoare triple {5706#false} assume 0 == ~mode2~0 % 256; {5706#false} is VALID [2022-02-20 18:57:50,646 INFO L290 TraceCheckUtils]: 41: Hoare triple {5706#false} assume 0 == ~mode3~0 % 256; {5706#false} is VALID [2022-02-20 18:57:50,646 INFO L290 TraceCheckUtils]: 42: Hoare triple {5706#false} assume !(0 == ~newmax1~0 % 256); {5706#false} is VALID [2022-02-20 18:57:50,646 INFO L290 TraceCheckUtils]: 43: Hoare triple {5706#false} assume !(0 == ~newmax2~0 % 256); {5706#false} is VALID [2022-02-20 18:57:50,646 INFO L290 TraceCheckUtils]: 44: Hoare triple {5706#false} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1237~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1237~0; {5706#false} is VALID [2022-02-20 18:57:50,646 INFO L290 TraceCheckUtils]: 45: Hoare triple {5706#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; {5706#false} is VALID [2022-02-20 18:57:50,646 INFO L290 TraceCheckUtils]: 46: Hoare triple {5706#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {5706#false} is VALID [2022-02-20 18:57:50,647 INFO L290 TraceCheckUtils]: 47: Hoare triple {5706#false} assume !!(0 == ~mode1~0 % 256); {5706#false} is VALID [2022-02-20 18:57:50,647 INFO L290 TraceCheckUtils]: 48: Hoare triple {5706#false} assume ~r1~0 < 2; {5706#false} is VALID [2022-02-20 18:57:50,647 INFO L290 TraceCheckUtils]: 49: Hoare triple {5706#false} assume !!(0 == ~ep12~0 % 256); {5706#false} is VALID [2022-02-20 18:57:50,647 INFO L290 TraceCheckUtils]: 50: Hoare triple {5706#false} assume !!(0 == ~ep13~0 % 256); {5706#false} is VALID [2022-02-20 18:57:50,647 INFO L290 TraceCheckUtils]: 51: Hoare triple {5706#false} ~mode1~0 := 1;havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {5706#false} is VALID [2022-02-20 18:57:50,647 INFO L290 TraceCheckUtils]: 52: Hoare triple {5706#false} assume !!(0 == ~mode2~0 % 256); {5706#false} is VALID [2022-02-20 18:57:50,648 INFO L290 TraceCheckUtils]: 53: Hoare triple {5706#false} assume ~r2~0 < 2; {5706#false} is VALID [2022-02-20 18:57:50,648 INFO L290 TraceCheckUtils]: 54: Hoare triple {5706#false} assume !!(0 == ~ep21~0 % 256); {5706#false} is VALID [2022-02-20 18:57:50,648 INFO L290 TraceCheckUtils]: 55: Hoare triple {5706#false} assume !!(0 == ~ep23~0 % 256); {5706#false} is VALID [2022-02-20 18:57:50,648 INFO L290 TraceCheckUtils]: 56: Hoare triple {5706#false} ~mode2~0 := 1;havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {5706#false} is VALID [2022-02-20 18:57:50,648 INFO L290 TraceCheckUtils]: 57: Hoare triple {5706#false} assume !!(0 == ~mode3~0 % 256); {5706#false} is VALID [2022-02-20 18:57:50,648 INFO L290 TraceCheckUtils]: 58: Hoare triple {5706#false} assume ~r3~0 < 2; {5706#false} is VALID [2022-02-20 18:57:50,648 INFO L290 TraceCheckUtils]: 59: Hoare triple {5706#false} assume !!(0 == ~ep31~0 % 256); {5706#false} is VALID [2022-02-20 18:57:50,649 INFO L290 TraceCheckUtils]: 60: Hoare triple {5706#false} assume !!(0 == ~ep32~0 % 256); {5706#false} is VALID [2022-02-20 18:57:50,649 INFO L290 TraceCheckUtils]: 61: Hoare triple {5706#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; {5706#false} is VALID [2022-02-20 18:57:50,649 INFO L290 TraceCheckUtils]: 62: Hoare triple {5706#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {5706#false} is VALID [2022-02-20 18:57:50,649 INFO L290 TraceCheckUtils]: 63: Hoare triple {5706#false} assume ~st1~0 + ~nl1~0 <= 1; {5706#false} is VALID [2022-02-20 18:57:50,649 INFO L290 TraceCheckUtils]: 64: Hoare triple {5706#false} assume ~st2~0 + ~nl2~0 <= 1; {5706#false} is VALID [2022-02-20 18:57:50,649 INFO L290 TraceCheckUtils]: 65: Hoare triple {5706#false} assume ~st3~0 + ~nl3~0 <= 1; {5706#false} is VALID [2022-02-20 18:57:50,649 INFO L290 TraceCheckUtils]: 66: Hoare triple {5706#false} assume !(~r1~0 >= 2); {5706#false} is VALID [2022-02-20 18:57:50,650 INFO L290 TraceCheckUtils]: 67: Hoare triple {5706#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {5706#false} is VALID [2022-02-20 18:57:50,650 INFO L290 TraceCheckUtils]: 68: Hoare triple {5706#false} assume ~r1~0 < 2; {5706#false} is VALID [2022-02-20 18:57:50,650 INFO L290 TraceCheckUtils]: 69: Hoare triple {5706#false} assume !(~r1~0 >= 2); {5706#false} is VALID [2022-02-20 18:57:50,650 INFO L290 TraceCheckUtils]: 70: Hoare triple {5706#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {5706#false} is VALID [2022-02-20 18:57:50,650 INFO L290 TraceCheckUtils]: 71: Hoare triple {5706#false} assume ~r1~0 < 2;main_~check__tmp~0#1 := 1;~__return_1383~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1383~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; {5706#false} is VALID [2022-02-20 18:57:50,650 INFO L290 TraceCheckUtils]: 72: Hoare triple {5706#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {5706#false} is VALID [2022-02-20 18:57:50,650 INFO L290 TraceCheckUtils]: 73: Hoare triple {5706#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~1#1;main_~node1__newmax~1#1 := 0; {5706#false} is VALID [2022-02-20 18:57:50,651 INFO L290 TraceCheckUtils]: 74: Hoare triple {5706#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); {5706#false} is VALID [2022-02-20 18:57:50,651 INFO L290 TraceCheckUtils]: 75: Hoare triple {5706#false} assume !!(0 == ~ep21~0 % 256); {5706#false} is VALID [2022-02-20 18:57:50,651 INFO L290 TraceCheckUtils]: 76: Hoare triple {5706#false} assume !!(0 == ~ep31~0 % 256); {5706#false} is VALID [2022-02-20 18:57:50,651 INFO L290 TraceCheckUtils]: 77: Hoare triple {5706#false} ~newmax1~0 := main_~node1__newmax~1#1; {5706#false} is VALID [2022-02-20 18:57:50,651 INFO L290 TraceCheckUtils]: 78: Hoare triple {5706#false} assume 1 == ~r1~0; {5706#false} is VALID [2022-02-20 18:57:50,651 INFO L290 TraceCheckUtils]: 79: Hoare triple {5706#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {5706#false} is VALID [2022-02-20 18:57:50,651 INFO L290 TraceCheckUtils]: 80: Hoare triple {5706#false} ~mode1~0 := 0;havoc main_~node2__newmax~1#1;main_~node2__newmax~1#1 := 0; {5706#false} is VALID [2022-02-20 18:57:50,652 INFO L290 TraceCheckUtils]: 81: Hoare triple {5706#false} assume !(0 == ~mode2~0 % 256);~r2~0 := (if (1 + ~r2~0) % 256 <= 127 then (1 + ~r2~0) % 256 else (1 + ~r2~0) % 256 - 256); {5706#false} is VALID [2022-02-20 18:57:50,652 INFO L290 TraceCheckUtils]: 82: Hoare triple {5706#false} assume !!(0 == ~ep12~0 % 256); {5706#false} is VALID [2022-02-20 18:57:50,652 INFO L290 TraceCheckUtils]: 83: Hoare triple {5706#false} assume !!(0 == ~ep32~0 % 256); {5706#false} is VALID [2022-02-20 18:57:50,652 INFO L290 TraceCheckUtils]: 84: Hoare triple {5706#false} ~newmax2~0 := main_~node2__newmax~1#1; {5706#false} is VALID [2022-02-20 18:57:50,652 INFO L290 TraceCheckUtils]: 85: Hoare triple {5706#false} assume !(2 == ~r2~0);~mode2~0 := 0;havoc main_~node3__newmax~1#1;main_~node3__newmax~1#1 := 0; {5706#false} is VALID [2022-02-20 18:57:50,652 INFO L290 TraceCheckUtils]: 86: Hoare triple {5706#false} assume !(0 == ~mode3~0 % 256);~r3~0 := (if (1 + ~r3~0) % 256 <= 127 then (1 + ~r3~0) % 256 else (1 + ~r3~0) % 256 - 256); {5706#false} is VALID [2022-02-20 18:57:50,652 INFO L290 TraceCheckUtils]: 87: Hoare triple {5706#false} assume !!(0 == ~ep13~0 % 256); {5706#false} is VALID [2022-02-20 18:57:50,652 INFO L290 TraceCheckUtils]: 88: Hoare triple {5706#false} assume !!(0 == ~ep23~0 % 256); {5706#false} is VALID [2022-02-20 18:57:50,653 INFO L290 TraceCheckUtils]: 89: Hoare triple {5706#false} ~newmax3~0 := main_~node3__newmax~1#1; {5706#false} is VALID [2022-02-20 18:57:50,653 INFO L290 TraceCheckUtils]: 90: Hoare triple {5706#false} assume !(2 == ~r3~0);~mode3~0 := 0;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {5706#false} is VALID [2022-02-20 18:57:50,653 INFO L290 TraceCheckUtils]: 91: Hoare triple {5706#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {5706#false} is VALID [2022-02-20 18:57:50,653 INFO L290 TraceCheckUtils]: 92: Hoare triple {5706#false} assume ~st1~0 + ~nl1~0 <= 1; {5706#false} is VALID [2022-02-20 18:57:50,653 INFO L290 TraceCheckUtils]: 93: Hoare triple {5706#false} assume ~st2~0 + ~nl2~0 <= 1; {5706#false} is VALID [2022-02-20 18:57:50,653 INFO L290 TraceCheckUtils]: 94: Hoare triple {5706#false} assume ~st3~0 + ~nl3~0 <= 1; {5706#false} is VALID [2022-02-20 18:57:50,653 INFO L290 TraceCheckUtils]: 95: Hoare triple {5706#false} assume !(~r1~0 >= 2); {5706#false} is VALID [2022-02-20 18:57:50,654 INFO L290 TraceCheckUtils]: 96: Hoare triple {5706#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {5706#false} is VALID [2022-02-20 18:57:50,654 INFO L290 TraceCheckUtils]: 97: Hoare triple {5706#false} ~__return_1517~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1517~0;~__tmp_1518_0~0 := main_~main____CPAchecker_TMP_0~0#1; {5706#false} is VALID [2022-02-20 18:57:50,654 INFO L290 TraceCheckUtils]: 98: Hoare triple {5706#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1518_0~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {5706#false} is VALID [2022-02-20 18:57:50,654 INFO L290 TraceCheckUtils]: 99: Hoare triple {5706#false} assume 0 == main_~assert__arg~1#1 % 256; {5706#false} is VALID [2022-02-20 18:57:50,654 INFO L290 TraceCheckUtils]: 100: Hoare triple {5706#false} assume !false; {5706#false} is VALID [2022-02-20 18:57:50,654 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:57:50,655 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:57:50,655 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207009076] [2022-02-20 18:57:50,655 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207009076] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:57:50,655 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:57:50,655 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:57:50,655 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405108231] [2022-02-20 18:57:50,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:57:50,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2022-02-20 18:57:50,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:57:50,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:50,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:50,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:57:50,704 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:57:50,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:57:50,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:57:50,705 INFO L87 Difference]: Start difference. First operand 685 states and 1034 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:51,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:51,468 INFO L93 Difference]: Finished difference Result 2017 states and 3040 transitions. [2022-02-20 18:57:51,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:57:51,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2022-02-20 18:57:51,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:57:51,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:51,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1035 transitions. [2022-02-20 18:57:51,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:51,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1035 transitions. [2022-02-20 18:57:51,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1035 transitions. [2022-02-20 18:57:52,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1035 edges. 1035 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:52,144 INFO L225 Difference]: With dead ends: 2017 [2022-02-20 18:57:52,145 INFO L226 Difference]: Without dead ends: 1360 [2022-02-20 18:57:52,146 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:57:52,146 INFO L933 BasicCegarLoop]: 694 mSDtfsCounter, 343 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 1039 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:57:52,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 1039 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:57:52,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2022-02-20 18:57:52,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 687. [2022-02-20 18:57:52,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:57:52,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1360 states. Second operand has 687 states, 686 states have (on average 1.510204081632653) internal successors, (1036), 686 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:52,230 INFO L74 IsIncluded]: Start isIncluded. First operand 1360 states. Second operand has 687 states, 686 states have (on average 1.510204081632653) internal successors, (1036), 686 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:52,231 INFO L87 Difference]: Start difference. First operand 1360 states. Second operand has 687 states, 686 states have (on average 1.510204081632653) internal successors, (1036), 686 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:52,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:52,282 INFO L93 Difference]: Finished difference Result 1360 states and 2051 transitions. [2022-02-20 18:57:52,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 2051 transitions. [2022-02-20 18:57:52,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:52,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:52,285 INFO L74 IsIncluded]: Start isIncluded. First operand has 687 states, 686 states have (on average 1.510204081632653) internal successors, (1036), 686 states have internal predecessors, (1036), 0 states have call successors, (0), 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 1360 states. [2022-02-20 18:57:52,286 INFO L87 Difference]: Start difference. First operand has 687 states, 686 states have (on average 1.510204081632653) internal successors, (1036), 686 states have internal predecessors, (1036), 0 states have call successors, (0), 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 1360 states. [2022-02-20 18:57:52,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:52,335 INFO L93 Difference]: Finished difference Result 1360 states and 2051 transitions. [2022-02-20 18:57:52,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 2051 transitions. [2022-02-20 18:57:52,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:52,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:52,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:57:52,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:57:52,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 686 states have (on average 1.510204081632653) internal successors, (1036), 686 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:52,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1036 transitions. [2022-02-20 18:57:52,357 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1036 transitions. Word has length 101 [2022-02-20 18:57:52,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:57:52,357 INFO L470 AbstractCegarLoop]: Abstraction has 687 states and 1036 transitions. [2022-02-20 18:57:52,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:52,357 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1036 transitions. [2022-02-20 18:57:52,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-02-20 18:57:52,358 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:57:52,358 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:57:52,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:57:52,358 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:57:52,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:57:52,359 INFO L85 PathProgramCache]: Analyzing trace with hash 923754978, now seen corresponding path program 1 times [2022-02-20 18:57:52,359 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:57:52,359 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801461981] [2022-02-20 18:57:52,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:57:52,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:57:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:57:52,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {11984#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(59, 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;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~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_1237~0 := 0;~__return_1383~0 := 0;~__return_1517~0 := 0;~__tmp_1518_0~0 := 0;~__return_1641~0 := 0;~__return_1531~0 := 0; {11984#true} is VALID [2022-02-20 18:57:52,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {11984#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_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__newmax~2#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__newmax~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__newmax~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__newmax~1#1, main_~node2__newmax~1#1, main_~node1__newmax~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#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; {11984#true} is VALID [2022-02-20 18:57:52,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {11984#true} assume !!(0 == main_~init__r121~0#1 % 256); {11984#true} is VALID [2022-02-20 18:57:52,412 INFO L290 TraceCheckUtils]: 3: Hoare triple {11984#true} assume !(0 == main_~init__r131~0#1 % 256); {11984#true} is VALID [2022-02-20 18:57:52,413 INFO L290 TraceCheckUtils]: 4: Hoare triple {11984#true} assume !(0 == ~ep32~0 % 256);main_~init__tmp~0#1 := 1; {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {11986#(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); {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {11986#(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); {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {11986#(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); {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,415 INFO L290 TraceCheckUtils]: 11: Hoare triple {11986#(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); {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,416 INFO L290 TraceCheckUtils]: 13: Hoare triple {11986#(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); {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {11986#(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); {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,417 INFO L290 TraceCheckUtils]: 16: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~id1~0 != ~id2~0; {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,418 INFO L290 TraceCheckUtils]: 17: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~id1~0 != ~id3~0; {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,418 INFO L290 TraceCheckUtils]: 18: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~id2~0 != ~id3~0; {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,418 INFO L290 TraceCheckUtils]: 19: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~id1~0 >= 0; {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,419 INFO L290 TraceCheckUtils]: 20: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~id2~0 >= 0; {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,419 INFO L290 TraceCheckUtils]: 21: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~id3~0 >= 0; {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,419 INFO L290 TraceCheckUtils]: 22: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~r1~0; {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,420 INFO L290 TraceCheckUtils]: 23: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~r2~0; {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,420 INFO L290 TraceCheckUtils]: 24: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~r3~0; {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,420 INFO L290 TraceCheckUtils]: 25: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r122~0#1 % 256); {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,421 INFO L290 TraceCheckUtils]: 26: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r132~0#1 % 256); {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,421 INFO L290 TraceCheckUtils]: 27: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r212~0#1 % 256); {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,421 INFO L290 TraceCheckUtils]: 28: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r232~0#1 % 256); {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,422 INFO L290 TraceCheckUtils]: 29: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r312~0#1 % 256); {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,422 INFO L290 TraceCheckUtils]: 30: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r322~0#1 % 256); {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,422 INFO L290 TraceCheckUtils]: 31: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~max1~0 == ~id1~0; {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,423 INFO L290 TraceCheckUtils]: 32: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~max2~0 == ~id2~0; {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,423 INFO L290 TraceCheckUtils]: 33: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~max3~0 == ~id3~0; {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,424 INFO L290 TraceCheckUtils]: 34: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~st1~0; {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,424 INFO L290 TraceCheckUtils]: 35: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~st2~0; {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,424 INFO L290 TraceCheckUtils]: 36: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~st3~0; {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,425 INFO L290 TraceCheckUtils]: 37: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~nl1~0; {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,425 INFO L290 TraceCheckUtils]: 38: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~nl2~0; {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,425 INFO L290 TraceCheckUtils]: 39: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~nl3~0; {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,426 INFO L290 TraceCheckUtils]: 40: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~mode1~0 % 256; {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,426 INFO L290 TraceCheckUtils]: 41: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~mode2~0 % 256; {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,426 INFO L290 TraceCheckUtils]: 42: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~mode3~0 % 256; {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,427 INFO L290 TraceCheckUtils]: 43: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == ~newmax1~0 % 256); {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,427 INFO L290 TraceCheckUtils]: 44: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == ~newmax2~0 % 256); {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,427 INFO L290 TraceCheckUtils]: 45: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1237~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1237~0; {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,428 INFO L290 TraceCheckUtils]: 46: Hoare triple {11986#(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; {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,428 INFO L290 TraceCheckUtils]: 47: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,429 INFO L290 TraceCheckUtils]: 48: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !!(0 == ~mode1~0 % 256); {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,429 INFO L290 TraceCheckUtils]: 49: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~r1~0 < 2; {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,429 INFO L290 TraceCheckUtils]: 50: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !!(0 == ~ep12~0 % 256); {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,430 INFO L290 TraceCheckUtils]: 51: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !!(0 == ~ep13~0 % 256); {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,430 INFO L290 TraceCheckUtils]: 52: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} ~mode1~0 := 1;havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,430 INFO L290 TraceCheckUtils]: 53: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !!(0 == ~mode2~0 % 256); {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,431 INFO L290 TraceCheckUtils]: 54: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~r2~0 < 2; {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,431 INFO L290 TraceCheckUtils]: 55: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !!(0 == ~ep21~0 % 256); {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,431 INFO L290 TraceCheckUtils]: 56: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !!(0 == ~ep23~0 % 256); {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,432 INFO L290 TraceCheckUtils]: 57: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} ~mode2~0 := 1;havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,432 INFO L290 TraceCheckUtils]: 58: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !!(0 == ~mode3~0 % 256); {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,433 INFO L290 TraceCheckUtils]: 59: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~r3~0 < 2; {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,433 INFO L290 TraceCheckUtils]: 60: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !!(0 == ~ep31~0 % 256); {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:57:52,433 INFO L290 TraceCheckUtils]: 61: Hoare triple {11986#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !!(0 == ~ep32~0 % 256); {11985#false} is VALID [2022-02-20 18:57:52,433 INFO L290 TraceCheckUtils]: 62: Hoare triple {11985#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; {11985#false} is VALID [2022-02-20 18:57:52,434 INFO L290 TraceCheckUtils]: 63: Hoare triple {11985#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {11985#false} is VALID [2022-02-20 18:57:52,434 INFO L290 TraceCheckUtils]: 64: Hoare triple {11985#false} assume ~st1~0 + ~nl1~0 <= 1; {11985#false} is VALID [2022-02-20 18:57:52,434 INFO L290 TraceCheckUtils]: 65: Hoare triple {11985#false} assume ~st2~0 + ~nl2~0 <= 1; {11985#false} is VALID [2022-02-20 18:57:52,434 INFO L290 TraceCheckUtils]: 66: Hoare triple {11985#false} assume ~st3~0 + ~nl3~0 <= 1; {11985#false} is VALID [2022-02-20 18:57:52,440 INFO L290 TraceCheckUtils]: 67: Hoare triple {11985#false} assume !(~r1~0 >= 2); {11985#false} is VALID [2022-02-20 18:57:52,440 INFO L290 TraceCheckUtils]: 68: Hoare triple {11985#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {11985#false} is VALID [2022-02-20 18:57:52,440 INFO L290 TraceCheckUtils]: 69: Hoare triple {11985#false} assume ~r1~0 < 2; {11985#false} is VALID [2022-02-20 18:57:52,440 INFO L290 TraceCheckUtils]: 70: Hoare triple {11985#false} assume !(~r1~0 >= 2); {11985#false} is VALID [2022-02-20 18:57:52,440 INFO L290 TraceCheckUtils]: 71: Hoare triple {11985#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {11985#false} is VALID [2022-02-20 18:57:52,440 INFO L290 TraceCheckUtils]: 72: Hoare triple {11985#false} assume ~r1~0 < 2;main_~check__tmp~0#1 := 1;~__return_1383~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1383~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; {11985#false} is VALID [2022-02-20 18:57:52,441 INFO L290 TraceCheckUtils]: 73: Hoare triple {11985#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {11985#false} is VALID [2022-02-20 18:57:52,441 INFO L290 TraceCheckUtils]: 74: Hoare triple {11985#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~1#1;main_~node1__newmax~1#1 := 0; {11985#false} is VALID [2022-02-20 18:57:52,441 INFO L290 TraceCheckUtils]: 75: Hoare triple {11985#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); {11985#false} is VALID [2022-02-20 18:57:52,441 INFO L290 TraceCheckUtils]: 76: Hoare triple {11985#false} assume !!(0 == ~ep21~0 % 256); {11985#false} is VALID [2022-02-20 18:57:52,441 INFO L290 TraceCheckUtils]: 77: Hoare triple {11985#false} assume !!(0 == ~ep31~0 % 256); {11985#false} is VALID [2022-02-20 18:57:52,441 INFO L290 TraceCheckUtils]: 78: Hoare triple {11985#false} ~newmax1~0 := main_~node1__newmax~1#1; {11985#false} is VALID [2022-02-20 18:57:52,442 INFO L290 TraceCheckUtils]: 79: Hoare triple {11985#false} assume 1 == ~r1~0; {11985#false} is VALID [2022-02-20 18:57:52,442 INFO L290 TraceCheckUtils]: 80: Hoare triple {11985#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {11985#false} is VALID [2022-02-20 18:57:52,442 INFO L290 TraceCheckUtils]: 81: Hoare triple {11985#false} ~mode1~0 := 0;havoc main_~node2__newmax~1#1;main_~node2__newmax~1#1 := 0; {11985#false} is VALID [2022-02-20 18:57:52,442 INFO L290 TraceCheckUtils]: 82: Hoare triple {11985#false} assume !(0 == ~mode2~0 % 256);~r2~0 := (if (1 + ~r2~0) % 256 <= 127 then (1 + ~r2~0) % 256 else (1 + ~r2~0) % 256 - 256); {11985#false} is VALID [2022-02-20 18:57:52,442 INFO L290 TraceCheckUtils]: 83: Hoare triple {11985#false} assume !!(0 == ~ep12~0 % 256); {11985#false} is VALID [2022-02-20 18:57:52,442 INFO L290 TraceCheckUtils]: 84: Hoare triple {11985#false} assume !!(0 == ~ep32~0 % 256); {11985#false} is VALID [2022-02-20 18:57:52,442 INFO L290 TraceCheckUtils]: 85: Hoare triple {11985#false} ~newmax2~0 := main_~node2__newmax~1#1; {11985#false} is VALID [2022-02-20 18:57:52,443 INFO L290 TraceCheckUtils]: 86: Hoare triple {11985#false} assume !(2 == ~r2~0);~mode2~0 := 0;havoc main_~node3__newmax~1#1;main_~node3__newmax~1#1 := 0; {11985#false} is VALID [2022-02-20 18:57:52,443 INFO L290 TraceCheckUtils]: 87: Hoare triple {11985#false} assume !(0 == ~mode3~0 % 256);~r3~0 := (if (1 + ~r3~0) % 256 <= 127 then (1 + ~r3~0) % 256 else (1 + ~r3~0) % 256 - 256); {11985#false} is VALID [2022-02-20 18:57:52,443 INFO L290 TraceCheckUtils]: 88: Hoare triple {11985#false} assume !!(0 == ~ep13~0 % 256); {11985#false} is VALID [2022-02-20 18:57:52,443 INFO L290 TraceCheckUtils]: 89: Hoare triple {11985#false} assume !!(0 == ~ep23~0 % 256); {11985#false} is VALID [2022-02-20 18:57:52,443 INFO L290 TraceCheckUtils]: 90: Hoare triple {11985#false} ~newmax3~0 := main_~node3__newmax~1#1; {11985#false} is VALID [2022-02-20 18:57:52,443 INFO L290 TraceCheckUtils]: 91: Hoare triple {11985#false} assume !(2 == ~r3~0);~mode3~0 := 0;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {11985#false} is VALID [2022-02-20 18:57:52,444 INFO L290 TraceCheckUtils]: 92: Hoare triple {11985#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {11985#false} is VALID [2022-02-20 18:57:52,444 INFO L290 TraceCheckUtils]: 93: Hoare triple {11985#false} assume ~st1~0 + ~nl1~0 <= 1; {11985#false} is VALID [2022-02-20 18:57:52,444 INFO L290 TraceCheckUtils]: 94: Hoare triple {11985#false} assume ~st2~0 + ~nl2~0 <= 1; {11985#false} is VALID [2022-02-20 18:57:52,444 INFO L290 TraceCheckUtils]: 95: Hoare triple {11985#false} assume ~st3~0 + ~nl3~0 <= 1; {11985#false} is VALID [2022-02-20 18:57:52,444 INFO L290 TraceCheckUtils]: 96: Hoare triple {11985#false} assume !(~r1~0 >= 2); {11985#false} is VALID [2022-02-20 18:57:52,444 INFO L290 TraceCheckUtils]: 97: Hoare triple {11985#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {11985#false} is VALID [2022-02-20 18:57:52,444 INFO L290 TraceCheckUtils]: 98: Hoare triple {11985#false} ~__return_1517~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1517~0;~__tmp_1518_0~0 := main_~main____CPAchecker_TMP_0~0#1; {11985#false} is VALID [2022-02-20 18:57:52,445 INFO L290 TraceCheckUtils]: 99: Hoare triple {11985#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1518_0~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {11985#false} is VALID [2022-02-20 18:57:52,445 INFO L290 TraceCheckUtils]: 100: Hoare triple {11985#false} assume 0 == main_~assert__arg~1#1 % 256; {11985#false} is VALID [2022-02-20 18:57:52,445 INFO L290 TraceCheckUtils]: 101: Hoare triple {11985#false} assume !false; {11985#false} is VALID [2022-02-20 18:57:52,445 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:57:52,446 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:57:52,446 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801461981] [2022-02-20 18:57:52,446 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801461981] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:57:52,446 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:57:52,446 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:57:52,446 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097826968] [2022-02-20 18:57:52,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:57:52,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2022-02-20 18:57:52,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:57:52,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:52,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:52,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:57:52,508 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:57:52,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:57:52,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:57:52,509 INFO L87 Difference]: Start difference. First operand 687 states and 1036 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:53,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:53,220 INFO L93 Difference]: Finished difference Result 1818 states and 2761 transitions. [2022-02-20 18:57:53,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:57:53,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2022-02-20 18:57:53,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:57:53,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:53,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 890 transitions. [2022-02-20 18:57:53,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:53,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 890 transitions. [2022-02-20 18:57:53,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 890 transitions. [2022-02-20 18:57:53,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 890 edges. 890 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:53,774 INFO L225 Difference]: With dead ends: 1818 [2022-02-20 18:57:53,774 INFO L226 Difference]: Without dead ends: 1326 [2022-02-20 18:57:53,775 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:57:53,776 INFO L933 BasicCegarLoop]: 670 mSDtfsCounter, 282 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:57:53,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [282 Valid, 992 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:57:53,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2022-02-20 18:57:53,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1324. [2022-02-20 18:57:53,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:57:53,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1326 states. Second operand has 1324 states, 1323 states have (on average 1.4958427815570672) internal successors, (1979), 1323 states have internal predecessors, (1979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:53,921 INFO L74 IsIncluded]: Start isIncluded. First operand 1326 states. Second operand has 1324 states, 1323 states have (on average 1.4958427815570672) internal successors, (1979), 1323 states have internal predecessors, (1979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:53,923 INFO L87 Difference]: Start difference. First operand 1326 states. Second operand has 1324 states, 1323 states have (on average 1.4958427815570672) internal successors, (1979), 1323 states have internal predecessors, (1979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:53,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:53,972 INFO L93 Difference]: Finished difference Result 1326 states and 1980 transitions. [2022-02-20 18:57:53,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1980 transitions. [2022-02-20 18:57:53,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:53,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:53,976 INFO L74 IsIncluded]: Start isIncluded. First operand has 1324 states, 1323 states have (on average 1.4958427815570672) internal successors, (1979), 1323 states have internal predecessors, (1979), 0 states have call successors, (0), 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 1326 states. [2022-02-20 18:57:53,978 INFO L87 Difference]: Start difference. First operand has 1324 states, 1323 states have (on average 1.4958427815570672) internal successors, (1979), 1323 states have internal predecessors, (1979), 0 states have call successors, (0), 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 1326 states. [2022-02-20 18:57:54,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:54,028 INFO L93 Difference]: Finished difference Result 1326 states and 1980 transitions. [2022-02-20 18:57:54,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1980 transitions. [2022-02-20 18:57:54,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:54,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:54,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:57:54,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:57:54,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 1323 states have (on average 1.4958427815570672) internal successors, (1979), 1323 states have internal predecessors, (1979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:54,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1979 transitions. [2022-02-20 18:57:54,091 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1979 transitions. Word has length 102 [2022-02-20 18:57:54,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:57:54,091 INFO L470 AbstractCegarLoop]: Abstraction has 1324 states and 1979 transitions. [2022-02-20 18:57:54,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:54,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1979 transitions. [2022-02-20 18:57:54,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-02-20 18:57:54,093 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:57:54,093 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:57:54,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:57:54,093 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:57:54,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:57:54,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1935849921, now seen corresponding path program 1 times [2022-02-20 18:57:54,094 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:57:54,094 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133203870] [2022-02-20 18:57:54,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:57:54,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:57:54,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:57:54,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {18785#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(59, 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;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~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_1237~0 := 0;~__return_1383~0 := 0;~__return_1517~0 := 0;~__tmp_1518_0~0 := 0;~__return_1641~0 := 0;~__return_1531~0 := 0; {18785#true} is VALID [2022-02-20 18:57:54,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {18785#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_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__newmax~2#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__newmax~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__newmax~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__newmax~1#1, main_~node2__newmax~1#1, main_~node1__newmax~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#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; {18787#(= (+ (* (- 1) ~ep13~0) |ULTIMATE.start_main_~init__r131~0#1|) 0)} is VALID [2022-02-20 18:57:54,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {18787#(= (+ (* (- 1) ~ep13~0) |ULTIMATE.start_main_~init__r131~0#1|) 0)} assume !!(0 == main_~init__r121~0#1 % 256); {18787#(= (+ (* (- 1) ~ep13~0) |ULTIMATE.start_main_~init__r131~0#1|) 0)} is VALID [2022-02-20 18:57:54,198 INFO L290 TraceCheckUtils]: 3: Hoare triple {18787#(= (+ (* (- 1) ~ep13~0) |ULTIMATE.start_main_~init__r131~0#1|) 0)} assume !(0 == main_~init__r131~0#1 % 256); {18788#(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:57:54,199 INFO L290 TraceCheckUtils]: 4: Hoare triple {18788#(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; {18788#(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:57:54,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {18788#(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); {18788#(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:57:54,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {18788#(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; {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {18789#(<= (+ (* 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); {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {18789#(<= (+ (* 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); {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,211 INFO L290 TraceCheckUtils]: 10: Hoare triple {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {18789#(<= (+ (* 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); {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {18789#(<= (+ (* 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); {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,212 INFO L290 TraceCheckUtils]: 15: Hoare triple {18789#(<= (+ (* 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); {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,212 INFO L290 TraceCheckUtils]: 16: Hoare triple {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~id1~0 != ~id2~0; {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,213 INFO L290 TraceCheckUtils]: 17: Hoare triple {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~id1~0 != ~id3~0; {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,213 INFO L290 TraceCheckUtils]: 18: Hoare triple {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~id2~0 != ~id3~0; {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,213 INFO L290 TraceCheckUtils]: 19: Hoare triple {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~id1~0 >= 0; {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,213 INFO L290 TraceCheckUtils]: 20: Hoare triple {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~id2~0 >= 0; {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,214 INFO L290 TraceCheckUtils]: 21: Hoare triple {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~id3~0 >= 0; {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~r1~0; {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,214 INFO L290 TraceCheckUtils]: 23: Hoare triple {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~r2~0; {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,214 INFO L290 TraceCheckUtils]: 24: Hoare triple {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~r3~0; {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,215 INFO L290 TraceCheckUtils]: 25: Hoare triple {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r122~0#1 % 256); {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,215 INFO L290 TraceCheckUtils]: 26: Hoare triple {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r132~0#1 % 256); {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,216 INFO L290 TraceCheckUtils]: 27: Hoare triple {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r212~0#1 % 256); {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,216 INFO L290 TraceCheckUtils]: 28: Hoare triple {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r232~0#1 % 256); {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,216 INFO L290 TraceCheckUtils]: 29: Hoare triple {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r312~0#1 % 256); {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,217 INFO L290 TraceCheckUtils]: 30: Hoare triple {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r322~0#1 % 256); {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,217 INFO L290 TraceCheckUtils]: 31: Hoare triple {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~max1~0 == ~id1~0; {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,218 INFO L290 TraceCheckUtils]: 32: Hoare triple {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~max2~0 == ~id2~0; {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,218 INFO L290 TraceCheckUtils]: 33: Hoare triple {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~max3~0 == ~id3~0; {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,218 INFO L290 TraceCheckUtils]: 34: Hoare triple {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~st1~0; {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,218 INFO L290 TraceCheckUtils]: 35: Hoare triple {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~st2~0; {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,219 INFO L290 TraceCheckUtils]: 36: Hoare triple {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~st3~0; {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,219 INFO L290 TraceCheckUtils]: 37: Hoare triple {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~nl1~0; {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,219 INFO L290 TraceCheckUtils]: 38: Hoare triple {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~nl2~0; {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,220 INFO L290 TraceCheckUtils]: 39: Hoare triple {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~nl3~0; {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,220 INFO L290 TraceCheckUtils]: 40: Hoare triple {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~mode1~0 % 256; {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,220 INFO L290 TraceCheckUtils]: 41: Hoare triple {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~mode2~0 % 256; {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,220 INFO L290 TraceCheckUtils]: 42: Hoare triple {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~mode3~0 % 256; {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,221 INFO L290 TraceCheckUtils]: 43: Hoare triple {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == ~newmax1~0 % 256); {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,221 INFO L290 TraceCheckUtils]: 44: Hoare triple {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == ~newmax2~0 % 256); {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,221 INFO L290 TraceCheckUtils]: 45: Hoare triple {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1237~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1237~0; {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,221 INFO L290 TraceCheckUtils]: 46: Hoare triple {18789#(<= (+ (* 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; {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,222 INFO L290 TraceCheckUtils]: 47: Hoare triple {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,222 INFO L290 TraceCheckUtils]: 48: Hoare triple {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !!(0 == ~mode1~0 % 256); {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,222 INFO L290 TraceCheckUtils]: 49: Hoare triple {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~r1~0 < 2; {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,222 INFO L290 TraceCheckUtils]: 50: Hoare triple {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !!(0 == ~ep12~0 % 256); {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:57:54,223 INFO L290 TraceCheckUtils]: 51: Hoare triple {18789#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !!(0 == ~ep13~0 % 256); {18786#false} is VALID [2022-02-20 18:57:54,223 INFO L290 TraceCheckUtils]: 52: Hoare triple {18786#false} ~mode1~0 := 1;havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {18786#false} is VALID [2022-02-20 18:57:54,223 INFO L290 TraceCheckUtils]: 53: Hoare triple {18786#false} assume !!(0 == ~mode2~0 % 256); {18786#false} is VALID [2022-02-20 18:57:54,223 INFO L290 TraceCheckUtils]: 54: Hoare triple {18786#false} assume ~r2~0 < 2; {18786#false} is VALID [2022-02-20 18:57:54,223 INFO L290 TraceCheckUtils]: 55: Hoare triple {18786#false} assume !!(0 == ~ep21~0 % 256); {18786#false} is VALID [2022-02-20 18:57:54,223 INFO L290 TraceCheckUtils]: 56: Hoare triple {18786#false} assume !!(0 == ~ep23~0 % 256); {18786#false} is VALID [2022-02-20 18:57:54,224 INFO L290 TraceCheckUtils]: 57: Hoare triple {18786#false} ~mode2~0 := 1;havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {18786#false} is VALID [2022-02-20 18:57:54,224 INFO L290 TraceCheckUtils]: 58: Hoare triple {18786#false} assume !!(0 == ~mode3~0 % 256); {18786#false} is VALID [2022-02-20 18:57:54,224 INFO L290 TraceCheckUtils]: 59: Hoare triple {18786#false} assume ~r3~0 < 2; {18786#false} is VALID [2022-02-20 18:57:54,224 INFO L290 TraceCheckUtils]: 60: Hoare triple {18786#false} assume !!(0 == ~ep31~0 % 256); {18786#false} is VALID [2022-02-20 18:57:54,224 INFO L290 TraceCheckUtils]: 61: Hoare triple {18786#false} assume !!(0 == ~ep32~0 % 256); {18786#false} is VALID [2022-02-20 18:57:54,224 INFO L290 TraceCheckUtils]: 62: Hoare triple {18786#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; {18786#false} is VALID [2022-02-20 18:57:54,224 INFO L290 TraceCheckUtils]: 63: Hoare triple {18786#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {18786#false} is VALID [2022-02-20 18:57:54,224 INFO L290 TraceCheckUtils]: 64: Hoare triple {18786#false} assume ~st1~0 + ~nl1~0 <= 1; {18786#false} is VALID [2022-02-20 18:57:54,225 INFO L290 TraceCheckUtils]: 65: Hoare triple {18786#false} assume ~st2~0 + ~nl2~0 <= 1; {18786#false} is VALID [2022-02-20 18:57:54,225 INFO L290 TraceCheckUtils]: 66: Hoare triple {18786#false} assume ~st3~0 + ~nl3~0 <= 1; {18786#false} is VALID [2022-02-20 18:57:54,225 INFO L290 TraceCheckUtils]: 67: Hoare triple {18786#false} assume !(~r1~0 >= 2); {18786#false} is VALID [2022-02-20 18:57:54,225 INFO L290 TraceCheckUtils]: 68: Hoare triple {18786#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {18786#false} is VALID [2022-02-20 18:57:54,225 INFO L290 TraceCheckUtils]: 69: Hoare triple {18786#false} assume ~r1~0 < 2; {18786#false} is VALID [2022-02-20 18:57:54,225 INFO L290 TraceCheckUtils]: 70: Hoare triple {18786#false} assume !(~r1~0 >= 2); {18786#false} is VALID [2022-02-20 18:57:54,225 INFO L290 TraceCheckUtils]: 71: Hoare triple {18786#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {18786#false} is VALID [2022-02-20 18:57:54,225 INFO L290 TraceCheckUtils]: 72: Hoare triple {18786#false} assume ~r1~0 < 2;main_~check__tmp~0#1 := 1;~__return_1383~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1383~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; {18786#false} is VALID [2022-02-20 18:57:54,226 INFO L290 TraceCheckUtils]: 73: Hoare triple {18786#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {18786#false} is VALID [2022-02-20 18:57:54,226 INFO L290 TraceCheckUtils]: 74: Hoare triple {18786#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~1#1;main_~node1__newmax~1#1 := 0; {18786#false} is VALID [2022-02-20 18:57:54,226 INFO L290 TraceCheckUtils]: 75: Hoare triple {18786#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); {18786#false} is VALID [2022-02-20 18:57:54,226 INFO L290 TraceCheckUtils]: 76: Hoare triple {18786#false} assume !!(0 == ~ep21~0 % 256); {18786#false} is VALID [2022-02-20 18:57:54,226 INFO L290 TraceCheckUtils]: 77: Hoare triple {18786#false} assume !!(0 == ~ep31~0 % 256); {18786#false} is VALID [2022-02-20 18:57:54,226 INFO L290 TraceCheckUtils]: 78: Hoare triple {18786#false} ~newmax1~0 := main_~node1__newmax~1#1; {18786#false} is VALID [2022-02-20 18:57:54,226 INFO L290 TraceCheckUtils]: 79: Hoare triple {18786#false} assume 1 == ~r1~0; {18786#false} is VALID [2022-02-20 18:57:54,226 INFO L290 TraceCheckUtils]: 80: Hoare triple {18786#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {18786#false} is VALID [2022-02-20 18:57:54,227 INFO L290 TraceCheckUtils]: 81: Hoare triple {18786#false} ~mode1~0 := 0;havoc main_~node2__newmax~1#1;main_~node2__newmax~1#1 := 0; {18786#false} is VALID [2022-02-20 18:57:54,227 INFO L290 TraceCheckUtils]: 82: Hoare triple {18786#false} assume !(0 == ~mode2~0 % 256);~r2~0 := (if (1 + ~r2~0) % 256 <= 127 then (1 + ~r2~0) % 256 else (1 + ~r2~0) % 256 - 256); {18786#false} is VALID [2022-02-20 18:57:54,227 INFO L290 TraceCheckUtils]: 83: Hoare triple {18786#false} assume !!(0 == ~ep12~0 % 256); {18786#false} is VALID [2022-02-20 18:57:54,227 INFO L290 TraceCheckUtils]: 84: Hoare triple {18786#false} assume !!(0 == ~ep32~0 % 256); {18786#false} is VALID [2022-02-20 18:57:54,227 INFO L290 TraceCheckUtils]: 85: Hoare triple {18786#false} ~newmax2~0 := main_~node2__newmax~1#1; {18786#false} is VALID [2022-02-20 18:57:54,227 INFO L290 TraceCheckUtils]: 86: Hoare triple {18786#false} assume !(2 == ~r2~0);~mode2~0 := 0;havoc main_~node3__newmax~1#1;main_~node3__newmax~1#1 := 0; {18786#false} is VALID [2022-02-20 18:57:54,227 INFO L290 TraceCheckUtils]: 87: Hoare triple {18786#false} assume !(0 == ~mode3~0 % 256);~r3~0 := (if (1 + ~r3~0) % 256 <= 127 then (1 + ~r3~0) % 256 else (1 + ~r3~0) % 256 - 256); {18786#false} is VALID [2022-02-20 18:57:54,227 INFO L290 TraceCheckUtils]: 88: Hoare triple {18786#false} assume !!(0 == ~ep13~0 % 256); {18786#false} is VALID [2022-02-20 18:57:54,228 INFO L290 TraceCheckUtils]: 89: Hoare triple {18786#false} assume !!(0 == ~ep23~0 % 256); {18786#false} is VALID [2022-02-20 18:57:54,228 INFO L290 TraceCheckUtils]: 90: Hoare triple {18786#false} ~newmax3~0 := main_~node3__newmax~1#1; {18786#false} is VALID [2022-02-20 18:57:54,228 INFO L290 TraceCheckUtils]: 91: Hoare triple {18786#false} assume !(2 == ~r3~0);~mode3~0 := 0;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {18786#false} is VALID [2022-02-20 18:57:54,228 INFO L290 TraceCheckUtils]: 92: Hoare triple {18786#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {18786#false} is VALID [2022-02-20 18:57:54,228 INFO L290 TraceCheckUtils]: 93: Hoare triple {18786#false} assume ~st1~0 + ~nl1~0 <= 1; {18786#false} is VALID [2022-02-20 18:57:54,228 INFO L290 TraceCheckUtils]: 94: Hoare triple {18786#false} assume ~st2~0 + ~nl2~0 <= 1; {18786#false} is VALID [2022-02-20 18:57:54,228 INFO L290 TraceCheckUtils]: 95: Hoare triple {18786#false} assume ~st3~0 + ~nl3~0 <= 1; {18786#false} is VALID [2022-02-20 18:57:54,228 INFO L290 TraceCheckUtils]: 96: Hoare triple {18786#false} assume !(~r1~0 >= 2); {18786#false} is VALID [2022-02-20 18:57:54,229 INFO L290 TraceCheckUtils]: 97: Hoare triple {18786#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {18786#false} is VALID [2022-02-20 18:57:54,229 INFO L290 TraceCheckUtils]: 98: Hoare triple {18786#false} ~__return_1517~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1517~0;~__tmp_1518_0~0 := main_~main____CPAchecker_TMP_0~0#1; {18786#false} is VALID [2022-02-20 18:57:54,229 INFO L290 TraceCheckUtils]: 99: Hoare triple {18786#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1518_0~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {18786#false} is VALID [2022-02-20 18:57:54,229 INFO L290 TraceCheckUtils]: 100: Hoare triple {18786#false} assume 0 == main_~assert__arg~1#1 % 256; {18786#false} is VALID [2022-02-20 18:57:54,229 INFO L290 TraceCheckUtils]: 101: Hoare triple {18786#false} assume !false; {18786#false} is VALID [2022-02-20 18:57:54,229 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:57:54,230 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:57:54,230 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133203870] [2022-02-20 18:57:54,230 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133203870] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:57:54,230 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:57:54,230 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:57:54,230 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990514748] [2022-02-20 18:57:54,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:57:54,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2022-02-20 18:57:54,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:57:54,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:54,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:54,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:57:54,288 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:57:54,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:57:54,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:57:54,289 INFO L87 Difference]: Start difference. First operand 1324 states and 1979 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:55,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:55,941 INFO L93 Difference]: Finished difference Result 3685 states and 5516 transitions. [2022-02-20 18:57:55,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:57:55,941 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2022-02-20 18:57:55,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:57:55,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:55,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1019 transitions. [2022-02-20 18:57:55,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:55,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1019 transitions. [2022-02-20 18:57:55,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 1019 transitions. [2022-02-20 18:57:56,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1019 edges. 1019 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:56,801 INFO L225 Difference]: With dead ends: 3685 [2022-02-20 18:57:56,801 INFO L226 Difference]: Without dead ends: 2375 [2022-02-20 18:57:56,802 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:57:56,806 INFO L933 BasicCegarLoop]: 579 mSDtfsCounter, 946 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 946 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:57:56,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [946 Valid, 895 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:57:56,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2375 states. [2022-02-20 18:57:57,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2375 to 2373. [2022-02-20 18:57:57,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:57:57,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2375 states. Second operand has 2373 states, 2372 states have (on average 1.4852445193929174) internal successors, (3523), 2372 states have internal predecessors, (3523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:57,253 INFO L74 IsIncluded]: Start isIncluded. First operand 2375 states. Second operand has 2373 states, 2372 states have (on average 1.4852445193929174) internal successors, (3523), 2372 states have internal predecessors, (3523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:57,256 INFO L87 Difference]: Start difference. First operand 2375 states. Second operand has 2373 states, 2372 states have (on average 1.4852445193929174) internal successors, (3523), 2372 states have internal predecessors, (3523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:57,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:57,399 INFO L93 Difference]: Finished difference Result 2375 states and 3524 transitions. [2022-02-20 18:57:57,399 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 3524 transitions. [2022-02-20 18:57:57,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:57,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:57,406 INFO L74 IsIncluded]: Start isIncluded. First operand has 2373 states, 2372 states have (on average 1.4852445193929174) internal successors, (3523), 2372 states have internal predecessors, (3523), 0 states have call successors, (0), 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 2375 states. [2022-02-20 18:57:57,408 INFO L87 Difference]: Start difference. First operand has 2373 states, 2372 states have (on average 1.4852445193929174) internal successors, (3523), 2372 states have internal predecessors, (3523), 0 states have call successors, (0), 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 2375 states. [2022-02-20 18:57:57,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:57,551 INFO L93 Difference]: Finished difference Result 2375 states and 3524 transitions. [2022-02-20 18:57:57,551 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 3524 transitions. [2022-02-20 18:57:57,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:57,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:57,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:57:57,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:57:57,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2373 states, 2372 states have (on average 1.4852445193929174) internal successors, (3523), 2372 states have internal predecessors, (3523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:57,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2373 states to 2373 states and 3523 transitions. [2022-02-20 18:57:57,760 INFO L78 Accepts]: Start accepts. Automaton has 2373 states and 3523 transitions. Word has length 102 [2022-02-20 18:57:57,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:57:57,760 INFO L470 AbstractCegarLoop]: Abstraction has 2373 states and 3523 transitions. [2022-02-20 18:57:57,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:57,761 INFO L276 IsEmpty]: Start isEmpty. Operand 2373 states and 3523 transitions. [2022-02-20 18:57:57,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-02-20 18:57:57,762 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:57:57,762 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:57:57,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:57:57,763 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:57:57,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:57:57,763 INFO L85 PathProgramCache]: Analyzing trace with hash -24067963, now seen corresponding path program 1 times [2022-02-20 18:57:57,763 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:57:57,764 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924733069] [2022-02-20 18:57:57,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:57:57,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:57:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:57:57,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {31544#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(59, 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;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~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_1237~0 := 0;~__return_1383~0 := 0;~__return_1517~0 := 0;~__tmp_1518_0~0 := 0;~__return_1641~0 := 0;~__return_1531~0 := 0; {31544#true} is VALID [2022-02-20 18:57:57,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {31544#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_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__newmax~2#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__newmax~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__newmax~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__newmax~1#1, main_~node2__newmax~1#1, main_~node1__newmax~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#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; {31546#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:57:57,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {31546#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} assume !!(0 == main_~init__r121~0#1 % 256); {31546#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:57:57,836 INFO L290 TraceCheckUtils]: 3: Hoare triple {31546#(= (+ |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; {31546#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:57:57,837 INFO L290 TraceCheckUtils]: 4: Hoare triple {31546#(= (+ |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); {31546#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:57:57,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {31546#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} assume !!(0 == main_~init__r131~0#1 % 256); {31546#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:57:57,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {31546#(= (+ |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; {31546#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:57:57,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {31546#(= (+ |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); {31546#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:57:57,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {31546#(= (+ |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; {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {31547#(<= (+ (* 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); {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,841 INFO L290 TraceCheckUtils]: 10: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,841 INFO L290 TraceCheckUtils]: 11: Hoare triple {31547#(<= (+ (* 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); {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {31547#(<= (+ (* 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); {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {31547#(<= (+ (* 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); {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id1~0 != ~id2~0; {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,844 INFO L290 TraceCheckUtils]: 17: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id1~0 != ~id3~0; {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,844 INFO L290 TraceCheckUtils]: 18: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id2~0 != ~id3~0; {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,844 INFO L290 TraceCheckUtils]: 19: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id1~0 >= 0; {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,845 INFO L290 TraceCheckUtils]: 20: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id2~0 >= 0; {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,845 INFO L290 TraceCheckUtils]: 21: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id3~0 >= 0; {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,845 INFO L290 TraceCheckUtils]: 22: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~r1~0; {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,846 INFO L290 TraceCheckUtils]: 23: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~r2~0; {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,846 INFO L290 TraceCheckUtils]: 24: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~r3~0; {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,846 INFO L290 TraceCheckUtils]: 25: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r122~0#1 % 256); {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,847 INFO L290 TraceCheckUtils]: 26: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r132~0#1 % 256); {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,847 INFO L290 TraceCheckUtils]: 27: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r212~0#1 % 256); {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,847 INFO L290 TraceCheckUtils]: 28: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r232~0#1 % 256); {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,848 INFO L290 TraceCheckUtils]: 29: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r312~0#1 % 256); {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,848 INFO L290 TraceCheckUtils]: 30: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r322~0#1 % 256); {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,848 INFO L290 TraceCheckUtils]: 31: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~max1~0 == ~id1~0; {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,849 INFO L290 TraceCheckUtils]: 32: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~max2~0 == ~id2~0; {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,849 INFO L290 TraceCheckUtils]: 33: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~max3~0 == ~id3~0; {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,849 INFO L290 TraceCheckUtils]: 34: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~st1~0; {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,850 INFO L290 TraceCheckUtils]: 35: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~st2~0; {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,850 INFO L290 TraceCheckUtils]: 36: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~st3~0; {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,850 INFO L290 TraceCheckUtils]: 37: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~nl1~0; {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,851 INFO L290 TraceCheckUtils]: 38: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~nl2~0; {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,851 INFO L290 TraceCheckUtils]: 39: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~nl3~0; {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,851 INFO L290 TraceCheckUtils]: 40: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~mode1~0 % 256; {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,852 INFO L290 TraceCheckUtils]: 41: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~mode2~0 % 256; {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,852 INFO L290 TraceCheckUtils]: 42: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~mode3~0 % 256; {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,852 INFO L290 TraceCheckUtils]: 43: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == ~newmax1~0 % 256); {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,853 INFO L290 TraceCheckUtils]: 44: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == ~newmax2~0 % 256); {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,853 INFO L290 TraceCheckUtils]: 45: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1237~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1237~0; {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,853 INFO L290 TraceCheckUtils]: 46: Hoare triple {31547#(<= (+ (* 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; {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,854 INFO L290 TraceCheckUtils]: 47: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,854 INFO L290 TraceCheckUtils]: 48: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !!(0 == ~mode1~0 % 256); {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,854 INFO L290 TraceCheckUtils]: 49: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~r1~0 < 2; {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,855 INFO L290 TraceCheckUtils]: 50: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !!(0 == ~ep12~0 % 256); {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,855 INFO L290 TraceCheckUtils]: 51: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !!(0 == ~ep13~0 % 256); {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,855 INFO L290 TraceCheckUtils]: 52: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} ~mode1~0 := 1;havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,856 INFO L290 TraceCheckUtils]: 53: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !!(0 == ~mode2~0 % 256); {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,856 INFO L290 TraceCheckUtils]: 54: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~r2~0 < 2; {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:57:57,856 INFO L290 TraceCheckUtils]: 55: Hoare triple {31547#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !!(0 == ~ep21~0 % 256); {31545#false} is VALID [2022-02-20 18:57:57,857 INFO L290 TraceCheckUtils]: 56: Hoare triple {31545#false} assume !!(0 == ~ep23~0 % 256); {31545#false} is VALID [2022-02-20 18:57:57,857 INFO L290 TraceCheckUtils]: 57: Hoare triple {31545#false} ~mode2~0 := 1;havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {31545#false} is VALID [2022-02-20 18:57:57,857 INFO L290 TraceCheckUtils]: 58: Hoare triple {31545#false} assume !!(0 == ~mode3~0 % 256); {31545#false} is VALID [2022-02-20 18:57:57,857 INFO L290 TraceCheckUtils]: 59: Hoare triple {31545#false} assume ~r3~0 < 2; {31545#false} is VALID [2022-02-20 18:57:57,857 INFO L290 TraceCheckUtils]: 60: Hoare triple {31545#false} assume !!(0 == ~ep31~0 % 256); {31545#false} is VALID [2022-02-20 18:57:57,857 INFO L290 TraceCheckUtils]: 61: Hoare triple {31545#false} assume !!(0 == ~ep32~0 % 256); {31545#false} is VALID [2022-02-20 18:57:57,857 INFO L290 TraceCheckUtils]: 62: Hoare triple {31545#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; {31545#false} is VALID [2022-02-20 18:57:57,857 INFO L290 TraceCheckUtils]: 63: Hoare triple {31545#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {31545#false} is VALID [2022-02-20 18:57:57,857 INFO L290 TraceCheckUtils]: 64: Hoare triple {31545#false} assume ~st1~0 + ~nl1~0 <= 1; {31545#false} is VALID [2022-02-20 18:57:57,858 INFO L290 TraceCheckUtils]: 65: Hoare triple {31545#false} assume ~st2~0 + ~nl2~0 <= 1; {31545#false} is VALID [2022-02-20 18:57:57,858 INFO L290 TraceCheckUtils]: 66: Hoare triple {31545#false} assume ~st3~0 + ~nl3~0 <= 1; {31545#false} is VALID [2022-02-20 18:57:57,858 INFO L290 TraceCheckUtils]: 67: Hoare triple {31545#false} assume !(~r1~0 >= 2); {31545#false} is VALID [2022-02-20 18:57:57,858 INFO L290 TraceCheckUtils]: 68: Hoare triple {31545#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {31545#false} is VALID [2022-02-20 18:57:57,858 INFO L290 TraceCheckUtils]: 69: Hoare triple {31545#false} assume ~r1~0 < 2; {31545#false} is VALID [2022-02-20 18:57:57,858 INFO L290 TraceCheckUtils]: 70: Hoare triple {31545#false} assume !(~r1~0 >= 2); {31545#false} is VALID [2022-02-20 18:57:57,858 INFO L290 TraceCheckUtils]: 71: Hoare triple {31545#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {31545#false} is VALID [2022-02-20 18:57:57,858 INFO L290 TraceCheckUtils]: 72: Hoare triple {31545#false} assume ~r1~0 < 2;main_~check__tmp~0#1 := 1;~__return_1383~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1383~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; {31545#false} is VALID [2022-02-20 18:57:57,858 INFO L290 TraceCheckUtils]: 73: Hoare triple {31545#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {31545#false} is VALID [2022-02-20 18:57:57,859 INFO L290 TraceCheckUtils]: 74: Hoare triple {31545#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~1#1;main_~node1__newmax~1#1 := 0; {31545#false} is VALID [2022-02-20 18:57:57,859 INFO L290 TraceCheckUtils]: 75: Hoare triple {31545#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); {31545#false} is VALID [2022-02-20 18:57:57,859 INFO L290 TraceCheckUtils]: 76: Hoare triple {31545#false} assume !!(0 == ~ep21~0 % 256); {31545#false} is VALID [2022-02-20 18:57:57,859 INFO L290 TraceCheckUtils]: 77: Hoare triple {31545#false} assume !!(0 == ~ep31~0 % 256); {31545#false} is VALID [2022-02-20 18:57:57,859 INFO L290 TraceCheckUtils]: 78: Hoare triple {31545#false} ~newmax1~0 := main_~node1__newmax~1#1; {31545#false} is VALID [2022-02-20 18:57:57,859 INFO L290 TraceCheckUtils]: 79: Hoare triple {31545#false} assume 1 == ~r1~0; {31545#false} is VALID [2022-02-20 18:57:57,859 INFO L290 TraceCheckUtils]: 80: Hoare triple {31545#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {31545#false} is VALID [2022-02-20 18:57:57,859 INFO L290 TraceCheckUtils]: 81: Hoare triple {31545#false} ~mode1~0 := 0;havoc main_~node2__newmax~1#1;main_~node2__newmax~1#1 := 0; {31545#false} is VALID [2022-02-20 18:57:57,860 INFO L290 TraceCheckUtils]: 82: Hoare triple {31545#false} assume !(0 == ~mode2~0 % 256);~r2~0 := (if (1 + ~r2~0) % 256 <= 127 then (1 + ~r2~0) % 256 else (1 + ~r2~0) % 256 - 256); {31545#false} is VALID [2022-02-20 18:57:57,860 INFO L290 TraceCheckUtils]: 83: Hoare triple {31545#false} assume !!(0 == ~ep12~0 % 256); {31545#false} is VALID [2022-02-20 18:57:57,860 INFO L290 TraceCheckUtils]: 84: Hoare triple {31545#false} assume !!(0 == ~ep32~0 % 256); {31545#false} is VALID [2022-02-20 18:57:57,860 INFO L290 TraceCheckUtils]: 85: Hoare triple {31545#false} ~newmax2~0 := main_~node2__newmax~1#1; {31545#false} is VALID [2022-02-20 18:57:57,860 INFO L290 TraceCheckUtils]: 86: Hoare triple {31545#false} assume !(2 == ~r2~0);~mode2~0 := 0;havoc main_~node3__newmax~1#1;main_~node3__newmax~1#1 := 0; {31545#false} is VALID [2022-02-20 18:57:57,860 INFO L290 TraceCheckUtils]: 87: Hoare triple {31545#false} assume !(0 == ~mode3~0 % 256);~r3~0 := (if (1 + ~r3~0) % 256 <= 127 then (1 + ~r3~0) % 256 else (1 + ~r3~0) % 256 - 256); {31545#false} is VALID [2022-02-20 18:57:57,860 INFO L290 TraceCheckUtils]: 88: Hoare triple {31545#false} assume !!(0 == ~ep13~0 % 256); {31545#false} is VALID [2022-02-20 18:57:57,860 INFO L290 TraceCheckUtils]: 89: Hoare triple {31545#false} assume !!(0 == ~ep23~0 % 256); {31545#false} is VALID [2022-02-20 18:57:57,861 INFO L290 TraceCheckUtils]: 90: Hoare triple {31545#false} ~newmax3~0 := main_~node3__newmax~1#1; {31545#false} is VALID [2022-02-20 18:57:57,861 INFO L290 TraceCheckUtils]: 91: Hoare triple {31545#false} assume !(2 == ~r3~0);~mode3~0 := 0;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {31545#false} is VALID [2022-02-20 18:57:57,861 INFO L290 TraceCheckUtils]: 92: Hoare triple {31545#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {31545#false} is VALID [2022-02-20 18:57:57,861 INFO L290 TraceCheckUtils]: 93: Hoare triple {31545#false} assume ~st1~0 + ~nl1~0 <= 1; {31545#false} is VALID [2022-02-20 18:57:57,861 INFO L290 TraceCheckUtils]: 94: Hoare triple {31545#false} assume ~st2~0 + ~nl2~0 <= 1; {31545#false} is VALID [2022-02-20 18:57:57,861 INFO L290 TraceCheckUtils]: 95: Hoare triple {31545#false} assume ~st3~0 + ~nl3~0 <= 1; {31545#false} is VALID [2022-02-20 18:57:57,861 INFO L290 TraceCheckUtils]: 96: Hoare triple {31545#false} assume !(~r1~0 >= 2); {31545#false} is VALID [2022-02-20 18:57:57,861 INFO L290 TraceCheckUtils]: 97: Hoare triple {31545#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {31545#false} is VALID [2022-02-20 18:57:57,861 INFO L290 TraceCheckUtils]: 98: Hoare triple {31545#false} ~__return_1517~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1517~0;~__tmp_1518_0~0 := main_~main____CPAchecker_TMP_0~0#1; {31545#false} is VALID [2022-02-20 18:57:57,862 INFO L290 TraceCheckUtils]: 99: Hoare triple {31545#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1518_0~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {31545#false} is VALID [2022-02-20 18:57:57,862 INFO L290 TraceCheckUtils]: 100: Hoare triple {31545#false} assume 0 == main_~assert__arg~1#1 % 256; {31545#false} is VALID [2022-02-20 18:57:57,862 INFO L290 TraceCheckUtils]: 101: Hoare triple {31545#false} assume !false; {31545#false} is VALID [2022-02-20 18:57:57,862 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:57:57,862 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:57:57,862 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924733069] [2022-02-20 18:57:57,863 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924733069] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:57:57,863 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:57:57,863 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:57:57,863 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626556988] [2022-02-20 18:57:57,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:57:57,863 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2022-02-20 18:57:57,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:57:57,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:57,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:57,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:57:57,927 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:57:57,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:57:57,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:57:57,928 INFO L87 Difference]: Start difference. First operand 2373 states and 3523 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:01,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:01,513 INFO L93 Difference]: Finished difference Result 6872 states and 10160 transitions. [2022-02-20 18:58:01,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:58:01,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2022-02-20 18:58:01,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:01,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:01,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 989 transitions. [2022-02-20 18:58:01,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:01,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 989 transitions. [2022-02-20 18:58:01,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 989 transitions. [2022-02-20 18:58:02,110 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:58:02,922 INFO L225 Difference]: With dead ends: 6872 [2022-02-20 18:58:02,922 INFO L226 Difference]: Without dead ends: 4555 [2022-02-20 18:58:02,925 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:58:02,926 INFO L933 BasicCegarLoop]: 564 mSDtfsCounter, 700 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 880 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:58:02,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [700 Valid, 880 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:58:02,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4555 states. [2022-02-20 18:58:04,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4555 to 4553. [2022-02-20 18:58:04,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:04,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4555 states. Second operand has 4553 states, 4552 states have (on average 1.4650702987697715) internal successors, (6669), 4552 states have internal predecessors, (6669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:04,136 INFO L74 IsIncluded]: Start isIncluded. First operand 4555 states. Second operand has 4553 states, 4552 states have (on average 1.4650702987697715) internal successors, (6669), 4552 states have internal predecessors, (6669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:04,139 INFO L87 Difference]: Start difference. First operand 4555 states. Second operand has 4553 states, 4552 states have (on average 1.4650702987697715) internal successors, (6669), 4552 states have internal predecessors, (6669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:04,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:04,672 INFO L93 Difference]: Finished difference Result 4555 states and 6670 transitions. [2022-02-20 18:58:04,672 INFO L276 IsEmpty]: Start isEmpty. Operand 4555 states and 6670 transitions. [2022-02-20 18:58:04,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:04,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:04,682 INFO L74 IsIncluded]: Start isIncluded. First operand has 4553 states, 4552 states have (on average 1.4650702987697715) internal successors, (6669), 4552 states have internal predecessors, (6669), 0 states have call successors, (0), 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 4555 states. [2022-02-20 18:58:04,686 INFO L87 Difference]: Start difference. First operand has 4553 states, 4552 states have (on average 1.4650702987697715) internal successors, (6669), 4552 states have internal predecessors, (6669), 0 states have call successors, (0), 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 4555 states. [2022-02-20 18:58:05,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:05,217 INFO L93 Difference]: Finished difference Result 4555 states and 6670 transitions. [2022-02-20 18:58:05,217 INFO L276 IsEmpty]: Start isEmpty. Operand 4555 states and 6670 transitions. [2022-02-20 18:58:05,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:05,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:05,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:05,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:05,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4553 states, 4552 states have (on average 1.4650702987697715) internal successors, (6669), 4552 states have internal predecessors, (6669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:05,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4553 states to 4553 states and 6669 transitions. [2022-02-20 18:58:05,957 INFO L78 Accepts]: Start accepts. Automaton has 4553 states and 6669 transitions. Word has length 102 [2022-02-20 18:58:05,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:05,958 INFO L470 AbstractCegarLoop]: Abstraction has 4553 states and 6669 transitions. [2022-02-20 18:58:05,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:05,958 INFO L276 IsEmpty]: Start isEmpty. Operand 4553 states and 6669 transitions. [2022-02-20 18:58:05,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-02-20 18:58:05,960 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:05,960 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:58:05,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:58:05,961 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:05,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:05,961 INFO L85 PathProgramCache]: Analyzing trace with hash 535900793, now seen corresponding path program 1 times [2022-02-20 18:58:05,961 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:05,961 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007024152] [2022-02-20 18:58:05,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:05,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:05,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {55781#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(59, 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;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~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_1237~0 := 0;~__return_1383~0 := 0;~__return_1517~0 := 0;~__tmp_1518_0~0 := 0;~__return_1641~0 := 0;~__return_1531~0 := 0; {55781#true} is VALID [2022-02-20 18:58:05,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {55781#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_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__newmax~2#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__newmax~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__newmax~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__newmax~1#1, main_~node2__newmax~1#1, main_~node1__newmax~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#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; {55781#true} is VALID [2022-02-20 18:58:05,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {55781#true} assume !!(0 == main_~init__r121~0#1 % 256); {55781#true} is VALID [2022-02-20 18:58:05,996 INFO L290 TraceCheckUtils]: 3: Hoare triple {55781#true} assume !!(0 == main_~init__r131~0#1 % 256);main_~init__tmp~0#1 := 0; {55781#true} is VALID [2022-02-20 18:58:05,996 INFO L290 TraceCheckUtils]: 4: Hoare triple {55781#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {55781#true} is VALID [2022-02-20 18:58:05,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {55781#true} assume !!(0 == main_~init__r131~0#1 % 256); {55781#true} is VALID [2022-02-20 18:58:05,997 INFO L290 TraceCheckUtils]: 6: Hoare triple {55781#true} assume !!(0 == main_~init__r121~0#1 % 256);main_~init__tmp___0~0#1 := 0; {55781#true} is VALID [2022-02-20 18:58:05,997 INFO L290 TraceCheckUtils]: 7: Hoare triple {55781#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {55781#true} is VALID [2022-02-20 18:58:05,997 INFO L290 TraceCheckUtils]: 8: Hoare triple {55781#true} assume !!(0 == main_~init__r211~0#1 % 256); {55781#true} is VALID [2022-02-20 18:58:05,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {55781#true} assume !!(0 == main_~init__r231~0#1 % 256);main_~init__tmp___1~0#1 := 0; {55783#(= (+ |ULTIMATE.start_main_~init__r231~0#1| (* (- 256) (div |ULTIMATE.start_main_~init__r231~0#1| 256))) 0)} is VALID [2022-02-20 18:58:05,998 INFO L290 TraceCheckUtils]: 10: Hoare triple {55783#(= (+ |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); {55783#(= (+ |ULTIMATE.start_main_~init__r231~0#1| (* (- 256) (div |ULTIMATE.start_main_~init__r231~0#1| 256))) 0)} is VALID [2022-02-20 18:58:05,998 INFO L290 TraceCheckUtils]: 11: Hoare triple {55783#(= (+ |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; {55782#false} is VALID [2022-02-20 18:58:05,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {55782#false} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {55782#false} is VALID [2022-02-20 18:58:05,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {55782#false} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {55782#false} is VALID [2022-02-20 18:58:05,998 INFO L290 TraceCheckUtils]: 14: Hoare triple {55782#false} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {55782#false} is VALID [2022-02-20 18:58:05,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {55782#false} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {55782#false} is VALID [2022-02-20 18:58:05,999 INFO L290 TraceCheckUtils]: 16: Hoare triple {55782#false} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {55782#false} is VALID [2022-02-20 18:58:05,999 INFO L290 TraceCheckUtils]: 17: Hoare triple {55782#false} assume ~id1~0 != ~id2~0; {55782#false} is VALID [2022-02-20 18:58:05,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {55782#false} assume ~id1~0 != ~id3~0; {55782#false} is VALID [2022-02-20 18:58:05,999 INFO L290 TraceCheckUtils]: 19: Hoare triple {55782#false} assume ~id2~0 != ~id3~0; {55782#false} is VALID [2022-02-20 18:58:05,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {55782#false} assume ~id1~0 >= 0; {55782#false} is VALID [2022-02-20 18:58:05,999 INFO L290 TraceCheckUtils]: 21: Hoare triple {55782#false} assume ~id2~0 >= 0; {55782#false} is VALID [2022-02-20 18:58:05,999 INFO L290 TraceCheckUtils]: 22: Hoare triple {55782#false} assume ~id3~0 >= 0; {55782#false} is VALID [2022-02-20 18:58:05,999 INFO L290 TraceCheckUtils]: 23: Hoare triple {55782#false} assume 0 == ~r1~0; {55782#false} is VALID [2022-02-20 18:58:05,999 INFO L290 TraceCheckUtils]: 24: Hoare triple {55782#false} assume 0 == ~r2~0; {55782#false} is VALID [2022-02-20 18:58:06,000 INFO L290 TraceCheckUtils]: 25: Hoare triple {55782#false} assume 0 == ~r3~0; {55782#false} is VALID [2022-02-20 18:58:06,000 INFO L290 TraceCheckUtils]: 26: Hoare triple {55782#false} assume !(0 == main_~init__r122~0#1 % 256); {55782#false} is VALID [2022-02-20 18:58:06,000 INFO L290 TraceCheckUtils]: 27: Hoare triple {55782#false} assume !(0 == main_~init__r132~0#1 % 256); {55782#false} is VALID [2022-02-20 18:58:06,000 INFO L290 TraceCheckUtils]: 28: Hoare triple {55782#false} assume !(0 == main_~init__r212~0#1 % 256); {55782#false} is VALID [2022-02-20 18:58:06,000 INFO L290 TraceCheckUtils]: 29: Hoare triple {55782#false} assume !(0 == main_~init__r232~0#1 % 256); {55782#false} is VALID [2022-02-20 18:58:06,000 INFO L290 TraceCheckUtils]: 30: Hoare triple {55782#false} assume !(0 == main_~init__r312~0#1 % 256); {55782#false} is VALID [2022-02-20 18:58:06,000 INFO L290 TraceCheckUtils]: 31: Hoare triple {55782#false} assume !(0 == main_~init__r322~0#1 % 256); {55782#false} is VALID [2022-02-20 18:58:06,000 INFO L290 TraceCheckUtils]: 32: Hoare triple {55782#false} assume ~max1~0 == ~id1~0; {55782#false} is VALID [2022-02-20 18:58:06,000 INFO L290 TraceCheckUtils]: 33: Hoare triple {55782#false} assume ~max2~0 == ~id2~0; {55782#false} is VALID [2022-02-20 18:58:06,001 INFO L290 TraceCheckUtils]: 34: Hoare triple {55782#false} assume ~max3~0 == ~id3~0; {55782#false} is VALID [2022-02-20 18:58:06,001 INFO L290 TraceCheckUtils]: 35: Hoare triple {55782#false} assume 0 == ~st1~0; {55782#false} is VALID [2022-02-20 18:58:06,001 INFO L290 TraceCheckUtils]: 36: Hoare triple {55782#false} assume 0 == ~st2~0; {55782#false} is VALID [2022-02-20 18:58:06,001 INFO L290 TraceCheckUtils]: 37: Hoare triple {55782#false} assume 0 == ~st3~0; {55782#false} is VALID [2022-02-20 18:58:06,001 INFO L290 TraceCheckUtils]: 38: Hoare triple {55782#false} assume 0 == ~nl1~0; {55782#false} is VALID [2022-02-20 18:58:06,001 INFO L290 TraceCheckUtils]: 39: Hoare triple {55782#false} assume 0 == ~nl2~0; {55782#false} is VALID [2022-02-20 18:58:06,001 INFO L290 TraceCheckUtils]: 40: Hoare triple {55782#false} assume 0 == ~nl3~0; {55782#false} is VALID [2022-02-20 18:58:06,001 INFO L290 TraceCheckUtils]: 41: Hoare triple {55782#false} assume 0 == ~mode1~0 % 256; {55782#false} is VALID [2022-02-20 18:58:06,001 INFO L290 TraceCheckUtils]: 42: Hoare triple {55782#false} assume 0 == ~mode2~0 % 256; {55782#false} is VALID [2022-02-20 18:58:06,002 INFO L290 TraceCheckUtils]: 43: Hoare triple {55782#false} assume 0 == ~mode3~0 % 256; {55782#false} is VALID [2022-02-20 18:58:06,002 INFO L290 TraceCheckUtils]: 44: Hoare triple {55782#false} assume !(0 == ~newmax1~0 % 256); {55782#false} is VALID [2022-02-20 18:58:06,002 INFO L290 TraceCheckUtils]: 45: Hoare triple {55782#false} assume !(0 == ~newmax2~0 % 256); {55782#false} is VALID [2022-02-20 18:58:06,002 INFO L290 TraceCheckUtils]: 46: Hoare triple {55782#false} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1237~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1237~0; {55782#false} is VALID [2022-02-20 18:58:06,002 INFO L290 TraceCheckUtils]: 47: Hoare triple {55782#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; {55782#false} is VALID [2022-02-20 18:58:06,002 INFO L290 TraceCheckUtils]: 48: Hoare triple {55782#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {55782#false} is VALID [2022-02-20 18:58:06,002 INFO L290 TraceCheckUtils]: 49: Hoare triple {55782#false} assume !!(0 == ~mode1~0 % 256); {55782#false} is VALID [2022-02-20 18:58:06,002 INFO L290 TraceCheckUtils]: 50: Hoare triple {55782#false} assume ~r1~0 < 2; {55782#false} is VALID [2022-02-20 18:58:06,002 INFO L290 TraceCheckUtils]: 51: Hoare triple {55782#false} assume !!(0 == ~ep12~0 % 256); {55782#false} is VALID [2022-02-20 18:58:06,003 INFO L290 TraceCheckUtils]: 52: Hoare triple {55782#false} assume !!(0 == ~ep13~0 % 256); {55782#false} is VALID [2022-02-20 18:58:06,003 INFO L290 TraceCheckUtils]: 53: Hoare triple {55782#false} ~mode1~0 := 1;havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {55782#false} is VALID [2022-02-20 18:58:06,003 INFO L290 TraceCheckUtils]: 54: Hoare triple {55782#false} assume !!(0 == ~mode2~0 % 256); {55782#false} is VALID [2022-02-20 18:58:06,003 INFO L290 TraceCheckUtils]: 55: Hoare triple {55782#false} assume ~r2~0 < 2; {55782#false} is VALID [2022-02-20 18:58:06,003 INFO L290 TraceCheckUtils]: 56: Hoare triple {55782#false} assume !!(0 == ~ep21~0 % 256); {55782#false} is VALID [2022-02-20 18:58:06,003 INFO L290 TraceCheckUtils]: 57: Hoare triple {55782#false} assume !!(0 == ~ep23~0 % 256); {55782#false} is VALID [2022-02-20 18:58:06,003 INFO L290 TraceCheckUtils]: 58: Hoare triple {55782#false} ~mode2~0 := 1;havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {55782#false} is VALID [2022-02-20 18:58:06,003 INFO L290 TraceCheckUtils]: 59: Hoare triple {55782#false} assume !!(0 == ~mode3~0 % 256); {55782#false} is VALID [2022-02-20 18:58:06,003 INFO L290 TraceCheckUtils]: 60: Hoare triple {55782#false} assume ~r3~0 < 2; {55782#false} is VALID [2022-02-20 18:58:06,004 INFO L290 TraceCheckUtils]: 61: Hoare triple {55782#false} assume !!(0 == ~ep31~0 % 256); {55782#false} is VALID [2022-02-20 18:58:06,004 INFO L290 TraceCheckUtils]: 62: Hoare triple {55782#false} assume !!(0 == ~ep32~0 % 256); {55782#false} is VALID [2022-02-20 18:58:06,004 INFO L290 TraceCheckUtils]: 63: Hoare triple {55782#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; {55782#false} is VALID [2022-02-20 18:58:06,004 INFO L290 TraceCheckUtils]: 64: Hoare triple {55782#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {55782#false} is VALID [2022-02-20 18:58:06,004 INFO L290 TraceCheckUtils]: 65: Hoare triple {55782#false} assume ~st1~0 + ~nl1~0 <= 1; {55782#false} is VALID [2022-02-20 18:58:06,004 INFO L290 TraceCheckUtils]: 66: Hoare triple {55782#false} assume ~st2~0 + ~nl2~0 <= 1; {55782#false} is VALID [2022-02-20 18:58:06,004 INFO L290 TraceCheckUtils]: 67: Hoare triple {55782#false} assume ~st3~0 + ~nl3~0 <= 1; {55782#false} is VALID [2022-02-20 18:58:06,004 INFO L290 TraceCheckUtils]: 68: Hoare triple {55782#false} assume !(~r1~0 >= 2); {55782#false} is VALID [2022-02-20 18:58:06,004 INFO L290 TraceCheckUtils]: 69: Hoare triple {55782#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {55782#false} is VALID [2022-02-20 18:58:06,005 INFO L290 TraceCheckUtils]: 70: Hoare triple {55782#false} assume ~r1~0 < 2; {55782#false} is VALID [2022-02-20 18:58:06,005 INFO L290 TraceCheckUtils]: 71: Hoare triple {55782#false} assume !(~r1~0 >= 2); {55782#false} is VALID [2022-02-20 18:58:06,005 INFO L290 TraceCheckUtils]: 72: Hoare triple {55782#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {55782#false} is VALID [2022-02-20 18:58:06,005 INFO L290 TraceCheckUtils]: 73: Hoare triple {55782#false} assume ~r1~0 < 2;main_~check__tmp~0#1 := 1;~__return_1383~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1383~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; {55782#false} is VALID [2022-02-20 18:58:06,005 INFO L290 TraceCheckUtils]: 74: Hoare triple {55782#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {55782#false} is VALID [2022-02-20 18:58:06,005 INFO L290 TraceCheckUtils]: 75: Hoare triple {55782#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~1#1;main_~node1__newmax~1#1 := 0; {55782#false} is VALID [2022-02-20 18:58:06,005 INFO L290 TraceCheckUtils]: 76: Hoare triple {55782#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); {55782#false} is VALID [2022-02-20 18:58:06,005 INFO L290 TraceCheckUtils]: 77: Hoare triple {55782#false} assume !!(0 == ~ep21~0 % 256); {55782#false} is VALID [2022-02-20 18:58:06,006 INFO L290 TraceCheckUtils]: 78: Hoare triple {55782#false} assume !!(0 == ~ep31~0 % 256); {55782#false} is VALID [2022-02-20 18:58:06,006 INFO L290 TraceCheckUtils]: 79: Hoare triple {55782#false} ~newmax1~0 := main_~node1__newmax~1#1; {55782#false} is VALID [2022-02-20 18:58:06,006 INFO L290 TraceCheckUtils]: 80: Hoare triple {55782#false} assume 1 == ~r1~0; {55782#false} is VALID [2022-02-20 18:58:06,006 INFO L290 TraceCheckUtils]: 81: Hoare triple {55782#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {55782#false} is VALID [2022-02-20 18:58:06,006 INFO L290 TraceCheckUtils]: 82: Hoare triple {55782#false} ~mode1~0 := 0;havoc main_~node2__newmax~1#1;main_~node2__newmax~1#1 := 0; {55782#false} is VALID [2022-02-20 18:58:06,006 INFO L290 TraceCheckUtils]: 83: Hoare triple {55782#false} assume !(0 == ~mode2~0 % 256);~r2~0 := (if (1 + ~r2~0) % 256 <= 127 then (1 + ~r2~0) % 256 else (1 + ~r2~0) % 256 - 256); {55782#false} is VALID [2022-02-20 18:58:06,006 INFO L290 TraceCheckUtils]: 84: Hoare triple {55782#false} assume !!(0 == ~ep12~0 % 256); {55782#false} is VALID [2022-02-20 18:58:06,006 INFO L290 TraceCheckUtils]: 85: Hoare triple {55782#false} assume !!(0 == ~ep32~0 % 256); {55782#false} is VALID [2022-02-20 18:58:06,006 INFO L290 TraceCheckUtils]: 86: Hoare triple {55782#false} ~newmax2~0 := main_~node2__newmax~1#1; {55782#false} is VALID [2022-02-20 18:58:06,007 INFO L290 TraceCheckUtils]: 87: Hoare triple {55782#false} assume !(2 == ~r2~0);~mode2~0 := 0;havoc main_~node3__newmax~1#1;main_~node3__newmax~1#1 := 0; {55782#false} is VALID [2022-02-20 18:58:06,007 INFO L290 TraceCheckUtils]: 88: Hoare triple {55782#false} assume !(0 == ~mode3~0 % 256);~r3~0 := (if (1 + ~r3~0) % 256 <= 127 then (1 + ~r3~0) % 256 else (1 + ~r3~0) % 256 - 256); {55782#false} is VALID [2022-02-20 18:58:06,007 INFO L290 TraceCheckUtils]: 89: Hoare triple {55782#false} assume !!(0 == ~ep13~0 % 256); {55782#false} is VALID [2022-02-20 18:58:06,007 INFO L290 TraceCheckUtils]: 90: Hoare triple {55782#false} assume !!(0 == ~ep23~0 % 256); {55782#false} is VALID [2022-02-20 18:58:06,007 INFO L290 TraceCheckUtils]: 91: Hoare triple {55782#false} ~newmax3~0 := main_~node3__newmax~1#1; {55782#false} is VALID [2022-02-20 18:58:06,007 INFO L290 TraceCheckUtils]: 92: Hoare triple {55782#false} assume !(2 == ~r3~0);~mode3~0 := 0;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {55782#false} is VALID [2022-02-20 18:58:06,007 INFO L290 TraceCheckUtils]: 93: Hoare triple {55782#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {55782#false} is VALID [2022-02-20 18:58:06,007 INFO L290 TraceCheckUtils]: 94: Hoare triple {55782#false} assume ~st1~0 + ~nl1~0 <= 1; {55782#false} is VALID [2022-02-20 18:58:06,007 INFO L290 TraceCheckUtils]: 95: Hoare triple {55782#false} assume ~st2~0 + ~nl2~0 <= 1; {55782#false} is VALID [2022-02-20 18:58:06,008 INFO L290 TraceCheckUtils]: 96: Hoare triple {55782#false} assume ~st3~0 + ~nl3~0 <= 1; {55782#false} is VALID [2022-02-20 18:58:06,008 INFO L290 TraceCheckUtils]: 97: Hoare triple {55782#false} assume !(~r1~0 >= 2); {55782#false} is VALID [2022-02-20 18:58:06,008 INFO L290 TraceCheckUtils]: 98: Hoare triple {55782#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {55782#false} is VALID [2022-02-20 18:58:06,008 INFO L290 TraceCheckUtils]: 99: Hoare triple {55782#false} ~__return_1517~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1517~0;~__tmp_1518_0~0 := main_~main____CPAchecker_TMP_0~0#1; {55782#false} is VALID [2022-02-20 18:58:06,008 INFO L290 TraceCheckUtils]: 100: Hoare triple {55782#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1518_0~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {55782#false} is VALID [2022-02-20 18:58:06,008 INFO L290 TraceCheckUtils]: 101: Hoare triple {55782#false} assume 0 == main_~assert__arg~1#1 % 256; {55782#false} is VALID [2022-02-20 18:58:06,008 INFO L290 TraceCheckUtils]: 102: Hoare triple {55782#false} assume !false; {55782#false} is VALID [2022-02-20 18:58:06,008 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:58:06,009 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:06,009 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007024152] [2022-02-20 18:58:06,009 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007024152] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:06,009 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:06,009 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:58:06,009 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715909817] [2022-02-20 18:58:06,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:06,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2022-02-20 18:58:06,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:06,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:06,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:06,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:58:06,067 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:06,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:58:06,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:06,068 INFO L87 Difference]: Start difference. First operand 4553 states and 6669 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:15,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:15,686 INFO L93 Difference]: Finished difference Result 13507 states and 19774 transitions. [2022-02-20 18:58:15,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:58:15,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2022-02-20 18:58:15,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:15,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:15,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1007 transitions. [2022-02-20 18:58:15,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:15,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1007 transitions. [2022-02-20 18:58:15,692 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1007 transitions. [2022-02-20 18:58:16,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1007 edges. 1007 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:19,272 INFO L225 Difference]: With dead ends: 13507 [2022-02-20 18:58:19,272 INFO L226 Difference]: Without dead ends: 9045 [2022-02-20 18:58:19,300 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:58:19,302 INFO L933 BasicCegarLoop]: 486 mSDtfsCounter, 329 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 831 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:58:19,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [329 Valid, 831 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:58:19,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9045 states. [2022-02-20 18:58:20,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9045 to 4563. [2022-02-20 18:58:20,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:20,541 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9045 states. Second operand has 4563 states, 4562 states have (on average 1.464050854888207) internal successors, (6679), 4562 states have internal predecessors, (6679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:20,544 INFO L74 IsIncluded]: Start isIncluded. First operand 9045 states. Second operand has 4563 states, 4562 states have (on average 1.464050854888207) internal successors, (6679), 4562 states have internal predecessors, (6679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:20,547 INFO L87 Difference]: Start difference. First operand 9045 states. Second operand has 4563 states, 4562 states have (on average 1.464050854888207) internal successors, (6679), 4562 states have internal predecessors, (6679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:22,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:22,623 INFO L93 Difference]: Finished difference Result 9045 states and 13239 transitions. [2022-02-20 18:58:22,623 INFO L276 IsEmpty]: Start isEmpty. Operand 9045 states and 13239 transitions. [2022-02-20 18:58:22,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:22,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:22,635 INFO L74 IsIncluded]: Start isIncluded. First operand has 4563 states, 4562 states have (on average 1.464050854888207) internal successors, (6679), 4562 states have internal predecessors, (6679), 0 states have call successors, (0), 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 9045 states. [2022-02-20 18:58:22,638 INFO L87 Difference]: Start difference. First operand has 4563 states, 4562 states have (on average 1.464050854888207) internal successors, (6679), 4562 states have internal predecessors, (6679), 0 states have call successors, (0), 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 9045 states. [2022-02-20 18:58:24,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:24,785 INFO L93 Difference]: Finished difference Result 9045 states and 13239 transitions. [2022-02-20 18:58:24,785 INFO L276 IsEmpty]: Start isEmpty. Operand 9045 states and 13239 transitions. [2022-02-20 18:58:24,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:24,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:24,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:24,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:24,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4563 states, 4562 states have (on average 1.464050854888207) internal successors, (6679), 4562 states have internal predecessors, (6679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:25,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4563 states to 4563 states and 6679 transitions. [2022-02-20 18:58:25,577 INFO L78 Accepts]: Start accepts. Automaton has 4563 states and 6679 transitions. Word has length 103 [2022-02-20 18:58:25,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:25,577 INFO L470 AbstractCegarLoop]: Abstraction has 4563 states and 6679 transitions. [2022-02-20 18:58:25,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:25,577 INFO L276 IsEmpty]: Start isEmpty. Operand 4563 states and 6679 transitions. [2022-02-20 18:58:25,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-02-20 18:58:25,579 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:25,580 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:58:25,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:58:25,580 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:25,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:25,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1648131910, now seen corresponding path program 1 times [2022-02-20 18:58:25,580 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:25,581 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679599571] [2022-02-20 18:58:25,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:25,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:25,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {97797#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(59, 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;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~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_1237~0 := 0;~__return_1383~0 := 0;~__return_1517~0 := 0;~__tmp_1518_0~0 := 0;~__return_1641~0 := 0;~__return_1531~0 := 0; {97797#true} is VALID [2022-02-20 18:58:25,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {97797#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_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__newmax~2#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__newmax~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__newmax~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__newmax~1#1, main_~node2__newmax~1#1, main_~node1__newmax~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#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; {97799#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:58:25,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {97799#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r121~0#1 % 256); {97799#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:58:25,663 INFO L290 TraceCheckUtils]: 3: Hoare triple {97799#(= (+ |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; {97799#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:58:25,663 INFO L290 TraceCheckUtils]: 4: Hoare triple {97799#(= (+ |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); {97799#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:58:25,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {97799#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r131~0#1 % 256); {97799#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:58:25,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {97799#(= (+ |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; {97799#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:58:25,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {97799#(= (+ |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); {97799#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:58:25,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {97799#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r211~0#1 % 256); {97799#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:58:25,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {97799#(= (+ |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; {97799#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:58:25,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {97799#(= (+ |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); {97799#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:58:25,665 INFO L290 TraceCheckUtils]: 11: Hoare triple {97799#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r231~0#1 % 256); {97799#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:58:25,665 INFO L290 TraceCheckUtils]: 12: Hoare triple {97799#(= (+ |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; {97799#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:58:25,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {97799#(= (+ |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); {97799#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:58:25,666 INFO L290 TraceCheckUtils]: 14: Hoare triple {97799#(= (+ |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; {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,667 INFO L290 TraceCheckUtils]: 15: Hoare triple {97800#(<= (+ (* 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); {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,667 INFO L290 TraceCheckUtils]: 16: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,667 INFO L290 TraceCheckUtils]: 17: Hoare triple {97800#(<= (+ (* 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); {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,679 INFO L290 TraceCheckUtils]: 18: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id1~0 != ~id2~0; {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,689 INFO L290 TraceCheckUtils]: 19: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id1~0 != ~id3~0; {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,689 INFO L290 TraceCheckUtils]: 20: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id2~0 != ~id3~0; {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,690 INFO L290 TraceCheckUtils]: 21: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id1~0 >= 0; {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,690 INFO L290 TraceCheckUtils]: 22: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id2~0 >= 0; {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,690 INFO L290 TraceCheckUtils]: 23: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id3~0 >= 0; {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,690 INFO L290 TraceCheckUtils]: 24: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~r1~0; {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,691 INFO L290 TraceCheckUtils]: 25: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~r2~0; {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,691 INFO L290 TraceCheckUtils]: 26: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~r3~0; {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,691 INFO L290 TraceCheckUtils]: 27: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r122~0#1 % 256); {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,691 INFO L290 TraceCheckUtils]: 28: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r132~0#1 % 256); {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,692 INFO L290 TraceCheckUtils]: 29: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r212~0#1 % 256); {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,692 INFO L290 TraceCheckUtils]: 30: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r232~0#1 % 256); {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,692 INFO L290 TraceCheckUtils]: 31: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r312~0#1 % 256); {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,692 INFO L290 TraceCheckUtils]: 32: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r322~0#1 % 256); {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,693 INFO L290 TraceCheckUtils]: 33: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~max1~0 == ~id1~0; {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,693 INFO L290 TraceCheckUtils]: 34: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~max2~0 == ~id2~0; {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,693 INFO L290 TraceCheckUtils]: 35: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~max3~0 == ~id3~0; {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,694 INFO L290 TraceCheckUtils]: 36: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~st1~0; {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,694 INFO L290 TraceCheckUtils]: 37: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~st2~0; {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,694 INFO L290 TraceCheckUtils]: 38: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~st3~0; {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,694 INFO L290 TraceCheckUtils]: 39: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~nl1~0; {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,695 INFO L290 TraceCheckUtils]: 40: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~nl2~0; {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,695 INFO L290 TraceCheckUtils]: 41: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~nl3~0; {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,695 INFO L290 TraceCheckUtils]: 42: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~mode1~0 % 256; {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,695 INFO L290 TraceCheckUtils]: 43: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~mode2~0 % 256; {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,696 INFO L290 TraceCheckUtils]: 44: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~mode3~0 % 256; {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,696 INFO L290 TraceCheckUtils]: 45: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == ~newmax1~0 % 256); {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,696 INFO L290 TraceCheckUtils]: 46: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == ~newmax2~0 % 256); {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,697 INFO L290 TraceCheckUtils]: 47: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1237~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1237~0; {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,697 INFO L290 TraceCheckUtils]: 48: Hoare triple {97800#(<= (+ (* 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; {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,697 INFO L290 TraceCheckUtils]: 49: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,697 INFO L290 TraceCheckUtils]: 50: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~mode1~0 % 256); {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,698 INFO L290 TraceCheckUtils]: 51: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~r1~0 < 2; {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,698 INFO L290 TraceCheckUtils]: 52: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~ep12~0 % 256); {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,698 INFO L290 TraceCheckUtils]: 53: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~ep13~0 % 256); {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,699 INFO L290 TraceCheckUtils]: 54: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} ~mode1~0 := 1;havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,699 INFO L290 TraceCheckUtils]: 55: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~mode2~0 % 256); {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,699 INFO L290 TraceCheckUtils]: 56: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~r2~0 < 2; {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,699 INFO L290 TraceCheckUtils]: 57: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~ep21~0 % 256); {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,700 INFO L290 TraceCheckUtils]: 58: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~ep23~0 % 256); {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,700 INFO L290 TraceCheckUtils]: 59: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} ~mode2~0 := 1;havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,700 INFO L290 TraceCheckUtils]: 60: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~mode3~0 % 256); {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,700 INFO L290 TraceCheckUtils]: 61: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~r3~0 < 2; {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:25,701 INFO L290 TraceCheckUtils]: 62: Hoare triple {97800#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~ep31~0 % 256); {97798#false} is VALID [2022-02-20 18:58:25,701 INFO L290 TraceCheckUtils]: 63: Hoare triple {97798#false} assume !!(0 == ~ep32~0 % 256); {97798#false} is VALID [2022-02-20 18:58:25,701 INFO L290 TraceCheckUtils]: 64: Hoare triple {97798#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; {97798#false} is VALID [2022-02-20 18:58:25,701 INFO L290 TraceCheckUtils]: 65: Hoare triple {97798#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {97798#false} is VALID [2022-02-20 18:58:25,701 INFO L290 TraceCheckUtils]: 66: Hoare triple {97798#false} assume ~st1~0 + ~nl1~0 <= 1; {97798#false} is VALID [2022-02-20 18:58:25,702 INFO L290 TraceCheckUtils]: 67: Hoare triple {97798#false} assume ~st2~0 + ~nl2~0 <= 1; {97798#false} is VALID [2022-02-20 18:58:25,702 INFO L290 TraceCheckUtils]: 68: Hoare triple {97798#false} assume ~st3~0 + ~nl3~0 <= 1; {97798#false} is VALID [2022-02-20 18:58:25,702 INFO L290 TraceCheckUtils]: 69: Hoare triple {97798#false} assume !(~r1~0 >= 2); {97798#false} is VALID [2022-02-20 18:58:25,702 INFO L290 TraceCheckUtils]: 70: Hoare triple {97798#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {97798#false} is VALID [2022-02-20 18:58:25,702 INFO L290 TraceCheckUtils]: 71: Hoare triple {97798#false} assume ~r1~0 < 2; {97798#false} is VALID [2022-02-20 18:58:25,702 INFO L290 TraceCheckUtils]: 72: Hoare triple {97798#false} assume !(~r1~0 >= 2); {97798#false} is VALID [2022-02-20 18:58:25,702 INFO L290 TraceCheckUtils]: 73: Hoare triple {97798#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {97798#false} is VALID [2022-02-20 18:58:25,702 INFO L290 TraceCheckUtils]: 74: Hoare triple {97798#false} assume ~r1~0 < 2;main_~check__tmp~0#1 := 1;~__return_1383~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1383~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; {97798#false} is VALID [2022-02-20 18:58:25,702 INFO L290 TraceCheckUtils]: 75: Hoare triple {97798#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {97798#false} is VALID [2022-02-20 18:58:25,703 INFO L290 TraceCheckUtils]: 76: Hoare triple {97798#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~1#1;main_~node1__newmax~1#1 := 0; {97798#false} is VALID [2022-02-20 18:58:25,703 INFO L290 TraceCheckUtils]: 77: Hoare triple {97798#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); {97798#false} is VALID [2022-02-20 18:58:25,703 INFO L290 TraceCheckUtils]: 78: Hoare triple {97798#false} assume !!(0 == ~ep21~0 % 256); {97798#false} is VALID [2022-02-20 18:58:25,703 INFO L290 TraceCheckUtils]: 79: Hoare triple {97798#false} assume !!(0 == ~ep31~0 % 256); {97798#false} is VALID [2022-02-20 18:58:25,703 INFO L290 TraceCheckUtils]: 80: Hoare triple {97798#false} ~newmax1~0 := main_~node1__newmax~1#1; {97798#false} is VALID [2022-02-20 18:58:25,703 INFO L290 TraceCheckUtils]: 81: Hoare triple {97798#false} assume 1 == ~r1~0; {97798#false} is VALID [2022-02-20 18:58:25,703 INFO L290 TraceCheckUtils]: 82: Hoare triple {97798#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {97798#false} is VALID [2022-02-20 18:58:25,703 INFO L290 TraceCheckUtils]: 83: Hoare triple {97798#false} ~mode1~0 := 0;havoc main_~node2__newmax~1#1;main_~node2__newmax~1#1 := 0; {97798#false} is VALID [2022-02-20 18:58:25,703 INFO L290 TraceCheckUtils]: 84: Hoare triple {97798#false} assume !(0 == ~mode2~0 % 256);~r2~0 := (if (1 + ~r2~0) % 256 <= 127 then (1 + ~r2~0) % 256 else (1 + ~r2~0) % 256 - 256); {97798#false} is VALID [2022-02-20 18:58:25,704 INFO L290 TraceCheckUtils]: 85: Hoare triple {97798#false} assume !!(0 == ~ep12~0 % 256); {97798#false} is VALID [2022-02-20 18:58:25,704 INFO L290 TraceCheckUtils]: 86: Hoare triple {97798#false} assume !!(0 == ~ep32~0 % 256); {97798#false} is VALID [2022-02-20 18:58:25,704 INFO L290 TraceCheckUtils]: 87: Hoare triple {97798#false} ~newmax2~0 := main_~node2__newmax~1#1; {97798#false} is VALID [2022-02-20 18:58:25,704 INFO L290 TraceCheckUtils]: 88: Hoare triple {97798#false} assume !(2 == ~r2~0);~mode2~0 := 0;havoc main_~node3__newmax~1#1;main_~node3__newmax~1#1 := 0; {97798#false} is VALID [2022-02-20 18:58:25,704 INFO L290 TraceCheckUtils]: 89: Hoare triple {97798#false} assume !(0 == ~mode3~0 % 256);~r3~0 := (if (1 + ~r3~0) % 256 <= 127 then (1 + ~r3~0) % 256 else (1 + ~r3~0) % 256 - 256); {97798#false} is VALID [2022-02-20 18:58:25,704 INFO L290 TraceCheckUtils]: 90: Hoare triple {97798#false} assume !!(0 == ~ep13~0 % 256); {97798#false} is VALID [2022-02-20 18:58:25,705 INFO L290 TraceCheckUtils]: 91: Hoare triple {97798#false} assume !!(0 == ~ep23~0 % 256); {97798#false} is VALID [2022-02-20 18:58:25,705 INFO L290 TraceCheckUtils]: 92: Hoare triple {97798#false} ~newmax3~0 := main_~node3__newmax~1#1; {97798#false} is VALID [2022-02-20 18:58:25,705 INFO L290 TraceCheckUtils]: 93: Hoare triple {97798#false} assume !(2 == ~r3~0);~mode3~0 := 0;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {97798#false} is VALID [2022-02-20 18:58:25,705 INFO L290 TraceCheckUtils]: 94: Hoare triple {97798#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {97798#false} is VALID [2022-02-20 18:58:25,705 INFO L290 TraceCheckUtils]: 95: Hoare triple {97798#false} assume ~st1~0 + ~nl1~0 <= 1; {97798#false} is VALID [2022-02-20 18:58:25,705 INFO L290 TraceCheckUtils]: 96: Hoare triple {97798#false} assume ~st2~0 + ~nl2~0 <= 1; {97798#false} is VALID [2022-02-20 18:58:25,705 INFO L290 TraceCheckUtils]: 97: Hoare triple {97798#false} assume ~st3~0 + ~nl3~0 <= 1; {97798#false} is VALID [2022-02-20 18:58:25,706 INFO L290 TraceCheckUtils]: 98: Hoare triple {97798#false} assume !(~r1~0 >= 2); {97798#false} is VALID [2022-02-20 18:58:25,706 INFO L290 TraceCheckUtils]: 99: Hoare triple {97798#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {97798#false} is VALID [2022-02-20 18:58:25,706 INFO L290 TraceCheckUtils]: 100: Hoare triple {97798#false} ~__return_1517~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1517~0;~__tmp_1518_0~0 := main_~main____CPAchecker_TMP_0~0#1; {97798#false} is VALID [2022-02-20 18:58:25,706 INFO L290 TraceCheckUtils]: 101: Hoare triple {97798#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1518_0~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {97798#false} is VALID [2022-02-20 18:58:25,706 INFO L290 TraceCheckUtils]: 102: Hoare triple {97798#false} assume 0 == main_~assert__arg~1#1 % 256; {97798#false} is VALID [2022-02-20 18:58:25,706 INFO L290 TraceCheckUtils]: 103: Hoare triple {97798#false} assume !false; {97798#false} is VALID [2022-02-20 18:58:25,706 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:58:25,707 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:25,707 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679599571] [2022-02-20 18:58:25,707 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679599571] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:25,707 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:25,708 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:58:25,708 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594035690] [2022-02-20 18:58:25,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:25,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2022-02-20 18:58:25,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:25,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:25,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:25,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:58:25,770 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:25,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:58:25,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:58:25,770 INFO L87 Difference]: Start difference. First operand 4563 states and 6679 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:34,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:34,794 INFO L93 Difference]: Finished difference Result 12401 states and 18058 transitions. [2022-02-20 18:58:34,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:58:34,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2022-02-20 18:58:34,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:34,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:34,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 982 transitions. [2022-02-20 18:58:34,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:34,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 982 transitions. [2022-02-20 18:58:34,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 982 transitions. [2022-02-20 18:58:35,371 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:58:37,735 INFO L225 Difference]: With dead ends: 12401 [2022-02-20 18:58:37,736 INFO L226 Difference]: Without dead ends: 7939 [2022-02-20 18:58:37,742 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:58:37,743 INFO L933 BasicCegarLoop]: 549 mSDtfsCounter, 698 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 865 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:58:37,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [698 Valid, 865 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:58:37,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7939 states. [2022-02-20 18:58:40,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7939 to 7937. [2022-02-20 18:58:40,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:40,494 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7939 states. Second operand has 7937 states, 7936 states have (on average 1.4373739919354838) internal successors, (11407), 7936 states have internal predecessors, (11407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:40,499 INFO L74 IsIncluded]: Start isIncluded. First operand 7939 states. Second operand has 7937 states, 7936 states have (on average 1.4373739919354838) internal successors, (11407), 7936 states have internal predecessors, (11407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:40,506 INFO L87 Difference]: Start difference. First operand 7939 states. Second operand has 7937 states, 7936 states have (on average 1.4373739919354838) internal successors, (11407), 7936 states have internal predecessors, (11407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:42,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:42,246 INFO L93 Difference]: Finished difference Result 7939 states and 11408 transitions. [2022-02-20 18:58:42,246 INFO L276 IsEmpty]: Start isEmpty. Operand 7939 states and 11408 transitions. [2022-02-20 18:58:42,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:42,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:42,261 INFO L74 IsIncluded]: Start isIncluded. First operand has 7937 states, 7936 states have (on average 1.4373739919354838) internal successors, (11407), 7936 states have internal predecessors, (11407), 0 states have call successors, (0), 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 7939 states. [2022-02-20 18:58:42,266 INFO L87 Difference]: Start difference. First operand has 7937 states, 7936 states have (on average 1.4373739919354838) internal successors, (11407), 7936 states have internal predecessors, (11407), 0 states have call successors, (0), 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 7939 states. [2022-02-20 18:58:44,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:44,012 INFO L93 Difference]: Finished difference Result 7939 states and 11408 transitions. [2022-02-20 18:58:44,012 INFO L276 IsEmpty]: Start isEmpty. Operand 7939 states and 11408 transitions. [2022-02-20 18:58:44,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:44,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:44,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:44,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:44,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7937 states, 7936 states have (on average 1.4373739919354838) internal successors, (11407), 7936 states have internal predecessors, (11407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:46,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7937 states to 7937 states and 11407 transitions. [2022-02-20 18:58:46,348 INFO L78 Accepts]: Start accepts. Automaton has 7937 states and 11407 transitions. Word has length 104 [2022-02-20 18:58:46,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:46,349 INFO L470 AbstractCegarLoop]: Abstraction has 7937 states and 11407 transitions. [2022-02-20 18:58:46,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:46,349 INFO L276 IsEmpty]: Start isEmpty. Operand 7937 states and 11407 transitions. [2022-02-20 18:58:46,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-20 18:58:46,352 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:46,352 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:46,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:58:46,352 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:46,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:46,352 INFO L85 PathProgramCache]: Analyzing trace with hash 67303578, now seen corresponding path program 1 times [2022-02-20 18:58:46,353 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:46,353 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994764183] [2022-02-20 18:58:46,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:46,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:46,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {140589#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(59, 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;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~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_1237~0 := 0;~__return_1383~0 := 0;~__return_1517~0 := 0;~__tmp_1518_0~0 := 0;~__return_1641~0 := 0;~__return_1531~0 := 0; {140589#true} is VALID [2022-02-20 18:58:46,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {140589#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_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__newmax~2#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__newmax~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__newmax~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__newmax~1#1, main_~node2__newmax~1#1, main_~node1__newmax~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#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; {140589#true} is VALID [2022-02-20 18:58:46,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {140589#true} assume !!(0 == main_~init__r121~0#1 % 256); {140589#true} is VALID [2022-02-20 18:58:46,398 INFO L290 TraceCheckUtils]: 3: Hoare triple {140589#true} assume !!(0 == main_~init__r131~0#1 % 256);main_~init__tmp~0#1 := 0; {140589#true} is VALID [2022-02-20 18:58:46,398 INFO L290 TraceCheckUtils]: 4: Hoare triple {140589#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {140589#true} is VALID [2022-02-20 18:58:46,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {140589#true} assume !!(0 == main_~init__r131~0#1 % 256); {140589#true} is VALID [2022-02-20 18:58:46,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {140589#true} assume !!(0 == main_~init__r121~0#1 % 256);main_~init__tmp___0~0#1 := 0; {140589#true} is VALID [2022-02-20 18:58:46,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {140589#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {140589#true} is VALID [2022-02-20 18:58:46,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {140589#true} assume !!(0 == main_~init__r211~0#1 % 256); {140589#true} is VALID [2022-02-20 18:58:46,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {140589#true} assume !!(0 == main_~init__r231~0#1 % 256);main_~init__tmp___1~0#1 := 0; {140589#true} is VALID [2022-02-20 18:58:46,399 INFO L290 TraceCheckUtils]: 10: Hoare triple {140589#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {140589#true} is VALID [2022-02-20 18:58:46,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {140589#true} assume !!(0 == main_~init__r231~0#1 % 256); {140589#true} is VALID [2022-02-20 18:58:46,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {140589#true} assume !!(0 == main_~init__r211~0#1 % 256);main_~init__tmp___2~0#1 := 0; {140589#true} is VALID [2022-02-20 18:58:46,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {140589#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {140589#true} is VALID [2022-02-20 18:58:46,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {140589#true} assume !!(0 == main_~init__r311~0#1 % 256); {140589#true} is VALID [2022-02-20 18:58:46,401 INFO L290 TraceCheckUtils]: 15: Hoare triple {140589#true} assume !!(0 == main_~init__r321~0#1 % 256);main_~init__tmp___3~0#1 := 0; {140591#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (div |ULTIMATE.start_main_~init__r321~0#1| 256) (- 256))) 0)} is VALID [2022-02-20 18:58:46,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {140591#(= (+ |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); {140591#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (div |ULTIMATE.start_main_~init__r321~0#1| 256) (- 256))) 0)} is VALID [2022-02-20 18:58:46,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {140591#(= (+ |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; {140590#false} is VALID [2022-02-20 18:58:46,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {140590#false} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {140590#false} is VALID [2022-02-20 18:58:46,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {140590#false} assume ~id1~0 != ~id2~0; {140590#false} is VALID [2022-02-20 18:58:46,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {140590#false} assume ~id1~0 != ~id3~0; {140590#false} is VALID [2022-02-20 18:58:46,403 INFO L290 TraceCheckUtils]: 21: Hoare triple {140590#false} assume ~id2~0 != ~id3~0; {140590#false} is VALID [2022-02-20 18:58:46,403 INFO L290 TraceCheckUtils]: 22: Hoare triple {140590#false} assume ~id1~0 >= 0; {140590#false} is VALID [2022-02-20 18:58:46,403 INFO L290 TraceCheckUtils]: 23: Hoare triple {140590#false} assume ~id2~0 >= 0; {140590#false} is VALID [2022-02-20 18:58:46,403 INFO L290 TraceCheckUtils]: 24: Hoare triple {140590#false} assume ~id3~0 >= 0; {140590#false} is VALID [2022-02-20 18:58:46,403 INFO L290 TraceCheckUtils]: 25: Hoare triple {140590#false} assume 0 == ~r1~0; {140590#false} is VALID [2022-02-20 18:58:46,403 INFO L290 TraceCheckUtils]: 26: Hoare triple {140590#false} assume 0 == ~r2~0; {140590#false} is VALID [2022-02-20 18:58:46,403 INFO L290 TraceCheckUtils]: 27: Hoare triple {140590#false} assume 0 == ~r3~0; {140590#false} is VALID [2022-02-20 18:58:46,403 INFO L290 TraceCheckUtils]: 28: Hoare triple {140590#false} assume !(0 == main_~init__r122~0#1 % 256); {140590#false} is VALID [2022-02-20 18:58:46,403 INFO L290 TraceCheckUtils]: 29: Hoare triple {140590#false} assume !(0 == main_~init__r132~0#1 % 256); {140590#false} is VALID [2022-02-20 18:58:46,404 INFO L290 TraceCheckUtils]: 30: Hoare triple {140590#false} assume !(0 == main_~init__r212~0#1 % 256); {140590#false} is VALID [2022-02-20 18:58:46,404 INFO L290 TraceCheckUtils]: 31: Hoare triple {140590#false} assume !(0 == main_~init__r232~0#1 % 256); {140590#false} is VALID [2022-02-20 18:58:46,404 INFO L290 TraceCheckUtils]: 32: Hoare triple {140590#false} assume !(0 == main_~init__r312~0#1 % 256); {140590#false} is VALID [2022-02-20 18:58:46,404 INFO L290 TraceCheckUtils]: 33: Hoare triple {140590#false} assume !(0 == main_~init__r322~0#1 % 256); {140590#false} is VALID [2022-02-20 18:58:46,404 INFO L290 TraceCheckUtils]: 34: Hoare triple {140590#false} assume ~max1~0 == ~id1~0; {140590#false} is VALID [2022-02-20 18:58:46,404 INFO L290 TraceCheckUtils]: 35: Hoare triple {140590#false} assume ~max2~0 == ~id2~0; {140590#false} is VALID [2022-02-20 18:58:46,404 INFO L290 TraceCheckUtils]: 36: Hoare triple {140590#false} assume ~max3~0 == ~id3~0; {140590#false} is VALID [2022-02-20 18:58:46,404 INFO L290 TraceCheckUtils]: 37: Hoare triple {140590#false} assume 0 == ~st1~0; {140590#false} is VALID [2022-02-20 18:58:46,404 INFO L290 TraceCheckUtils]: 38: Hoare triple {140590#false} assume 0 == ~st2~0; {140590#false} is VALID [2022-02-20 18:58:46,405 INFO L290 TraceCheckUtils]: 39: Hoare triple {140590#false} assume 0 == ~st3~0; {140590#false} is VALID [2022-02-20 18:58:46,405 INFO L290 TraceCheckUtils]: 40: Hoare triple {140590#false} assume 0 == ~nl1~0; {140590#false} is VALID [2022-02-20 18:58:46,405 INFO L290 TraceCheckUtils]: 41: Hoare triple {140590#false} assume 0 == ~nl2~0; {140590#false} is VALID [2022-02-20 18:58:46,405 INFO L290 TraceCheckUtils]: 42: Hoare triple {140590#false} assume 0 == ~nl3~0; {140590#false} is VALID [2022-02-20 18:58:46,405 INFO L290 TraceCheckUtils]: 43: Hoare triple {140590#false} assume 0 == ~mode1~0 % 256; {140590#false} is VALID [2022-02-20 18:58:46,405 INFO L290 TraceCheckUtils]: 44: Hoare triple {140590#false} assume 0 == ~mode2~0 % 256; {140590#false} is VALID [2022-02-20 18:58:46,405 INFO L290 TraceCheckUtils]: 45: Hoare triple {140590#false} assume 0 == ~mode3~0 % 256; {140590#false} is VALID [2022-02-20 18:58:46,405 INFO L290 TraceCheckUtils]: 46: Hoare triple {140590#false} assume !(0 == ~newmax1~0 % 256); {140590#false} is VALID [2022-02-20 18:58:46,406 INFO L290 TraceCheckUtils]: 47: Hoare triple {140590#false} assume !(0 == ~newmax2~0 % 256); {140590#false} is VALID [2022-02-20 18:58:46,406 INFO L290 TraceCheckUtils]: 48: Hoare triple {140590#false} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1237~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1237~0; {140590#false} is VALID [2022-02-20 18:58:46,406 INFO L290 TraceCheckUtils]: 49: Hoare triple {140590#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; {140590#false} is VALID [2022-02-20 18:58:46,406 INFO L290 TraceCheckUtils]: 50: Hoare triple {140590#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {140590#false} is VALID [2022-02-20 18:58:46,406 INFO L290 TraceCheckUtils]: 51: Hoare triple {140590#false} assume !!(0 == ~mode1~0 % 256); {140590#false} is VALID [2022-02-20 18:58:46,406 INFO L290 TraceCheckUtils]: 52: Hoare triple {140590#false} assume ~r1~0 < 2; {140590#false} is VALID [2022-02-20 18:58:46,406 INFO L290 TraceCheckUtils]: 53: Hoare triple {140590#false} assume !!(0 == ~ep12~0 % 256); {140590#false} is VALID [2022-02-20 18:58:46,406 INFO L290 TraceCheckUtils]: 54: Hoare triple {140590#false} assume !!(0 == ~ep13~0 % 256); {140590#false} is VALID [2022-02-20 18:58:46,406 INFO L290 TraceCheckUtils]: 55: Hoare triple {140590#false} ~mode1~0 := 1;havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {140590#false} is VALID [2022-02-20 18:58:46,407 INFO L290 TraceCheckUtils]: 56: Hoare triple {140590#false} assume !!(0 == ~mode2~0 % 256); {140590#false} is VALID [2022-02-20 18:58:46,407 INFO L290 TraceCheckUtils]: 57: Hoare triple {140590#false} assume ~r2~0 < 2; {140590#false} is VALID [2022-02-20 18:58:46,407 INFO L290 TraceCheckUtils]: 58: Hoare triple {140590#false} assume !!(0 == ~ep21~0 % 256); {140590#false} is VALID [2022-02-20 18:58:46,407 INFO L290 TraceCheckUtils]: 59: Hoare triple {140590#false} assume !!(0 == ~ep23~0 % 256); {140590#false} is VALID [2022-02-20 18:58:46,407 INFO L290 TraceCheckUtils]: 60: Hoare triple {140590#false} ~mode2~0 := 1;havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {140590#false} is VALID [2022-02-20 18:58:46,407 INFO L290 TraceCheckUtils]: 61: Hoare triple {140590#false} assume !!(0 == ~mode3~0 % 256); {140590#false} is VALID [2022-02-20 18:58:46,407 INFO L290 TraceCheckUtils]: 62: Hoare triple {140590#false} assume ~r3~0 < 2; {140590#false} is VALID [2022-02-20 18:58:46,407 INFO L290 TraceCheckUtils]: 63: Hoare triple {140590#false} assume !!(0 == ~ep31~0 % 256); {140590#false} is VALID [2022-02-20 18:58:46,407 INFO L290 TraceCheckUtils]: 64: Hoare triple {140590#false} assume !!(0 == ~ep32~0 % 256); {140590#false} is VALID [2022-02-20 18:58:46,408 INFO L290 TraceCheckUtils]: 65: Hoare triple {140590#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; {140590#false} is VALID [2022-02-20 18:58:46,408 INFO L290 TraceCheckUtils]: 66: Hoare triple {140590#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {140590#false} is VALID [2022-02-20 18:58:46,408 INFO L290 TraceCheckUtils]: 67: Hoare triple {140590#false} assume ~st1~0 + ~nl1~0 <= 1; {140590#false} is VALID [2022-02-20 18:58:46,408 INFO L290 TraceCheckUtils]: 68: Hoare triple {140590#false} assume ~st2~0 + ~nl2~0 <= 1; {140590#false} is VALID [2022-02-20 18:58:46,408 INFO L290 TraceCheckUtils]: 69: Hoare triple {140590#false} assume ~st3~0 + ~nl3~0 <= 1; {140590#false} is VALID [2022-02-20 18:58:46,408 INFO L290 TraceCheckUtils]: 70: Hoare triple {140590#false} assume !(~r1~0 >= 2); {140590#false} is VALID [2022-02-20 18:58:46,408 INFO L290 TraceCheckUtils]: 71: Hoare triple {140590#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {140590#false} is VALID [2022-02-20 18:58:46,408 INFO L290 TraceCheckUtils]: 72: Hoare triple {140590#false} assume ~r1~0 < 2; {140590#false} is VALID [2022-02-20 18:58:46,408 INFO L290 TraceCheckUtils]: 73: Hoare triple {140590#false} assume !(~r1~0 >= 2); {140590#false} is VALID [2022-02-20 18:58:46,409 INFO L290 TraceCheckUtils]: 74: Hoare triple {140590#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {140590#false} is VALID [2022-02-20 18:58:46,409 INFO L290 TraceCheckUtils]: 75: Hoare triple {140590#false} assume ~r1~0 < 2;main_~check__tmp~0#1 := 1;~__return_1383~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1383~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; {140590#false} is VALID [2022-02-20 18:58:46,409 INFO L290 TraceCheckUtils]: 76: Hoare triple {140590#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {140590#false} is VALID [2022-02-20 18:58:46,409 INFO L290 TraceCheckUtils]: 77: Hoare triple {140590#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~1#1;main_~node1__newmax~1#1 := 0; {140590#false} is VALID [2022-02-20 18:58:46,409 INFO L290 TraceCheckUtils]: 78: Hoare triple {140590#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); {140590#false} is VALID [2022-02-20 18:58:46,409 INFO L290 TraceCheckUtils]: 79: Hoare triple {140590#false} assume !!(0 == ~ep21~0 % 256); {140590#false} is VALID [2022-02-20 18:58:46,409 INFO L290 TraceCheckUtils]: 80: Hoare triple {140590#false} assume !!(0 == ~ep31~0 % 256); {140590#false} is VALID [2022-02-20 18:58:46,409 INFO L290 TraceCheckUtils]: 81: Hoare triple {140590#false} ~newmax1~0 := main_~node1__newmax~1#1; {140590#false} is VALID [2022-02-20 18:58:46,410 INFO L290 TraceCheckUtils]: 82: Hoare triple {140590#false} assume 1 == ~r1~0; {140590#false} is VALID [2022-02-20 18:58:46,410 INFO L290 TraceCheckUtils]: 83: Hoare triple {140590#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {140590#false} is VALID [2022-02-20 18:58:46,410 INFO L290 TraceCheckUtils]: 84: Hoare triple {140590#false} ~mode1~0 := 0;havoc main_~node2__newmax~1#1;main_~node2__newmax~1#1 := 0; {140590#false} is VALID [2022-02-20 18:58:46,410 INFO L290 TraceCheckUtils]: 85: Hoare triple {140590#false} assume !(0 == ~mode2~0 % 256);~r2~0 := (if (1 + ~r2~0) % 256 <= 127 then (1 + ~r2~0) % 256 else (1 + ~r2~0) % 256 - 256); {140590#false} is VALID [2022-02-20 18:58:46,410 INFO L290 TraceCheckUtils]: 86: Hoare triple {140590#false} assume !!(0 == ~ep12~0 % 256); {140590#false} is VALID [2022-02-20 18:58:46,410 INFO L290 TraceCheckUtils]: 87: Hoare triple {140590#false} assume !!(0 == ~ep32~0 % 256); {140590#false} is VALID [2022-02-20 18:58:46,410 INFO L290 TraceCheckUtils]: 88: Hoare triple {140590#false} ~newmax2~0 := main_~node2__newmax~1#1; {140590#false} is VALID [2022-02-20 18:58:46,410 INFO L290 TraceCheckUtils]: 89: Hoare triple {140590#false} assume !(2 == ~r2~0);~mode2~0 := 0;havoc main_~node3__newmax~1#1;main_~node3__newmax~1#1 := 0; {140590#false} is VALID [2022-02-20 18:58:46,410 INFO L290 TraceCheckUtils]: 90: Hoare triple {140590#false} assume !(0 == ~mode3~0 % 256);~r3~0 := (if (1 + ~r3~0) % 256 <= 127 then (1 + ~r3~0) % 256 else (1 + ~r3~0) % 256 - 256); {140590#false} is VALID [2022-02-20 18:58:46,411 INFO L290 TraceCheckUtils]: 91: Hoare triple {140590#false} assume !!(0 == ~ep13~0 % 256); {140590#false} is VALID [2022-02-20 18:58:46,411 INFO L290 TraceCheckUtils]: 92: Hoare triple {140590#false} assume !!(0 == ~ep23~0 % 256); {140590#false} is VALID [2022-02-20 18:58:46,411 INFO L290 TraceCheckUtils]: 93: Hoare triple {140590#false} ~newmax3~0 := main_~node3__newmax~1#1; {140590#false} is VALID [2022-02-20 18:58:46,411 INFO L290 TraceCheckUtils]: 94: Hoare triple {140590#false} assume !(2 == ~r3~0);~mode3~0 := 0;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {140590#false} is VALID [2022-02-20 18:58:46,411 INFO L290 TraceCheckUtils]: 95: Hoare triple {140590#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {140590#false} is VALID [2022-02-20 18:58:46,411 INFO L290 TraceCheckUtils]: 96: Hoare triple {140590#false} assume ~st1~0 + ~nl1~0 <= 1; {140590#false} is VALID [2022-02-20 18:58:46,411 INFO L290 TraceCheckUtils]: 97: Hoare triple {140590#false} assume ~st2~0 + ~nl2~0 <= 1; {140590#false} is VALID [2022-02-20 18:58:46,411 INFO L290 TraceCheckUtils]: 98: Hoare triple {140590#false} assume ~st3~0 + ~nl3~0 <= 1; {140590#false} is VALID [2022-02-20 18:58:46,411 INFO L290 TraceCheckUtils]: 99: Hoare triple {140590#false} assume !(~r1~0 >= 2); {140590#false} is VALID [2022-02-20 18:58:46,412 INFO L290 TraceCheckUtils]: 100: Hoare triple {140590#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {140590#false} is VALID [2022-02-20 18:58:46,412 INFO L290 TraceCheckUtils]: 101: Hoare triple {140590#false} ~__return_1517~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1517~0;~__tmp_1518_0~0 := main_~main____CPAchecker_TMP_0~0#1; {140590#false} is VALID [2022-02-20 18:58:46,412 INFO L290 TraceCheckUtils]: 102: Hoare triple {140590#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1518_0~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {140590#false} is VALID [2022-02-20 18:58:46,412 INFO L290 TraceCheckUtils]: 103: Hoare triple {140590#false} assume 0 == main_~assert__arg~1#1 % 256; {140590#false} is VALID [2022-02-20 18:58:46,412 INFO L290 TraceCheckUtils]: 104: Hoare triple {140590#false} assume !false; {140590#false} is VALID [2022-02-20 18:58:46,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:58:46,413 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:46,413 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994764183] [2022-02-20 18:58:46,413 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994764183] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:46,413 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:46,413 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:58:46,413 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614917018] [2022-02-20 18:58:46,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:46,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-02-20 18:58:46,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:46,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:46,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:46,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:58:46,471 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:46,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:58:46,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:46,472 INFO L87 Difference]: Start difference. First operand 7937 states and 11407 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)