./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5a61d3db55f61e1c69c316c83f1e37b4c9c56a755bd5e8fcd2da0d467aefc9f7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:31:43,649 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:31:43,651 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:31:43,698 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:31:43,699 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:31:43,702 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:31:43,704 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:31:43,706 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:31:43,708 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:31:43,712 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:31:43,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:31:43,714 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:31:43,714 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:31:43,716 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:31:43,717 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:31:43,720 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:31:43,721 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:31:43,722 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:31:43,724 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:31:43,730 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:31:43,731 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:31:43,732 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:31:43,733 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:31:43,734 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:31:43,740 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:31:43,740 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:31:43,741 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:31:43,742 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:31:43,743 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:31:43,744 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:31:43,744 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:31:43,745 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:31:43,746 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:31:43,747 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:31:43,748 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:31:43,748 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:31:43,749 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:31:43,749 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:31:43,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:31:43,750 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:31:43,751 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:31:43,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:31:43,786 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:31:43,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:31:43,787 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:31:43,787 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:31:43,788 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:31:43,788 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:31:43,789 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:31:43,789 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:31:43,789 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:31:43,789 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:31:43,790 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:31:43,790 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:31:43,790 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:31:43,790 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:31:43,791 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:31:43,791 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:31:43,791 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:31:43,791 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:31:43,791 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:31:43,792 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:31:43,792 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:31:43,792 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:31:43,792 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:31:43,792 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:31:43,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:31:43,793 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:31:43,793 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:31:43,793 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:31:43,793 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:31:43,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:31:43,794 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:31:43,794 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:31:43,794 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:31:43,795 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 -> 5a61d3db55f61e1c69c316c83f1e37b4c9c56a755bd5e8fcd2da0d467aefc9f7 [2022-02-20 18:31:44,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:31:44,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:31:44,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:31:44,069 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:31:44,070 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:31:44,071 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c [2022-02-20 18:31:44,135 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15cfe9d7b/e7715059fd394a00a2b7f0eb14720bc9/FLAG9b8cfdc81 [2022-02-20 18:31:44,533 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:31:44,534 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c [2022-02-20 18:31:44,547 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15cfe9d7b/e7715059fd394a00a2b7f0eb14720bc9/FLAG9b8cfdc81 [2022-02-20 18:31:44,892 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15cfe9d7b/e7715059fd394a00a2b7f0eb14720bc9 [2022-02-20 18:31:44,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:31:44,895 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:31:44,897 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:31:44,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:31:44,902 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:31:44,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:31:44" (1/1) ... [2022-02-20 18:31:44,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@563d8b89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:44, skipping insertion in model container [2022-02-20 18:31:44,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:31:44" (1/1) ... [2022-02-20 18:31:44,911 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:31:44,955 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:31:45,162 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c[14373,14386] [2022-02-20 18:31:45,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:31:45,173 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:31:45,228 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c[14373,14386] [2022-02-20 18:31:45,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:31:45,248 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:31:45,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:45 WrapperNode [2022-02-20 18:31:45,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:31:45,249 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:31:45,249 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:31:45,250 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:31:45,255 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:31:45" (1/1) ... [2022-02-20 18:31:45,267 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:31:45" (1/1) ... [2022-02-20 18:31:45,334 INFO L137 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 479 [2022-02-20 18:31:45,342 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:31:45,343 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:31:45,343 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:31:45,343 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:31:45,350 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:45" (1/1) ... [2022-02-20 18:31:45,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:45" (1/1) ... [2022-02-20 18:31:45,353 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:45" (1/1) ... [2022-02-20 18:31:45,354 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:45" (1/1) ... [2022-02-20 18:31:45,362 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:45" (1/1) ... [2022-02-20 18:31:45,369 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:45" (1/1) ... [2022-02-20 18:31:45,383 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:45" (1/1) ... [2022-02-20 18:31:45,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:31:45,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:31:45,388 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:31:45,388 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:31:45,393 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:45" (1/1) ... [2022-02-20 18:31:45,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:31:45,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:31:45,420 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:31:45,422 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:31:45,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:31:45,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:31:45,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:31:45,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:31:45,540 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:31:45,542 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:31:46,267 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:31:46,277 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:31:46,277 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:31:46,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:31:46 BoogieIcfgContainer [2022-02-20 18:31:46,280 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:31:46,282 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:31:46,282 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:31:46,285 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:31:46,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:31:44" (1/3) ... [2022-02-20 18:31:46,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ef6721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:31:46, skipping insertion in model container [2022-02-20 18:31:46,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:45" (2/3) ... [2022-02-20 18:31:46,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ef6721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:31:46, skipping insertion in model container [2022-02-20 18:31:46,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:31:46" (3/3) ... [2022-02-20 18:31:46,288 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c [2022-02-20 18:31:46,298 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:31:46,298 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:31:46,337 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:31:46,352 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:31:46,352 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:31:46,376 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 141 states have (on average 1.7588652482269505) internal successors, (248), 142 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:46,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:31:46,383 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:46,383 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] [2022-02-20 18:31:46,384 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:46,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:46,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1418405445, now seen corresponding path program 1 times [2022-02-20 18:31:46,400 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:46,401 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562329215] [2022-02-20 18:31:46,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:46,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:46,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:46,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {146#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(43, 2);call #Ultimate.allocInit(12, 3);~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; {146#true} is VALID [2022-02-20 18:31:46,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {146#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {146#true} is VALID [2022-02-20 18:31:46,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {146#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {146#true} is VALID [2022-02-20 18:31:46,680 INFO L290 TraceCheckUtils]: 3: Hoare triple {146#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {146#true} is VALID [2022-02-20 18:31:46,680 INFO L290 TraceCheckUtils]: 4: Hoare triple {146#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {146#true} is VALID [2022-02-20 18:31:46,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {146#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {146#true} is VALID [2022-02-20 18:31:46,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {146#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {146#true} is VALID [2022-02-20 18:31:46,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {146#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {146#true} is VALID [2022-02-20 18:31:46,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {146#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {146#true} is VALID [2022-02-20 18:31:46,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {146#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {146#true} is VALID [2022-02-20 18:31:46,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {146#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {146#true} is VALID [2022-02-20 18:31:46,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {146#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {146#true} is VALID [2022-02-20 18:31:46,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {146#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {146#true} is VALID [2022-02-20 18:31:46,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {146#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {146#true} is VALID [2022-02-20 18:31:46,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {146#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; {146#true} is VALID [2022-02-20 18:31:46,683 INFO L290 TraceCheckUtils]: 15: Hoare triple {146#true} init_#res#1 := init_~tmp___5~0#1; {146#true} is VALID [2022-02-20 18:31:46,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {146#true} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {146#true} is VALID [2022-02-20 18:31:46,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {146#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {147#false} is VALID [2022-02-20 18:31:46,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {147#false} assume { :end_inline_assume_abort_if_not } true;~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_~i2~0#1 := 0; {147#false} is VALID [2022-02-20 18:31:46,686 INFO L290 TraceCheckUtils]: 19: Hoare triple {147#false} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {147#false} is VALID [2022-02-20 18:31:46,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {147#false} assume !(0 != ~mode1~0 % 256); {147#false} is VALID [2022-02-20 18:31:46,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {147#false} assume !(~r1~0 < 1); {147#false} is VALID [2022-02-20 18:31:46,687 INFO L290 TraceCheckUtils]: 22: Hoare triple {147#false} ~mode1~0 := 1; {147#false} is VALID [2022-02-20 18:31:46,687 INFO L290 TraceCheckUtils]: 23: Hoare triple {147#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {147#false} is VALID [2022-02-20 18:31:46,687 INFO L290 TraceCheckUtils]: 24: Hoare triple {147#false} assume !(0 != ~mode2~0 % 256); {147#false} is VALID [2022-02-20 18:31:46,687 INFO L290 TraceCheckUtils]: 25: Hoare triple {147#false} assume !(~r2~0 < 2); {147#false} is VALID [2022-02-20 18:31:46,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {147#false} ~mode2~0 := 1; {147#false} is VALID [2022-02-20 18:31:46,688 INFO L290 TraceCheckUtils]: 27: Hoare triple {147#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {147#false} is VALID [2022-02-20 18:31:46,688 INFO L290 TraceCheckUtils]: 28: Hoare triple {147#false} assume !(0 != ~mode3~0 % 256); {147#false} is VALID [2022-02-20 18:31:46,689 INFO L290 TraceCheckUtils]: 29: Hoare triple {147#false} assume !(~r3~0 < 2); {147#false} is VALID [2022-02-20 18:31:46,689 INFO L290 TraceCheckUtils]: 30: Hoare triple {147#false} ~mode3~0 := 1; {147#false} is VALID [2022-02-20 18:31:46,689 INFO L290 TraceCheckUtils]: 31: Hoare triple {147#false} assume { :end_inline_node3 } true;~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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {147#false} is VALID [2022-02-20 18:31:46,689 INFO L290 TraceCheckUtils]: 32: Hoare triple {147#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {147#false} is VALID [2022-02-20 18:31:46,690 INFO L290 TraceCheckUtils]: 33: Hoare triple {147#false} check_#res#1 := check_~tmp~1#1; {147#false} is VALID [2022-02-20 18:31:46,690 INFO L290 TraceCheckUtils]: 34: Hoare triple {147#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {147#false} is VALID [2022-02-20 18:31:46,690 INFO L290 TraceCheckUtils]: 35: Hoare triple {147#false} assume 0 == assert_~arg#1 % 256; {147#false} is VALID [2022-02-20 18:31:46,691 INFO L290 TraceCheckUtils]: 36: Hoare triple {147#false} assume !false; {147#false} is VALID [2022-02-20 18:31:46,692 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:31:46,692 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:46,693 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562329215] [2022-02-20 18:31:46,693 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562329215] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:46,694 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:46,694 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:31:46,695 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727044180] [2022-02-20 18:31:46,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:46,700 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-02-20 18:31:46,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:46,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:46,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:46,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:31:46,742 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:46,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:31:46,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:31:46,763 INFO L87 Difference]: Start difference. First operand has 143 states, 141 states have (on average 1.7588652482269505) internal successors, (248), 142 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:46,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:46,952 INFO L93 Difference]: Finished difference Result 227 states and 388 transitions. [2022-02-20 18:31:46,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:31:46,954 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-02-20 18:31:46,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:46,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:46,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 388 transitions. [2022-02-20 18:31:46,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:46,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 388 transitions. [2022-02-20 18:31:46,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 388 transitions. [2022-02-20 18:31:47,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 388 edges. 388 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:47,357 INFO L225 Difference]: With dead ends: 227 [2022-02-20 18:31:47,357 INFO L226 Difference]: Without dead ends: 139 [2022-02-20 18:31:47,361 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:31:47,368 INFO L933 BasicCegarLoop]: 245 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:31:47,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:47,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-02-20 18:31:47,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-02-20 18:31:47,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:47,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 139 states, 138 states have (on average 1.7463768115942029) internal successors, (241), 138 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:47,406 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 139 states, 138 states have (on average 1.7463768115942029) internal successors, (241), 138 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:47,407 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 139 states, 138 states have (on average 1.7463768115942029) internal successors, (241), 138 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:47,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:47,414 INFO L93 Difference]: Finished difference Result 139 states and 241 transitions. [2022-02-20 18:31:47,415 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 241 transitions. [2022-02-20 18:31:47,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:47,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:47,417 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 138 states have (on average 1.7463768115942029) internal successors, (241), 138 states have internal predecessors, (241), 0 states have call successors, (0), 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 139 states. [2022-02-20 18:31:47,417 INFO L87 Difference]: Start difference. First operand has 139 states, 138 states have (on average 1.7463768115942029) internal successors, (241), 138 states have internal predecessors, (241), 0 states have call successors, (0), 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 139 states. [2022-02-20 18:31:47,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:47,424 INFO L93 Difference]: Finished difference Result 139 states and 241 transitions. [2022-02-20 18:31:47,424 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 241 transitions. [2022-02-20 18:31:47,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:47,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:47,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:47,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:47,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.7463768115942029) internal successors, (241), 138 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:47,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 241 transitions. [2022-02-20 18:31:47,433 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 241 transitions. Word has length 37 [2022-02-20 18:31:47,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:47,433 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 241 transitions. [2022-02-20 18:31:47,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:47,434 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 241 transitions. [2022-02-20 18:31:47,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:31:47,435 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:47,436 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] [2022-02-20 18:31:47,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:31:47,436 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:47,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:47,437 INFO L85 PathProgramCache]: Analyzing trace with hash 2058913401, now seen corresponding path program 1 times [2022-02-20 18:31:47,437 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:47,437 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877543675] [2022-02-20 18:31:47,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:47,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:47,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {822#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(43, 2);call #Ultimate.allocInit(12, 3);~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; {822#true} is VALID [2022-02-20 18:31:47,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {822#true} is VALID [2022-02-20 18:31:47,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {822#true} is VALID [2022-02-20 18:31:47,568 INFO L290 TraceCheckUtils]: 3: Hoare triple {822#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {822#true} is VALID [2022-02-20 18:31:47,568 INFO L290 TraceCheckUtils]: 4: Hoare triple {822#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {822#true} is VALID [2022-02-20 18:31:47,568 INFO L290 TraceCheckUtils]: 5: Hoare triple {822#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {822#true} is VALID [2022-02-20 18:31:47,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {822#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {822#true} is VALID [2022-02-20 18:31:47,569 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {822#true} is VALID [2022-02-20 18:31:47,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {822#true} is VALID [2022-02-20 18:31:47,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {822#true} is VALID [2022-02-20 18:31:47,570 INFO L290 TraceCheckUtils]: 10: Hoare triple {822#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {822#true} is VALID [2022-02-20 18:31:47,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {822#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {822#true} is VALID [2022-02-20 18:31:47,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {822#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {822#true} is VALID [2022-02-20 18:31:47,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {822#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {822#true} is VALID [2022-02-20 18:31:47,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {822#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; {824#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} is VALID [2022-02-20 18:31:47,575 INFO L290 TraceCheckUtils]: 15: Hoare triple {824#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} init_#res#1 := init_~tmp___5~0#1; {825#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:31:47,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {825#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {826#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 18:31:47,578 INFO L290 TraceCheckUtils]: 17: Hoare triple {826#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {823#false} is VALID [2022-02-20 18:31:47,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {823#false} assume { :end_inline_assume_abort_if_not } true;~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_~i2~0#1 := 0; {823#false} is VALID [2022-02-20 18:31:47,579 INFO L290 TraceCheckUtils]: 19: Hoare triple {823#false} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {823#false} is VALID [2022-02-20 18:31:47,579 INFO L290 TraceCheckUtils]: 20: Hoare triple {823#false} assume !(0 != ~mode1~0 % 256); {823#false} is VALID [2022-02-20 18:31:47,579 INFO L290 TraceCheckUtils]: 21: Hoare triple {823#false} assume !(~r1~0 < 1); {823#false} is VALID [2022-02-20 18:31:47,579 INFO L290 TraceCheckUtils]: 22: Hoare triple {823#false} ~mode1~0 := 1; {823#false} is VALID [2022-02-20 18:31:47,579 INFO L290 TraceCheckUtils]: 23: Hoare triple {823#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {823#false} is VALID [2022-02-20 18:31:47,580 INFO L290 TraceCheckUtils]: 24: Hoare triple {823#false} assume !(0 != ~mode2~0 % 256); {823#false} is VALID [2022-02-20 18:31:47,580 INFO L290 TraceCheckUtils]: 25: Hoare triple {823#false} assume !(~r2~0 < 2); {823#false} is VALID [2022-02-20 18:31:47,580 INFO L290 TraceCheckUtils]: 26: Hoare triple {823#false} ~mode2~0 := 1; {823#false} is VALID [2022-02-20 18:31:47,581 INFO L290 TraceCheckUtils]: 27: Hoare triple {823#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {823#false} is VALID [2022-02-20 18:31:47,581 INFO L290 TraceCheckUtils]: 28: Hoare triple {823#false} assume !(0 != ~mode3~0 % 256); {823#false} is VALID [2022-02-20 18:31:47,581 INFO L290 TraceCheckUtils]: 29: Hoare triple {823#false} assume !(~r3~0 < 2); {823#false} is VALID [2022-02-20 18:31:47,581 INFO L290 TraceCheckUtils]: 30: Hoare triple {823#false} ~mode3~0 := 1; {823#false} is VALID [2022-02-20 18:31:47,582 INFO L290 TraceCheckUtils]: 31: Hoare triple {823#false} assume { :end_inline_node3 } true;~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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {823#false} is VALID [2022-02-20 18:31:47,582 INFO L290 TraceCheckUtils]: 32: Hoare triple {823#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {823#false} is VALID [2022-02-20 18:31:47,582 INFO L290 TraceCheckUtils]: 33: Hoare triple {823#false} check_#res#1 := check_~tmp~1#1; {823#false} is VALID [2022-02-20 18:31:47,582 INFO L290 TraceCheckUtils]: 34: Hoare triple {823#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {823#false} is VALID [2022-02-20 18:31:47,582 INFO L290 TraceCheckUtils]: 35: Hoare triple {823#false} assume 0 == assert_~arg#1 % 256; {823#false} is VALID [2022-02-20 18:31:47,583 INFO L290 TraceCheckUtils]: 36: Hoare triple {823#false} assume !false; {823#false} is VALID [2022-02-20 18:31:47,584 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:31:47,584 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:47,584 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877543675] [2022-02-20 18:31:47,585 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877543675] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:47,585 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:47,586 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:31:47,586 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618567353] [2022-02-20 18:31:47,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:47,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-02-20 18:31:47,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:47,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:47,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:47,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:31:47,615 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:47,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:31:47,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:31:47,616 INFO L87 Difference]: Start difference. First operand 139 states and 241 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:48,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:48,106 INFO L93 Difference]: Finished difference Result 222 states and 378 transitions. [2022-02-20 18:31:48,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:31:48,106 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-02-20 18:31:48,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:48,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:48,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 378 transitions. [2022-02-20 18:31:48,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:48,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 378 transitions. [2022-02-20 18:31:48,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 378 transitions. [2022-02-20 18:31:48,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 378 edges. 378 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:48,426 INFO L225 Difference]: With dead ends: 222 [2022-02-20 18:31:48,427 INFO L226 Difference]: Without dead ends: 139 [2022-02-20 18:31:48,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:31:48,429 INFO L933 BasicCegarLoop]: 239 mSDtfsCounter, 3 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:31:48,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 923 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:48,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-02-20 18:31:48,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-02-20 18:31:48,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:48,437 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 139 states, 138 states have (on average 1.5289855072463767) internal successors, (211), 138 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:48,437 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 139 states, 138 states have (on average 1.5289855072463767) internal successors, (211), 138 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:48,438 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 139 states, 138 states have (on average 1.5289855072463767) internal successors, (211), 138 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:48,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:48,442 INFO L93 Difference]: Finished difference Result 139 states and 211 transitions. [2022-02-20 18:31:48,442 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 211 transitions. [2022-02-20 18:31:48,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:48,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:48,444 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 138 states have (on average 1.5289855072463767) internal successors, (211), 138 states have internal predecessors, (211), 0 states have call successors, (0), 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 139 states. [2022-02-20 18:31:48,444 INFO L87 Difference]: Start difference. First operand has 139 states, 138 states have (on average 1.5289855072463767) internal successors, (211), 138 states have internal predecessors, (211), 0 states have call successors, (0), 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 139 states. [2022-02-20 18:31:48,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:48,449 INFO L93 Difference]: Finished difference Result 139 states and 211 transitions. [2022-02-20 18:31:48,449 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 211 transitions. [2022-02-20 18:31:48,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:48,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:48,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:48,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:48,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.5289855072463767) internal successors, (211), 138 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:48,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 211 transitions. [2022-02-20 18:31:48,456 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 211 transitions. Word has length 37 [2022-02-20 18:31:48,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:48,456 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 211 transitions. [2022-02-20 18:31:48,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:48,457 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 211 transitions. [2022-02-20 18:31:48,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:31:48,458 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:48,458 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] [2022-02-20 18:31:48,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:31:48,459 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:48,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:48,459 INFO L85 PathProgramCache]: Analyzing trace with hash -415118785, now seen corresponding path program 1 times [2022-02-20 18:31:48,460 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:48,460 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844330276] [2022-02-20 18:31:48,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:48,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:48,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {1499#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(43, 2);call #Ultimate.allocInit(12, 3);~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; {1499#true} is VALID [2022-02-20 18:31:48,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {1499#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {1499#true} is VALID [2022-02-20 18:31:48,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {1499#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {1499#true} is VALID [2022-02-20 18:31:48,553 INFO L290 TraceCheckUtils]: 3: Hoare triple {1499#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {1499#true} is VALID [2022-02-20 18:31:48,554 INFO L290 TraceCheckUtils]: 4: Hoare triple {1499#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {1499#true} is VALID [2022-02-20 18:31:48,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {1499#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {1499#true} is VALID [2022-02-20 18:31:48,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {1499#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {1499#true} is VALID [2022-02-20 18:31:48,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {1499#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {1499#true} is VALID [2022-02-20 18:31:48,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {1499#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {1499#true} is VALID [2022-02-20 18:31:48,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {1499#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {1499#true} is VALID [2022-02-20 18:31:48,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {1499#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {1499#true} is VALID [2022-02-20 18:31:48,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {1499#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {1499#true} is VALID [2022-02-20 18:31:48,555 INFO L290 TraceCheckUtils]: 12: Hoare triple {1499#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {1499#true} is VALID [2022-02-20 18:31:48,555 INFO L290 TraceCheckUtils]: 13: Hoare triple {1499#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {1499#true} is VALID [2022-02-20 18:31:48,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {1499#true} assume ~id1~0 != ~id2~0; {1499#true} is VALID [2022-02-20 18:31:48,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {1499#true} assume ~id1~0 != ~id3~0; {1499#true} is VALID [2022-02-20 18:31:48,556 INFO L290 TraceCheckUtils]: 16: Hoare triple {1499#true} assume ~id2~0 != ~id3~0; {1499#true} is VALID [2022-02-20 18:31:48,556 INFO L290 TraceCheckUtils]: 17: Hoare triple {1499#true} assume ~id1~0 >= 0; {1499#true} is VALID [2022-02-20 18:31:48,557 INFO L290 TraceCheckUtils]: 18: Hoare triple {1499#true} assume ~id2~0 >= 0; {1499#true} is VALID [2022-02-20 18:31:48,557 INFO L290 TraceCheckUtils]: 19: Hoare triple {1499#true} assume ~id3~0 >= 0; {1499#true} is VALID [2022-02-20 18:31:48,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {1499#true} assume 0 == ~r1~0; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:31:48,558 INFO L290 TraceCheckUtils]: 21: Hoare triple {1501#(<= ~r1~0 0)} assume 0 == ~r2~0; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:31:48,558 INFO L290 TraceCheckUtils]: 22: Hoare triple {1501#(<= ~r1~0 0)} assume 0 == ~r3~0; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:31:48,559 INFO L290 TraceCheckUtils]: 23: Hoare triple {1501#(<= ~r1~0 0)} assume 0 != init_~r122~0#1 % 256; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:31:48,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {1501#(<= ~r1~0 0)} assume 0 != init_~r132~0#1 % 256; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:31:48,560 INFO L290 TraceCheckUtils]: 25: Hoare triple {1501#(<= ~r1~0 0)} assume 0 != init_~r212~0#1 % 256; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:31:48,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {1501#(<= ~r1~0 0)} assume 0 != init_~r232~0#1 % 256; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:31:48,561 INFO L290 TraceCheckUtils]: 27: Hoare triple {1501#(<= ~r1~0 0)} assume 0 != init_~r312~0#1 % 256; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:31:48,561 INFO L290 TraceCheckUtils]: 28: Hoare triple {1501#(<= ~r1~0 0)} assume 0 != init_~r322~0#1 % 256; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:31:48,561 INFO L290 TraceCheckUtils]: 29: Hoare triple {1501#(<= ~r1~0 0)} assume ~max1~0 == ~id1~0; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:31:48,562 INFO L290 TraceCheckUtils]: 30: Hoare triple {1501#(<= ~r1~0 0)} assume ~max2~0 == ~id2~0; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:31:48,562 INFO L290 TraceCheckUtils]: 31: Hoare triple {1501#(<= ~r1~0 0)} assume ~max3~0 == ~id3~0; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:31:48,563 INFO L290 TraceCheckUtils]: 32: Hoare triple {1501#(<= ~r1~0 0)} assume 0 == ~st1~0; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:31:48,567 INFO L290 TraceCheckUtils]: 33: Hoare triple {1501#(<= ~r1~0 0)} assume 0 == ~st2~0; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:31:48,568 INFO L290 TraceCheckUtils]: 34: Hoare triple {1501#(<= ~r1~0 0)} assume 0 == ~st3~0; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:31:48,569 INFO L290 TraceCheckUtils]: 35: Hoare triple {1501#(<= ~r1~0 0)} assume 0 == ~nl1~0; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:31:48,569 INFO L290 TraceCheckUtils]: 36: Hoare triple {1501#(<= ~r1~0 0)} assume 0 == ~nl2~0; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:31:48,570 INFO L290 TraceCheckUtils]: 37: Hoare triple {1501#(<= ~r1~0 0)} assume 0 == ~nl3~0; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:31:48,571 INFO L290 TraceCheckUtils]: 38: Hoare triple {1501#(<= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:31:48,571 INFO L290 TraceCheckUtils]: 39: Hoare triple {1501#(<= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:31:48,572 INFO L290 TraceCheckUtils]: 40: Hoare triple {1501#(<= ~r1~0 0)} assume 0 == ~mode3~0 % 256; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:31:48,573 INFO L290 TraceCheckUtils]: 41: Hoare triple {1501#(<= ~r1~0 0)} assume 0 != ~newmax1~0 % 256; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:31:48,574 INFO L290 TraceCheckUtils]: 42: Hoare triple {1501#(<= ~r1~0 0)} assume 0 != ~newmax2~0 % 256; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:31:48,587 INFO L290 TraceCheckUtils]: 43: Hoare triple {1501#(<= ~r1~0 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:31:48,588 INFO L290 TraceCheckUtils]: 44: Hoare triple {1501#(<= ~r1~0 0)} init_#res#1 := init_~tmp___5~0#1; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:31:48,588 INFO L290 TraceCheckUtils]: 45: Hoare triple {1501#(<= ~r1~0 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:31:48,589 INFO L290 TraceCheckUtils]: 46: Hoare triple {1501#(<= ~r1~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:31:48,589 INFO L290 TraceCheckUtils]: 47: Hoare triple {1501#(<= ~r1~0 0)} assume { :end_inline_assume_abort_if_not } true;~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_~i2~0#1 := 0; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:31:48,590 INFO L290 TraceCheckUtils]: 48: Hoare triple {1501#(<= ~r1~0 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:31:48,590 INFO L290 TraceCheckUtils]: 49: Hoare triple {1501#(<= ~r1~0 0)} assume !(0 != ~mode1~0 % 256); {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:31:48,591 INFO L290 TraceCheckUtils]: 50: Hoare triple {1501#(<= ~r1~0 0)} assume !(~r1~0 < 1); {1500#false} is VALID [2022-02-20 18:31:48,591 INFO L290 TraceCheckUtils]: 51: Hoare triple {1500#false} ~mode1~0 := 1; {1500#false} is VALID [2022-02-20 18:31:48,591 INFO L290 TraceCheckUtils]: 52: Hoare triple {1500#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {1500#false} is VALID [2022-02-20 18:31:48,591 INFO L290 TraceCheckUtils]: 53: Hoare triple {1500#false} assume !(0 != ~mode2~0 % 256); {1500#false} is VALID [2022-02-20 18:31:48,591 INFO L290 TraceCheckUtils]: 54: Hoare triple {1500#false} assume !(~r2~0 < 2); {1500#false} is VALID [2022-02-20 18:31:48,591 INFO L290 TraceCheckUtils]: 55: Hoare triple {1500#false} ~mode2~0 := 1; {1500#false} is VALID [2022-02-20 18:31:48,591 INFO L290 TraceCheckUtils]: 56: Hoare triple {1500#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {1500#false} is VALID [2022-02-20 18:31:48,592 INFO L290 TraceCheckUtils]: 57: Hoare triple {1500#false} assume !(0 != ~mode3~0 % 256); {1500#false} is VALID [2022-02-20 18:31:48,592 INFO L290 TraceCheckUtils]: 58: Hoare triple {1500#false} assume !(~r3~0 < 2); {1500#false} is VALID [2022-02-20 18:31:48,592 INFO L290 TraceCheckUtils]: 59: Hoare triple {1500#false} ~mode3~0 := 1; {1500#false} is VALID [2022-02-20 18:31:48,592 INFO L290 TraceCheckUtils]: 60: Hoare triple {1500#false} assume { :end_inline_node3 } true;~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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1500#false} is VALID [2022-02-20 18:31:48,592 INFO L290 TraceCheckUtils]: 61: Hoare triple {1500#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {1500#false} is VALID [2022-02-20 18:31:48,592 INFO L290 TraceCheckUtils]: 62: Hoare triple {1500#false} check_#res#1 := check_~tmp~1#1; {1500#false} is VALID [2022-02-20 18:31:48,592 INFO L290 TraceCheckUtils]: 63: Hoare triple {1500#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1500#false} is VALID [2022-02-20 18:31:48,593 INFO L290 TraceCheckUtils]: 64: Hoare triple {1500#false} assume 0 == assert_~arg#1 % 256; {1500#false} is VALID [2022-02-20 18:31:48,593 INFO L290 TraceCheckUtils]: 65: Hoare triple {1500#false} assume !false; {1500#false} is VALID [2022-02-20 18:31:48,593 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:31:48,593 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:48,594 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844330276] [2022-02-20 18:31:48,594 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844330276] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:48,594 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:48,594 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:31:48,594 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010305411] [2022-02-20 18:31:48,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:48,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:31:48,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:48,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:48,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:48,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:31:48,646 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:48,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:31:48,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:31:48,647 INFO L87 Difference]: Start difference. First operand 139 states and 211 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:48,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:48,881 INFO L93 Difference]: Finished difference Result 279 states and 445 transitions. [2022-02-20 18:31:48,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:31:48,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:31:48,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:48,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:48,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2022-02-20 18:31:48,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:48,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2022-02-20 18:31:48,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 445 transitions. [2022-02-20 18:31:49,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 445 edges. 445 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:49,224 INFO L225 Difference]: With dead ends: 279 [2022-02-20 18:31:49,224 INFO L226 Difference]: Without dead ends: 200 [2022-02-20 18:31:49,225 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:31:49,226 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 107 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:31:49,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 360 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:49,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-02-20 18:31:49,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2022-02-20 18:31:49,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:49,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand has 198 states, 197 states have (on average 1.5532994923857868) internal successors, (306), 197 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:49,241 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand has 198 states, 197 states have (on average 1.5532994923857868) internal successors, (306), 197 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:49,241 INFO L87 Difference]: Start difference. First operand 200 states. Second operand has 198 states, 197 states have (on average 1.5532994923857868) internal successors, (306), 197 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:49,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:49,247 INFO L93 Difference]: Finished difference Result 200 states and 307 transitions. [2022-02-20 18:31:49,247 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 307 transitions. [2022-02-20 18:31:49,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:49,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:49,248 INFO L74 IsIncluded]: Start isIncluded. First operand has 198 states, 197 states have (on average 1.5532994923857868) internal successors, (306), 197 states have internal predecessors, (306), 0 states have call successors, (0), 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 200 states. [2022-02-20 18:31:49,249 INFO L87 Difference]: Start difference. First operand has 198 states, 197 states have (on average 1.5532994923857868) internal successors, (306), 197 states have internal predecessors, (306), 0 states have call successors, (0), 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 200 states. [2022-02-20 18:31:49,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:49,255 INFO L93 Difference]: Finished difference Result 200 states and 307 transitions. [2022-02-20 18:31:49,255 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 307 transitions. [2022-02-20 18:31:49,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:49,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:49,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:49,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:49,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 1.5532994923857868) internal successors, (306), 197 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:49,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 306 transitions. [2022-02-20 18:31:49,262 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 306 transitions. Word has length 66 [2022-02-20 18:31:49,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:49,263 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 306 transitions. [2022-02-20 18:31:49,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:49,263 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 306 transitions. [2022-02-20 18:31:49,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 18:31:49,264 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:49,264 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] [2022-02-20 18:31:49,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:31:49,264 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:49,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:49,265 INFO L85 PathProgramCache]: Analyzing trace with hash 928134868, now seen corresponding path program 1 times [2022-02-20 18:31:49,265 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:49,265 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083697778] [2022-02-20 18:31:49,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:49,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:49,379 INFO L290 TraceCheckUtils]: 0: Hoare triple {2423#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(43, 2);call #Ultimate.allocInit(12, 3);~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; {2423#true} is VALID [2022-02-20 18:31:49,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {2423#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {2423#true} is VALID [2022-02-20 18:31:49,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {2423#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {2423#true} is VALID [2022-02-20 18:31:49,380 INFO L290 TraceCheckUtils]: 3: Hoare triple {2423#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {2423#true} is VALID [2022-02-20 18:31:49,381 INFO L290 TraceCheckUtils]: 4: Hoare triple {2423#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {2423#true} is VALID [2022-02-20 18:31:49,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {2423#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {2423#true} is VALID [2022-02-20 18:31:49,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {2423#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {2423#true} is VALID [2022-02-20 18:31:49,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {2423#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {2423#true} is VALID [2022-02-20 18:31:49,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {2423#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {2423#true} is VALID [2022-02-20 18:31:49,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {2423#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {2423#true} is VALID [2022-02-20 18:31:49,382 INFO L290 TraceCheckUtils]: 10: Hoare triple {2423#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {2423#true} is VALID [2022-02-20 18:31:49,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {2423#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {2423#true} is VALID [2022-02-20 18:31:49,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {2423#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {2423#true} is VALID [2022-02-20 18:31:49,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {2423#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {2423#true} is VALID [2022-02-20 18:31:49,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {2423#true} assume ~id1~0 != ~id2~0; {2423#true} is VALID [2022-02-20 18:31:49,383 INFO L290 TraceCheckUtils]: 15: Hoare triple {2423#true} assume ~id1~0 != ~id3~0; {2423#true} is VALID [2022-02-20 18:31:49,383 INFO L290 TraceCheckUtils]: 16: Hoare triple {2423#true} assume ~id2~0 != ~id3~0; {2423#true} is VALID [2022-02-20 18:31:49,383 INFO L290 TraceCheckUtils]: 17: Hoare triple {2423#true} assume ~id1~0 >= 0; {2423#true} is VALID [2022-02-20 18:31:49,383 INFO L290 TraceCheckUtils]: 18: Hoare triple {2423#true} assume ~id2~0 >= 0; {2423#true} is VALID [2022-02-20 18:31:49,383 INFO L290 TraceCheckUtils]: 19: Hoare triple {2423#true} assume ~id3~0 >= 0; {2423#true} is VALID [2022-02-20 18:31:49,383 INFO L290 TraceCheckUtils]: 20: Hoare triple {2423#true} assume 0 == ~r1~0; {2423#true} is VALID [2022-02-20 18:31:49,384 INFO L290 TraceCheckUtils]: 21: Hoare triple {2423#true} assume 0 == ~r2~0; {2425#(<= ~r2~0 0)} is VALID [2022-02-20 18:31:49,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {2425#(<= ~r2~0 0)} assume 0 == ~r3~0; {2425#(<= ~r2~0 0)} is VALID [2022-02-20 18:31:49,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {2425#(<= ~r2~0 0)} assume 0 != init_~r122~0#1 % 256; {2425#(<= ~r2~0 0)} is VALID [2022-02-20 18:31:49,385 INFO L290 TraceCheckUtils]: 24: Hoare triple {2425#(<= ~r2~0 0)} assume 0 != init_~r132~0#1 % 256; {2425#(<= ~r2~0 0)} is VALID [2022-02-20 18:31:49,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {2425#(<= ~r2~0 0)} assume 0 != init_~r212~0#1 % 256; {2425#(<= ~r2~0 0)} is VALID [2022-02-20 18:31:49,385 INFO L290 TraceCheckUtils]: 26: Hoare triple {2425#(<= ~r2~0 0)} assume 0 != init_~r232~0#1 % 256; {2425#(<= ~r2~0 0)} is VALID [2022-02-20 18:31:49,385 INFO L290 TraceCheckUtils]: 27: Hoare triple {2425#(<= ~r2~0 0)} assume 0 != init_~r312~0#1 % 256; {2425#(<= ~r2~0 0)} is VALID [2022-02-20 18:31:49,386 INFO L290 TraceCheckUtils]: 28: Hoare triple {2425#(<= ~r2~0 0)} assume 0 != init_~r322~0#1 % 256; {2425#(<= ~r2~0 0)} is VALID [2022-02-20 18:31:49,386 INFO L290 TraceCheckUtils]: 29: Hoare triple {2425#(<= ~r2~0 0)} assume ~max1~0 == ~id1~0; {2425#(<= ~r2~0 0)} is VALID [2022-02-20 18:31:49,386 INFO L290 TraceCheckUtils]: 30: Hoare triple {2425#(<= ~r2~0 0)} assume ~max2~0 == ~id2~0; {2425#(<= ~r2~0 0)} is VALID [2022-02-20 18:31:49,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {2425#(<= ~r2~0 0)} assume ~max3~0 == ~id3~0; {2425#(<= ~r2~0 0)} is VALID [2022-02-20 18:31:49,387 INFO L290 TraceCheckUtils]: 32: Hoare triple {2425#(<= ~r2~0 0)} assume 0 == ~st1~0; {2425#(<= ~r2~0 0)} is VALID [2022-02-20 18:31:49,387 INFO L290 TraceCheckUtils]: 33: Hoare triple {2425#(<= ~r2~0 0)} assume 0 == ~st2~0; {2425#(<= ~r2~0 0)} is VALID [2022-02-20 18:31:49,388 INFO L290 TraceCheckUtils]: 34: Hoare triple {2425#(<= ~r2~0 0)} assume 0 == ~st3~0; {2425#(<= ~r2~0 0)} is VALID [2022-02-20 18:31:49,388 INFO L290 TraceCheckUtils]: 35: Hoare triple {2425#(<= ~r2~0 0)} assume 0 == ~nl1~0; {2425#(<= ~r2~0 0)} is VALID [2022-02-20 18:31:49,389 INFO L290 TraceCheckUtils]: 36: Hoare triple {2425#(<= ~r2~0 0)} assume 0 == ~nl2~0; {2425#(<= ~r2~0 0)} is VALID [2022-02-20 18:31:49,389 INFO L290 TraceCheckUtils]: 37: Hoare triple {2425#(<= ~r2~0 0)} assume 0 == ~nl3~0; {2425#(<= ~r2~0 0)} is VALID [2022-02-20 18:31:49,390 INFO L290 TraceCheckUtils]: 38: Hoare triple {2425#(<= ~r2~0 0)} assume 0 == ~mode1~0 % 256; {2425#(<= ~r2~0 0)} is VALID [2022-02-20 18:31:49,390 INFO L290 TraceCheckUtils]: 39: Hoare triple {2425#(<= ~r2~0 0)} assume 0 == ~mode2~0 % 256; {2425#(<= ~r2~0 0)} is VALID [2022-02-20 18:31:49,391 INFO L290 TraceCheckUtils]: 40: Hoare triple {2425#(<= ~r2~0 0)} assume 0 == ~mode3~0 % 256; {2425#(<= ~r2~0 0)} is VALID [2022-02-20 18:31:49,391 INFO L290 TraceCheckUtils]: 41: Hoare triple {2425#(<= ~r2~0 0)} assume 0 != ~newmax1~0 % 256; {2425#(<= ~r2~0 0)} is VALID [2022-02-20 18:31:49,391 INFO L290 TraceCheckUtils]: 42: Hoare triple {2425#(<= ~r2~0 0)} assume 0 != ~newmax2~0 % 256; {2425#(<= ~r2~0 0)} is VALID [2022-02-20 18:31:49,392 INFO L290 TraceCheckUtils]: 43: Hoare triple {2425#(<= ~r2~0 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {2425#(<= ~r2~0 0)} is VALID [2022-02-20 18:31:49,392 INFO L290 TraceCheckUtils]: 44: Hoare triple {2425#(<= ~r2~0 0)} init_#res#1 := init_~tmp___5~0#1; {2425#(<= ~r2~0 0)} is VALID [2022-02-20 18:31:49,392 INFO L290 TraceCheckUtils]: 45: Hoare triple {2425#(<= ~r2~0 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2425#(<= ~r2~0 0)} is VALID [2022-02-20 18:31:49,392 INFO L290 TraceCheckUtils]: 46: Hoare triple {2425#(<= ~r2~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {2425#(<= ~r2~0 0)} is VALID [2022-02-20 18:31:49,393 INFO L290 TraceCheckUtils]: 47: Hoare triple {2425#(<= ~r2~0 0)} assume { :end_inline_assume_abort_if_not } true;~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_~i2~0#1 := 0; {2425#(<= ~r2~0 0)} is VALID [2022-02-20 18:31:49,393 INFO L290 TraceCheckUtils]: 48: Hoare triple {2425#(<= ~r2~0 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {2425#(<= ~r2~0 0)} is VALID [2022-02-20 18:31:49,393 INFO L290 TraceCheckUtils]: 49: Hoare triple {2425#(<= ~r2~0 0)} assume !(0 != ~mode1~0 % 256); {2425#(<= ~r2~0 0)} is VALID [2022-02-20 18:31:49,394 INFO L290 TraceCheckUtils]: 50: Hoare triple {2425#(<= ~r2~0 0)} assume ~r1~0 < 1; {2425#(<= ~r2~0 0)} is VALID [2022-02-20 18:31:49,395 INFO L290 TraceCheckUtils]: 51: Hoare triple {2425#(<= ~r2~0 0)} assume !(0 != ~ep12~0 % 256); {2425#(<= ~r2~0 0)} is VALID [2022-02-20 18:31:49,396 INFO L290 TraceCheckUtils]: 52: Hoare triple {2425#(<= ~r2~0 0)} assume !(0 != ~ep13~0 % 256); {2425#(<= ~r2~0 0)} is VALID [2022-02-20 18:31:49,396 INFO L290 TraceCheckUtils]: 53: Hoare triple {2425#(<= ~r2~0 0)} ~mode1~0 := 1; {2425#(<= ~r2~0 0)} is VALID [2022-02-20 18:31:49,396 INFO L290 TraceCheckUtils]: 54: Hoare triple {2425#(<= ~r2~0 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {2425#(<= ~r2~0 0)} is VALID [2022-02-20 18:31:49,397 INFO L290 TraceCheckUtils]: 55: Hoare triple {2425#(<= ~r2~0 0)} assume !(0 != ~mode2~0 % 256); {2425#(<= ~r2~0 0)} is VALID [2022-02-20 18:31:49,398 INFO L290 TraceCheckUtils]: 56: Hoare triple {2425#(<= ~r2~0 0)} assume !(~r2~0 < 2); {2424#false} is VALID [2022-02-20 18:31:49,398 INFO L290 TraceCheckUtils]: 57: Hoare triple {2424#false} ~mode2~0 := 1; {2424#false} is VALID [2022-02-20 18:31:49,398 INFO L290 TraceCheckUtils]: 58: Hoare triple {2424#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {2424#false} is VALID [2022-02-20 18:31:49,398 INFO L290 TraceCheckUtils]: 59: Hoare triple {2424#false} assume !(0 != ~mode3~0 % 256); {2424#false} is VALID [2022-02-20 18:31:49,398 INFO L290 TraceCheckUtils]: 60: Hoare triple {2424#false} assume !(~r3~0 < 2); {2424#false} is VALID [2022-02-20 18:31:49,398 INFO L290 TraceCheckUtils]: 61: Hoare triple {2424#false} ~mode3~0 := 1; {2424#false} is VALID [2022-02-20 18:31:49,398 INFO L290 TraceCheckUtils]: 62: Hoare triple {2424#false} assume { :end_inline_node3 } true;~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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {2424#false} is VALID [2022-02-20 18:31:49,398 INFO L290 TraceCheckUtils]: 63: Hoare triple {2424#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {2424#false} is VALID [2022-02-20 18:31:49,399 INFO L290 TraceCheckUtils]: 64: Hoare triple {2424#false} check_#res#1 := check_~tmp~1#1; {2424#false} is VALID [2022-02-20 18:31:49,399 INFO L290 TraceCheckUtils]: 65: Hoare triple {2424#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {2424#false} is VALID [2022-02-20 18:31:49,399 INFO L290 TraceCheckUtils]: 66: Hoare triple {2424#false} assume 0 == assert_~arg#1 % 256; {2424#false} is VALID [2022-02-20 18:31:49,399 INFO L290 TraceCheckUtils]: 67: Hoare triple {2424#false} assume !false; {2424#false} is VALID [2022-02-20 18:31:49,399 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:31:49,399 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:49,400 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083697778] [2022-02-20 18:31:49,400 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083697778] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:49,400 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:49,400 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:31:49,400 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055278306] [2022-02-20 18:31:49,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:49,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2022-02-20 18:31:49,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:49,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:49,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:49,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:31:49,450 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:49,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:31:49,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:31:49,451 INFO L87 Difference]: Start difference. First operand 198 states and 306 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:49,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:49,686 INFO L93 Difference]: Finished difference Result 458 states and 734 transitions. [2022-02-20 18:31:49,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:31:49,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2022-02-20 18:31:49,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:49,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:49,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 463 transitions. [2022-02-20 18:31:49,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:49,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 463 transitions. [2022-02-20 18:31:49,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 463 transitions. [2022-02-20 18:31:50,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 463 edges. 463 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:50,013 INFO L225 Difference]: With dead ends: 458 [2022-02-20 18:31:50,013 INFO L226 Difference]: Without dead ends: 320 [2022-02-20 18:31:50,014 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:31:50,015 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 109 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:31:50,015 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 386 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:50,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-02-20 18:31:50,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 318. [2022-02-20 18:31:50,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:50,056 INFO L82 GeneralOperation]: Start isEquivalent. First operand 320 states. Second operand has 318 states, 317 states have (on average 1.586750788643533) internal successors, (503), 317 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:50,057 INFO L74 IsIncluded]: Start isIncluded. First operand 320 states. Second operand has 318 states, 317 states have (on average 1.586750788643533) internal successors, (503), 317 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:50,058 INFO L87 Difference]: Start difference. First operand 320 states. Second operand has 318 states, 317 states have (on average 1.586750788643533) internal successors, (503), 317 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:50,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:50,067 INFO L93 Difference]: Finished difference Result 320 states and 504 transitions. [2022-02-20 18:31:50,067 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 504 transitions. [2022-02-20 18:31:50,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:50,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:50,069 INFO L74 IsIncluded]: Start isIncluded. First operand has 318 states, 317 states have (on average 1.586750788643533) internal successors, (503), 317 states have internal predecessors, (503), 0 states have call successors, (0), 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 320 states. [2022-02-20 18:31:50,070 INFO L87 Difference]: Start difference. First operand has 318 states, 317 states have (on average 1.586750788643533) internal successors, (503), 317 states have internal predecessors, (503), 0 states have call successors, (0), 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 320 states. [2022-02-20 18:31:50,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:50,080 INFO L93 Difference]: Finished difference Result 320 states and 504 transitions. [2022-02-20 18:31:50,080 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 504 transitions. [2022-02-20 18:31:50,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:50,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:50,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:50,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:50,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 317 states have (on average 1.586750788643533) internal successors, (503), 317 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:50,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 503 transitions. [2022-02-20 18:31:50,092 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 503 transitions. Word has length 68 [2022-02-20 18:31:50,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:50,092 INFO L470 AbstractCegarLoop]: Abstraction has 318 states and 503 transitions. [2022-02-20 18:31:50,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:50,093 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 503 transitions. [2022-02-20 18:31:50,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 18:31:50,093 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:50,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] [2022-02-20 18:31:50,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:31:50,094 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:50,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:50,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1295175881, now seen corresponding path program 1 times [2022-02-20 18:31:50,094 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:50,095 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111678515] [2022-02-20 18:31:50,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:50,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:50,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:50,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {3926#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(43, 2);call #Ultimate.allocInit(12, 3);~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; {3926#true} is VALID [2022-02-20 18:31:50,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {3926#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {3926#true} is VALID [2022-02-20 18:31:50,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {3926#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {3926#true} is VALID [2022-02-20 18:31:50,168 INFO L290 TraceCheckUtils]: 3: Hoare triple {3926#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {3926#true} is VALID [2022-02-20 18:31:50,168 INFO L290 TraceCheckUtils]: 4: Hoare triple {3926#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {3926#true} is VALID [2022-02-20 18:31:50,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {3926#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {3926#true} is VALID [2022-02-20 18:31:50,168 INFO L290 TraceCheckUtils]: 6: Hoare triple {3926#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {3926#true} is VALID [2022-02-20 18:31:50,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {3926#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {3926#true} is VALID [2022-02-20 18:31:50,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {3926#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {3926#true} is VALID [2022-02-20 18:31:50,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {3926#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {3926#true} is VALID [2022-02-20 18:31:50,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {3926#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {3926#true} is VALID [2022-02-20 18:31:50,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {3926#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {3926#true} is VALID [2022-02-20 18:31:50,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {3926#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {3926#true} is VALID [2022-02-20 18:31:50,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {3926#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {3926#true} is VALID [2022-02-20 18:31:50,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {3926#true} assume ~id1~0 != ~id2~0; {3926#true} is VALID [2022-02-20 18:31:50,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {3926#true} assume ~id1~0 != ~id3~0; {3926#true} is VALID [2022-02-20 18:31:50,170 INFO L290 TraceCheckUtils]: 16: Hoare triple {3926#true} assume ~id2~0 != ~id3~0; {3926#true} is VALID [2022-02-20 18:31:50,170 INFO L290 TraceCheckUtils]: 17: Hoare triple {3926#true} assume ~id1~0 >= 0; {3926#true} is VALID [2022-02-20 18:31:50,170 INFO L290 TraceCheckUtils]: 18: Hoare triple {3926#true} assume ~id2~0 >= 0; {3926#true} is VALID [2022-02-20 18:31:50,170 INFO L290 TraceCheckUtils]: 19: Hoare triple {3926#true} assume ~id3~0 >= 0; {3926#true} is VALID [2022-02-20 18:31:50,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {3926#true} assume 0 == ~r1~0; {3926#true} is VALID [2022-02-20 18:31:50,170 INFO L290 TraceCheckUtils]: 21: Hoare triple {3926#true} assume 0 == ~r2~0; {3926#true} is VALID [2022-02-20 18:31:50,171 INFO L290 TraceCheckUtils]: 22: Hoare triple {3926#true} assume 0 == ~r3~0; {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,171 INFO L290 TraceCheckUtils]: 23: Hoare triple {3928#(<= ~r3~0 0)} assume 0 != init_~r122~0#1 % 256; {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,171 INFO L290 TraceCheckUtils]: 24: Hoare triple {3928#(<= ~r3~0 0)} assume 0 != init_~r132~0#1 % 256; {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,172 INFO L290 TraceCheckUtils]: 25: Hoare triple {3928#(<= ~r3~0 0)} assume 0 != init_~r212~0#1 % 256; {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,172 INFO L290 TraceCheckUtils]: 26: Hoare triple {3928#(<= ~r3~0 0)} assume 0 != init_~r232~0#1 % 256; {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,172 INFO L290 TraceCheckUtils]: 27: Hoare triple {3928#(<= ~r3~0 0)} assume 0 != init_~r312~0#1 % 256; {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,173 INFO L290 TraceCheckUtils]: 28: Hoare triple {3928#(<= ~r3~0 0)} assume 0 != init_~r322~0#1 % 256; {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,173 INFO L290 TraceCheckUtils]: 29: Hoare triple {3928#(<= ~r3~0 0)} assume ~max1~0 == ~id1~0; {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,173 INFO L290 TraceCheckUtils]: 30: Hoare triple {3928#(<= ~r3~0 0)} assume ~max2~0 == ~id2~0; {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,174 INFO L290 TraceCheckUtils]: 31: Hoare triple {3928#(<= ~r3~0 0)} assume ~max3~0 == ~id3~0; {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,174 INFO L290 TraceCheckUtils]: 32: Hoare triple {3928#(<= ~r3~0 0)} assume 0 == ~st1~0; {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,174 INFO L290 TraceCheckUtils]: 33: Hoare triple {3928#(<= ~r3~0 0)} assume 0 == ~st2~0; {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,175 INFO L290 TraceCheckUtils]: 34: Hoare triple {3928#(<= ~r3~0 0)} assume 0 == ~st3~0; {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,175 INFO L290 TraceCheckUtils]: 35: Hoare triple {3928#(<= ~r3~0 0)} assume 0 == ~nl1~0; {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,175 INFO L290 TraceCheckUtils]: 36: Hoare triple {3928#(<= ~r3~0 0)} assume 0 == ~nl2~0; {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,176 INFO L290 TraceCheckUtils]: 37: Hoare triple {3928#(<= ~r3~0 0)} assume 0 == ~nl3~0; {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,176 INFO L290 TraceCheckUtils]: 38: Hoare triple {3928#(<= ~r3~0 0)} assume 0 == ~mode1~0 % 256; {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,176 INFO L290 TraceCheckUtils]: 39: Hoare triple {3928#(<= ~r3~0 0)} assume 0 == ~mode2~0 % 256; {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,176 INFO L290 TraceCheckUtils]: 40: Hoare triple {3928#(<= ~r3~0 0)} assume 0 == ~mode3~0 % 256; {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,177 INFO L290 TraceCheckUtils]: 41: Hoare triple {3928#(<= ~r3~0 0)} assume 0 != ~newmax1~0 % 256; {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,177 INFO L290 TraceCheckUtils]: 42: Hoare triple {3928#(<= ~r3~0 0)} assume 0 != ~newmax2~0 % 256; {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,177 INFO L290 TraceCheckUtils]: 43: Hoare triple {3928#(<= ~r3~0 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,178 INFO L290 TraceCheckUtils]: 44: Hoare triple {3928#(<= ~r3~0 0)} init_#res#1 := init_~tmp___5~0#1; {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,178 INFO L290 TraceCheckUtils]: 45: Hoare triple {3928#(<= ~r3~0 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,178 INFO L290 TraceCheckUtils]: 46: Hoare triple {3928#(<= ~r3~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,179 INFO L290 TraceCheckUtils]: 47: Hoare triple {3928#(<= ~r3~0 0)} assume { :end_inline_assume_abort_if_not } true;~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_~i2~0#1 := 0; {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,179 INFO L290 TraceCheckUtils]: 48: Hoare triple {3928#(<= ~r3~0 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,179 INFO L290 TraceCheckUtils]: 49: Hoare triple {3928#(<= ~r3~0 0)} assume !(0 != ~mode1~0 % 256); {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,180 INFO L290 TraceCheckUtils]: 50: Hoare triple {3928#(<= ~r3~0 0)} assume ~r1~0 < 1; {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,180 INFO L290 TraceCheckUtils]: 51: Hoare triple {3928#(<= ~r3~0 0)} assume !(0 != ~ep12~0 % 256); {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,180 INFO L290 TraceCheckUtils]: 52: Hoare triple {3928#(<= ~r3~0 0)} assume !(0 != ~ep13~0 % 256); {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,181 INFO L290 TraceCheckUtils]: 53: Hoare triple {3928#(<= ~r3~0 0)} ~mode1~0 := 1; {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,181 INFO L290 TraceCheckUtils]: 54: Hoare triple {3928#(<= ~r3~0 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,181 INFO L290 TraceCheckUtils]: 55: Hoare triple {3928#(<= ~r3~0 0)} assume !(0 != ~mode2~0 % 256); {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,182 INFO L290 TraceCheckUtils]: 56: Hoare triple {3928#(<= ~r3~0 0)} assume ~r2~0 < 2; {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,182 INFO L290 TraceCheckUtils]: 57: Hoare triple {3928#(<= ~r3~0 0)} assume !(0 != ~ep21~0 % 256); {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,182 INFO L290 TraceCheckUtils]: 58: Hoare triple {3928#(<= ~r3~0 0)} assume !(0 != ~ep23~0 % 256); {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,183 INFO L290 TraceCheckUtils]: 59: Hoare triple {3928#(<= ~r3~0 0)} ~mode2~0 := 1; {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,183 INFO L290 TraceCheckUtils]: 60: Hoare triple {3928#(<= ~r3~0 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,183 INFO L290 TraceCheckUtils]: 61: Hoare triple {3928#(<= ~r3~0 0)} assume !(0 != ~mode3~0 % 256); {3928#(<= ~r3~0 0)} is VALID [2022-02-20 18:31:50,184 INFO L290 TraceCheckUtils]: 62: Hoare triple {3928#(<= ~r3~0 0)} assume !(~r3~0 < 2); {3927#false} is VALID [2022-02-20 18:31:50,184 INFO L290 TraceCheckUtils]: 63: Hoare triple {3927#false} ~mode3~0 := 1; {3927#false} is VALID [2022-02-20 18:31:50,184 INFO L290 TraceCheckUtils]: 64: Hoare triple {3927#false} assume { :end_inline_node3 } true;~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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {3927#false} is VALID [2022-02-20 18:31:50,184 INFO L290 TraceCheckUtils]: 65: Hoare triple {3927#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {3927#false} is VALID [2022-02-20 18:31:50,184 INFO L290 TraceCheckUtils]: 66: Hoare triple {3927#false} check_#res#1 := check_~tmp~1#1; {3927#false} is VALID [2022-02-20 18:31:50,185 INFO L290 TraceCheckUtils]: 67: Hoare triple {3927#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {3927#false} is VALID [2022-02-20 18:31:50,185 INFO L290 TraceCheckUtils]: 68: Hoare triple {3927#false} assume 0 == assert_~arg#1 % 256; {3927#false} is VALID [2022-02-20 18:31:50,185 INFO L290 TraceCheckUtils]: 69: Hoare triple {3927#false} assume !false; {3927#false} is VALID [2022-02-20 18:31:50,185 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:31:50,185 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:50,185 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111678515] [2022-02-20 18:31:50,186 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111678515] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:50,186 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:50,186 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:31:50,186 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834582526] [2022-02-20 18:31:50,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:50,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2022-02-20 18:31:50,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:50,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:50,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:50,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:31:50,241 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:50,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:31:50,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:31:50,241 INFO L87 Difference]: Start difference. First operand 318 states and 503 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:50,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:50,567 INFO L93 Difference]: Finished difference Result 802 states and 1297 transitions. [2022-02-20 18:31:50,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:31:50,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2022-02-20 18:31:50,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:50,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:50,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 463 transitions. [2022-02-20 18:31:50,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:50,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 463 transitions. [2022-02-20 18:31:50,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 463 transitions. [2022-02-20 18:31:50,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 463 edges. 463 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:50,927 INFO L225 Difference]: With dead ends: 802 [2022-02-20 18:31:50,927 INFO L226 Difference]: Without dead ends: 544 [2022-02-20 18:31:50,928 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:31:50,929 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 103 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:31:50,929 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 387 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:50,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2022-02-20 18:31:50,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 542. [2022-02-20 18:31:50,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:50,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 544 states. Second operand has 542 states, 541 states have (on average 1.6025878003696858) internal successors, (867), 541 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:50,990 INFO L74 IsIncluded]: Start isIncluded. First operand 544 states. Second operand has 542 states, 541 states have (on average 1.6025878003696858) internal successors, (867), 541 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:50,991 INFO L87 Difference]: Start difference. First operand 544 states. Second operand has 542 states, 541 states have (on average 1.6025878003696858) internal successors, (867), 541 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:51,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:51,008 INFO L93 Difference]: Finished difference Result 544 states and 868 transitions. [2022-02-20 18:31:51,008 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 868 transitions. [2022-02-20 18:31:51,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:51,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:51,011 INFO L74 IsIncluded]: Start isIncluded. First operand has 542 states, 541 states have (on average 1.6025878003696858) internal successors, (867), 541 states have internal predecessors, (867), 0 states have call successors, (0), 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 544 states. [2022-02-20 18:31:51,012 INFO L87 Difference]: Start difference. First operand has 542 states, 541 states have (on average 1.6025878003696858) internal successors, (867), 541 states have internal predecessors, (867), 0 states have call successors, (0), 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 544 states. [2022-02-20 18:31:51,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:51,029 INFO L93 Difference]: Finished difference Result 544 states and 868 transitions. [2022-02-20 18:31:51,029 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 868 transitions. [2022-02-20 18:31:51,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:51,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:51,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:51,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:51,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 1.6025878003696858) internal successors, (867), 541 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:51,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 867 transitions. [2022-02-20 18:31:51,048 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 867 transitions. Word has length 70 [2022-02-20 18:31:51,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:51,049 INFO L470 AbstractCegarLoop]: Abstraction has 542 states and 867 transitions. [2022-02-20 18:31:51,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:51,049 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 867 transitions. [2022-02-20 18:31:51,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 18:31:51,050 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:51,050 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] [2022-02-20 18:31:51,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:31:51,050 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:51,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:51,051 INFO L85 PathProgramCache]: Analyzing trace with hash -367652834, now seen corresponding path program 1 times [2022-02-20 18:31:51,051 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:51,051 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309880602] [2022-02-20 18:31:51,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:51,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:51,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {6525#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(43, 2);call #Ultimate.allocInit(12, 3);~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; {6525#true} is VALID [2022-02-20 18:31:51,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {6525#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {6525#true} is VALID [2022-02-20 18:31:51,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {6525#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {6525#true} is VALID [2022-02-20 18:31:51,150 INFO L290 TraceCheckUtils]: 3: Hoare triple {6525#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {6525#true} is VALID [2022-02-20 18:31:51,150 INFO L290 TraceCheckUtils]: 4: Hoare triple {6525#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {6525#true} is VALID [2022-02-20 18:31:51,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {6525#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {6525#true} is VALID [2022-02-20 18:31:51,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {6525#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {6525#true} is VALID [2022-02-20 18:31:51,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {6525#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {6525#true} is VALID [2022-02-20 18:31:51,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {6525#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {6525#true} is VALID [2022-02-20 18:31:51,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {6525#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {6525#true} is VALID [2022-02-20 18:31:51,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {6525#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {6525#true} is VALID [2022-02-20 18:31:51,151 INFO L290 TraceCheckUtils]: 11: Hoare triple {6525#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {6525#true} is VALID [2022-02-20 18:31:51,151 INFO L290 TraceCheckUtils]: 12: Hoare triple {6525#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {6525#true} is VALID [2022-02-20 18:31:51,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {6525#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {6525#true} is VALID [2022-02-20 18:31:51,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {6525#true} assume ~id1~0 != ~id2~0; {6525#true} is VALID [2022-02-20 18:31:51,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {6525#true} assume ~id1~0 != ~id3~0; {6525#true} is VALID [2022-02-20 18:31:51,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {6525#true} assume ~id2~0 != ~id3~0; {6525#true} is VALID [2022-02-20 18:31:51,152 INFO L290 TraceCheckUtils]: 17: Hoare triple {6525#true} assume ~id1~0 >= 0; {6525#true} is VALID [2022-02-20 18:31:51,152 INFO L290 TraceCheckUtils]: 18: Hoare triple {6525#true} assume ~id2~0 >= 0; {6525#true} is VALID [2022-02-20 18:31:51,152 INFO L290 TraceCheckUtils]: 19: Hoare triple {6525#true} assume ~id3~0 >= 0; {6525#true} is VALID [2022-02-20 18:31:51,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {6525#true} assume 0 == ~r1~0; {6525#true} is VALID [2022-02-20 18:31:51,152 INFO L290 TraceCheckUtils]: 21: Hoare triple {6525#true} assume 0 == ~r2~0; {6525#true} is VALID [2022-02-20 18:31:51,152 INFO L290 TraceCheckUtils]: 22: Hoare triple {6525#true} assume 0 == ~r3~0; {6525#true} is VALID [2022-02-20 18:31:51,152 INFO L290 TraceCheckUtils]: 23: Hoare triple {6525#true} assume 0 != init_~r122~0#1 % 256; {6525#true} is VALID [2022-02-20 18:31:51,152 INFO L290 TraceCheckUtils]: 24: Hoare triple {6525#true} assume 0 != init_~r132~0#1 % 256; {6525#true} is VALID [2022-02-20 18:31:51,153 INFO L290 TraceCheckUtils]: 25: Hoare triple {6525#true} assume 0 != init_~r212~0#1 % 256; {6525#true} is VALID [2022-02-20 18:31:51,153 INFO L290 TraceCheckUtils]: 26: Hoare triple {6525#true} assume 0 != init_~r232~0#1 % 256; {6525#true} is VALID [2022-02-20 18:31:51,153 INFO L290 TraceCheckUtils]: 27: Hoare triple {6525#true} assume 0 != init_~r312~0#1 % 256; {6525#true} is VALID [2022-02-20 18:31:51,153 INFO L290 TraceCheckUtils]: 28: Hoare triple {6525#true} assume 0 != init_~r322~0#1 % 256; {6525#true} is VALID [2022-02-20 18:31:51,153 INFO L290 TraceCheckUtils]: 29: Hoare triple {6525#true} assume ~max1~0 == ~id1~0; {6525#true} is VALID [2022-02-20 18:31:51,153 INFO L290 TraceCheckUtils]: 30: Hoare triple {6525#true} assume ~max2~0 == ~id2~0; {6525#true} is VALID [2022-02-20 18:31:51,153 INFO L290 TraceCheckUtils]: 31: Hoare triple {6525#true} assume ~max3~0 == ~id3~0; {6525#true} is VALID [2022-02-20 18:31:51,154 INFO L290 TraceCheckUtils]: 32: Hoare triple {6525#true} assume 0 == ~st1~0; {6527#(<= ~st1~0 0)} is VALID [2022-02-20 18:31:51,154 INFO L290 TraceCheckUtils]: 33: Hoare triple {6527#(<= ~st1~0 0)} assume 0 == ~st2~0; {6528#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:51,154 INFO L290 TraceCheckUtils]: 34: Hoare triple {6528#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:51,155 INFO L290 TraceCheckUtils]: 35: Hoare triple {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl1~0; {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:51,155 INFO L290 TraceCheckUtils]: 36: Hoare triple {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl2~0; {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:51,155 INFO L290 TraceCheckUtils]: 37: Hoare triple {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl3~0; {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:51,156 INFO L290 TraceCheckUtils]: 38: Hoare triple {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:51,156 INFO L290 TraceCheckUtils]: 39: Hoare triple {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:51,156 INFO L290 TraceCheckUtils]: 40: Hoare triple {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:51,157 INFO L290 TraceCheckUtils]: 41: Hoare triple {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~newmax1~0 % 256; {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:51,157 INFO L290 TraceCheckUtils]: 42: Hoare triple {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~newmax2~0 % 256; {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:51,157 INFO L290 TraceCheckUtils]: 43: Hoare triple {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:51,157 INFO L290 TraceCheckUtils]: 44: Hoare triple {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:51,158 INFO L290 TraceCheckUtils]: 45: Hoare triple {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:51,158 INFO L290 TraceCheckUtils]: 46: Hoare triple {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:51,158 INFO L290 TraceCheckUtils]: 47: Hoare triple {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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_~i2~0#1 := 0; {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:51,159 INFO L290 TraceCheckUtils]: 48: Hoare triple {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:51,159 INFO L290 TraceCheckUtils]: 49: Hoare triple {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:51,159 INFO L290 TraceCheckUtils]: 50: Hoare triple {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 1; {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:51,160 INFO L290 TraceCheckUtils]: 51: Hoare triple {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep12~0 % 256); {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:51,160 INFO L290 TraceCheckUtils]: 52: Hoare triple {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep13~0 % 256); {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:51,160 INFO L290 TraceCheckUtils]: 53: Hoare triple {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:51,160 INFO L290 TraceCheckUtils]: 54: Hoare triple {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:51,161 INFO L290 TraceCheckUtils]: 55: Hoare triple {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:51,161 INFO L290 TraceCheckUtils]: 56: Hoare triple {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r2~0 < 2; {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:51,161 INFO L290 TraceCheckUtils]: 57: Hoare triple {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep21~0 % 256); {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:51,162 INFO L290 TraceCheckUtils]: 58: Hoare triple {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep23~0 % 256); {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:51,162 INFO L290 TraceCheckUtils]: 59: Hoare triple {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:51,162 INFO L290 TraceCheckUtils]: 60: Hoare triple {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:51,162 INFO L290 TraceCheckUtils]: 61: Hoare triple {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:51,163 INFO L290 TraceCheckUtils]: 62: Hoare triple {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r3~0 < 2; {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:51,163 INFO L290 TraceCheckUtils]: 63: Hoare triple {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep31~0 % 256); {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:51,163 INFO L290 TraceCheckUtils]: 64: Hoare triple {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep32~0 % 256); {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:51,164 INFO L290 TraceCheckUtils]: 65: Hoare triple {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:51,164 INFO L290 TraceCheckUtils]: 66: Hoare triple {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;~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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:51,164 INFO L290 TraceCheckUtils]: 67: Hoare triple {6529#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {6526#false} is VALID [2022-02-20 18:31:51,165 INFO L290 TraceCheckUtils]: 68: Hoare triple {6526#false} check_#res#1 := check_~tmp~1#1; {6526#false} is VALID [2022-02-20 18:31:51,165 INFO L290 TraceCheckUtils]: 69: Hoare triple {6526#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {6526#false} is VALID [2022-02-20 18:31:51,165 INFO L290 TraceCheckUtils]: 70: Hoare triple {6526#false} assume 0 == assert_~arg#1 % 256; {6526#false} is VALID [2022-02-20 18:31:51,165 INFO L290 TraceCheckUtils]: 71: Hoare triple {6526#false} assume !false; {6526#false} is VALID [2022-02-20 18:31:51,165 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:31:51,165 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:51,165 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309880602] [2022-02-20 18:31:51,166 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309880602] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:51,166 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:51,166 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:31:51,166 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447198213] [2022-02-20 18:31:51,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:51,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2022-02-20 18:31:51,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:51,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:51,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:51,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:31:51,212 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:51,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:31:51,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:31:51,212 INFO L87 Difference]: Start difference. First operand 542 states and 867 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:52,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:52,886 INFO L93 Difference]: Finished difference Result 2730 states and 4469 transitions. [2022-02-20 18:31:52,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:31:52,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2022-02-20 18:31:52,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:52,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:52,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1009 transitions. [2022-02-20 18:31:52,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:52,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1009 transitions. [2022-02-20 18:31:52,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1009 transitions. [2022-02-20 18:31:53,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1009 edges. 1009 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:53,878 INFO L225 Difference]: With dead ends: 2730 [2022-02-20 18:31:53,878 INFO L226 Difference]: Without dead ends: 2248 [2022-02-20 18:31:53,880 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:31:53,880 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 778 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:31:53,881 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [778 Valid, 1306 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:31:53,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2248 states. [2022-02-20 18:31:54,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2248 to 1006. [2022-02-20 18:31:54,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:54,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2248 states. Second operand has 1006 states, 1005 states have (on average 1.6149253731343283) internal successors, (1623), 1005 states have internal predecessors, (1623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:54,117 INFO L74 IsIncluded]: Start isIncluded. First operand 2248 states. Second operand has 1006 states, 1005 states have (on average 1.6149253731343283) internal successors, (1623), 1005 states have internal predecessors, (1623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:54,119 INFO L87 Difference]: Start difference. First operand 2248 states. Second operand has 1006 states, 1005 states have (on average 1.6149253731343283) internal successors, (1623), 1005 states have internal predecessors, (1623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:54,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:54,327 INFO L93 Difference]: Finished difference Result 2248 states and 3650 transitions. [2022-02-20 18:31:54,327 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 3650 transitions. [2022-02-20 18:31:54,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:54,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:54,333 INFO L74 IsIncluded]: Start isIncluded. First operand has 1006 states, 1005 states have (on average 1.6149253731343283) internal successors, (1623), 1005 states have internal predecessors, (1623), 0 states have call successors, (0), 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 2248 states. [2022-02-20 18:31:54,335 INFO L87 Difference]: Start difference. First operand has 1006 states, 1005 states have (on average 1.6149253731343283) internal successors, (1623), 1005 states have internal predecessors, (1623), 0 states have call successors, (0), 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 2248 states. [2022-02-20 18:31:54,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:54,532 INFO L93 Difference]: Finished difference Result 2248 states and 3650 transitions. [2022-02-20 18:31:54,532 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 3650 transitions. [2022-02-20 18:31:54,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:54,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:54,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:54,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:54,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 1005 states have (on average 1.6149253731343283) internal successors, (1623), 1005 states have internal predecessors, (1623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:54,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1623 transitions. [2022-02-20 18:31:54,589 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1623 transitions. Word has length 72 [2022-02-20 18:31:54,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:54,589 INFO L470 AbstractCegarLoop]: Abstraction has 1006 states and 1623 transitions. [2022-02-20 18:31:54,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:54,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1623 transitions. [2022-02-20 18:31:54,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 18:31:54,592 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:54,592 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] [2022-02-20 18:31:54,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:31:54,592 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:54,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:54,593 INFO L85 PathProgramCache]: Analyzing trace with hash -435168554, now seen corresponding path program 1 times [2022-02-20 18:31:54,593 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:54,593 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855827726] [2022-02-20 18:31:54,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:54,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:54,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {15217#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(43, 2);call #Ultimate.allocInit(12, 3);~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; {15217#true} is VALID [2022-02-20 18:31:54,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {15217#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {15217#true} is VALID [2022-02-20 18:31:54,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {15217#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {15217#true} is VALID [2022-02-20 18:31:54,703 INFO L290 TraceCheckUtils]: 3: Hoare triple {15217#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {15217#true} is VALID [2022-02-20 18:31:54,703 INFO L290 TraceCheckUtils]: 4: Hoare triple {15217#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {15217#true} is VALID [2022-02-20 18:31:54,704 INFO L290 TraceCheckUtils]: 5: Hoare triple {15217#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {15217#true} is VALID [2022-02-20 18:31:54,704 INFO L290 TraceCheckUtils]: 6: Hoare triple {15217#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {15217#true} is VALID [2022-02-20 18:31:54,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {15217#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {15217#true} is VALID [2022-02-20 18:31:54,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {15217#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {15217#true} is VALID [2022-02-20 18:31:54,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {15217#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {15217#true} is VALID [2022-02-20 18:31:54,704 INFO L290 TraceCheckUtils]: 10: Hoare triple {15217#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {15217#true} is VALID [2022-02-20 18:31:54,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {15217#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {15217#true} is VALID [2022-02-20 18:31:54,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {15217#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {15217#true} is VALID [2022-02-20 18:31:54,705 INFO L290 TraceCheckUtils]: 13: Hoare triple {15217#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {15217#true} is VALID [2022-02-20 18:31:54,705 INFO L290 TraceCheckUtils]: 14: Hoare triple {15217#true} assume ~id1~0 != ~id2~0; {15217#true} is VALID [2022-02-20 18:31:54,705 INFO L290 TraceCheckUtils]: 15: Hoare triple {15217#true} assume ~id1~0 != ~id3~0; {15217#true} is VALID [2022-02-20 18:31:54,705 INFO L290 TraceCheckUtils]: 16: Hoare triple {15217#true} assume ~id2~0 != ~id3~0; {15217#true} is VALID [2022-02-20 18:31:54,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {15217#true} assume ~id1~0 >= 0; {15217#true} is VALID [2022-02-20 18:31:54,711 INFO L290 TraceCheckUtils]: 18: Hoare triple {15217#true} assume ~id2~0 >= 0; {15217#true} is VALID [2022-02-20 18:31:54,711 INFO L290 TraceCheckUtils]: 19: Hoare triple {15217#true} assume ~id3~0 >= 0; {15217#true} is VALID [2022-02-20 18:31:54,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {15217#true} assume 0 == ~r1~0; {15217#true} is VALID [2022-02-20 18:31:54,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {15217#true} assume 0 == ~r2~0; {15217#true} is VALID [2022-02-20 18:31:54,716 INFO L290 TraceCheckUtils]: 22: Hoare triple {15217#true} assume 0 == ~r3~0; {15217#true} is VALID [2022-02-20 18:31:54,717 INFO L290 TraceCheckUtils]: 23: Hoare triple {15217#true} assume 0 != init_~r122~0#1 % 256; {15217#true} is VALID [2022-02-20 18:31:54,717 INFO L290 TraceCheckUtils]: 24: Hoare triple {15217#true} assume 0 != init_~r132~0#1 % 256; {15217#true} is VALID [2022-02-20 18:31:54,717 INFO L290 TraceCheckUtils]: 25: Hoare triple {15217#true} assume 0 != init_~r212~0#1 % 256; {15217#true} is VALID [2022-02-20 18:31:54,717 INFO L290 TraceCheckUtils]: 26: Hoare triple {15217#true} assume 0 != init_~r232~0#1 % 256; {15217#true} is VALID [2022-02-20 18:31:54,718 INFO L290 TraceCheckUtils]: 27: Hoare triple {15217#true} assume 0 != init_~r312~0#1 % 256; {15217#true} is VALID [2022-02-20 18:31:54,719 INFO L290 TraceCheckUtils]: 28: Hoare triple {15217#true} assume 0 != init_~r322~0#1 % 256; {15217#true} is VALID [2022-02-20 18:31:54,719 INFO L290 TraceCheckUtils]: 29: Hoare triple {15217#true} assume ~max1~0 == ~id1~0; {15217#true} is VALID [2022-02-20 18:31:54,719 INFO L290 TraceCheckUtils]: 30: Hoare triple {15217#true} assume ~max2~0 == ~id2~0; {15217#true} is VALID [2022-02-20 18:31:54,719 INFO L290 TraceCheckUtils]: 31: Hoare triple {15217#true} assume ~max3~0 == ~id3~0; {15217#true} is VALID [2022-02-20 18:31:54,720 INFO L290 TraceCheckUtils]: 32: Hoare triple {15217#true} assume 0 == ~st1~0; {15219#(<= ~st1~0 0)} is VALID [2022-02-20 18:31:54,723 INFO L290 TraceCheckUtils]: 33: Hoare triple {15219#(<= ~st1~0 0)} assume 0 == ~st2~0; {15219#(<= ~st1~0 0)} is VALID [2022-02-20 18:31:54,724 INFO L290 TraceCheckUtils]: 34: Hoare triple {15219#(<= ~st1~0 0)} assume 0 == ~st3~0; {15219#(<= ~st1~0 0)} is VALID [2022-02-20 18:31:54,744 INFO L290 TraceCheckUtils]: 35: Hoare triple {15219#(<= ~st1~0 0)} assume 0 == ~nl1~0; {15220#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:54,745 INFO L290 TraceCheckUtils]: 36: Hoare triple {15220#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl2~0; {15220#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:54,745 INFO L290 TraceCheckUtils]: 37: Hoare triple {15220#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl3~0; {15220#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:54,745 INFO L290 TraceCheckUtils]: 38: Hoare triple {15220#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {15220#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:54,746 INFO L290 TraceCheckUtils]: 39: Hoare triple {15220#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {15220#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:54,746 INFO L290 TraceCheckUtils]: 40: Hoare triple {15220#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {15220#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:54,746 INFO L290 TraceCheckUtils]: 41: Hoare triple {15220#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 != ~newmax1~0 % 256; {15220#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:54,747 INFO L290 TraceCheckUtils]: 42: Hoare triple {15220#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 != ~newmax2~0 % 256; {15220#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:54,747 INFO L290 TraceCheckUtils]: 43: Hoare triple {15220#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {15220#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:54,747 INFO L290 TraceCheckUtils]: 44: Hoare triple {15220#(<= (+ ~nl1~0 ~st1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {15220#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:54,748 INFO L290 TraceCheckUtils]: 45: Hoare triple {15220#(<= (+ ~nl1~0 ~st1~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {15220#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:54,748 INFO L290 TraceCheckUtils]: 46: Hoare triple {15220#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {15220#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:54,748 INFO L290 TraceCheckUtils]: 47: Hoare triple {15220#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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_~i2~0#1 := 0; {15220#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:54,749 INFO L290 TraceCheckUtils]: 48: Hoare triple {15220#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {15220#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:54,749 INFO L290 TraceCheckUtils]: 49: Hoare triple {15220#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {15220#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:54,750 INFO L290 TraceCheckUtils]: 50: Hoare triple {15220#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r1~0 < 1; {15220#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:54,750 INFO L290 TraceCheckUtils]: 51: Hoare triple {15220#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep12~0 % 256); {15220#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:54,750 INFO L290 TraceCheckUtils]: 52: Hoare triple {15220#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep13~0 % 256); {15220#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:54,751 INFO L290 TraceCheckUtils]: 53: Hoare triple {15220#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode1~0 := 1; {15220#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:54,751 INFO L290 TraceCheckUtils]: 54: Hoare triple {15220#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {15220#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:54,751 INFO L290 TraceCheckUtils]: 55: Hoare triple {15220#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {15220#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:54,752 INFO L290 TraceCheckUtils]: 56: Hoare triple {15220#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r2~0 < 2; {15220#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:54,752 INFO L290 TraceCheckUtils]: 57: Hoare triple {15220#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep21~0 % 256); {15220#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:54,752 INFO L290 TraceCheckUtils]: 58: Hoare triple {15220#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep23~0 % 256); {15220#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:54,753 INFO L290 TraceCheckUtils]: 59: Hoare triple {15220#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode2~0 := 1; {15220#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:54,753 INFO L290 TraceCheckUtils]: 60: Hoare triple {15220#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {15220#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:54,753 INFO L290 TraceCheckUtils]: 61: Hoare triple {15220#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {15220#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:54,754 INFO L290 TraceCheckUtils]: 62: Hoare triple {15220#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r3~0 < 2; {15220#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:54,754 INFO L290 TraceCheckUtils]: 63: Hoare triple {15220#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep31~0 % 256); {15220#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:54,754 INFO L290 TraceCheckUtils]: 64: Hoare triple {15220#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep32~0 % 256); {15220#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:54,755 INFO L290 TraceCheckUtils]: 65: Hoare triple {15220#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode3~0 := 1; {15220#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:54,755 INFO L290 TraceCheckUtils]: 66: Hoare triple {15220#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_node3 } true;~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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {15220#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:54,755 INFO L290 TraceCheckUtils]: 67: Hoare triple {15220#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {15220#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:54,756 INFO L290 TraceCheckUtils]: 68: Hoare triple {15220#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(~st1~0 + ~nl1~0 <= 1);check_~tmp~1#1 := 0; {15218#false} is VALID [2022-02-20 18:31:54,756 INFO L290 TraceCheckUtils]: 69: Hoare triple {15218#false} check_#res#1 := check_~tmp~1#1; {15218#false} is VALID [2022-02-20 18:31:54,756 INFO L290 TraceCheckUtils]: 70: Hoare triple {15218#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {15218#false} is VALID [2022-02-20 18:31:54,756 INFO L290 TraceCheckUtils]: 71: Hoare triple {15218#false} assume 0 == assert_~arg#1 % 256; {15218#false} is VALID [2022-02-20 18:31:54,757 INFO L290 TraceCheckUtils]: 72: Hoare triple {15218#false} assume !false; {15218#false} is VALID [2022-02-20 18:31:54,758 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:31:54,759 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:54,759 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855827726] [2022-02-20 18:31:54,759 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855827726] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:54,759 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:54,759 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:31:54,759 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296172754] [2022-02-20 18:31:54,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:54,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2022-02-20 18:31:54,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:54,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:54,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:54,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:31:54,814 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:54,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:31:54,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:31:54,815 INFO L87 Difference]: Start difference. First operand 1006 states and 1623 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:56,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:56,484 INFO L93 Difference]: Finished difference Result 3644 states and 5934 transitions. [2022-02-20 18:31:56,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:31:56,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2022-02-20 18:31:56,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:56,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:56,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 610 transitions. [2022-02-20 18:31:56,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:56,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 610 transitions. [2022-02-20 18:31:56,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 610 transitions. [2022-02-20 18:31:56,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 610 edges. 610 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:57,134 INFO L225 Difference]: With dead ends: 3644 [2022-02-20 18:31:57,134 INFO L226 Difference]: Without dead ends: 2698 [2022-02-20 18:31:57,135 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:31:57,136 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 385 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:31:57,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [385 Valid, 689 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:57,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2022-02-20 18:31:57,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 1843. [2022-02-20 18:31:57,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:57,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2698 states. Second operand has 1843 states, 1842 states have (on average 1.6161780673181325) internal successors, (2977), 1842 states have internal predecessors, (2977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:57,584 INFO L74 IsIncluded]: Start isIncluded. First operand 2698 states. Second operand has 1843 states, 1842 states have (on average 1.6161780673181325) internal successors, (2977), 1842 states have internal predecessors, (2977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:57,587 INFO L87 Difference]: Start difference. First operand 2698 states. Second operand has 1843 states, 1842 states have (on average 1.6161780673181325) internal successors, (2977), 1842 states have internal predecessors, (2977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:57,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:57,839 INFO L93 Difference]: Finished difference Result 2698 states and 4375 transitions. [2022-02-20 18:31:57,839 INFO L276 IsEmpty]: Start isEmpty. Operand 2698 states and 4375 transitions. [2022-02-20 18:31:57,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:57,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:57,845 INFO L74 IsIncluded]: Start isIncluded. First operand has 1843 states, 1842 states have (on average 1.6161780673181325) internal successors, (2977), 1842 states have internal predecessors, (2977), 0 states have call successors, (0), 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 2698 states. [2022-02-20 18:31:57,847 INFO L87 Difference]: Start difference. First operand has 1843 states, 1842 states have (on average 1.6161780673181325) internal successors, (2977), 1842 states have internal predecessors, (2977), 0 states have call successors, (0), 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 2698 states. [2022-02-20 18:31:58,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:58,050 INFO L93 Difference]: Finished difference Result 2698 states and 4375 transitions. [2022-02-20 18:31:58,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2698 states and 4375 transitions. [2022-02-20 18:31:58,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:58,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:58,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:58,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:58,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1843 states, 1842 states have (on average 1.6161780673181325) internal successors, (2977), 1842 states have internal predecessors, (2977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:58,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1843 states to 1843 states and 2977 transitions. [2022-02-20 18:31:58,170 INFO L78 Accepts]: Start accepts. Automaton has 1843 states and 2977 transitions. Word has length 73 [2022-02-20 18:31:58,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:58,170 INFO L470 AbstractCegarLoop]: Abstraction has 1843 states and 2977 transitions. [2022-02-20 18:31:58,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:58,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 2977 transitions. [2022-02-20 18:31:58,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 18:31:58,171 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:58,171 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] [2022-02-20 18:31:58,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:31:58,172 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:58,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:58,172 INFO L85 PathProgramCache]: Analyzing trace with hash 152415701, now seen corresponding path program 1 times [2022-02-20 18:31:58,172 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:58,172 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176523647] [2022-02-20 18:31:58,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:58,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:58,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:58,227 INFO L290 TraceCheckUtils]: 0: Hoare triple {26768#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(43, 2);call #Ultimate.allocInit(12, 3);~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; {26768#true} is VALID [2022-02-20 18:31:58,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {26768#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {26768#true} is VALID [2022-02-20 18:31:58,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {26768#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {26768#true} is VALID [2022-02-20 18:31:58,228 INFO L290 TraceCheckUtils]: 3: Hoare triple {26768#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {26768#true} is VALID [2022-02-20 18:31:58,228 INFO L290 TraceCheckUtils]: 4: Hoare triple {26768#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {26768#true} is VALID [2022-02-20 18:31:58,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {26768#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {26768#true} is VALID [2022-02-20 18:31:58,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {26768#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {26768#true} is VALID [2022-02-20 18:31:58,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {26768#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {26768#true} is VALID [2022-02-20 18:31:58,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {26768#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {26768#true} is VALID [2022-02-20 18:31:58,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {26768#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {26768#true} is VALID [2022-02-20 18:31:58,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {26768#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {26768#true} is VALID [2022-02-20 18:31:58,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {26768#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {26768#true} is VALID [2022-02-20 18:31:58,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {26768#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {26768#true} is VALID [2022-02-20 18:31:58,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {26768#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {26768#true} is VALID [2022-02-20 18:31:58,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {26768#true} assume ~id1~0 != ~id2~0; {26768#true} is VALID [2022-02-20 18:31:58,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {26768#true} assume ~id1~0 != ~id3~0; {26768#true} is VALID [2022-02-20 18:31:58,230 INFO L290 TraceCheckUtils]: 16: Hoare triple {26768#true} assume ~id2~0 != ~id3~0; {26768#true} is VALID [2022-02-20 18:31:58,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {26768#true} assume ~id1~0 >= 0; {26768#true} is VALID [2022-02-20 18:31:58,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {26768#true} assume ~id2~0 >= 0; {26768#true} is VALID [2022-02-20 18:31:58,231 INFO L290 TraceCheckUtils]: 19: Hoare triple {26768#true} assume ~id3~0 >= 0; {26768#true} is VALID [2022-02-20 18:31:58,231 INFO L290 TraceCheckUtils]: 20: Hoare triple {26768#true} assume 0 == ~r1~0; {26768#true} is VALID [2022-02-20 18:31:58,231 INFO L290 TraceCheckUtils]: 21: Hoare triple {26768#true} assume 0 == ~r2~0; {26768#true} is VALID [2022-02-20 18:31:58,231 INFO L290 TraceCheckUtils]: 22: Hoare triple {26768#true} assume 0 == ~r3~0; {26768#true} is VALID [2022-02-20 18:31:58,231 INFO L290 TraceCheckUtils]: 23: Hoare triple {26768#true} assume 0 != init_~r122~0#1 % 256; {26768#true} is VALID [2022-02-20 18:31:58,231 INFO L290 TraceCheckUtils]: 24: Hoare triple {26768#true} assume 0 != init_~r132~0#1 % 256; {26768#true} is VALID [2022-02-20 18:31:58,232 INFO L290 TraceCheckUtils]: 25: Hoare triple {26768#true} assume 0 != init_~r212~0#1 % 256; {26768#true} is VALID [2022-02-20 18:31:58,232 INFO L290 TraceCheckUtils]: 26: Hoare triple {26768#true} assume 0 != init_~r232~0#1 % 256; {26768#true} is VALID [2022-02-20 18:31:58,232 INFO L290 TraceCheckUtils]: 27: Hoare triple {26768#true} assume 0 != init_~r312~0#1 % 256; {26768#true} is VALID [2022-02-20 18:31:58,232 INFO L290 TraceCheckUtils]: 28: Hoare triple {26768#true} assume 0 != init_~r322~0#1 % 256; {26768#true} is VALID [2022-02-20 18:31:58,232 INFO L290 TraceCheckUtils]: 29: Hoare triple {26768#true} assume ~max1~0 == ~id1~0; {26768#true} is VALID [2022-02-20 18:31:58,232 INFO L290 TraceCheckUtils]: 30: Hoare triple {26768#true} assume ~max2~0 == ~id2~0; {26768#true} is VALID [2022-02-20 18:31:58,233 INFO L290 TraceCheckUtils]: 31: Hoare triple {26768#true} assume ~max3~0 == ~id3~0; {26768#true} is VALID [2022-02-20 18:31:58,233 INFO L290 TraceCheckUtils]: 32: Hoare triple {26768#true} assume 0 == ~st1~0; {26768#true} is VALID [2022-02-20 18:31:58,233 INFO L290 TraceCheckUtils]: 33: Hoare triple {26768#true} assume 0 == ~st2~0; {26768#true} is VALID [2022-02-20 18:31:58,233 INFO L290 TraceCheckUtils]: 34: Hoare triple {26768#true} assume 0 == ~st3~0; {26768#true} is VALID [2022-02-20 18:31:58,233 INFO L290 TraceCheckUtils]: 35: Hoare triple {26768#true} assume 0 == ~nl1~0; {26768#true} is VALID [2022-02-20 18:31:58,233 INFO L290 TraceCheckUtils]: 36: Hoare triple {26768#true} assume 0 == ~nl2~0; {26768#true} is VALID [2022-02-20 18:31:58,233 INFO L290 TraceCheckUtils]: 37: Hoare triple {26768#true} assume 0 == ~nl3~0; {26768#true} is VALID [2022-02-20 18:31:58,234 INFO L290 TraceCheckUtils]: 38: Hoare triple {26768#true} assume 0 == ~mode1~0 % 256; {26768#true} is VALID [2022-02-20 18:31:58,234 INFO L290 TraceCheckUtils]: 39: Hoare triple {26768#true} assume 0 == ~mode2~0 % 256; {26770#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:58,235 INFO L290 TraceCheckUtils]: 40: Hoare triple {26770#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {26770#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:58,235 INFO L290 TraceCheckUtils]: 41: Hoare triple {26770#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~newmax1~0 % 256; {26770#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:58,236 INFO L290 TraceCheckUtils]: 42: Hoare triple {26770#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~newmax2~0 % 256; {26770#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:58,236 INFO L290 TraceCheckUtils]: 43: Hoare triple {26770#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {26770#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:58,236 INFO L290 TraceCheckUtils]: 44: Hoare triple {26770#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp___5~0#1; {26770#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:58,237 INFO L290 TraceCheckUtils]: 45: Hoare triple {26770#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {26770#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:58,237 INFO L290 TraceCheckUtils]: 46: Hoare triple {26770#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {26770#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:58,238 INFO L290 TraceCheckUtils]: 47: Hoare triple {26770#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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_~i2~0#1 := 0; {26770#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:58,239 INFO L290 TraceCheckUtils]: 48: Hoare triple {26770#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {26770#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:58,240 INFO L290 TraceCheckUtils]: 49: Hoare triple {26770#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {26770#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:58,240 INFO L290 TraceCheckUtils]: 50: Hoare triple {26770#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~r1~0 < 1; {26770#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:58,240 INFO L290 TraceCheckUtils]: 51: Hoare triple {26770#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~ep12~0 % 256); {26770#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:58,241 INFO L290 TraceCheckUtils]: 52: Hoare triple {26770#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~ep13~0 % 256); {26770#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:58,241 INFO L290 TraceCheckUtils]: 53: Hoare triple {26770#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {26770#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:58,242 INFO L290 TraceCheckUtils]: 54: Hoare triple {26770#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {26770#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:58,242 INFO L290 TraceCheckUtils]: 55: Hoare triple {26770#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256;~r2~0 := (if (1 + ~r2~0) % 256 <= 127 then (1 + ~r2~0) % 256 else (1 + ~r2~0) % 256 - 256); {26769#false} is VALID [2022-02-20 18:31:58,243 INFO L290 TraceCheckUtils]: 56: Hoare triple {26769#false} assume !(0 != ~ep12~0 % 256); {26769#false} is VALID [2022-02-20 18:31:58,243 INFO L290 TraceCheckUtils]: 57: Hoare triple {26769#false} assume !(0 != ~ep32~0 % 256); {26769#false} is VALID [2022-02-20 18:31:58,243 INFO L290 TraceCheckUtils]: 58: Hoare triple {26769#false} ~newmax2~0 := node2_~newmax~1#1; {26769#false} is VALID [2022-02-20 18:31:58,243 INFO L290 TraceCheckUtils]: 59: Hoare triple {26769#false} assume 2 == ~r2~0; {26769#false} is VALID [2022-02-20 18:31:58,243 INFO L290 TraceCheckUtils]: 60: Hoare triple {26769#false} assume ~max2~0 == ~id2~0;~st2~0 := 1; {26769#false} is VALID [2022-02-20 18:31:58,243 INFO L290 TraceCheckUtils]: 61: Hoare triple {26769#false} ~mode2~0 := 0; {26769#false} is VALID [2022-02-20 18:31:58,243 INFO L290 TraceCheckUtils]: 62: Hoare triple {26769#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {26769#false} is VALID [2022-02-20 18:31:58,244 INFO L290 TraceCheckUtils]: 63: Hoare triple {26769#false} assume !(0 != ~mode3~0 % 256); {26769#false} is VALID [2022-02-20 18:31:58,244 INFO L290 TraceCheckUtils]: 64: Hoare triple {26769#false} assume ~r3~0 < 2; {26769#false} is VALID [2022-02-20 18:31:58,244 INFO L290 TraceCheckUtils]: 65: Hoare triple {26769#false} assume !(0 != ~ep31~0 % 256); {26769#false} is VALID [2022-02-20 18:31:58,244 INFO L290 TraceCheckUtils]: 66: Hoare triple {26769#false} assume !(0 != ~ep32~0 % 256); {26769#false} is VALID [2022-02-20 18:31:58,244 INFO L290 TraceCheckUtils]: 67: Hoare triple {26769#false} ~mode3~0 := 1; {26769#false} is VALID [2022-02-20 18:31:58,244 INFO L290 TraceCheckUtils]: 68: Hoare triple {26769#false} assume { :end_inline_node3 } true;~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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {26769#false} is VALID [2022-02-20 18:31:58,245 INFO L290 TraceCheckUtils]: 69: Hoare triple {26769#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {26769#false} is VALID [2022-02-20 18:31:58,245 INFO L290 TraceCheckUtils]: 70: Hoare triple {26769#false} check_#res#1 := check_~tmp~1#1; {26769#false} is VALID [2022-02-20 18:31:58,245 INFO L290 TraceCheckUtils]: 71: Hoare triple {26769#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {26769#false} is VALID [2022-02-20 18:31:58,246 INFO L290 TraceCheckUtils]: 72: Hoare triple {26769#false} assume 0 == assert_~arg#1 % 256; {26769#false} is VALID [2022-02-20 18:31:58,247 INFO L290 TraceCheckUtils]: 73: Hoare triple {26769#false} assume !false; {26769#false} is VALID [2022-02-20 18:31:58,247 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:31:58,247 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:58,248 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176523647] [2022-02-20 18:31:58,248 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176523647] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:58,248 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:58,248 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:31:58,248 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905002516] [2022-02-20 18:31:58,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:58,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-02-20 18:31:58,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:58,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:58,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:58,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:31:58,296 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:58,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:31:58,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:31:58,297 INFO L87 Difference]: Start difference. First operand 1843 states and 2977 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:59,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:59,651 INFO L93 Difference]: Finished difference Result 3597 states and 5826 transitions. [2022-02-20 18:31:59,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:31:59,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-02-20 18:31:59,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:59,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:59,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2022-02-20 18:31:59,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:59,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2022-02-20 18:31:59,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 446 transitions. [2022-02-20 18:31:59,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 446 edges. 446 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:00,188 INFO L225 Difference]: With dead ends: 3597 [2022-02-20 18:32:00,188 INFO L226 Difference]: Without dead ends: 2591 [2022-02-20 18:32:00,189 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:32:00,190 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 110 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:32:00,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 456 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:32:00,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2591 states. [2022-02-20 18:32:00,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2591 to 2589. [2022-02-20 18:32:00,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:00,959 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2591 states. Second operand has 2589 states, 2588 states have (on average 1.6058732612055642) internal successors, (4156), 2588 states have internal predecessors, (4156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:00,964 INFO L74 IsIncluded]: Start isIncluded. First operand 2591 states. Second operand has 2589 states, 2588 states have (on average 1.6058732612055642) internal successors, (4156), 2588 states have internal predecessors, (4156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:00,969 INFO L87 Difference]: Start difference. First operand 2591 states. Second operand has 2589 states, 2588 states have (on average 1.6058732612055642) internal successors, (4156), 2588 states have internal predecessors, (4156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:01,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:01,176 INFO L93 Difference]: Finished difference Result 2591 states and 4157 transitions. [2022-02-20 18:32:01,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2591 states and 4157 transitions. [2022-02-20 18:32:01,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:01,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:01,184 INFO L74 IsIncluded]: Start isIncluded. First operand has 2589 states, 2588 states have (on average 1.6058732612055642) internal successors, (4156), 2588 states have internal predecessors, (4156), 0 states have call successors, (0), 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 2591 states. [2022-02-20 18:32:01,187 INFO L87 Difference]: Start difference. First operand has 2589 states, 2588 states have (on average 1.6058732612055642) internal successors, (4156), 2588 states have internal predecessors, (4156), 0 states have call successors, (0), 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 2591 states. [2022-02-20 18:32:01,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:01,385 INFO L93 Difference]: Finished difference Result 2591 states and 4157 transitions. [2022-02-20 18:32:01,385 INFO L276 IsEmpty]: Start isEmpty. Operand 2591 states and 4157 transitions. [2022-02-20 18:32:01,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:01,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:01,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:01,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:01,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2589 states, 2588 states have (on average 1.6058732612055642) internal successors, (4156), 2588 states have internal predecessors, (4156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:01,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2589 states to 2589 states and 4156 transitions. [2022-02-20 18:32:01,635 INFO L78 Accepts]: Start accepts. Automaton has 2589 states and 4156 transitions. Word has length 74 [2022-02-20 18:32:01,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:01,637 INFO L470 AbstractCegarLoop]: Abstraction has 2589 states and 4156 transitions. [2022-02-20 18:32:01,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:01,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2589 states and 4156 transitions. [2022-02-20 18:32:01,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 18:32:01,638 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:01,638 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] [2022-02-20 18:32:01,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:32:01,638 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:01,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:01,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1935815765, now seen corresponding path program 1 times [2022-02-20 18:32:01,639 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:01,639 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820444456] [2022-02-20 18:32:01,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:01,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:01,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:01,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {38939#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(43, 2);call #Ultimate.allocInit(12, 3);~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; {38939#true} is VALID [2022-02-20 18:32:01,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {38939#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {38939#true} is VALID [2022-02-20 18:32:01,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {38939#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {38939#true} is VALID [2022-02-20 18:32:01,723 INFO L290 TraceCheckUtils]: 3: Hoare triple {38939#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {38939#true} is VALID [2022-02-20 18:32:01,724 INFO L290 TraceCheckUtils]: 4: Hoare triple {38939#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {38939#true} is VALID [2022-02-20 18:32:01,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {38939#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {38939#true} is VALID [2022-02-20 18:32:01,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {38939#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {38939#true} is VALID [2022-02-20 18:32:01,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {38939#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {38939#true} is VALID [2022-02-20 18:32:01,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {38939#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {38939#true} is VALID [2022-02-20 18:32:01,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {38939#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {38939#true} is VALID [2022-02-20 18:32:01,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {38939#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {38939#true} is VALID [2022-02-20 18:32:01,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {38939#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {38939#true} is VALID [2022-02-20 18:32:01,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {38939#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {38939#true} is VALID [2022-02-20 18:32:01,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {38939#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {38939#true} is VALID [2022-02-20 18:32:01,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {38939#true} assume ~id1~0 != ~id2~0; {38939#true} is VALID [2022-02-20 18:32:01,725 INFO L290 TraceCheckUtils]: 15: Hoare triple {38939#true} assume ~id1~0 != ~id3~0; {38939#true} is VALID [2022-02-20 18:32:01,725 INFO L290 TraceCheckUtils]: 16: Hoare triple {38939#true} assume ~id2~0 != ~id3~0; {38939#true} is VALID [2022-02-20 18:32:01,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {38939#true} assume ~id1~0 >= 0; {38939#true} is VALID [2022-02-20 18:32:01,726 INFO L290 TraceCheckUtils]: 18: Hoare triple {38939#true} assume ~id2~0 >= 0; {38939#true} is VALID [2022-02-20 18:32:01,726 INFO L290 TraceCheckUtils]: 19: Hoare triple {38939#true} assume ~id3~0 >= 0; {38939#true} is VALID [2022-02-20 18:32:01,726 INFO L290 TraceCheckUtils]: 20: Hoare triple {38939#true} assume 0 == ~r1~0; {38939#true} is VALID [2022-02-20 18:32:01,726 INFO L290 TraceCheckUtils]: 21: Hoare triple {38939#true} assume 0 == ~r2~0; {38939#true} is VALID [2022-02-20 18:32:01,726 INFO L290 TraceCheckUtils]: 22: Hoare triple {38939#true} assume 0 == ~r3~0; {38939#true} is VALID [2022-02-20 18:32:01,726 INFO L290 TraceCheckUtils]: 23: Hoare triple {38939#true} assume 0 != init_~r122~0#1 % 256; {38939#true} is VALID [2022-02-20 18:32:01,726 INFO L290 TraceCheckUtils]: 24: Hoare triple {38939#true} assume 0 != init_~r132~0#1 % 256; {38939#true} is VALID [2022-02-20 18:32:01,727 INFO L290 TraceCheckUtils]: 25: Hoare triple {38939#true} assume 0 != init_~r212~0#1 % 256; {38939#true} is VALID [2022-02-20 18:32:01,727 INFO L290 TraceCheckUtils]: 26: Hoare triple {38939#true} assume 0 != init_~r232~0#1 % 256; {38939#true} is VALID [2022-02-20 18:32:01,727 INFO L290 TraceCheckUtils]: 27: Hoare triple {38939#true} assume 0 != init_~r312~0#1 % 256; {38939#true} is VALID [2022-02-20 18:32:01,727 INFO L290 TraceCheckUtils]: 28: Hoare triple {38939#true} assume 0 != init_~r322~0#1 % 256; {38939#true} is VALID [2022-02-20 18:32:01,727 INFO L290 TraceCheckUtils]: 29: Hoare triple {38939#true} assume ~max1~0 == ~id1~0; {38939#true} is VALID [2022-02-20 18:32:01,727 INFO L290 TraceCheckUtils]: 30: Hoare triple {38939#true} assume ~max2~0 == ~id2~0; {38939#true} is VALID [2022-02-20 18:32:01,727 INFO L290 TraceCheckUtils]: 31: Hoare triple {38939#true} assume ~max3~0 == ~id3~0; {38939#true} is VALID [2022-02-20 18:32:01,728 INFO L290 TraceCheckUtils]: 32: Hoare triple {38939#true} assume 0 == ~st1~0; {38939#true} is VALID [2022-02-20 18:32:01,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {38939#true} assume 0 == ~st2~0; {38941#(<= ~st2~0 0)} is VALID [2022-02-20 18:32:01,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {38941#(<= ~st2~0 0)} assume 0 == ~st3~0; {38941#(<= ~st2~0 0)} is VALID [2022-02-20 18:32:01,729 INFO L290 TraceCheckUtils]: 35: Hoare triple {38941#(<= ~st2~0 0)} assume 0 == ~nl1~0; {38941#(<= ~st2~0 0)} is VALID [2022-02-20 18:32:01,729 INFO L290 TraceCheckUtils]: 36: Hoare triple {38941#(<= ~st2~0 0)} assume 0 == ~nl2~0; {38942#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,729 INFO L290 TraceCheckUtils]: 37: Hoare triple {38942#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~nl3~0; {38942#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,730 INFO L290 TraceCheckUtils]: 38: Hoare triple {38942#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode1~0 % 256; {38942#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,730 INFO L290 TraceCheckUtils]: 39: Hoare triple {38942#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode2~0 % 256; {38942#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,731 INFO L290 TraceCheckUtils]: 40: Hoare triple {38942#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {38942#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,731 INFO L290 TraceCheckUtils]: 41: Hoare triple {38942#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 != ~newmax1~0 % 256; {38942#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,731 INFO L290 TraceCheckUtils]: 42: Hoare triple {38942#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 != ~newmax2~0 % 256; {38942#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,732 INFO L290 TraceCheckUtils]: 43: Hoare triple {38942#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {38942#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,732 INFO L290 TraceCheckUtils]: 44: Hoare triple {38942#(<= (+ ~nl2~0 ~st2~0) 0)} init_#res#1 := init_~tmp___5~0#1; {38942#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,733 INFO L290 TraceCheckUtils]: 45: Hoare triple {38942#(<= (+ ~nl2~0 ~st2~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {38942#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,733 INFO L290 TraceCheckUtils]: 46: Hoare triple {38942#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {38942#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,733 INFO L290 TraceCheckUtils]: 47: Hoare triple {38942#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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_~i2~0#1 := 0; {38942#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,734 INFO L290 TraceCheckUtils]: 48: Hoare triple {38942#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {38942#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,734 INFO L290 TraceCheckUtils]: 49: Hoare triple {38942#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode1~0 % 256); {38942#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,735 INFO L290 TraceCheckUtils]: 50: Hoare triple {38942#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r1~0 < 1; {38942#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,735 INFO L290 TraceCheckUtils]: 51: Hoare triple {38942#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep12~0 % 256); {38942#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,735 INFO L290 TraceCheckUtils]: 52: Hoare triple {38942#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep13~0 % 256); {38942#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,736 INFO L290 TraceCheckUtils]: 53: Hoare triple {38942#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode1~0 := 1; {38942#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,736 INFO L290 TraceCheckUtils]: 54: Hoare triple {38942#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {38942#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,737 INFO L290 TraceCheckUtils]: 55: Hoare triple {38942#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode2~0 % 256); {38942#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,737 INFO L290 TraceCheckUtils]: 56: Hoare triple {38942#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r2~0 < 2; {38942#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,737 INFO L290 TraceCheckUtils]: 57: Hoare triple {38942#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep21~0 % 256); {38942#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,738 INFO L290 TraceCheckUtils]: 58: Hoare triple {38942#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep23~0 % 256); {38942#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,738 INFO L290 TraceCheckUtils]: 59: Hoare triple {38942#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode2~0 := 1; {38942#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,738 INFO L290 TraceCheckUtils]: 60: Hoare triple {38942#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {38942#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,739 INFO L290 TraceCheckUtils]: 61: Hoare triple {38942#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode3~0 % 256); {38942#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,739 INFO L290 TraceCheckUtils]: 62: Hoare triple {38942#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r3~0 < 2; {38942#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,740 INFO L290 TraceCheckUtils]: 63: Hoare triple {38942#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep31~0 % 256); {38942#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,740 INFO L290 TraceCheckUtils]: 64: Hoare triple {38942#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep32~0 % 256); {38942#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,740 INFO L290 TraceCheckUtils]: 65: Hoare triple {38942#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode3~0 := 1; {38942#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,741 INFO L290 TraceCheckUtils]: 66: Hoare triple {38942#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_node3 } true;~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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {38942#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,741 INFO L290 TraceCheckUtils]: 67: Hoare triple {38942#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {38942#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,742 INFO L290 TraceCheckUtils]: 68: Hoare triple {38942#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {38942#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,742 INFO L290 TraceCheckUtils]: 69: Hoare triple {38942#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(~st2~0 + ~nl2~0 <= 1);check_~tmp~1#1 := 0; {38940#false} is VALID [2022-02-20 18:32:01,742 INFO L290 TraceCheckUtils]: 70: Hoare triple {38940#false} check_#res#1 := check_~tmp~1#1; {38940#false} is VALID [2022-02-20 18:32:01,742 INFO L290 TraceCheckUtils]: 71: Hoare triple {38940#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {38940#false} is VALID [2022-02-20 18:32:01,743 INFO L290 TraceCheckUtils]: 72: Hoare triple {38940#false} assume 0 == assert_~arg#1 % 256; {38940#false} is VALID [2022-02-20 18:32:01,743 INFO L290 TraceCheckUtils]: 73: Hoare triple {38940#false} assume !false; {38940#false} is VALID [2022-02-20 18:32:01,744 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:32:01,744 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:01,744 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820444456] [2022-02-20 18:32:01,744 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820444456] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:01,744 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:01,744 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:32:01,745 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452354059] [2022-02-20 18:32:01,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:01,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-02-20 18:32:01,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:01,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:01,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:01,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:32:01,791 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:01,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:32:01,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:32:01,792 INFO L87 Difference]: Start difference. First operand 2589 states and 4156 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:05,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:05,875 INFO L93 Difference]: Finished difference Result 8144 states and 13137 transitions. [2022-02-20 18:32:05,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:32:05,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-02-20 18:32:05,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:05,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:05,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 610 transitions. [2022-02-20 18:32:05,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:05,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 610 transitions. [2022-02-20 18:32:05,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 610 transitions. [2022-02-20 18:32:06,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 610 edges. 610 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:07,366 INFO L225 Difference]: With dead ends: 8144 [2022-02-20 18:32:07,366 INFO L226 Difference]: Without dead ends: 5645 [2022-02-20 18:32:07,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:32:07,370 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 384 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:32:07,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [384 Valid, 686 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:32:07,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5645 states. [2022-02-20 18:32:08,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5645 to 4101. [2022-02-20 18:32:08,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:08,845 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5645 states. Second operand has 4101 states, 4100 states have (on average 1.5995121951219513) internal successors, (6558), 4100 states have internal predecessors, (6558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:08,849 INFO L74 IsIncluded]: Start isIncluded. First operand 5645 states. Second operand has 4101 states, 4100 states have (on average 1.5995121951219513) internal successors, (6558), 4100 states have internal predecessors, (6558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:08,854 INFO L87 Difference]: Start difference. First operand 5645 states. Second operand has 4101 states, 4100 states have (on average 1.5995121951219513) internal successors, (6558), 4100 states have internal predecessors, (6558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:09,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:09,671 INFO L93 Difference]: Finished difference Result 5645 states and 9060 transitions. [2022-02-20 18:32:09,671 INFO L276 IsEmpty]: Start isEmpty. Operand 5645 states and 9060 transitions. [2022-02-20 18:32:09,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:09,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:09,680 INFO L74 IsIncluded]: Start isIncluded. First operand has 4101 states, 4100 states have (on average 1.5995121951219513) internal successors, (6558), 4100 states have internal predecessors, (6558), 0 states have call successors, (0), 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 5645 states. [2022-02-20 18:32:09,685 INFO L87 Difference]: Start difference. First operand has 4101 states, 4100 states have (on average 1.5995121951219513) internal successors, (6558), 4100 states have internal predecessors, (6558), 0 states have call successors, (0), 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 5645 states. [2022-02-20 18:32:10,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:10,568 INFO L93 Difference]: Finished difference Result 5645 states and 9060 transitions. [2022-02-20 18:32:10,569 INFO L276 IsEmpty]: Start isEmpty. Operand 5645 states and 9060 transitions. [2022-02-20 18:32:10,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:10,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:10,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:10,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:10,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4101 states, 4100 states have (on average 1.5995121951219513) internal successors, (6558), 4100 states have internal predecessors, (6558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:11,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 6558 transitions. [2022-02-20 18:32:11,082 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 6558 transitions. Word has length 74 [2022-02-20 18:32:11,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:11,082 INFO L470 AbstractCegarLoop]: Abstraction has 4101 states and 6558 transitions. [2022-02-20 18:32:11,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:11,083 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 6558 transitions. [2022-02-20 18:32:11,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 18:32:11,083 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:11,083 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] [2022-02-20 18:32:11,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:32:11,083 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:11,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:11,084 INFO L85 PathProgramCache]: Analyzing trace with hash -2130170379, now seen corresponding path program 1 times [2022-02-20 18:32:11,084 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:11,084 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718527749] [2022-02-20 18:32:11,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:11,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:11,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {64118#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(43, 2);call #Ultimate.allocInit(12, 3);~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; {64118#true} is VALID [2022-02-20 18:32:11,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {64118#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {64118#true} is VALID [2022-02-20 18:32:11,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {64118#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {64118#true} is VALID [2022-02-20 18:32:11,143 INFO L290 TraceCheckUtils]: 3: Hoare triple {64118#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {64118#true} is VALID [2022-02-20 18:32:11,143 INFO L290 TraceCheckUtils]: 4: Hoare triple {64118#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {64118#true} is VALID [2022-02-20 18:32:11,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {64118#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {64118#true} is VALID [2022-02-20 18:32:11,143 INFO L290 TraceCheckUtils]: 6: Hoare triple {64118#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {64118#true} is VALID [2022-02-20 18:32:11,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {64118#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {64118#true} is VALID [2022-02-20 18:32:11,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {64118#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {64118#true} is VALID [2022-02-20 18:32:11,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {64118#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {64118#true} is VALID [2022-02-20 18:32:11,144 INFO L290 TraceCheckUtils]: 10: Hoare triple {64118#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {64118#true} is VALID [2022-02-20 18:32:11,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {64118#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {64118#true} is VALID [2022-02-20 18:32:11,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {64118#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {64118#true} is VALID [2022-02-20 18:32:11,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {64118#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {64118#true} is VALID [2022-02-20 18:32:11,144 INFO L290 TraceCheckUtils]: 14: Hoare triple {64118#true} assume ~id1~0 != ~id2~0; {64118#true} is VALID [2022-02-20 18:32:11,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {64118#true} assume ~id1~0 != ~id3~0; {64118#true} is VALID [2022-02-20 18:32:11,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {64118#true} assume ~id2~0 != ~id3~0; {64118#true} is VALID [2022-02-20 18:32:11,145 INFO L290 TraceCheckUtils]: 17: Hoare triple {64118#true} assume ~id1~0 >= 0; {64118#true} is VALID [2022-02-20 18:32:11,145 INFO L290 TraceCheckUtils]: 18: Hoare triple {64118#true} assume ~id2~0 >= 0; {64118#true} is VALID [2022-02-20 18:32:11,145 INFO L290 TraceCheckUtils]: 19: Hoare triple {64118#true} assume ~id3~0 >= 0; {64118#true} is VALID [2022-02-20 18:32:11,145 INFO L290 TraceCheckUtils]: 20: Hoare triple {64118#true} assume 0 == ~r1~0; {64118#true} is VALID [2022-02-20 18:32:11,145 INFO L290 TraceCheckUtils]: 21: Hoare triple {64118#true} assume 0 == ~r2~0; {64118#true} is VALID [2022-02-20 18:32:11,146 INFO L290 TraceCheckUtils]: 22: Hoare triple {64118#true} assume 0 == ~r3~0; {64118#true} is VALID [2022-02-20 18:32:11,146 INFO L290 TraceCheckUtils]: 23: Hoare triple {64118#true} assume 0 != init_~r122~0#1 % 256; {64118#true} is VALID [2022-02-20 18:32:11,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {64118#true} assume 0 != init_~r132~0#1 % 256; {64118#true} is VALID [2022-02-20 18:32:11,146 INFO L290 TraceCheckUtils]: 25: Hoare triple {64118#true} assume 0 != init_~r212~0#1 % 256; {64118#true} is VALID [2022-02-20 18:32:11,146 INFO L290 TraceCheckUtils]: 26: Hoare triple {64118#true} assume 0 != init_~r232~0#1 % 256; {64118#true} is VALID [2022-02-20 18:32:11,146 INFO L290 TraceCheckUtils]: 27: Hoare triple {64118#true} assume 0 != init_~r312~0#1 % 256; {64118#true} is VALID [2022-02-20 18:32:11,146 INFO L290 TraceCheckUtils]: 28: Hoare triple {64118#true} assume 0 != init_~r322~0#1 % 256; {64118#true} is VALID [2022-02-20 18:32:11,146 INFO L290 TraceCheckUtils]: 29: Hoare triple {64118#true} assume ~max1~0 == ~id1~0; {64118#true} is VALID [2022-02-20 18:32:11,147 INFO L290 TraceCheckUtils]: 30: Hoare triple {64118#true} assume ~max2~0 == ~id2~0; {64118#true} is VALID [2022-02-20 18:32:11,147 INFO L290 TraceCheckUtils]: 31: Hoare triple {64118#true} assume ~max3~0 == ~id3~0; {64118#true} is VALID [2022-02-20 18:32:11,147 INFO L290 TraceCheckUtils]: 32: Hoare triple {64118#true} assume 0 == ~st1~0; {64118#true} is VALID [2022-02-20 18:32:11,147 INFO L290 TraceCheckUtils]: 33: Hoare triple {64118#true} assume 0 == ~st2~0; {64118#true} is VALID [2022-02-20 18:32:11,147 INFO L290 TraceCheckUtils]: 34: Hoare triple {64118#true} assume 0 == ~st3~0; {64118#true} is VALID [2022-02-20 18:32:11,147 INFO L290 TraceCheckUtils]: 35: Hoare triple {64118#true} assume 0 == ~nl1~0; {64118#true} is VALID [2022-02-20 18:32:11,147 INFO L290 TraceCheckUtils]: 36: Hoare triple {64118#true} assume 0 == ~nl2~0; {64118#true} is VALID [2022-02-20 18:32:11,148 INFO L290 TraceCheckUtils]: 37: Hoare triple {64118#true} assume 0 == ~nl3~0; {64118#true} is VALID [2022-02-20 18:32:11,148 INFO L290 TraceCheckUtils]: 38: Hoare triple {64118#true} assume 0 == ~mode1~0 % 256; {64118#true} is VALID [2022-02-20 18:32:11,148 INFO L290 TraceCheckUtils]: 39: Hoare triple {64118#true} assume 0 == ~mode2~0 % 256; {64118#true} is VALID [2022-02-20 18:32:11,149 INFO L290 TraceCheckUtils]: 40: Hoare triple {64118#true} assume 0 == ~mode3~0 % 256; {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:11,149 INFO L290 TraceCheckUtils]: 41: Hoare triple {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~newmax1~0 % 256; {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:11,150 INFO L290 TraceCheckUtils]: 42: Hoare triple {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~newmax2~0 % 256; {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:11,150 INFO L290 TraceCheckUtils]: 43: Hoare triple {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:11,150 INFO L290 TraceCheckUtils]: 44: Hoare triple {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp___5~0#1; {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:11,151 INFO L290 TraceCheckUtils]: 45: Hoare triple {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:11,151 INFO L290 TraceCheckUtils]: 46: Hoare triple {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:11,152 INFO L290 TraceCheckUtils]: 47: Hoare triple {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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_~i2~0#1 := 0; {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:11,152 INFO L290 TraceCheckUtils]: 48: Hoare triple {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:11,153 INFO L290 TraceCheckUtils]: 49: Hoare triple {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:11,153 INFO L290 TraceCheckUtils]: 50: Hoare triple {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r1~0 < 1; {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:11,153 INFO L290 TraceCheckUtils]: 51: Hoare triple {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep12~0 % 256); {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:11,154 INFO L290 TraceCheckUtils]: 52: Hoare triple {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep13~0 % 256); {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:11,154 INFO L290 TraceCheckUtils]: 53: Hoare triple {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:11,155 INFO L290 TraceCheckUtils]: 54: Hoare triple {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:11,155 INFO L290 TraceCheckUtils]: 55: Hoare triple {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:11,155 INFO L290 TraceCheckUtils]: 56: Hoare triple {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r2~0 < 2; {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:11,156 INFO L290 TraceCheckUtils]: 57: Hoare triple {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep21~0 % 256); {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:11,156 INFO L290 TraceCheckUtils]: 58: Hoare triple {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep23~0 % 256); {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:11,157 INFO L290 TraceCheckUtils]: 59: Hoare triple {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:11,157 INFO L290 TraceCheckUtils]: 60: Hoare triple {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:11,158 INFO L290 TraceCheckUtils]: 61: Hoare triple {64120#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~mode3~0 % 256;~r3~0 := (if (1 + ~r3~0) % 256 <= 127 then (1 + ~r3~0) % 256 else (1 + ~r3~0) % 256 - 256); {64119#false} is VALID [2022-02-20 18:32:11,158 INFO L290 TraceCheckUtils]: 62: Hoare triple {64119#false} assume !(0 != ~ep13~0 % 256); {64119#false} is VALID [2022-02-20 18:32:11,158 INFO L290 TraceCheckUtils]: 63: Hoare triple {64119#false} assume !(0 != ~ep23~0 % 256); {64119#false} is VALID [2022-02-20 18:32:11,158 INFO L290 TraceCheckUtils]: 64: Hoare triple {64119#false} ~newmax3~0 := node3_~newmax~2#1; {64119#false} is VALID [2022-02-20 18:32:11,159 INFO L290 TraceCheckUtils]: 65: Hoare triple {64119#false} assume 2 == ~r3~0; {64119#false} is VALID [2022-02-20 18:32:11,159 INFO L290 TraceCheckUtils]: 66: Hoare triple {64119#false} assume ~max3~0 == ~id3~0;~st3~0 := 1; {64119#false} is VALID [2022-02-20 18:32:11,159 INFO L290 TraceCheckUtils]: 67: Hoare triple {64119#false} ~mode3~0 := 0; {64119#false} is VALID [2022-02-20 18:32:11,159 INFO L290 TraceCheckUtils]: 68: Hoare triple {64119#false} assume { :end_inline_node3 } true;~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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {64119#false} is VALID [2022-02-20 18:32:11,159 INFO L290 TraceCheckUtils]: 69: Hoare triple {64119#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {64119#false} is VALID [2022-02-20 18:32:11,159 INFO L290 TraceCheckUtils]: 70: Hoare triple {64119#false} check_#res#1 := check_~tmp~1#1; {64119#false} is VALID [2022-02-20 18:32:11,159 INFO L290 TraceCheckUtils]: 71: Hoare triple {64119#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {64119#false} is VALID [2022-02-20 18:32:11,159 INFO L290 TraceCheckUtils]: 72: Hoare triple {64119#false} assume 0 == assert_~arg#1 % 256; {64119#false} is VALID [2022-02-20 18:32:11,160 INFO L290 TraceCheckUtils]: 73: Hoare triple {64119#false} assume !false; {64119#false} is VALID [2022-02-20 18:32:11,160 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:32:11,160 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:11,160 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718527749] [2022-02-20 18:32:11,160 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718527749] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:11,161 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:11,161 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:32:11,161 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236860743] [2022-02-20 18:32:11,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:11,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-02-20 18:32:11,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:11,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:11,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:11,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:32:11,220 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:11,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:32:11,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:32:11,221 INFO L87 Difference]: Start difference. First operand 4101 states and 6558 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:15,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:15,440 INFO L93 Difference]: Finished difference Result 8053 states and 12892 transitions. [2022-02-20 18:32:15,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:32:15,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-02-20 18:32:15,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:15,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:15,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2022-02-20 18:32:15,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:15,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2022-02-20 18:32:15,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 446 transitions. [2022-02-20 18:32:15,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 446 edges. 446 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:16,881 INFO L225 Difference]: With dead ends: 8053 [2022-02-20 18:32:16,882 INFO L226 Difference]: Without dead ends: 5741 [2022-02-20 18:32:16,884 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:32:16,885 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 104 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:32:16,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 439 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:32:16,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5741 states. [2022-02-20 18:32:18,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5741 to 5739. [2022-02-20 18:32:18,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:18,836 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5741 states. Second operand has 5739 states, 5738 states have (on average 1.585569884977344) internal successors, (9098), 5738 states have internal predecessors, (9098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:18,841 INFO L74 IsIncluded]: Start isIncluded. First operand 5741 states. Second operand has 5739 states, 5738 states have (on average 1.585569884977344) internal successors, (9098), 5738 states have internal predecessors, (9098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:18,848 INFO L87 Difference]: Start difference. First operand 5741 states. Second operand has 5739 states, 5738 states have (on average 1.585569884977344) internal successors, (9098), 5738 states have internal predecessors, (9098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:19,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:19,658 INFO L93 Difference]: Finished difference Result 5741 states and 9099 transitions. [2022-02-20 18:32:19,658 INFO L276 IsEmpty]: Start isEmpty. Operand 5741 states and 9099 transitions. [2022-02-20 18:32:19,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:19,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:19,671 INFO L74 IsIncluded]: Start isIncluded. First operand has 5739 states, 5738 states have (on average 1.585569884977344) internal successors, (9098), 5738 states have internal predecessors, (9098), 0 states have call successors, (0), 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 5741 states. [2022-02-20 18:32:19,679 INFO L87 Difference]: Start difference. First operand has 5739 states, 5738 states have (on average 1.585569884977344) internal successors, (9098), 5738 states have internal predecessors, (9098), 0 states have call successors, (0), 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 5741 states. [2022-02-20 18:32:20,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:20,518 INFO L93 Difference]: Finished difference Result 5741 states and 9099 transitions. [2022-02-20 18:32:20,519 INFO L276 IsEmpty]: Start isEmpty. Operand 5741 states and 9099 transitions. [2022-02-20 18:32:20,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:20,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:20,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:20,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:20,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5739 states, 5738 states have (on average 1.585569884977344) internal successors, (9098), 5738 states have internal predecessors, (9098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:21,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5739 states to 5739 states and 9098 transitions. [2022-02-20 18:32:21,455 INFO L78 Accepts]: Start accepts. Automaton has 5739 states and 9098 transitions. Word has length 74 [2022-02-20 18:32:21,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:21,455 INFO L470 AbstractCegarLoop]: Abstraction has 5739 states and 9098 transitions. [2022-02-20 18:32:21,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:21,455 INFO L276 IsEmpty]: Start isEmpty. Operand 5739 states and 9098 transitions. [2022-02-20 18:32:21,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 18:32:21,456 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:21,456 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] [2022-02-20 18:32:21,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:32:21,457 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:21,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:21,457 INFO L85 PathProgramCache]: Analyzing trace with hash 339461557, now seen corresponding path program 1 times [2022-02-20 18:32:21,457 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:21,458 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474811370] [2022-02-20 18:32:21,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:21,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:21,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {91369#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(43, 2);call #Ultimate.allocInit(12, 3);~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; {91369#true} is VALID [2022-02-20 18:32:21,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {91369#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {91369#true} is VALID [2022-02-20 18:32:21,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {91369#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {91369#true} is VALID [2022-02-20 18:32:21,516 INFO L290 TraceCheckUtils]: 3: Hoare triple {91369#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {91369#true} is VALID [2022-02-20 18:32:21,516 INFO L290 TraceCheckUtils]: 4: Hoare triple {91369#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {91369#true} is VALID [2022-02-20 18:32:21,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {91369#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {91369#true} is VALID [2022-02-20 18:32:21,517 INFO L290 TraceCheckUtils]: 6: Hoare triple {91369#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {91369#true} is VALID [2022-02-20 18:32:21,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {91369#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {91369#true} is VALID [2022-02-20 18:32:21,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {91369#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {91369#true} is VALID [2022-02-20 18:32:21,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {91369#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {91369#true} is VALID [2022-02-20 18:32:21,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {91369#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {91369#true} is VALID [2022-02-20 18:32:21,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {91369#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {91369#true} is VALID [2022-02-20 18:32:21,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {91369#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {91369#true} is VALID [2022-02-20 18:32:21,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {91369#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {91369#true} is VALID [2022-02-20 18:32:21,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {91369#true} assume ~id1~0 != ~id2~0; {91369#true} is VALID [2022-02-20 18:32:21,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {91369#true} assume ~id1~0 != ~id3~0; {91369#true} is VALID [2022-02-20 18:32:21,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {91369#true} assume ~id2~0 != ~id3~0; {91369#true} is VALID [2022-02-20 18:32:21,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {91369#true} assume ~id1~0 >= 0; {91369#true} is VALID [2022-02-20 18:32:21,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {91369#true} assume ~id2~0 >= 0; {91369#true} is VALID [2022-02-20 18:32:21,518 INFO L290 TraceCheckUtils]: 19: Hoare triple {91369#true} assume ~id3~0 >= 0; {91369#true} is VALID [2022-02-20 18:32:21,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {91369#true} assume 0 == ~r1~0; {91369#true} is VALID [2022-02-20 18:32:21,519 INFO L290 TraceCheckUtils]: 21: Hoare triple {91369#true} assume 0 == ~r2~0; {91369#true} is VALID [2022-02-20 18:32:21,519 INFO L290 TraceCheckUtils]: 22: Hoare triple {91369#true} assume 0 == ~r3~0; {91369#true} is VALID [2022-02-20 18:32:21,519 INFO L290 TraceCheckUtils]: 23: Hoare triple {91369#true} assume 0 != init_~r122~0#1 % 256; {91369#true} is VALID [2022-02-20 18:32:21,519 INFO L290 TraceCheckUtils]: 24: Hoare triple {91369#true} assume 0 != init_~r132~0#1 % 256; {91369#true} is VALID [2022-02-20 18:32:21,519 INFO L290 TraceCheckUtils]: 25: Hoare triple {91369#true} assume 0 != init_~r212~0#1 % 256; {91369#true} is VALID [2022-02-20 18:32:21,519 INFO L290 TraceCheckUtils]: 26: Hoare triple {91369#true} assume 0 != init_~r232~0#1 % 256; {91369#true} is VALID [2022-02-20 18:32:21,520 INFO L290 TraceCheckUtils]: 27: Hoare triple {91369#true} assume 0 != init_~r312~0#1 % 256; {91369#true} is VALID [2022-02-20 18:32:21,520 INFO L290 TraceCheckUtils]: 28: Hoare triple {91369#true} assume 0 != init_~r322~0#1 % 256; {91369#true} is VALID [2022-02-20 18:32:21,520 INFO L290 TraceCheckUtils]: 29: Hoare triple {91369#true} assume ~max1~0 == ~id1~0; {91369#true} is VALID [2022-02-20 18:32:21,520 INFO L290 TraceCheckUtils]: 30: Hoare triple {91369#true} assume ~max2~0 == ~id2~0; {91369#true} is VALID [2022-02-20 18:32:21,520 INFO L290 TraceCheckUtils]: 31: Hoare triple {91369#true} assume ~max3~0 == ~id3~0; {91369#true} is VALID [2022-02-20 18:32:21,520 INFO L290 TraceCheckUtils]: 32: Hoare triple {91369#true} assume 0 == ~st1~0; {91369#true} is VALID [2022-02-20 18:32:21,520 INFO L290 TraceCheckUtils]: 33: Hoare triple {91369#true} assume 0 == ~st2~0; {91369#true} is VALID [2022-02-20 18:32:21,521 INFO L290 TraceCheckUtils]: 34: Hoare triple {91369#true} assume 0 == ~st3~0; {91369#true} is VALID [2022-02-20 18:32:21,521 INFO L290 TraceCheckUtils]: 35: Hoare triple {91369#true} assume 0 == ~nl1~0; {91369#true} is VALID [2022-02-20 18:32:21,521 INFO L290 TraceCheckUtils]: 36: Hoare triple {91369#true} assume 0 == ~nl2~0; {91369#true} is VALID [2022-02-20 18:32:21,521 INFO L290 TraceCheckUtils]: 37: Hoare triple {91369#true} assume 0 == ~nl3~0; {91369#true} is VALID [2022-02-20 18:32:21,522 INFO L290 TraceCheckUtils]: 38: Hoare triple {91369#true} assume 0 == ~mode1~0 % 256; {91371#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:21,522 INFO L290 TraceCheckUtils]: 39: Hoare triple {91371#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {91371#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:21,523 INFO L290 TraceCheckUtils]: 40: Hoare triple {91371#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {91371#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:21,523 INFO L290 TraceCheckUtils]: 41: Hoare triple {91371#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~newmax1~0 % 256; {91371#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:21,523 INFO L290 TraceCheckUtils]: 42: Hoare triple {91371#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~newmax2~0 % 256; {91371#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:21,524 INFO L290 TraceCheckUtils]: 43: Hoare triple {91371#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {91371#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:21,524 INFO L290 TraceCheckUtils]: 44: Hoare triple {91371#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {91371#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:21,525 INFO L290 TraceCheckUtils]: 45: Hoare triple {91371#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {91371#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:21,525 INFO L290 TraceCheckUtils]: 46: Hoare triple {91371#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {91371#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:21,526 INFO L290 TraceCheckUtils]: 47: Hoare triple {91371#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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_~i2~0#1 := 0; {91371#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:21,526 INFO L290 TraceCheckUtils]: 48: Hoare triple {91371#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {91371#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:21,527 INFO L290 TraceCheckUtils]: 49: Hoare triple {91371#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~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); {91370#false} is VALID [2022-02-20 18:32:21,527 INFO L290 TraceCheckUtils]: 50: Hoare triple {91370#false} assume !(0 != ~ep21~0 % 256); {91370#false} is VALID [2022-02-20 18:32:21,527 INFO L290 TraceCheckUtils]: 51: Hoare triple {91370#false} assume !(0 != ~ep31~0 % 256); {91370#false} is VALID [2022-02-20 18:32:21,527 INFO L290 TraceCheckUtils]: 52: Hoare triple {91370#false} ~newmax1~0 := node1_~newmax~0#1; {91370#false} is VALID [2022-02-20 18:32:21,527 INFO L290 TraceCheckUtils]: 53: Hoare triple {91370#false} assume 2 == ~r1~0; {91370#false} is VALID [2022-02-20 18:32:21,528 INFO L290 TraceCheckUtils]: 54: Hoare triple {91370#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {91370#false} is VALID [2022-02-20 18:32:21,528 INFO L290 TraceCheckUtils]: 55: Hoare triple {91370#false} ~mode1~0 := 0; {91370#false} is VALID [2022-02-20 18:32:21,528 INFO L290 TraceCheckUtils]: 56: Hoare triple {91370#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {91370#false} is VALID [2022-02-20 18:32:21,528 INFO L290 TraceCheckUtils]: 57: Hoare triple {91370#false} assume !(0 != ~mode2~0 % 256); {91370#false} is VALID [2022-02-20 18:32:21,528 INFO L290 TraceCheckUtils]: 58: Hoare triple {91370#false} assume ~r2~0 < 2; {91370#false} is VALID [2022-02-20 18:32:21,528 INFO L290 TraceCheckUtils]: 59: Hoare triple {91370#false} assume !(0 != ~ep21~0 % 256); {91370#false} is VALID [2022-02-20 18:32:21,529 INFO L290 TraceCheckUtils]: 60: Hoare triple {91370#false} assume !(0 != ~ep23~0 % 256); {91370#false} is VALID [2022-02-20 18:32:21,529 INFO L290 TraceCheckUtils]: 61: Hoare triple {91370#false} ~mode2~0 := 1; {91370#false} is VALID [2022-02-20 18:32:21,529 INFO L290 TraceCheckUtils]: 62: Hoare triple {91370#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {91370#false} is VALID [2022-02-20 18:32:21,529 INFO L290 TraceCheckUtils]: 63: Hoare triple {91370#false} assume !(0 != ~mode3~0 % 256); {91370#false} is VALID [2022-02-20 18:32:21,529 INFO L290 TraceCheckUtils]: 64: Hoare triple {91370#false} assume ~r3~0 < 2; {91370#false} is VALID [2022-02-20 18:32:21,529 INFO L290 TraceCheckUtils]: 65: Hoare triple {91370#false} assume !(0 != ~ep31~0 % 256); {91370#false} is VALID [2022-02-20 18:32:21,529 INFO L290 TraceCheckUtils]: 66: Hoare triple {91370#false} assume !(0 != ~ep32~0 % 256); {91370#false} is VALID [2022-02-20 18:32:21,529 INFO L290 TraceCheckUtils]: 67: Hoare triple {91370#false} ~mode3~0 := 1; {91370#false} is VALID [2022-02-20 18:32:21,530 INFO L290 TraceCheckUtils]: 68: Hoare triple {91370#false} assume { :end_inline_node3 } true;~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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {91370#false} is VALID [2022-02-20 18:32:21,530 INFO L290 TraceCheckUtils]: 69: Hoare triple {91370#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {91370#false} is VALID [2022-02-20 18:32:21,530 INFO L290 TraceCheckUtils]: 70: Hoare triple {91370#false} check_#res#1 := check_~tmp~1#1; {91370#false} is VALID [2022-02-20 18:32:21,530 INFO L290 TraceCheckUtils]: 71: Hoare triple {91370#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {91370#false} is VALID [2022-02-20 18:32:21,530 INFO L290 TraceCheckUtils]: 72: Hoare triple {91370#false} assume 0 == assert_~arg#1 % 256; {91370#false} is VALID [2022-02-20 18:32:21,530 INFO L290 TraceCheckUtils]: 73: Hoare triple {91370#false} assume !false; {91370#false} is VALID [2022-02-20 18:32:21,531 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:32:21,531 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:21,531 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474811370] [2022-02-20 18:32:21,531 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474811370] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:21,531 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:21,531 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:32:21,532 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653479553] [2022-02-20 18:32:21,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:21,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-02-20 18:32:21,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:21,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:21,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:21,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:32:21,579 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:21,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:32:21,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:32:21,580 INFO L87 Difference]: Start difference. First operand 5739 states and 9098 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:30,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:30,369 INFO L93 Difference]: Finished difference Result 13696 states and 21823 transitions. [2022-02-20 18:32:30,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:32:30,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-02-20 18:32:30,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:30,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:30,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2022-02-20 18:32:30,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:30,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2022-02-20 18:32:30,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 446 transitions. [2022-02-20 18:32:30,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 446 edges. 446 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:32,984 INFO L225 Difference]: With dead ends: 13696 [2022-02-20 18:32:32,985 INFO L226 Difference]: Without dead ends: 8043 [2022-02-20 18:32:32,988 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:32:32,989 INFO L933 BasicCegarLoop]: 300 mSDtfsCounter, 116 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:32:32,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 479 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:32:32,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8043 states. [2022-02-20 18:32:35,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8043 to 8041. [2022-02-20 18:32:35,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:35,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8043 states. Second operand has 8041 states, 8040 states have (on average 1.5899253731343284) internal successors, (12783), 8040 states have internal predecessors, (12783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:35,876 INFO L74 IsIncluded]: Start isIncluded. First operand 8043 states. Second operand has 8041 states, 8040 states have (on average 1.5899253731343284) internal successors, (12783), 8040 states have internal predecessors, (12783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:35,882 INFO L87 Difference]: Start difference. First operand 8043 states. Second operand has 8041 states, 8040 states have (on average 1.5899253731343284) internal successors, (12783), 8040 states have internal predecessors, (12783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:37,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:37,563 INFO L93 Difference]: Finished difference Result 8043 states and 12784 transitions. [2022-02-20 18:32:37,563 INFO L276 IsEmpty]: Start isEmpty. Operand 8043 states and 12784 transitions. [2022-02-20 18:32:37,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:37,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:37,578 INFO L74 IsIncluded]: Start isIncluded. First operand has 8041 states, 8040 states have (on average 1.5899253731343284) internal successors, (12783), 8040 states have internal predecessors, (12783), 0 states have call successors, (0), 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 8043 states. [2022-02-20 18:32:37,586 INFO L87 Difference]: Start difference. First operand has 8041 states, 8040 states have (on average 1.5899253731343284) internal successors, (12783), 8040 states have internal predecessors, (12783), 0 states have call successors, (0), 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 8043 states. [2022-02-20 18:32:39,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:39,328 INFO L93 Difference]: Finished difference Result 8043 states and 12784 transitions. [2022-02-20 18:32:39,328 INFO L276 IsEmpty]: Start isEmpty. Operand 8043 states and 12784 transitions. [2022-02-20 18:32:39,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:39,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:39,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:39,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:39,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8041 states, 8040 states have (on average 1.5899253731343284) internal successors, (12783), 8040 states have internal predecessors, (12783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:41,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8041 states to 8041 states and 12783 transitions. [2022-02-20 18:32:41,299 INFO L78 Accepts]: Start accepts. Automaton has 8041 states and 12783 transitions. Word has length 74 [2022-02-20 18:32:41,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:41,300 INFO L470 AbstractCegarLoop]: Abstraction has 8041 states and 12783 transitions. [2022-02-20 18:32:41,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:41,300 INFO L276 IsEmpty]: Start isEmpty. Operand 8041 states and 12783 transitions. [2022-02-20 18:32:41,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-20 18:32:41,300 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:41,301 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] [2022-02-20 18:32:41,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:32:41,301 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:41,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:41,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1704077331, now seen corresponding path program 1 times [2022-02-20 18:32:41,302 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:41,302 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390472717] [2022-02-20 18:32:41,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:41,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:41,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {132616#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(43, 2);call #Ultimate.allocInit(12, 3);~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; {132616#true} is VALID [2022-02-20 18:32:41,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {132616#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {132616#true} is VALID [2022-02-20 18:32:41,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {132616#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {132616#true} is VALID [2022-02-20 18:32:41,357 INFO L290 TraceCheckUtils]: 3: Hoare triple {132616#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {132616#true} is VALID [2022-02-20 18:32:41,357 INFO L290 TraceCheckUtils]: 4: Hoare triple {132616#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {132616#true} is VALID [2022-02-20 18:32:41,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {132616#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {132616#true} is VALID [2022-02-20 18:32:41,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {132616#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {132616#true} is VALID [2022-02-20 18:32:41,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {132616#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {132616#true} is VALID [2022-02-20 18:32:41,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {132616#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {132616#true} is VALID [2022-02-20 18:32:41,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {132616#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {132616#true} is VALID [2022-02-20 18:32:41,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {132616#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {132616#true} is VALID [2022-02-20 18:32:41,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {132616#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {132616#true} is VALID [2022-02-20 18:32:41,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {132616#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {132616#true} is VALID [2022-02-20 18:32:41,358 INFO L290 TraceCheckUtils]: 13: Hoare triple {132616#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {132616#true} is VALID [2022-02-20 18:32:41,358 INFO L290 TraceCheckUtils]: 14: Hoare triple {132616#true} assume ~id1~0 != ~id2~0; {132616#true} is VALID [2022-02-20 18:32:41,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {132616#true} assume ~id1~0 != ~id3~0; {132616#true} is VALID [2022-02-20 18:32:41,359 INFO L290 TraceCheckUtils]: 16: Hoare triple {132616#true} assume ~id2~0 != ~id3~0; {132616#true} is VALID [2022-02-20 18:32:41,359 INFO L290 TraceCheckUtils]: 17: Hoare triple {132616#true} assume ~id1~0 >= 0; {132616#true} is VALID [2022-02-20 18:32:41,359 INFO L290 TraceCheckUtils]: 18: Hoare triple {132616#true} assume ~id2~0 >= 0; {132616#true} is VALID [2022-02-20 18:32:41,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {132616#true} assume ~id3~0 >= 0; {132616#true} is VALID [2022-02-20 18:32:41,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {132616#true} assume 0 == ~r1~0; {132616#true} is VALID [2022-02-20 18:32:41,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {132616#true} assume 0 == ~r2~0; {132616#true} is VALID [2022-02-20 18:32:41,360 INFO L290 TraceCheckUtils]: 22: Hoare triple {132616#true} assume 0 == ~r3~0; {132616#true} is VALID [2022-02-20 18:32:41,360 INFO L290 TraceCheckUtils]: 23: Hoare triple {132616#true} assume 0 != init_~r122~0#1 % 256; {132616#true} is VALID [2022-02-20 18:32:41,360 INFO L290 TraceCheckUtils]: 24: Hoare triple {132616#true} assume 0 != init_~r132~0#1 % 256; {132616#true} is VALID [2022-02-20 18:32:41,360 INFO L290 TraceCheckUtils]: 25: Hoare triple {132616#true} assume 0 != init_~r212~0#1 % 256; {132616#true} is VALID [2022-02-20 18:32:41,360 INFO L290 TraceCheckUtils]: 26: Hoare triple {132616#true} assume 0 != init_~r232~0#1 % 256; {132616#true} is VALID [2022-02-20 18:32:41,360 INFO L290 TraceCheckUtils]: 27: Hoare triple {132616#true} assume 0 != init_~r312~0#1 % 256; {132616#true} is VALID [2022-02-20 18:32:41,360 INFO L290 TraceCheckUtils]: 28: Hoare triple {132616#true} assume 0 != init_~r322~0#1 % 256; {132616#true} is VALID [2022-02-20 18:32:41,360 INFO L290 TraceCheckUtils]: 29: Hoare triple {132616#true} assume ~max1~0 == ~id1~0; {132616#true} is VALID [2022-02-20 18:32:41,361 INFO L290 TraceCheckUtils]: 30: Hoare triple {132616#true} assume ~max2~0 == ~id2~0; {132616#true} is VALID [2022-02-20 18:32:41,361 INFO L290 TraceCheckUtils]: 31: Hoare triple {132616#true} assume ~max3~0 == ~id3~0; {132616#true} is VALID [2022-02-20 18:32:41,361 INFO L290 TraceCheckUtils]: 32: Hoare triple {132616#true} assume 0 == ~st1~0; {132616#true} is VALID [2022-02-20 18:32:41,361 INFO L290 TraceCheckUtils]: 33: Hoare triple {132616#true} assume 0 == ~st2~0; {132616#true} is VALID [2022-02-20 18:32:41,361 INFO L290 TraceCheckUtils]: 34: Hoare triple {132616#true} assume 0 == ~st3~0; {132618#(<= ~st3~0 0)} is VALID [2022-02-20 18:32:41,362 INFO L290 TraceCheckUtils]: 35: Hoare triple {132618#(<= ~st3~0 0)} assume 0 == ~nl1~0; {132618#(<= ~st3~0 0)} is VALID [2022-02-20 18:32:41,362 INFO L290 TraceCheckUtils]: 36: Hoare triple {132618#(<= ~st3~0 0)} assume 0 == ~nl2~0; {132618#(<= ~st3~0 0)} is VALID [2022-02-20 18:32:41,362 INFO L290 TraceCheckUtils]: 37: Hoare triple {132618#(<= ~st3~0 0)} assume 0 == ~nl3~0; {132619#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:41,363 INFO L290 TraceCheckUtils]: 38: Hoare triple {132619#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode1~0 % 256; {132619#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:41,363 INFO L290 TraceCheckUtils]: 39: Hoare triple {132619#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode2~0 % 256; {132619#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:41,364 INFO L290 TraceCheckUtils]: 40: Hoare triple {132619#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode3~0 % 256; {132619#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:41,364 INFO L290 TraceCheckUtils]: 41: Hoare triple {132619#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 != ~newmax1~0 % 256; {132619#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:41,364 INFO L290 TraceCheckUtils]: 42: Hoare triple {132619#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 != ~newmax2~0 % 256; {132619#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:41,365 INFO L290 TraceCheckUtils]: 43: Hoare triple {132619#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {132619#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:41,365 INFO L290 TraceCheckUtils]: 44: Hoare triple {132619#(<= (+ ~nl3~0 ~st3~0) 0)} init_#res#1 := init_~tmp___5~0#1; {132619#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:41,366 INFO L290 TraceCheckUtils]: 45: Hoare triple {132619#(<= (+ ~nl3~0 ~st3~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {132619#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:41,366 INFO L290 TraceCheckUtils]: 46: Hoare triple {132619#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {132619#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:41,366 INFO L290 TraceCheckUtils]: 47: Hoare triple {132619#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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_~i2~0#1 := 0; {132619#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:41,367 INFO L290 TraceCheckUtils]: 48: Hoare triple {132619#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {132619#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:41,367 INFO L290 TraceCheckUtils]: 49: Hoare triple {132619#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode1~0 % 256); {132619#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:41,367 INFO L290 TraceCheckUtils]: 50: Hoare triple {132619#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r1~0 < 1; {132619#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:41,368 INFO L290 TraceCheckUtils]: 51: Hoare triple {132619#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep12~0 % 256); {132619#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:41,368 INFO L290 TraceCheckUtils]: 52: Hoare triple {132619#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep13~0 % 256); {132619#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:41,369 INFO L290 TraceCheckUtils]: 53: Hoare triple {132619#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode1~0 := 1; {132619#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:41,369 INFO L290 TraceCheckUtils]: 54: Hoare triple {132619#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {132619#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:41,369 INFO L290 TraceCheckUtils]: 55: Hoare triple {132619#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode2~0 % 256); {132619#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:41,370 INFO L290 TraceCheckUtils]: 56: Hoare triple {132619#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r2~0 < 2; {132619#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:41,370 INFO L290 TraceCheckUtils]: 57: Hoare triple {132619#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep21~0 % 256); {132619#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:41,371 INFO L290 TraceCheckUtils]: 58: Hoare triple {132619#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep23~0 % 256); {132619#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:41,371 INFO L290 TraceCheckUtils]: 59: Hoare triple {132619#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode2~0 := 1; {132619#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:41,371 INFO L290 TraceCheckUtils]: 60: Hoare triple {132619#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {132619#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:41,372 INFO L290 TraceCheckUtils]: 61: Hoare triple {132619#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode3~0 % 256); {132619#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:41,372 INFO L290 TraceCheckUtils]: 62: Hoare triple {132619#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r3~0 < 2; {132619#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:41,372 INFO L290 TraceCheckUtils]: 63: Hoare triple {132619#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep31~0 % 256); {132619#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:41,373 INFO L290 TraceCheckUtils]: 64: Hoare triple {132619#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep32~0 % 256); {132619#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:41,373 INFO L290 TraceCheckUtils]: 65: Hoare triple {132619#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode3~0 := 1; {132619#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:41,374 INFO L290 TraceCheckUtils]: 66: Hoare triple {132619#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_node3 } true;~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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {132619#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:41,374 INFO L290 TraceCheckUtils]: 67: Hoare triple {132619#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {132619#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:41,374 INFO L290 TraceCheckUtils]: 68: Hoare triple {132619#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {132619#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:41,375 INFO L290 TraceCheckUtils]: 69: Hoare triple {132619#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st2~0 + ~nl2~0 <= 1; {132619#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:41,375 INFO L290 TraceCheckUtils]: 70: Hoare triple {132619#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(~st3~0 + ~nl3~0 <= 1);check_~tmp~1#1 := 0; {132617#false} is VALID [2022-02-20 18:32:41,375 INFO L290 TraceCheckUtils]: 71: Hoare triple {132617#false} check_#res#1 := check_~tmp~1#1; {132617#false} is VALID [2022-02-20 18:32:41,376 INFO L290 TraceCheckUtils]: 72: Hoare triple {132617#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {132617#false} is VALID [2022-02-20 18:32:41,376 INFO L290 TraceCheckUtils]: 73: Hoare triple {132617#false} assume 0 == assert_~arg#1 % 256; {132617#false} is VALID [2022-02-20 18:32:41,376 INFO L290 TraceCheckUtils]: 74: Hoare triple {132617#false} assume !false; {132617#false} is VALID [2022-02-20 18:32:41,376 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:32:41,376 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:41,377 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390472717] [2022-02-20 18:32:41,377 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390472717] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:41,377 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:41,377 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:32:41,377 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045216272] [2022-02-20 18:32:41,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:41,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2022-02-20 18:32:41,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:41,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:41,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:41,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:32:41,432 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:41,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:32:41,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:32:41,433 INFO L87 Difference]: Start difference. First operand 8041 states and 12783 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)