./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 958ad7cbd67a25f08fdfb008e82df18bba1cce7737ba27f2fb1a13f2299466c1 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:58:47,973 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:58:47,995 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:58:48,020 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:58:48,020 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:58:48,021 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:58:48,022 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:58:48,024 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:58:48,026 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:58:48,027 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:58:48,028 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:58:48,029 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:58:48,029 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:58:48,030 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:58:48,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:58:48,033 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:58:48,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:58:48,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:58:48,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:58:48,037 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:58:48,039 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:58:48,040 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:58:48,041 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:58:48,042 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:58:48,044 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:58:48,045 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:58:48,045 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:58:48,046 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:58:48,046 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:58:48,047 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:58:48,047 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:58:48,048 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:58:48,049 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:58:48,049 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:58:48,050 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:58:48,050 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:58:48,051 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:58:48,051 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:58:48,052 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:58:48,052 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:58:48,053 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:58:48,056 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:58:48,079 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:58:48,079 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:58:48,080 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:58:48,080 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:58:48,081 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:58:48,081 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:58:48,081 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:58:48,082 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:58:48,082 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:58:48,082 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:58:48,083 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:58:48,083 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:58:48,083 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:58:48,083 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:58:48,084 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:58:48,084 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:58:48,084 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:58:48,084 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:58:48,084 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:58:48,085 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:58:48,085 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:58:48,085 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:58:48,085 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:58:48,085 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:58:48,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:58:48,086 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:58:48,086 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:58:48,086 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:58:48,087 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:58:48,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:58:48,087 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:58:48,087 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:58:48,087 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:58:48,088 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 -> 958ad7cbd67a25f08fdfb008e82df18bba1cce7737ba27f2fb1a13f2299466c1 [2022-02-20 18:58:48,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:58:48,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:58:48,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:58:48,373 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:58:48,374 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:58:48,375 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:58:48,444 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/456ec0a83/f005f6d40f674138bce84a6c35e91690/FLAGfa5663402 [2022-02-20 18:58:48,866 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:58:48,866 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:58:48,887 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/456ec0a83/f005f6d40f674138bce84a6c35e91690/FLAGfa5663402 [2022-02-20 18:58:49,234 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/456ec0a83/f005f6d40f674138bce84a6c35e91690 [2022-02-20 18:58:49,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:58:49,237 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:58:49,242 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:58:49,242 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:58:49,245 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:58:49,245 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:58:49" (1/1) ... [2022-02-20 18:58:49,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7071fec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:49, skipping insertion in model container [2022-02-20 18:58:49,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:58:49" (1/1) ... [2022-02-20 18:58:49,252 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:58:49,286 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:58:49,480 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7920,7933] [2022-02-20 18:58:49,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:58:49,525 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:58:49,570 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7920,7933] [2022-02-20 18:58:49,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:58:49,622 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:58:49,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:49 WrapperNode [2022-02-20 18:58:49,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:58:49,623 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:58:49,623 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:58:49,623 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:58:49,633 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:58:49" (1/1) ... [2022-02-20 18:58:49,642 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:58:49" (1/1) ... [2022-02-20 18:58:49,695 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 635 [2022-02-20 18:58:49,696 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:58:49,696 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:58:49,696 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:58:49,697 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:58:49,711 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:49" (1/1) ... [2022-02-20 18:58:49,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:49" (1/1) ... [2022-02-20 18:58:49,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:49" (1/1) ... [2022-02-20 18:58:49,734 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:49" (1/1) ... [2022-02-20 18:58:49,743 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:49" (1/1) ... [2022-02-20 18:58:49,760 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:49" (1/1) ... [2022-02-20 18:58:49,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:49" (1/1) ... [2022-02-20 18:58:49,765 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:58:49,766 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:58:49,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:58:49,779 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:58:49,780 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:49" (1/1) ... [2022-02-20 18:58:49,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:58:49,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:58:49,806 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:58:49,811 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:58:49,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:58:49,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:58:49,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:58:49,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:58:49,923 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:58:49,925 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:58:50,631 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:58:50,638 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:58:50,641 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:58:50,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:58:50 BoogieIcfgContainer [2022-02-20 18:58:50,643 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:58:50,645 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:58:50,645 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:58:50,648 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:58:50,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:58:49" (1/3) ... [2022-02-20 18:58:50,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de9dda3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:58:50, skipping insertion in model container [2022-02-20 18:58:50,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:49" (2/3) ... [2022-02-20 18:58:50,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de9dda3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:58:50, skipping insertion in model container [2022-02-20 18:58:50,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:58:50" (3/3) ... [2022-02-20 18:58:50,651 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:58:50,659 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:58:50,659 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:58:50,709 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:58:50,716 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:58:50,716 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:58:50,745 INFO L276 IsEmpty]: Start isEmpty. Operand has 155 states, 153 states have (on average 1.7450980392156863) internal successors, (267), 154 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:50,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 18:58:50,753 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:50,754 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] [2022-02-20 18:58:50,755 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:50,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:50,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1975649421, now seen corresponding path program 1 times [2022-02-20 18:58:50,765 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:50,765 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398586022] [2022-02-20 18:58:50,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:50,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:51,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {158#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1916~0 := 0;~__return_2065~0 := 0; {158#true} is VALID [2022-02-20 18:58:51,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {158#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {158#true} is VALID [2022-02-20 18:58:51,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {158#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {158#true} is VALID [2022-02-20 18:58:51,149 INFO L290 TraceCheckUtils]: 3: Hoare triple {158#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {158#true} is VALID [2022-02-20 18:58:51,150 INFO L290 TraceCheckUtils]: 4: Hoare triple {158#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {158#true} is VALID [2022-02-20 18:58:51,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {158#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {158#true} is VALID [2022-02-20 18:58:51,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {158#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {158#true} is VALID [2022-02-20 18:58:51,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {158#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {158#true} is VALID [2022-02-20 18:58:51,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {158#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {158#true} is VALID [2022-02-20 18:58:51,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {158#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {158#true} is VALID [2022-02-20 18:58:51,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {158#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {158#true} is VALID [2022-02-20 18:58:51,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {158#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {158#true} is VALID [2022-02-20 18:58:51,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {158#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {158#true} is VALID [2022-02-20 18:58:51,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {158#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {158#true} is VALID [2022-02-20 18:58:51,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {158#true} assume ~id1~0 != ~id2~0; {158#true} is VALID [2022-02-20 18:58:51,153 INFO L290 TraceCheckUtils]: 15: Hoare triple {158#true} assume ~id1~0 != ~id3~0; {158#true} is VALID [2022-02-20 18:58:51,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {158#true} assume ~id2~0 != ~id3~0; {158#true} is VALID [2022-02-20 18:58:51,153 INFO L290 TraceCheckUtils]: 17: Hoare triple {158#true} assume ~id1~0 >= 0; {158#true} is VALID [2022-02-20 18:58:51,154 INFO L290 TraceCheckUtils]: 18: Hoare triple {158#true} assume ~id2~0 >= 0; {158#true} is VALID [2022-02-20 18:58:51,154 INFO L290 TraceCheckUtils]: 19: Hoare triple {158#true} assume ~id3~0 >= 0; {158#true} is VALID [2022-02-20 18:58:51,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {158#true} assume 0 == ~r1~0 % 256; {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:58:51,157 INFO L290 TraceCheckUtils]: 21: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~r2~0 % 256; {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:58:51,157 INFO L290 TraceCheckUtils]: 22: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~r3~0 % 256; {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:58:51,158 INFO L290 TraceCheckUtils]: 23: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == main_~init__r122~0#1 % 256); {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:58:51,159 INFO L290 TraceCheckUtils]: 24: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == main_~init__r132~0#1 % 256); {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:58:51,159 INFO L290 TraceCheckUtils]: 25: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == main_~init__r212~0#1 % 256); {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:58:51,160 INFO L290 TraceCheckUtils]: 26: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == main_~init__r232~0#1 % 256); {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:58:51,160 INFO L290 TraceCheckUtils]: 27: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == main_~init__r312~0#1 % 256); {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:58:51,161 INFO L290 TraceCheckUtils]: 28: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == main_~init__r322~0#1 % 256); {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:58:51,161 INFO L290 TraceCheckUtils]: 29: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max1~0 == ~id1~0; {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:58:51,162 INFO L290 TraceCheckUtils]: 30: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max2~0 == ~id2~0; {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:58:51,162 INFO L290 TraceCheckUtils]: 31: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max3~0 == ~id3~0; {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:58:51,163 INFO L290 TraceCheckUtils]: 32: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:58:51,163 INFO L290 TraceCheckUtils]: 33: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:58:51,164 INFO L290 TraceCheckUtils]: 34: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:58:51,164 INFO L290 TraceCheckUtils]: 35: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl1~0; {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:58:51,165 INFO L290 TraceCheckUtils]: 36: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl2~0; {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:58:51,165 INFO L290 TraceCheckUtils]: 37: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl3~0; {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:58:51,166 INFO L290 TraceCheckUtils]: 38: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:58:51,166 INFO L290 TraceCheckUtils]: 39: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:58:51,167 INFO L290 TraceCheckUtils]: 40: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:58:51,167 INFO L290 TraceCheckUtils]: 41: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == ~newmax1~0 % 256); {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:58:51,168 INFO L290 TraceCheckUtils]: 42: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == ~newmax2~0 % 256); {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:58:51,168 INFO L290 TraceCheckUtils]: 43: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1916~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1916~0; {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:58:51,169 INFO L290 TraceCheckUtils]: 44: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:58:51,170 INFO L290 TraceCheckUtils]: 45: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:58:51,171 INFO L290 TraceCheckUtils]: 46: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode1~0 % 256); {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:58:51,172 INFO L290 TraceCheckUtils]: 47: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~r1~0 % 256 < 1); {159#false} is VALID [2022-02-20 18:58:51,172 INFO L290 TraceCheckUtils]: 48: Hoare triple {159#false} ~mode1~0 := 1; {159#false} is VALID [2022-02-20 18:58:51,175 INFO L290 TraceCheckUtils]: 49: Hoare triple {159#false} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {159#false} is VALID [2022-02-20 18:58:51,175 INFO L290 TraceCheckUtils]: 50: Hoare triple {159#false} assume !!(0 == ~mode2~0 % 256); {159#false} is VALID [2022-02-20 18:58:51,175 INFO L290 TraceCheckUtils]: 51: Hoare triple {159#false} assume !(~r2~0 % 256 < 2); {159#false} is VALID [2022-02-20 18:58:51,175 INFO L290 TraceCheckUtils]: 52: Hoare triple {159#false} ~mode2~0 := 1; {159#false} is VALID [2022-02-20 18:58:51,176 INFO L290 TraceCheckUtils]: 53: Hoare triple {159#false} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {159#false} is VALID [2022-02-20 18:58:51,176 INFO L290 TraceCheckUtils]: 54: Hoare triple {159#false} assume !!(0 == ~mode3~0 % 256); {159#false} is VALID [2022-02-20 18:58:51,178 INFO L290 TraceCheckUtils]: 55: Hoare triple {159#false} assume !(~r3~0 % 256 < 2); {159#false} is VALID [2022-02-20 18:58:51,178 INFO L290 TraceCheckUtils]: 56: Hoare triple {159#false} ~mode3~0 := 1; {159#false} is VALID [2022-02-20 18:58:51,179 INFO L290 TraceCheckUtils]: 57: Hoare triple {159#false} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {159#false} is VALID [2022-02-20 18:58:51,180 INFO L290 TraceCheckUtils]: 58: Hoare triple {159#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {159#false} is VALID [2022-02-20 18:58:51,180 INFO L290 TraceCheckUtils]: 59: Hoare triple {159#false} ~__return_2065~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2065~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {159#false} is VALID [2022-02-20 18:58:51,181 INFO L290 TraceCheckUtils]: 60: Hoare triple {159#false} assume 0 == main_~assert__arg~0#1 % 256; {159#false} is VALID [2022-02-20 18:58:51,181 INFO L290 TraceCheckUtils]: 61: Hoare triple {159#false} assume !false; {159#false} is VALID [2022-02-20 18:58:51,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:58:51,184 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:51,184 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398586022] [2022-02-20 18:58:51,185 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398586022] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:51,185 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:51,185 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:58:51,186 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879595547] [2022-02-20 18:58:51,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:51,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-02-20 18:58:51,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:51,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:51,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:51,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:58:51,259 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:51,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:58:51,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:51,279 INFO L87 Difference]: Start difference. First operand has 155 states, 153 states have (on average 1.7450980392156863) internal successors, (267), 154 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:51,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:51,795 INFO L93 Difference]: Finished difference Result 329 states and 551 transitions. [2022-02-20 18:58:51,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:58:51,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-02-20 18:58:51,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:51,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:51,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 551 transitions. [2022-02-20 18:58:51,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:51,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 551 transitions. [2022-02-20 18:58:51,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 551 transitions. [2022-02-20 18:58:52,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 551 edges. 551 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:52,327 INFO L225 Difference]: With dead ends: 329 [2022-02-20 18:58:52,327 INFO L226 Difference]: Without dead ends: 225 [2022-02-20 18:58:52,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:52,332 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 157 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:58:52,333 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 440 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:58:52,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-02-20 18:58:52,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 222. [2022-02-20 18:58:52,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:52,389 INFO L82 GeneralOperation]: Start isEquivalent. First operand 225 states. Second operand has 222 states, 221 states have (on average 1.5610859728506787) internal successors, (345), 221 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:52,391 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand has 222 states, 221 states have (on average 1.5610859728506787) internal successors, (345), 221 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:52,392 INFO L87 Difference]: Start difference. First operand 225 states. Second operand has 222 states, 221 states have (on average 1.5610859728506787) internal successors, (345), 221 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:52,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:52,402 INFO L93 Difference]: Finished difference Result 225 states and 347 transitions. [2022-02-20 18:58:52,402 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 347 transitions. [2022-02-20 18:58:52,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:52,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:52,404 INFO L74 IsIncluded]: Start isIncluded. First operand has 222 states, 221 states have (on average 1.5610859728506787) internal successors, (345), 221 states have internal predecessors, (345), 0 states have call successors, (0), 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 225 states. [2022-02-20 18:58:52,405 INFO L87 Difference]: Start difference. First operand has 222 states, 221 states have (on average 1.5610859728506787) internal successors, (345), 221 states have internal predecessors, (345), 0 states have call successors, (0), 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 225 states. [2022-02-20 18:58:52,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:52,413 INFO L93 Difference]: Finished difference Result 225 states and 347 transitions. [2022-02-20 18:58:52,413 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 347 transitions. [2022-02-20 18:58:52,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:52,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:52,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:52,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:52,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 1.5610859728506787) internal successors, (345), 221 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:52,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 345 transitions. [2022-02-20 18:58:52,425 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 345 transitions. Word has length 62 [2022-02-20 18:58:52,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:52,426 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 345 transitions. [2022-02-20 18:58:52,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:52,426 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 345 transitions. [2022-02-20 18:58:52,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:58:52,429 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:52,429 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] [2022-02-20 18:58:52,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:58:52,429 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:52,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:52,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1826541876, now seen corresponding path program 1 times [2022-02-20 18:58:52,430 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:52,431 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687474538] [2022-02-20 18:58:52,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:52,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:52,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:52,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {1352#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1916~0 := 0;~__return_2065~0 := 0; {1352#true} is VALID [2022-02-20 18:58:52,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {1352#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {1352#true} is VALID [2022-02-20 18:58:52,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {1352#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {1352#true} is VALID [2022-02-20 18:58:52,570 INFO L290 TraceCheckUtils]: 3: Hoare triple {1352#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {1352#true} is VALID [2022-02-20 18:58:52,570 INFO L290 TraceCheckUtils]: 4: Hoare triple {1352#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {1352#true} is VALID [2022-02-20 18:58:52,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {1352#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {1352#true} is VALID [2022-02-20 18:58:52,571 INFO L290 TraceCheckUtils]: 6: Hoare triple {1352#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {1352#true} is VALID [2022-02-20 18:58:52,571 INFO L290 TraceCheckUtils]: 7: Hoare triple {1352#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {1352#true} is VALID [2022-02-20 18:58:52,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {1352#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {1352#true} is VALID [2022-02-20 18:58:52,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {1352#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {1352#true} is VALID [2022-02-20 18:58:52,572 INFO L290 TraceCheckUtils]: 10: Hoare triple {1352#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {1352#true} is VALID [2022-02-20 18:58:52,572 INFO L290 TraceCheckUtils]: 11: Hoare triple {1352#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {1352#true} is VALID [2022-02-20 18:58:52,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {1352#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {1352#true} is VALID [2022-02-20 18:58:52,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {1352#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {1352#true} is VALID [2022-02-20 18:58:52,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {1352#true} assume ~id1~0 != ~id2~0; {1352#true} is VALID [2022-02-20 18:58:52,573 INFO L290 TraceCheckUtils]: 15: Hoare triple {1352#true} assume ~id1~0 != ~id3~0; {1352#true} is VALID [2022-02-20 18:58:52,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {1352#true} assume ~id2~0 != ~id3~0; {1352#true} is VALID [2022-02-20 18:58:52,574 INFO L290 TraceCheckUtils]: 17: Hoare triple {1352#true} assume ~id1~0 >= 0; {1352#true} is VALID [2022-02-20 18:58:52,574 INFO L290 TraceCheckUtils]: 18: Hoare triple {1352#true} assume ~id2~0 >= 0; {1352#true} is VALID [2022-02-20 18:58:52,575 INFO L290 TraceCheckUtils]: 19: Hoare triple {1352#true} assume ~id3~0 >= 0; {1352#true} is VALID [2022-02-20 18:58:52,575 INFO L290 TraceCheckUtils]: 20: Hoare triple {1352#true} assume 0 == ~r1~0 % 256; {1352#true} is VALID [2022-02-20 18:58:52,576 INFO L290 TraceCheckUtils]: 21: Hoare triple {1352#true} assume 0 == ~r2~0 % 256; {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:58:52,577 INFO L290 TraceCheckUtils]: 22: Hoare triple {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~r3~0 % 256; {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:58:52,577 INFO L290 TraceCheckUtils]: 23: Hoare triple {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == main_~init__r122~0#1 % 256); {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:58:52,578 INFO L290 TraceCheckUtils]: 24: Hoare triple {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == main_~init__r132~0#1 % 256); {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:58:52,578 INFO L290 TraceCheckUtils]: 25: Hoare triple {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == main_~init__r212~0#1 % 256); {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:58:52,578 INFO L290 TraceCheckUtils]: 26: Hoare triple {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == main_~init__r232~0#1 % 256); {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:58:52,579 INFO L290 TraceCheckUtils]: 27: Hoare triple {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == main_~init__r312~0#1 % 256); {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:58:52,579 INFO L290 TraceCheckUtils]: 28: Hoare triple {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == main_~init__r322~0#1 % 256); {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:58:52,580 INFO L290 TraceCheckUtils]: 29: Hoare triple {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max1~0 == ~id1~0; {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:58:52,580 INFO L290 TraceCheckUtils]: 30: Hoare triple {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max2~0 == ~id2~0; {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:58:52,580 INFO L290 TraceCheckUtils]: 31: Hoare triple {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max3~0 == ~id3~0; {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:58:52,581 INFO L290 TraceCheckUtils]: 32: Hoare triple {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st1~0; {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:58:52,581 INFO L290 TraceCheckUtils]: 33: Hoare triple {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st2~0; {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:58:52,582 INFO L290 TraceCheckUtils]: 34: Hoare triple {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st3~0; {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:58:52,582 INFO L290 TraceCheckUtils]: 35: Hoare triple {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl1~0; {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:58:52,582 INFO L290 TraceCheckUtils]: 36: Hoare triple {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl2~0; {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:58:52,583 INFO L290 TraceCheckUtils]: 37: Hoare triple {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl3~0; {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:58:52,583 INFO L290 TraceCheckUtils]: 38: Hoare triple {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode1~0 % 256; {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:58:52,584 INFO L290 TraceCheckUtils]: 39: Hoare triple {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode2~0 % 256; {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:58:52,584 INFO L290 TraceCheckUtils]: 40: Hoare triple {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode3~0 % 256; {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:58:52,585 INFO L290 TraceCheckUtils]: 41: Hoare triple {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == ~newmax1~0 % 256); {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:58:52,585 INFO L290 TraceCheckUtils]: 42: Hoare triple {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == ~newmax2~0 % 256); {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:58:52,587 INFO L290 TraceCheckUtils]: 43: Hoare triple {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1916~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1916~0; {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:58:52,587 INFO L290 TraceCheckUtils]: 44: Hoare triple {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:58:52,588 INFO L290 TraceCheckUtils]: 45: Hoare triple {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:58:52,588 INFO L290 TraceCheckUtils]: 46: Hoare triple {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !!(0 == ~mode1~0 % 256); {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:58:52,589 INFO L290 TraceCheckUtils]: 47: Hoare triple {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~r1~0 % 256 < 1; {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:58:52,589 INFO L290 TraceCheckUtils]: 48: Hoare triple {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !!(0 == ~ep12~0 % 256); {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:58:52,589 INFO L290 TraceCheckUtils]: 49: Hoare triple {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !!(0 == ~ep13~0 % 256); {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:58:52,590 INFO L290 TraceCheckUtils]: 50: Hoare triple {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} ~mode1~0 := 1; {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:58:52,590 INFO L290 TraceCheckUtils]: 51: Hoare triple {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:58:52,591 INFO L290 TraceCheckUtils]: 52: Hoare triple {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !!(0 == ~mode2~0 % 256); {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:58:52,592 INFO L290 TraceCheckUtils]: 53: Hoare triple {1354#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(~r2~0 % 256 < 2); {1353#false} is VALID [2022-02-20 18:58:52,592 INFO L290 TraceCheckUtils]: 54: Hoare triple {1353#false} ~mode2~0 := 1; {1353#false} is VALID [2022-02-20 18:58:52,592 INFO L290 TraceCheckUtils]: 55: Hoare triple {1353#false} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {1353#false} is VALID [2022-02-20 18:58:52,593 INFO L290 TraceCheckUtils]: 56: Hoare triple {1353#false} assume !!(0 == ~mode3~0 % 256); {1353#false} is VALID [2022-02-20 18:58:52,593 INFO L290 TraceCheckUtils]: 57: Hoare triple {1353#false} assume !(~r3~0 % 256 < 2); {1353#false} is VALID [2022-02-20 18:58:52,593 INFO L290 TraceCheckUtils]: 58: Hoare triple {1353#false} ~mode3~0 := 1; {1353#false} is VALID [2022-02-20 18:58:52,593 INFO L290 TraceCheckUtils]: 59: Hoare triple {1353#false} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {1353#false} is VALID [2022-02-20 18:58:52,593 INFO L290 TraceCheckUtils]: 60: Hoare triple {1353#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {1353#false} is VALID [2022-02-20 18:58:52,593 INFO L290 TraceCheckUtils]: 61: Hoare triple {1353#false} ~__return_2065~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2065~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {1353#false} is VALID [2022-02-20 18:58:52,593 INFO L290 TraceCheckUtils]: 62: Hoare triple {1353#false} assume 0 == main_~assert__arg~0#1 % 256; {1353#false} is VALID [2022-02-20 18:58:52,593 INFO L290 TraceCheckUtils]: 63: Hoare triple {1353#false} assume !false; {1353#false} is VALID [2022-02-20 18:58:52,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:58:52,594 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:52,594 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687474538] [2022-02-20 18:58:52,594 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687474538] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:52,594 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:52,594 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:58:52,594 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890126627] [2022-02-20 18:58:52,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:52,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-02-20 18:58:52,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:52,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:52,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:52,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:58:52,654 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:52,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:58:52,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:52,655 INFO L87 Difference]: Start difference. First operand 222 states and 345 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:53,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:53,078 INFO L93 Difference]: Finished difference Result 536 states and 857 transitions. [2022-02-20 18:58:53,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:58:53,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-02-20 18:58:53,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:53,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:53,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2022-02-20 18:58:53,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:53,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2022-02-20 18:58:53,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 535 transitions. [2022-02-20 18:58:53,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 535 edges. 535 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:53,478 INFO L225 Difference]: With dead ends: 536 [2022-02-20 18:58:53,478 INFO L226 Difference]: Without dead ends: 371 [2022-02-20 18:58:53,479 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:53,481 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 133 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:58:53,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 430 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:58:53,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2022-02-20 18:58:53,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 367. [2022-02-20 18:58:53,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:53,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 371 states. Second operand has 367 states, 366 states have (on average 1.5846994535519126) internal successors, (580), 366 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:53,576 INFO L74 IsIncluded]: Start isIncluded. First operand 371 states. Second operand has 367 states, 366 states have (on average 1.5846994535519126) internal successors, (580), 366 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:53,577 INFO L87 Difference]: Start difference. First operand 371 states. Second operand has 367 states, 366 states have (on average 1.5846994535519126) internal successors, (580), 366 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:53,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:53,589 INFO L93 Difference]: Finished difference Result 371 states and 583 transitions. [2022-02-20 18:58:53,590 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 583 transitions. [2022-02-20 18:58:53,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:53,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:53,592 INFO L74 IsIncluded]: Start isIncluded. First operand has 367 states, 366 states have (on average 1.5846994535519126) internal successors, (580), 366 states have internal predecessors, (580), 0 states have call successors, (0), 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 371 states. [2022-02-20 18:58:53,593 INFO L87 Difference]: Start difference. First operand has 367 states, 366 states have (on average 1.5846994535519126) internal successors, (580), 366 states have internal predecessors, (580), 0 states have call successors, (0), 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 371 states. [2022-02-20 18:58:53,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:53,606 INFO L93 Difference]: Finished difference Result 371 states and 583 transitions. [2022-02-20 18:58:53,606 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 583 transitions. [2022-02-20 18:58:53,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:53,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:53,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:53,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:53,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 366 states have (on average 1.5846994535519126) internal successors, (580), 366 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:53,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 580 transitions. [2022-02-20 18:58:53,623 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 580 transitions. Word has length 64 [2022-02-20 18:58:53,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:53,623 INFO L470 AbstractCegarLoop]: Abstraction has 367 states and 580 transitions. [2022-02-20 18:58:53,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:53,624 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 580 transitions. [2022-02-20 18:58:53,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:58:53,625 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:53,626 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:58:53,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:58:53,626 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:53,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:53,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1385775307, now seen corresponding path program 1 times [2022-02-20 18:58:53,627 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:53,627 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574468043] [2022-02-20 18:58:53,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:53,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:53,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:53,703 INFO L290 TraceCheckUtils]: 0: Hoare triple {3335#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1916~0 := 0;~__return_2065~0 := 0; {3335#true} is VALID [2022-02-20 18:58:53,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {3335#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {3335#true} is VALID [2022-02-20 18:58:53,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {3335#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {3335#true} is VALID [2022-02-20 18:58:53,704 INFO L290 TraceCheckUtils]: 3: Hoare triple {3335#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {3335#true} is VALID [2022-02-20 18:58:53,704 INFO L290 TraceCheckUtils]: 4: Hoare triple {3335#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {3335#true} is VALID [2022-02-20 18:58:53,704 INFO L290 TraceCheckUtils]: 5: Hoare triple {3335#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {3335#true} is VALID [2022-02-20 18:58:53,704 INFO L290 TraceCheckUtils]: 6: Hoare triple {3335#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {3335#true} is VALID [2022-02-20 18:58:53,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {3335#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {3335#true} is VALID [2022-02-20 18:58:53,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {3335#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {3335#true} is VALID [2022-02-20 18:58:53,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {3335#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {3335#true} is VALID [2022-02-20 18:58:53,705 INFO L290 TraceCheckUtils]: 10: Hoare triple {3335#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {3335#true} is VALID [2022-02-20 18:58:53,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {3335#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {3335#true} is VALID [2022-02-20 18:58:53,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {3335#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {3335#true} is VALID [2022-02-20 18:58:53,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {3335#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {3335#true} is VALID [2022-02-20 18:58:53,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {3335#true} assume ~id1~0 != ~id2~0; {3335#true} is VALID [2022-02-20 18:58:53,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {3335#true} assume ~id1~0 != ~id3~0; {3335#true} is VALID [2022-02-20 18:58:53,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {3335#true} assume ~id2~0 != ~id3~0; {3335#true} is VALID [2022-02-20 18:58:53,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {3335#true} assume ~id1~0 >= 0; {3335#true} is VALID [2022-02-20 18:58:53,708 INFO L290 TraceCheckUtils]: 18: Hoare triple {3335#true} assume ~id2~0 >= 0; {3335#true} is VALID [2022-02-20 18:58:53,708 INFO L290 TraceCheckUtils]: 19: Hoare triple {3335#true} assume ~id3~0 >= 0; {3335#true} is VALID [2022-02-20 18:58:53,708 INFO L290 TraceCheckUtils]: 20: Hoare triple {3335#true} assume 0 == ~r1~0 % 256; {3335#true} is VALID [2022-02-20 18:58:53,708 INFO L290 TraceCheckUtils]: 21: Hoare triple {3335#true} assume 0 == ~r2~0 % 256; {3335#true} is VALID [2022-02-20 18:58:53,709 INFO L290 TraceCheckUtils]: 22: Hoare triple {3335#true} assume 0 == ~r3~0 % 256; {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:58:53,710 INFO L290 TraceCheckUtils]: 23: Hoare triple {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == main_~init__r122~0#1 % 256); {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:58:53,710 INFO L290 TraceCheckUtils]: 24: Hoare triple {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == main_~init__r132~0#1 % 256); {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:58:53,710 INFO L290 TraceCheckUtils]: 25: Hoare triple {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == main_~init__r212~0#1 % 256); {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:58:53,711 INFO L290 TraceCheckUtils]: 26: Hoare triple {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == main_~init__r232~0#1 % 256); {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:58:53,711 INFO L290 TraceCheckUtils]: 27: Hoare triple {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == main_~init__r312~0#1 % 256); {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:58:53,712 INFO L290 TraceCheckUtils]: 28: Hoare triple {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == main_~init__r322~0#1 % 256); {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:58:53,712 INFO L290 TraceCheckUtils]: 29: Hoare triple {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max1~0 == ~id1~0; {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:58:53,712 INFO L290 TraceCheckUtils]: 30: Hoare triple {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max2~0 == ~id2~0; {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:58:53,713 INFO L290 TraceCheckUtils]: 31: Hoare triple {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max3~0 == ~id3~0; {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:58:53,713 INFO L290 TraceCheckUtils]: 32: Hoare triple {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st1~0; {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:58:53,714 INFO L290 TraceCheckUtils]: 33: Hoare triple {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st2~0; {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:58:53,714 INFO L290 TraceCheckUtils]: 34: Hoare triple {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st3~0; {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:58:53,715 INFO L290 TraceCheckUtils]: 35: Hoare triple {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl1~0; {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:58:53,715 INFO L290 TraceCheckUtils]: 36: Hoare triple {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl2~0; {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:58:53,715 INFO L290 TraceCheckUtils]: 37: Hoare triple {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl3~0; {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:58:53,716 INFO L290 TraceCheckUtils]: 38: Hoare triple {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode1~0 % 256; {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:58:53,716 INFO L290 TraceCheckUtils]: 39: Hoare triple {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode2~0 % 256; {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:58:53,717 INFO L290 TraceCheckUtils]: 40: Hoare triple {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode3~0 % 256; {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:58:53,717 INFO L290 TraceCheckUtils]: 41: Hoare triple {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == ~newmax1~0 % 256); {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:58:53,717 INFO L290 TraceCheckUtils]: 42: Hoare triple {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == ~newmax2~0 % 256); {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:58:53,718 INFO L290 TraceCheckUtils]: 43: Hoare triple {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1916~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1916~0; {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:58:53,726 INFO L290 TraceCheckUtils]: 44: Hoare triple {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:58:53,727 INFO L290 TraceCheckUtils]: 45: Hoare triple {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:58:53,727 INFO L290 TraceCheckUtils]: 46: Hoare triple {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~mode1~0 % 256); {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:58:53,727 INFO L290 TraceCheckUtils]: 47: Hoare triple {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~r1~0 % 256 < 1; {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:58:53,728 INFO L290 TraceCheckUtils]: 48: Hoare triple {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~ep12~0 % 256); {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:58:53,728 INFO L290 TraceCheckUtils]: 49: Hoare triple {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~ep13~0 % 256); {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:58:53,729 INFO L290 TraceCheckUtils]: 50: Hoare triple {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} ~mode1~0 := 1; {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:58:53,729 INFO L290 TraceCheckUtils]: 51: Hoare triple {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:58:53,729 INFO L290 TraceCheckUtils]: 52: Hoare triple {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~mode2~0 % 256); {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:58:53,730 INFO L290 TraceCheckUtils]: 53: Hoare triple {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~r2~0 % 256 < 2; {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:58:53,730 INFO L290 TraceCheckUtils]: 54: Hoare triple {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~ep21~0 % 256); {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:58:53,731 INFO L290 TraceCheckUtils]: 55: Hoare triple {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~ep23~0 % 256); {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:58:53,731 INFO L290 TraceCheckUtils]: 56: Hoare triple {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} ~mode2~0 := 1; {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:58:53,731 INFO L290 TraceCheckUtils]: 57: Hoare triple {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:58:53,732 INFO L290 TraceCheckUtils]: 58: Hoare triple {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~mode3~0 % 256); {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:58:53,735 INFO L290 TraceCheckUtils]: 59: Hoare triple {3337#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(~r3~0 % 256 < 2); {3336#false} is VALID [2022-02-20 18:58:53,735 INFO L290 TraceCheckUtils]: 60: Hoare triple {3336#false} ~mode3~0 := 1; {3336#false} is VALID [2022-02-20 18:58:53,735 INFO L290 TraceCheckUtils]: 61: Hoare triple {3336#false} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {3336#false} is VALID [2022-02-20 18:58:53,736 INFO L290 TraceCheckUtils]: 62: Hoare triple {3336#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {3336#false} is VALID [2022-02-20 18:58:53,736 INFO L290 TraceCheckUtils]: 63: Hoare triple {3336#false} ~__return_2065~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2065~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {3336#false} is VALID [2022-02-20 18:58:53,736 INFO L290 TraceCheckUtils]: 64: Hoare triple {3336#false} assume 0 == main_~assert__arg~0#1 % 256; {3336#false} is VALID [2022-02-20 18:58:53,737 INFO L290 TraceCheckUtils]: 65: Hoare triple {3336#false} assume !false; {3336#false} is VALID [2022-02-20 18:58:53,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:58:53,741 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:53,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574468043] [2022-02-20 18:58:53,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574468043] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:53,741 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:53,741 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:58:53,742 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113733129] [2022-02-20 18:58:53,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:53,742 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:58:53,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:53,743 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:58:53,789 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:58:53,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:58:53,790 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:53,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:58:53,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:53,791 INFO L87 Difference]: Start difference. First operand 367 states and 580 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:58:54,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:54,318 INFO L93 Difference]: Finished difference Result 955 states and 1534 transitions. [2022-02-20 18:58:54,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:58:54,319 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:58:54,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:54,319 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:58:54,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2022-02-20 18:58:54,334 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:58:54,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2022-02-20 18:58:54,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 535 transitions. [2022-02-20 18:58:54,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 535 edges. 535 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:54,759 INFO L225 Difference]: With dead ends: 955 [2022-02-20 18:58:54,759 INFO L226 Difference]: Without dead ends: 645 [2022-02-20 18:58:54,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:54,762 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 127 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:58:54,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 431 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:58:54,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2022-02-20 18:58:54,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 639. [2022-02-20 18:58:54,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:54,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 645 states. Second operand has 639 states, 638 states have (on average 1.5924764890282133) internal successors, (1016), 638 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:54,961 INFO L74 IsIncluded]: Start isIncluded. First operand 645 states. Second operand has 639 states, 638 states have (on average 1.5924764890282133) internal successors, (1016), 638 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:54,963 INFO L87 Difference]: Start difference. First operand 645 states. Second operand has 639 states, 638 states have (on average 1.5924764890282133) internal successors, (1016), 638 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:54,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:54,984 INFO L93 Difference]: Finished difference Result 645 states and 1021 transitions. [2022-02-20 18:58:54,984 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1021 transitions. [2022-02-20 18:58:54,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:54,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:54,987 INFO L74 IsIncluded]: Start isIncluded. First operand has 639 states, 638 states have (on average 1.5924764890282133) internal successors, (1016), 638 states have internal predecessors, (1016), 0 states have call successors, (0), 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 645 states. [2022-02-20 18:58:54,988 INFO L87 Difference]: Start difference. First operand has 639 states, 638 states have (on average 1.5924764890282133) internal successors, (1016), 638 states have internal predecessors, (1016), 0 states have call successors, (0), 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 645 states. [2022-02-20 18:58:55,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:55,010 INFO L93 Difference]: Finished difference Result 645 states and 1021 transitions. [2022-02-20 18:58:55,010 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1021 transitions. [2022-02-20 18:58:55,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:55,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:55,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:55,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:55,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 638 states have (on average 1.5924764890282133) internal successors, (1016), 638 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:55,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 1016 transitions. [2022-02-20 18:58:55,040 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 1016 transitions. Word has length 66 [2022-02-20 18:58:55,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:55,041 INFO L470 AbstractCegarLoop]: Abstraction has 639 states and 1016 transitions. [2022-02-20 18:58:55,041 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:58:55,041 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 1016 transitions. [2022-02-20 18:58:55,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 18:58:55,042 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:55,042 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:58:55,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:58:55,043 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:55,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:55,043 INFO L85 PathProgramCache]: Analyzing trace with hash -190660810, now seen corresponding path program 1 times [2022-02-20 18:58:55,043 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:55,044 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231807864] [2022-02-20 18:58:55,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:55,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:55,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {6838#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1916~0 := 0;~__return_2065~0 := 0; {6838#true} is VALID [2022-02-20 18:58:55,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {6838#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {6838#true} is VALID [2022-02-20 18:58:55,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {6838#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {6838#true} is VALID [2022-02-20 18:58:55,155 INFO L290 TraceCheckUtils]: 3: Hoare triple {6838#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {6838#true} is VALID [2022-02-20 18:58:55,155 INFO L290 TraceCheckUtils]: 4: Hoare triple {6838#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {6838#true} is VALID [2022-02-20 18:58:55,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {6838#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {6838#true} is VALID [2022-02-20 18:58:55,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {6838#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {6838#true} is VALID [2022-02-20 18:58:55,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {6838#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {6838#true} is VALID [2022-02-20 18:58:55,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {6838#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {6838#true} is VALID [2022-02-20 18:58:55,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {6838#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {6838#true} is VALID [2022-02-20 18:58:55,156 INFO L290 TraceCheckUtils]: 10: Hoare triple {6838#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {6838#true} is VALID [2022-02-20 18:58:55,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {6838#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {6838#true} is VALID [2022-02-20 18:58:55,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {6838#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {6838#true} is VALID [2022-02-20 18:58:55,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {6838#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {6838#true} is VALID [2022-02-20 18:58:55,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {6838#true} assume ~id1~0 != ~id2~0; {6838#true} is VALID [2022-02-20 18:58:55,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {6838#true} assume ~id1~0 != ~id3~0; {6838#true} is VALID [2022-02-20 18:58:55,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {6838#true} assume ~id2~0 != ~id3~0; {6838#true} is VALID [2022-02-20 18:58:55,158 INFO L290 TraceCheckUtils]: 17: Hoare triple {6838#true} assume ~id1~0 >= 0; {6838#true} is VALID [2022-02-20 18:58:55,158 INFO L290 TraceCheckUtils]: 18: Hoare triple {6838#true} assume ~id2~0 >= 0; {6838#true} is VALID [2022-02-20 18:58:55,158 INFO L290 TraceCheckUtils]: 19: Hoare triple {6838#true} assume ~id3~0 >= 0; {6838#true} is VALID [2022-02-20 18:58:55,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {6838#true} assume 0 == ~r1~0 % 256; {6838#true} is VALID [2022-02-20 18:58:55,158 INFO L290 TraceCheckUtils]: 21: Hoare triple {6838#true} assume 0 == ~r2~0 % 256; {6838#true} is VALID [2022-02-20 18:58:55,158 INFO L290 TraceCheckUtils]: 22: Hoare triple {6838#true} assume 0 == ~r3~0 % 256; {6838#true} is VALID [2022-02-20 18:58:55,159 INFO L290 TraceCheckUtils]: 23: Hoare triple {6838#true} assume !(0 == main_~init__r122~0#1 % 256); {6838#true} is VALID [2022-02-20 18:58:55,159 INFO L290 TraceCheckUtils]: 24: Hoare triple {6838#true} assume !(0 == main_~init__r132~0#1 % 256); {6838#true} is VALID [2022-02-20 18:58:55,159 INFO L290 TraceCheckUtils]: 25: Hoare triple {6838#true} assume !(0 == main_~init__r212~0#1 % 256); {6838#true} is VALID [2022-02-20 18:58:55,159 INFO L290 TraceCheckUtils]: 26: Hoare triple {6838#true} assume !(0 == main_~init__r232~0#1 % 256); {6838#true} is VALID [2022-02-20 18:58:55,159 INFO L290 TraceCheckUtils]: 27: Hoare triple {6838#true} assume !(0 == main_~init__r312~0#1 % 256); {6838#true} is VALID [2022-02-20 18:58:55,160 INFO L290 TraceCheckUtils]: 28: Hoare triple {6838#true} assume !(0 == main_~init__r322~0#1 % 256); {6838#true} is VALID [2022-02-20 18:58:55,160 INFO L290 TraceCheckUtils]: 29: Hoare triple {6838#true} assume ~max1~0 == ~id1~0; {6838#true} is VALID [2022-02-20 18:58:55,160 INFO L290 TraceCheckUtils]: 30: Hoare triple {6838#true} assume ~max2~0 == ~id2~0; {6838#true} is VALID [2022-02-20 18:58:55,160 INFO L290 TraceCheckUtils]: 31: Hoare triple {6838#true} assume ~max3~0 == ~id3~0; {6838#true} is VALID [2022-02-20 18:58:55,161 INFO L290 TraceCheckUtils]: 32: Hoare triple {6838#true} assume 0 == ~st1~0; {6840#(<= ~st1~0 0)} is VALID [2022-02-20 18:58:55,161 INFO L290 TraceCheckUtils]: 33: Hoare triple {6840#(<= ~st1~0 0)} assume 0 == ~st2~0; {6841#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:55,161 INFO L290 TraceCheckUtils]: 34: Hoare triple {6841#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:55,162 INFO L290 TraceCheckUtils]: 35: Hoare triple {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl1~0; {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:55,162 INFO L290 TraceCheckUtils]: 36: Hoare triple {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl2~0; {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:55,163 INFO L290 TraceCheckUtils]: 37: Hoare triple {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl3~0; {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:55,163 INFO L290 TraceCheckUtils]: 38: Hoare triple {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:55,163 INFO L290 TraceCheckUtils]: 39: Hoare triple {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:55,164 INFO L290 TraceCheckUtils]: 40: Hoare triple {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:55,164 INFO L290 TraceCheckUtils]: 41: Hoare triple {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~newmax1~0 % 256); {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:55,165 INFO L290 TraceCheckUtils]: 42: Hoare triple {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~newmax2~0 % 256); {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:55,165 INFO L290 TraceCheckUtils]: 43: Hoare triple {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1916~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1916~0; {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:55,165 INFO L290 TraceCheckUtils]: 44: Hoare triple {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:55,166 INFO L290 TraceCheckUtils]: 45: Hoare triple {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:55,166 INFO L290 TraceCheckUtils]: 46: Hoare triple {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:55,166 INFO L290 TraceCheckUtils]: 47: Hoare triple {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 1; {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:55,167 INFO L290 TraceCheckUtils]: 48: Hoare triple {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep12~0 % 256); {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:55,167 INFO L290 TraceCheckUtils]: 49: Hoare triple {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep13~0 % 256); {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:55,168 INFO L290 TraceCheckUtils]: 50: Hoare triple {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:55,168 INFO L290 TraceCheckUtils]: 51: Hoare triple {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:55,168 INFO L290 TraceCheckUtils]: 52: Hoare triple {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:55,169 INFO L290 TraceCheckUtils]: 53: Hoare triple {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r2~0 % 256 < 2; {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:55,169 INFO L290 TraceCheckUtils]: 54: Hoare triple {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep21~0 % 256); {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:55,170 INFO L290 TraceCheckUtils]: 55: Hoare triple {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep23~0 % 256); {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:55,170 INFO L290 TraceCheckUtils]: 56: Hoare triple {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:55,170 INFO L290 TraceCheckUtils]: 57: Hoare triple {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:55,171 INFO L290 TraceCheckUtils]: 58: Hoare triple {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:55,171 INFO L290 TraceCheckUtils]: 59: Hoare triple {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r3~0 % 256 < 2; {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:55,172 INFO L290 TraceCheckUtils]: 60: Hoare triple {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep31~0 % 256); {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:55,172 INFO L290 TraceCheckUtils]: 61: Hoare triple {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep32~0 % 256); {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:55,172 INFO L290 TraceCheckUtils]: 62: Hoare triple {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:55,173 INFO L290 TraceCheckUtils]: 63: Hoare triple {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:55,173 INFO L290 TraceCheckUtils]: 64: Hoare triple {6842#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {6839#false} is VALID [2022-02-20 18:58:55,173 INFO L290 TraceCheckUtils]: 65: Hoare triple {6839#false} ~__return_2065~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2065~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {6839#false} is VALID [2022-02-20 18:58:55,174 INFO L290 TraceCheckUtils]: 66: Hoare triple {6839#false} assume 0 == main_~assert__arg~0#1 % 256; {6839#false} is VALID [2022-02-20 18:58:55,174 INFO L290 TraceCheckUtils]: 67: Hoare triple {6839#false} assume !false; {6839#false} is VALID [2022-02-20 18:58:55,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:58:55,174 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:55,175 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231807864] [2022-02-20 18:58:55,175 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231807864] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:55,175 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:55,175 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:58:55,175 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613529450] [2022-02-20 18:58:55,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:55,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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:58:55,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:55,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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:58:55,225 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:58:55,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:58:55,225 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:55,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:58:55,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:58:55,226 INFO L87 Difference]: Start difference. First operand 639 states and 1016 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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:58:58,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:58,621 INFO L93 Difference]: Finished difference Result 3283 states and 5314 transitions. [2022-02-20 18:58:58,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:58:58,622 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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:58:58,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:58,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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:58:58,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1181 transitions. [2022-02-20 18:58:58,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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:58:58,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1181 transitions. [2022-02-20 18:58:58,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1181 transitions. [2022-02-20 18:58:59,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1181 edges. 1181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:59,764 INFO L225 Difference]: With dead ends: 3283 [2022-02-20 18:58:59,764 INFO L226 Difference]: Without dead ends: 2701 [2022-02-20 18:58:59,766 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:58:59,767 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 1026 mSDsluCounter, 1369 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:58:59,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1026 Valid, 1596 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:58:59,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2022-02-20 18:59:00,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 1203. [2022-02-20 18:59:00,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:59:00,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2701 states. Second operand has 1203 states, 1202 states have (on average 1.600665557404326) internal successors, (1924), 1202 states have internal predecessors, (1924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:00,628 INFO L74 IsIncluded]: Start isIncluded. First operand 2701 states. Second operand has 1203 states, 1202 states have (on average 1.600665557404326) internal successors, (1924), 1202 states have internal predecessors, (1924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:00,630 INFO L87 Difference]: Start difference. First operand 2701 states. Second operand has 1203 states, 1202 states have (on average 1.600665557404326) internal successors, (1924), 1202 states have internal predecessors, (1924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:00,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:59:00,851 INFO L93 Difference]: Finished difference Result 2701 states and 4343 transitions. [2022-02-20 18:59:00,851 INFO L276 IsEmpty]: Start isEmpty. Operand 2701 states and 4343 transitions. [2022-02-20 18:59:00,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:59:00,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:59:00,859 INFO L74 IsIncluded]: Start isIncluded. First operand has 1203 states, 1202 states have (on average 1.600665557404326) internal successors, (1924), 1202 states have internal predecessors, (1924), 0 states have call successors, (0), 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 2701 states. [2022-02-20 18:59:00,861 INFO L87 Difference]: Start difference. First operand has 1203 states, 1202 states have (on average 1.600665557404326) internal successors, (1924), 1202 states have internal predecessors, (1924), 0 states have call successors, (0), 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 2701 states. [2022-02-20 18:59:01,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:59:01,095 INFO L93 Difference]: Finished difference Result 2701 states and 4343 transitions. [2022-02-20 18:59:01,095 INFO L276 IsEmpty]: Start isEmpty. Operand 2701 states and 4343 transitions. [2022-02-20 18:59:01,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:59:01,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:59:01,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:59:01,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:59:01,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1203 states, 1202 states have (on average 1.600665557404326) internal successors, (1924), 1202 states have internal predecessors, (1924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:01,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1924 transitions. [2022-02-20 18:59:01,198 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1924 transitions. Word has length 68 [2022-02-20 18:59:01,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:59:01,198 INFO L470 AbstractCegarLoop]: Abstraction has 1203 states and 1924 transitions. [2022-02-20 18:59:01,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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:59:01,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1924 transitions. [2022-02-20 18:59:01,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 18:59:01,200 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:59:01,200 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] [2022-02-20 18:59:01,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:59:01,200 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:59:01,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:59:01,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1678021987, now seen corresponding path program 1 times [2022-02-20 18:59:01,201 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:59:01,201 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616213561] [2022-02-20 18:59:01,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:59:01,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:59:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:59:01,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {18510#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1916~0 := 0;~__return_2065~0 := 0; {18510#true} is VALID [2022-02-20 18:59:01,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {18510#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {18510#true} is VALID [2022-02-20 18:59:01,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {18510#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {18510#true} is VALID [2022-02-20 18:59:01,261 INFO L290 TraceCheckUtils]: 3: Hoare triple {18510#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {18510#true} is VALID [2022-02-20 18:59:01,261 INFO L290 TraceCheckUtils]: 4: Hoare triple {18510#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {18510#true} is VALID [2022-02-20 18:59:01,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {18510#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {18510#true} is VALID [2022-02-20 18:59:01,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {18510#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {18510#true} is VALID [2022-02-20 18:59:01,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {18510#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {18510#true} is VALID [2022-02-20 18:59:01,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {18510#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {18510#true} is VALID [2022-02-20 18:59:01,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {18510#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {18510#true} is VALID [2022-02-20 18:59:01,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {18510#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {18510#true} is VALID [2022-02-20 18:59:01,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {18510#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {18510#true} is VALID [2022-02-20 18:59:01,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {18510#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {18510#true} is VALID [2022-02-20 18:59:01,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {18510#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {18510#true} is VALID [2022-02-20 18:59:01,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {18510#true} assume ~id1~0 != ~id2~0; {18510#true} is VALID [2022-02-20 18:59:01,263 INFO L290 TraceCheckUtils]: 15: Hoare triple {18510#true} assume ~id1~0 != ~id3~0; {18510#true} is VALID [2022-02-20 18:59:01,263 INFO L290 TraceCheckUtils]: 16: Hoare triple {18510#true} assume ~id2~0 != ~id3~0; {18510#true} is VALID [2022-02-20 18:59:01,263 INFO L290 TraceCheckUtils]: 17: Hoare triple {18510#true} assume ~id1~0 >= 0; {18510#true} is VALID [2022-02-20 18:59:01,263 INFO L290 TraceCheckUtils]: 18: Hoare triple {18510#true} assume ~id2~0 >= 0; {18510#true} is VALID [2022-02-20 18:59:01,263 INFO L290 TraceCheckUtils]: 19: Hoare triple {18510#true} assume ~id3~0 >= 0; {18510#true} is VALID [2022-02-20 18:59:01,264 INFO L290 TraceCheckUtils]: 20: Hoare triple {18510#true} assume 0 == ~r1~0 % 256; {18510#true} is VALID [2022-02-20 18:59:01,264 INFO L290 TraceCheckUtils]: 21: Hoare triple {18510#true} assume 0 == ~r2~0 % 256; {18510#true} is VALID [2022-02-20 18:59:01,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {18510#true} assume 0 == ~r3~0 % 256; {18510#true} is VALID [2022-02-20 18:59:01,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {18510#true} assume !(0 == main_~init__r122~0#1 % 256); {18510#true} is VALID [2022-02-20 18:59:01,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {18510#true} assume !(0 == main_~init__r132~0#1 % 256); {18510#true} is VALID [2022-02-20 18:59:01,264 INFO L290 TraceCheckUtils]: 25: Hoare triple {18510#true} assume !(0 == main_~init__r212~0#1 % 256); {18510#true} is VALID [2022-02-20 18:59:01,265 INFO L290 TraceCheckUtils]: 26: Hoare triple {18510#true} assume !(0 == main_~init__r232~0#1 % 256); {18510#true} is VALID [2022-02-20 18:59:01,265 INFO L290 TraceCheckUtils]: 27: Hoare triple {18510#true} assume !(0 == main_~init__r312~0#1 % 256); {18510#true} is VALID [2022-02-20 18:59:01,265 INFO L290 TraceCheckUtils]: 28: Hoare triple {18510#true} assume !(0 == main_~init__r322~0#1 % 256); {18510#true} is VALID [2022-02-20 18:59:01,265 INFO L290 TraceCheckUtils]: 29: Hoare triple {18510#true} assume ~max1~0 == ~id1~0; {18510#true} is VALID [2022-02-20 18:59:01,265 INFO L290 TraceCheckUtils]: 30: Hoare triple {18510#true} assume ~max2~0 == ~id2~0; {18510#true} is VALID [2022-02-20 18:59:01,265 INFO L290 TraceCheckUtils]: 31: Hoare triple {18510#true} assume ~max3~0 == ~id3~0; {18510#true} is VALID [2022-02-20 18:59:01,266 INFO L290 TraceCheckUtils]: 32: Hoare triple {18510#true} assume 0 == ~st1~0; {18512#(<= ~st1~0 0)} is VALID [2022-02-20 18:59:01,266 INFO L290 TraceCheckUtils]: 33: Hoare triple {18512#(<= ~st1~0 0)} assume 0 == ~st2~0; {18512#(<= ~st1~0 0)} is VALID [2022-02-20 18:59:01,267 INFO L290 TraceCheckUtils]: 34: Hoare triple {18512#(<= ~st1~0 0)} assume 0 == ~st3~0; {18512#(<= ~st1~0 0)} is VALID [2022-02-20 18:59:01,267 INFO L290 TraceCheckUtils]: 35: Hoare triple {18512#(<= ~st1~0 0)} assume 0 == ~nl1~0; {18513#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:59:01,267 INFO L290 TraceCheckUtils]: 36: Hoare triple {18513#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl2~0; {18513#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:59:01,268 INFO L290 TraceCheckUtils]: 37: Hoare triple {18513#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl3~0; {18513#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:59:01,269 INFO L290 TraceCheckUtils]: 38: Hoare triple {18513#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {18513#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:59:01,269 INFO L290 TraceCheckUtils]: 39: Hoare triple {18513#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {18513#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:59:01,270 INFO L290 TraceCheckUtils]: 40: Hoare triple {18513#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {18513#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:59:01,270 INFO L290 TraceCheckUtils]: 41: Hoare triple {18513#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 == ~newmax1~0 % 256); {18513#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:59:01,270 INFO L290 TraceCheckUtils]: 42: Hoare triple {18513#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 == ~newmax2~0 % 256); {18513#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:59:01,271 INFO L290 TraceCheckUtils]: 43: Hoare triple {18513#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1916~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1916~0; {18513#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:59:01,271 INFO L290 TraceCheckUtils]: 44: Hoare triple {18513#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {18513#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:59:01,272 INFO L290 TraceCheckUtils]: 45: Hoare triple {18513#(<= (+ ~nl1~0 ~st1~0) 0)} havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {18513#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:59:01,272 INFO L290 TraceCheckUtils]: 46: Hoare triple {18513#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {18513#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:59:01,273 INFO L290 TraceCheckUtils]: 47: Hoare triple {18513#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r1~0 % 256 < 1; {18513#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:59:01,273 INFO L290 TraceCheckUtils]: 48: Hoare triple {18513#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep12~0 % 256); {18513#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:59:01,273 INFO L290 TraceCheckUtils]: 49: Hoare triple {18513#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep13~0 % 256); {18513#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:59:01,274 INFO L290 TraceCheckUtils]: 50: Hoare triple {18513#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode1~0 := 1; {18513#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:59:01,274 INFO L290 TraceCheckUtils]: 51: Hoare triple {18513#(<= (+ ~nl1~0 ~st1~0) 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {18513#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:59:01,274 INFO L290 TraceCheckUtils]: 52: Hoare triple {18513#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {18513#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:59:01,275 INFO L290 TraceCheckUtils]: 53: Hoare triple {18513#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r2~0 % 256 < 2; {18513#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:59:01,275 INFO L290 TraceCheckUtils]: 54: Hoare triple {18513#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep21~0 % 256); {18513#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:59:01,275 INFO L290 TraceCheckUtils]: 55: Hoare triple {18513#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep23~0 % 256); {18513#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:59:01,276 INFO L290 TraceCheckUtils]: 56: Hoare triple {18513#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode2~0 := 1; {18513#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:59:01,276 INFO L290 TraceCheckUtils]: 57: Hoare triple {18513#(<= (+ ~nl1~0 ~st1~0) 0)} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {18513#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:59:01,276 INFO L290 TraceCheckUtils]: 58: Hoare triple {18513#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {18513#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:59:01,277 INFO L290 TraceCheckUtils]: 59: Hoare triple {18513#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r3~0 % 256 < 2; {18513#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:59:01,277 INFO L290 TraceCheckUtils]: 60: Hoare triple {18513#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep31~0 % 256); {18513#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:59:01,278 INFO L290 TraceCheckUtils]: 61: Hoare triple {18513#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep32~0 % 256); {18513#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:59:01,278 INFO L290 TraceCheckUtils]: 62: Hoare triple {18513#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode3~0 := 1; {18513#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:59:01,278 INFO L290 TraceCheckUtils]: 63: Hoare triple {18513#(<= (+ ~nl1~0 ~st1~0) 0)} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {18513#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:59:01,279 INFO L290 TraceCheckUtils]: 64: Hoare triple {18513#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {18513#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:59:01,279 INFO L290 TraceCheckUtils]: 65: Hoare triple {18513#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(~st1~0 + ~nl1~0 <= 1);main_~check__tmp~0#1 := 0; {18511#false} is VALID [2022-02-20 18:59:01,279 INFO L290 TraceCheckUtils]: 66: Hoare triple {18511#false} ~__return_2065~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2065~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {18511#false} is VALID [2022-02-20 18:59:01,280 INFO L290 TraceCheckUtils]: 67: Hoare triple {18511#false} assume 0 == main_~assert__arg~0#1 % 256; {18511#false} is VALID [2022-02-20 18:59:01,280 INFO L290 TraceCheckUtils]: 68: Hoare triple {18511#false} assume !false; {18511#false} is VALID [2022-02-20 18:59:01,280 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:59:01,280 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:59:01,280 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616213561] [2022-02-20 18:59:01,281 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616213561] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:59:01,281 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:59:01,281 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:59:01,281 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713232546] [2022-02-20 18:59:01,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:59:01,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2022-02-20 18:59:01,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:59:01,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:01,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:59:01,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:59:01,327 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:59:01,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:59:01,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:59:01,328 INFO L87 Difference]: Start difference. First operand 1203 states and 1924 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:05,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:59:05,182 INFO L93 Difference]: Finished difference Result 4395 states and 7079 transitions. [2022-02-20 18:59:05,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:59:05,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2022-02-20 18:59:05,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:59:05,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:05,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 707 transitions. [2022-02-20 18:59:05,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:05,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 707 transitions. [2022-02-20 18:59:05,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 707 transitions. [2022-02-20 18:59:05,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 707 edges. 707 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:59:06,048 INFO L225 Difference]: With dead ends: 4395 [2022-02-20 18:59:06,049 INFO L226 Difference]: Without dead ends: 3249 [2022-02-20 18:59:06,050 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:59:06,051 INFO L933 BasicCegarLoop]: 228 mSDtfsCounter, 456 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 787 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:59:06,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [456 Valid, 787 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:59:06,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3249 states. [2022-02-20 18:59:07,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3249 to 2217. [2022-02-20 18:59:07,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:59:07,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3249 states. Second operand has 2217 states, 2216 states have (on average 1.6010830324909748) internal successors, (3548), 2216 states have internal predecessors, (3548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:07,830 INFO L74 IsIncluded]: Start isIncluded. First operand 3249 states. Second operand has 2217 states, 2216 states have (on average 1.6010830324909748) internal successors, (3548), 2216 states have internal predecessors, (3548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:07,833 INFO L87 Difference]: Start difference. First operand 3249 states. Second operand has 2217 states, 2216 states have (on average 1.6010830324909748) internal successors, (3548), 2216 states have internal predecessors, (3548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:08,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:59:08,138 INFO L93 Difference]: Finished difference Result 3249 states and 5216 transitions. [2022-02-20 18:59:08,138 INFO L276 IsEmpty]: Start isEmpty. Operand 3249 states and 5216 transitions. [2022-02-20 18:59:08,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:59:08,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:59:08,148 INFO L74 IsIncluded]: Start isIncluded. First operand has 2217 states, 2216 states have (on average 1.6010830324909748) internal successors, (3548), 2216 states have internal predecessors, (3548), 0 states have call successors, (0), 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 3249 states. [2022-02-20 18:59:08,151 INFO L87 Difference]: Start difference. First operand has 2217 states, 2216 states have (on average 1.6010830324909748) internal successors, (3548), 2216 states have internal predecessors, (3548), 0 states have call successors, (0), 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 3249 states. [2022-02-20 18:59:08,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:59:08,471 INFO L93 Difference]: Finished difference Result 3249 states and 5216 transitions. [2022-02-20 18:59:08,471 INFO L276 IsEmpty]: Start isEmpty. Operand 3249 states and 5216 transitions. [2022-02-20 18:59:08,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:59:08,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:59:08,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:59:08,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:59:08,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2217 states, 2216 states have (on average 1.6010830324909748) internal successors, (3548), 2216 states have internal predecessors, (3548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:08,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 3548 transitions. [2022-02-20 18:59:08,723 INFO L78 Accepts]: Start accepts. Automaton has 2217 states and 3548 transitions. Word has length 69 [2022-02-20 18:59:08,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:59:08,723 INFO L470 AbstractCegarLoop]: Abstraction has 2217 states and 3548 transitions. [2022-02-20 18:59:08,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:08,723 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 3548 transitions. [2022-02-20 18:59:08,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 18:59:08,724 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:59:08,724 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:59:08,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:59:08,724 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:59:08,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:59:08,725 INFO L85 PathProgramCache]: Analyzing trace with hash -537020195, now seen corresponding path program 1 times [2022-02-20 18:59:08,725 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:59:08,725 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002913525] [2022-02-20 18:59:08,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:59:08,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:59:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:59:08,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {34257#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1916~0 := 0;~__return_2065~0 := 0; {34257#true} is VALID [2022-02-20 18:59:08,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {34257#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {34257#true} is VALID [2022-02-20 18:59:08,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {34257#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {34257#true} is VALID [2022-02-20 18:59:08,786 INFO L290 TraceCheckUtils]: 3: Hoare triple {34257#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {34257#true} is VALID [2022-02-20 18:59:08,786 INFO L290 TraceCheckUtils]: 4: Hoare triple {34257#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {34257#true} is VALID [2022-02-20 18:59:08,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {34257#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {34257#true} is VALID [2022-02-20 18:59:08,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {34257#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {34257#true} is VALID [2022-02-20 18:59:08,787 INFO L290 TraceCheckUtils]: 7: Hoare triple {34257#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {34257#true} is VALID [2022-02-20 18:59:08,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {34257#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {34257#true} is VALID [2022-02-20 18:59:08,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {34257#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {34257#true} is VALID [2022-02-20 18:59:08,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {34257#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {34257#true} is VALID [2022-02-20 18:59:08,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {34257#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {34257#true} is VALID [2022-02-20 18:59:08,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {34257#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {34257#true} is VALID [2022-02-20 18:59:08,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {34257#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {34257#true} is VALID [2022-02-20 18:59:08,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {34257#true} assume ~id1~0 != ~id2~0; {34257#true} is VALID [2022-02-20 18:59:08,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {34257#true} assume ~id1~0 != ~id3~0; {34257#true} is VALID [2022-02-20 18:59:08,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {34257#true} assume ~id2~0 != ~id3~0; {34257#true} is VALID [2022-02-20 18:59:08,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {34257#true} assume ~id1~0 >= 0; {34257#true} is VALID [2022-02-20 18:59:08,788 INFO L290 TraceCheckUtils]: 18: Hoare triple {34257#true} assume ~id2~0 >= 0; {34257#true} is VALID [2022-02-20 18:59:08,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {34257#true} assume ~id3~0 >= 0; {34257#true} is VALID [2022-02-20 18:59:08,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {34257#true} assume 0 == ~r1~0 % 256; {34257#true} is VALID [2022-02-20 18:59:08,789 INFO L290 TraceCheckUtils]: 21: Hoare triple {34257#true} assume 0 == ~r2~0 % 256; {34257#true} is VALID [2022-02-20 18:59:08,789 INFO L290 TraceCheckUtils]: 22: Hoare triple {34257#true} assume 0 == ~r3~0 % 256; {34257#true} is VALID [2022-02-20 18:59:08,789 INFO L290 TraceCheckUtils]: 23: Hoare triple {34257#true} assume !(0 == main_~init__r122~0#1 % 256); {34257#true} is VALID [2022-02-20 18:59:08,789 INFO L290 TraceCheckUtils]: 24: Hoare triple {34257#true} assume !(0 == main_~init__r132~0#1 % 256); {34257#true} is VALID [2022-02-20 18:59:08,790 INFO L290 TraceCheckUtils]: 25: Hoare triple {34257#true} assume !(0 == main_~init__r212~0#1 % 256); {34257#true} is VALID [2022-02-20 18:59:08,790 INFO L290 TraceCheckUtils]: 26: Hoare triple {34257#true} assume !(0 == main_~init__r232~0#1 % 256); {34257#true} is VALID [2022-02-20 18:59:08,790 INFO L290 TraceCheckUtils]: 27: Hoare triple {34257#true} assume !(0 == main_~init__r312~0#1 % 256); {34257#true} is VALID [2022-02-20 18:59:08,790 INFO L290 TraceCheckUtils]: 28: Hoare triple {34257#true} assume !(0 == main_~init__r322~0#1 % 256); {34257#true} is VALID [2022-02-20 18:59:08,790 INFO L290 TraceCheckUtils]: 29: Hoare triple {34257#true} assume ~max1~0 == ~id1~0; {34257#true} is VALID [2022-02-20 18:59:08,790 INFO L290 TraceCheckUtils]: 30: Hoare triple {34257#true} assume ~max2~0 == ~id2~0; {34257#true} is VALID [2022-02-20 18:59:08,790 INFO L290 TraceCheckUtils]: 31: Hoare triple {34257#true} assume ~max3~0 == ~id3~0; {34257#true} is VALID [2022-02-20 18:59:08,791 INFO L290 TraceCheckUtils]: 32: Hoare triple {34257#true} assume 0 == ~st1~0; {34257#true} is VALID [2022-02-20 18:59:08,791 INFO L290 TraceCheckUtils]: 33: Hoare triple {34257#true} assume 0 == ~st2~0; {34259#(<= ~st2~0 0)} is VALID [2022-02-20 18:59:08,791 INFO L290 TraceCheckUtils]: 34: Hoare triple {34259#(<= ~st2~0 0)} assume 0 == ~st3~0; {34259#(<= ~st2~0 0)} is VALID [2022-02-20 18:59:08,792 INFO L290 TraceCheckUtils]: 35: Hoare triple {34259#(<= ~st2~0 0)} assume 0 == ~nl1~0; {34259#(<= ~st2~0 0)} is VALID [2022-02-20 18:59:08,792 INFO L290 TraceCheckUtils]: 36: Hoare triple {34259#(<= ~st2~0 0)} assume 0 == ~nl2~0; {34260#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:59:08,793 INFO L290 TraceCheckUtils]: 37: Hoare triple {34260#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~nl3~0; {34260#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:59:08,793 INFO L290 TraceCheckUtils]: 38: Hoare triple {34260#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode1~0 % 256; {34260#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:59:08,793 INFO L290 TraceCheckUtils]: 39: Hoare triple {34260#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode2~0 % 256; {34260#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:59:08,794 INFO L290 TraceCheckUtils]: 40: Hoare triple {34260#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {34260#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:59:08,794 INFO L290 TraceCheckUtils]: 41: Hoare triple {34260#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 == ~newmax1~0 % 256); {34260#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:59:08,795 INFO L290 TraceCheckUtils]: 42: Hoare triple {34260#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 == ~newmax2~0 % 256); {34260#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:59:08,795 INFO L290 TraceCheckUtils]: 43: Hoare triple {34260#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1916~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1916~0; {34260#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:59:08,796 INFO L290 TraceCheckUtils]: 44: Hoare triple {34260#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {34260#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:59:08,796 INFO L290 TraceCheckUtils]: 45: Hoare triple {34260#(<= (+ ~nl2~0 ~st2~0) 0)} havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {34260#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:59:08,796 INFO L290 TraceCheckUtils]: 46: Hoare triple {34260#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~mode1~0 % 256); {34260#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:59:08,797 INFO L290 TraceCheckUtils]: 47: Hoare triple {34260#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r1~0 % 256 < 1; {34260#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:59:08,797 INFO L290 TraceCheckUtils]: 48: Hoare triple {34260#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep12~0 % 256); {34260#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:59:08,798 INFO L290 TraceCheckUtils]: 49: Hoare triple {34260#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep13~0 % 256); {34260#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:59:08,798 INFO L290 TraceCheckUtils]: 50: Hoare triple {34260#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode1~0 := 1; {34260#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:59:08,799 INFO L290 TraceCheckUtils]: 51: Hoare triple {34260#(<= (+ ~nl2~0 ~st2~0) 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {34260#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:59:08,799 INFO L290 TraceCheckUtils]: 52: Hoare triple {34260#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~mode2~0 % 256); {34260#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:59:08,799 INFO L290 TraceCheckUtils]: 53: Hoare triple {34260#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r2~0 % 256 < 2; {34260#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:59:08,800 INFO L290 TraceCheckUtils]: 54: Hoare triple {34260#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep21~0 % 256); {34260#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:59:08,800 INFO L290 TraceCheckUtils]: 55: Hoare triple {34260#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep23~0 % 256); {34260#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:59:08,801 INFO L290 TraceCheckUtils]: 56: Hoare triple {34260#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode2~0 := 1; {34260#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:59:08,801 INFO L290 TraceCheckUtils]: 57: Hoare triple {34260#(<= (+ ~nl2~0 ~st2~0) 0)} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {34260#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:59:08,802 INFO L290 TraceCheckUtils]: 58: Hoare triple {34260#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~mode3~0 % 256); {34260#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:59:08,802 INFO L290 TraceCheckUtils]: 59: Hoare triple {34260#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r3~0 % 256 < 2; {34260#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:59:08,802 INFO L290 TraceCheckUtils]: 60: Hoare triple {34260#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep31~0 % 256); {34260#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:59:08,803 INFO L290 TraceCheckUtils]: 61: Hoare triple {34260#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep32~0 % 256); {34260#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:59:08,803 INFO L290 TraceCheckUtils]: 62: Hoare triple {34260#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode3~0 := 1; {34260#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:59:08,804 INFO L290 TraceCheckUtils]: 63: Hoare triple {34260#(<= (+ ~nl2~0 ~st2~0) 0)} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {34260#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:59:08,804 INFO L290 TraceCheckUtils]: 64: Hoare triple {34260#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {34260#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:59:08,805 INFO L290 TraceCheckUtils]: 65: Hoare triple {34260#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {34260#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:59:08,805 INFO L290 TraceCheckUtils]: 66: Hoare triple {34260#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(~st2~0 + ~nl2~0 <= 1);main_~check__tmp~0#1 := 0; {34258#false} is VALID [2022-02-20 18:59:08,805 INFO L290 TraceCheckUtils]: 67: Hoare triple {34258#false} ~__return_2065~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2065~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {34258#false} is VALID [2022-02-20 18:59:08,805 INFO L290 TraceCheckUtils]: 68: Hoare triple {34258#false} assume 0 == main_~assert__arg~0#1 % 256; {34258#false} is VALID [2022-02-20 18:59:08,806 INFO L290 TraceCheckUtils]: 69: Hoare triple {34258#false} assume !false; {34258#false} is VALID [2022-02-20 18:59:08,806 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:59:08,806 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:59:08,806 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002913525] [2022-02-20 18:59:08,806 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002913525] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:59:08,807 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:59:08,807 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:59:08,807 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375667293] [2022-02-20 18:59:08,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:59:08,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 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:59:08,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:59:08,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 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:59:08,863 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:59:08,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:59:08,863 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:59:08,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:59:08,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:59:08,864 INFO L87 Difference]: Start difference. First operand 2217 states and 3548 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 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:59:14,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:59:14,894 INFO L93 Difference]: Finished difference Result 6525 states and 10507 transitions. [2022-02-20 18:59:14,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:59:14,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 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:59:14,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:59:14,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 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:59:14,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 707 transitions. [2022-02-20 18:59:14,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 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:59:14,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 707 transitions. [2022-02-20 18:59:14,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 707 transitions. [2022-02-20 18:59:15,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 707 edges. 707 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:59:16,086 INFO L225 Difference]: With dead ends: 6525 [2022-02-20 18:59:16,087 INFO L226 Difference]: Without dead ends: 4365 [2022-02-20 18:59:16,089 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:59:16,090 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 456 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:59:16,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [456 Valid, 729 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:59:16,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4365 states. [2022-02-20 18:59:19,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4365 to 3275. [2022-02-20 18:59:19,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:59:19,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4365 states. Second operand has 3275 states, 3274 states have (on average 1.5986560781918142) internal successors, (5234), 3274 states have internal predecessors, (5234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:19,406 INFO L74 IsIncluded]: Start isIncluded. First operand 4365 states. Second operand has 3275 states, 3274 states have (on average 1.5986560781918142) internal successors, (5234), 3274 states have internal predecessors, (5234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:19,409 INFO L87 Difference]: Start difference. First operand 4365 states. Second operand has 3275 states, 3274 states have (on average 1.5986560781918142) internal successors, (5234), 3274 states have internal predecessors, (5234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:19,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:59:19,930 INFO L93 Difference]: Finished difference Result 4365 states and 7006 transitions. [2022-02-20 18:59:19,930 INFO L276 IsEmpty]: Start isEmpty. Operand 4365 states and 7006 transitions. [2022-02-20 18:59:19,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:59:19,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:59:19,940 INFO L74 IsIncluded]: Start isIncluded. First operand has 3275 states, 3274 states have (on average 1.5986560781918142) internal successors, (5234), 3274 states have internal predecessors, (5234), 0 states have call successors, (0), 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 4365 states. [2022-02-20 18:59:19,944 INFO L87 Difference]: Start difference. First operand has 3275 states, 3274 states have (on average 1.5986560781918142) internal successors, (5234), 3274 states have internal predecessors, (5234), 0 states have call successors, (0), 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 4365 states. [2022-02-20 18:59:20,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:59:20,503 INFO L93 Difference]: Finished difference Result 4365 states and 7006 transitions. [2022-02-20 18:59:20,503 INFO L276 IsEmpty]: Start isEmpty. Operand 4365 states and 7006 transitions. [2022-02-20 18:59:20,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:59:20,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:59:20,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:59:20,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:59:20,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3275 states, 3274 states have (on average 1.5986560781918142) internal successors, (5234), 3274 states have internal predecessors, (5234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:20,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3275 states to 3275 states and 5234 transitions. [2022-02-20 18:59:20,999 INFO L78 Accepts]: Start accepts. Automaton has 3275 states and 5234 transitions. Word has length 70 [2022-02-20 18:59:20,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:59:20,999 INFO L470 AbstractCegarLoop]: Abstraction has 3275 states and 5234 transitions. [2022-02-20 18:59:20,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 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:59:20,999 INFO L276 IsEmpty]: Start isEmpty. Operand 3275 states and 5234 transitions. [2022-02-20 18:59:21,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-20 18:59:21,000 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:59:21,001 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] [2022-02-20 18:59:21,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:59:21,001 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:59:21,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:59:21,001 INFO L85 PathProgramCache]: Analyzing trace with hash 478855012, now seen corresponding path program 1 times [2022-02-20 18:59:21,002 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:59:21,002 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287355360] [2022-02-20 18:59:21,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:59:21,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:59:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:59:21,081 INFO L290 TraceCheckUtils]: 0: Hoare triple {56732#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1916~0 := 0;~__return_2065~0 := 0; {56732#true} is VALID [2022-02-20 18:59:21,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {56732#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {56732#true} is VALID [2022-02-20 18:59:21,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {56732#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {56732#true} is VALID [2022-02-20 18:59:21,082 INFO L290 TraceCheckUtils]: 3: Hoare triple {56732#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {56732#true} is VALID [2022-02-20 18:59:21,082 INFO L290 TraceCheckUtils]: 4: Hoare triple {56732#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {56732#true} is VALID [2022-02-20 18:59:21,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {56732#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {56732#true} is VALID [2022-02-20 18:59:21,083 INFO L290 TraceCheckUtils]: 6: Hoare triple {56732#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {56732#true} is VALID [2022-02-20 18:59:21,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {56732#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {56732#true} is VALID [2022-02-20 18:59:21,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {56732#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {56732#true} is VALID [2022-02-20 18:59:21,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {56732#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {56732#true} is VALID [2022-02-20 18:59:21,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {56732#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {56732#true} is VALID [2022-02-20 18:59:21,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {56732#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {56732#true} is VALID [2022-02-20 18:59:21,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {56732#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {56732#true} is VALID [2022-02-20 18:59:21,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {56732#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {56732#true} is VALID [2022-02-20 18:59:21,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {56732#true} assume ~id1~0 != ~id2~0; {56732#true} is VALID [2022-02-20 18:59:21,084 INFO L290 TraceCheckUtils]: 15: Hoare triple {56732#true} assume ~id1~0 != ~id3~0; {56732#true} is VALID [2022-02-20 18:59:21,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {56732#true} assume ~id2~0 != ~id3~0; {56732#true} is VALID [2022-02-20 18:59:21,084 INFO L290 TraceCheckUtils]: 17: Hoare triple {56732#true} assume ~id1~0 >= 0; {56732#true} is VALID [2022-02-20 18:59:21,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {56732#true} assume ~id2~0 >= 0; {56732#true} is VALID [2022-02-20 18:59:21,085 INFO L290 TraceCheckUtils]: 19: Hoare triple {56732#true} assume ~id3~0 >= 0; {56732#true} is VALID [2022-02-20 18:59:21,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {56732#true} assume 0 == ~r1~0 % 256; {56732#true} is VALID [2022-02-20 18:59:21,085 INFO L290 TraceCheckUtils]: 21: Hoare triple {56732#true} assume 0 == ~r2~0 % 256; {56732#true} is VALID [2022-02-20 18:59:21,085 INFO L290 TraceCheckUtils]: 22: Hoare triple {56732#true} assume 0 == ~r3~0 % 256; {56732#true} is VALID [2022-02-20 18:59:21,085 INFO L290 TraceCheckUtils]: 23: Hoare triple {56732#true} assume !(0 == main_~init__r122~0#1 % 256); {56732#true} is VALID [2022-02-20 18:59:21,085 INFO L290 TraceCheckUtils]: 24: Hoare triple {56732#true} assume !(0 == main_~init__r132~0#1 % 256); {56732#true} is VALID [2022-02-20 18:59:21,085 INFO L290 TraceCheckUtils]: 25: Hoare triple {56732#true} assume !(0 == main_~init__r212~0#1 % 256); {56732#true} is VALID [2022-02-20 18:59:21,086 INFO L290 TraceCheckUtils]: 26: Hoare triple {56732#true} assume !(0 == main_~init__r232~0#1 % 256); {56732#true} is VALID [2022-02-20 18:59:21,086 INFO L290 TraceCheckUtils]: 27: Hoare triple {56732#true} assume !(0 == main_~init__r312~0#1 % 256); {56732#true} is VALID [2022-02-20 18:59:21,086 INFO L290 TraceCheckUtils]: 28: Hoare triple {56732#true} assume !(0 == main_~init__r322~0#1 % 256); {56732#true} is VALID [2022-02-20 18:59:21,087 INFO L290 TraceCheckUtils]: 29: Hoare triple {56732#true} assume ~max1~0 == ~id1~0; {56732#true} is VALID [2022-02-20 18:59:21,087 INFO L290 TraceCheckUtils]: 30: Hoare triple {56732#true} assume ~max2~0 == ~id2~0; {56732#true} is VALID [2022-02-20 18:59:21,087 INFO L290 TraceCheckUtils]: 31: Hoare triple {56732#true} assume ~max3~0 == ~id3~0; {56732#true} is VALID [2022-02-20 18:59:21,087 INFO L290 TraceCheckUtils]: 32: Hoare triple {56732#true} assume 0 == ~st1~0; {56732#true} is VALID [2022-02-20 18:59:21,088 INFO L290 TraceCheckUtils]: 33: Hoare triple {56732#true} assume 0 == ~st2~0; {56732#true} is VALID [2022-02-20 18:59:21,088 INFO L290 TraceCheckUtils]: 34: Hoare triple {56732#true} assume 0 == ~st3~0; {56734#(<= ~st3~0 0)} is VALID [2022-02-20 18:59:21,089 INFO L290 TraceCheckUtils]: 35: Hoare triple {56734#(<= ~st3~0 0)} assume 0 == ~nl1~0; {56734#(<= ~st3~0 0)} is VALID [2022-02-20 18:59:21,089 INFO L290 TraceCheckUtils]: 36: Hoare triple {56734#(<= ~st3~0 0)} assume 0 == ~nl2~0; {56734#(<= ~st3~0 0)} is VALID [2022-02-20 18:59:21,089 INFO L290 TraceCheckUtils]: 37: Hoare triple {56734#(<= ~st3~0 0)} assume 0 == ~nl3~0; {56735#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:21,090 INFO L290 TraceCheckUtils]: 38: Hoare triple {56735#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode1~0 % 256; {56735#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:21,090 INFO L290 TraceCheckUtils]: 39: Hoare triple {56735#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode2~0 % 256; {56735#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:21,090 INFO L290 TraceCheckUtils]: 40: Hoare triple {56735#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode3~0 % 256; {56735#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:21,091 INFO L290 TraceCheckUtils]: 41: Hoare triple {56735#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 == ~newmax1~0 % 256); {56735#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:21,091 INFO L290 TraceCheckUtils]: 42: Hoare triple {56735#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 == ~newmax2~0 % 256); {56735#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:21,092 INFO L290 TraceCheckUtils]: 43: Hoare triple {56735#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1916~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1916~0; {56735#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:21,092 INFO L290 TraceCheckUtils]: 44: Hoare triple {56735#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {56735#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:21,092 INFO L290 TraceCheckUtils]: 45: Hoare triple {56735#(<= (+ ~nl3~0 ~st3~0) 0)} havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {56735#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:21,093 INFO L290 TraceCheckUtils]: 46: Hoare triple {56735#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~mode1~0 % 256); {56735#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:21,093 INFO L290 TraceCheckUtils]: 47: Hoare triple {56735#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r1~0 % 256 < 1; {56735#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:21,094 INFO L290 TraceCheckUtils]: 48: Hoare triple {56735#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~ep12~0 % 256); {56735#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:21,094 INFO L290 TraceCheckUtils]: 49: Hoare triple {56735#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~ep13~0 % 256); {56735#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:21,094 INFO L290 TraceCheckUtils]: 50: Hoare triple {56735#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode1~0 := 1; {56735#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:21,095 INFO L290 TraceCheckUtils]: 51: Hoare triple {56735#(<= (+ ~nl3~0 ~st3~0) 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {56735#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:21,095 INFO L290 TraceCheckUtils]: 52: Hoare triple {56735#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~mode2~0 % 256); {56735#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:21,095 INFO L290 TraceCheckUtils]: 53: Hoare triple {56735#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r2~0 % 256 < 2; {56735#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:21,096 INFO L290 TraceCheckUtils]: 54: Hoare triple {56735#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~ep21~0 % 256); {56735#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:21,096 INFO L290 TraceCheckUtils]: 55: Hoare triple {56735#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~ep23~0 % 256); {56735#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:21,097 INFO L290 TraceCheckUtils]: 56: Hoare triple {56735#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode2~0 := 1; {56735#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:21,097 INFO L290 TraceCheckUtils]: 57: Hoare triple {56735#(<= (+ ~nl3~0 ~st3~0) 0)} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {56735#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:21,097 INFO L290 TraceCheckUtils]: 58: Hoare triple {56735#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~mode3~0 % 256); {56735#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:21,098 INFO L290 TraceCheckUtils]: 59: Hoare triple {56735#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r3~0 % 256 < 2; {56735#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:21,098 INFO L290 TraceCheckUtils]: 60: Hoare triple {56735#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~ep31~0 % 256); {56735#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:21,098 INFO L290 TraceCheckUtils]: 61: Hoare triple {56735#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~ep32~0 % 256); {56735#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:21,099 INFO L290 TraceCheckUtils]: 62: Hoare triple {56735#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode3~0 := 1; {56735#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:21,099 INFO L290 TraceCheckUtils]: 63: Hoare triple {56735#(<= (+ ~nl3~0 ~st3~0) 0)} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {56735#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:21,100 INFO L290 TraceCheckUtils]: 64: Hoare triple {56735#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {56735#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:21,100 INFO L290 TraceCheckUtils]: 65: Hoare triple {56735#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {56735#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:21,100 INFO L290 TraceCheckUtils]: 66: Hoare triple {56735#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st2~0 + ~nl2~0 <= 1; {56735#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:21,101 INFO L290 TraceCheckUtils]: 67: Hoare triple {56735#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(~st3~0 + ~nl3~0 <= 1);main_~check__tmp~0#1 := 0; {56733#false} is VALID [2022-02-20 18:59:21,101 INFO L290 TraceCheckUtils]: 68: Hoare triple {56733#false} ~__return_2065~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2065~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {56733#false} is VALID [2022-02-20 18:59:21,101 INFO L290 TraceCheckUtils]: 69: Hoare triple {56733#false} assume 0 == main_~assert__arg~0#1 % 256; {56733#false} is VALID [2022-02-20 18:59:21,101 INFO L290 TraceCheckUtils]: 70: Hoare triple {56733#false} assume !false; {56733#false} is VALID [2022-02-20 18:59:21,101 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:59:21,101 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:59:21,102 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287355360] [2022-02-20 18:59:21,102 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287355360] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:59:21,102 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:59:21,102 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:59:21,102 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071933558] [2022-02-20 18:59:21,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:59:21,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2022-02-20 18:59:21,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:59:21,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:21,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:59:21,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:59:21,150 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:59:21,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:59:21,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:59:21,151 INFO L87 Difference]: Start difference. First operand 3275 states and 5234 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:32,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:59:32,327 INFO L93 Difference]: Finished difference Result 9597 states and 15415 transitions. [2022-02-20 18:59:32,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:59:32,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2022-02-20 18:59:32,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:59:32,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:32,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 707 transitions. [2022-02-20 18:59:32,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:32,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 707 transitions. [2022-02-20 18:59:32,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 707 transitions. [2022-02-20 18:59:32,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 707 edges. 707 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:59:34,678 INFO L225 Difference]: With dead ends: 9597 [2022-02-20 18:59:34,678 INFO L226 Difference]: Without dead ends: 6379 [2022-02-20 18:59:34,681 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:59:34,682 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 454 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:59:34,682 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [454 Valid, 772 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:59:34,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6379 states. [2022-02-20 18:59:40,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6379 to 4805. [2022-02-20 18:59:40,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:59:40,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6379 states. Second operand has 4805 states, 4804 states have (on average 1.59533721898418) internal successors, (7664), 4804 states have internal predecessors, (7664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:40,616 INFO L74 IsIncluded]: Start isIncluded. First operand 6379 states. Second operand has 4805 states, 4804 states have (on average 1.59533721898418) internal successors, (7664), 4804 states have internal predecessors, (7664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:40,621 INFO L87 Difference]: Start difference. First operand 6379 states. Second operand has 4805 states, 4804 states have (on average 1.59533721898418) internal successors, (7664), 4804 states have internal predecessors, (7664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:41,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:59:41,895 INFO L93 Difference]: Finished difference Result 6379 states and 10216 transitions. [2022-02-20 18:59:41,895 INFO L276 IsEmpty]: Start isEmpty. Operand 6379 states and 10216 transitions. [2022-02-20 18:59:41,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:59:41,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:59:41,908 INFO L74 IsIncluded]: Start isIncluded. First operand has 4805 states, 4804 states have (on average 1.59533721898418) internal successors, (7664), 4804 states have internal predecessors, (7664), 0 states have call successors, (0), 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 6379 states. [2022-02-20 18:59:41,912 INFO L87 Difference]: Start difference. First operand has 4805 states, 4804 states have (on average 1.59533721898418) internal successors, (7664), 4804 states have internal predecessors, (7664), 0 states have call successors, (0), 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 6379 states. [2022-02-20 18:59:43,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:59:43,127 INFO L93 Difference]: Finished difference Result 6379 states and 10216 transitions. [2022-02-20 18:59:43,127 INFO L276 IsEmpty]: Start isEmpty. Operand 6379 states and 10216 transitions. [2022-02-20 18:59:43,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:59:43,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:59:43,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:59:43,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:59:43,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4805 states, 4804 states have (on average 1.59533721898418) internal successors, (7664), 4804 states have internal predecessors, (7664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:44,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4805 states to 4805 states and 7664 transitions. [2022-02-20 18:59:44,081 INFO L78 Accepts]: Start accepts. Automaton has 4805 states and 7664 transitions. Word has length 71 [2022-02-20 18:59:44,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:59:44,081 INFO L470 AbstractCegarLoop]: Abstraction has 4805 states and 7664 transitions. [2022-02-20 18:59:44,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:44,082 INFO L276 IsEmpty]: Start isEmpty. Operand 4805 states and 7664 transitions. [2022-02-20 18:59:44,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 18:59:44,082 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:59:44,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] [2022-02-20 18:59:44,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:59:44,083 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:59:44,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:59:44,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1637619353, now seen corresponding path program 1 times [2022-02-20 18:59:44,084 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:59:44,084 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995059490] [2022-02-20 18:59:44,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:59:44,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:59:44,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:59:44,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {89739#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1916~0 := 0;~__return_2065~0 := 0; {89739#true} is VALID [2022-02-20 18:59:44,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {89739#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {89739#true} is VALID [2022-02-20 18:59:44,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {89739#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {89739#true} is VALID [2022-02-20 18:59:44,135 INFO L290 TraceCheckUtils]: 3: Hoare triple {89739#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {89739#true} is VALID [2022-02-20 18:59:44,135 INFO L290 TraceCheckUtils]: 4: Hoare triple {89739#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {89739#true} is VALID [2022-02-20 18:59:44,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {89739#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {89739#true} is VALID [2022-02-20 18:59:44,135 INFO L290 TraceCheckUtils]: 6: Hoare triple {89739#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {89739#true} is VALID [2022-02-20 18:59:44,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {89739#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {89739#true} is VALID [2022-02-20 18:59:44,136 INFO L290 TraceCheckUtils]: 8: Hoare triple {89739#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {89739#true} is VALID [2022-02-20 18:59:44,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {89739#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {89739#true} is VALID [2022-02-20 18:59:44,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {89739#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {89739#true} is VALID [2022-02-20 18:59:44,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {89739#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {89739#true} is VALID [2022-02-20 18:59:44,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {89739#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {89739#true} is VALID [2022-02-20 18:59:44,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {89739#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {89739#true} is VALID [2022-02-20 18:59:44,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {89739#true} assume ~id1~0 != ~id2~0; {89739#true} is VALID [2022-02-20 18:59:44,137 INFO L290 TraceCheckUtils]: 15: Hoare triple {89739#true} assume ~id1~0 != ~id3~0; {89739#true} is VALID [2022-02-20 18:59:44,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {89739#true} assume ~id2~0 != ~id3~0; {89739#true} is VALID [2022-02-20 18:59:44,137 INFO L290 TraceCheckUtils]: 17: Hoare triple {89739#true} assume ~id1~0 >= 0; {89739#true} is VALID [2022-02-20 18:59:44,137 INFO L290 TraceCheckUtils]: 18: Hoare triple {89739#true} assume ~id2~0 >= 0; {89739#true} is VALID [2022-02-20 18:59:44,137 INFO L290 TraceCheckUtils]: 19: Hoare triple {89739#true} assume ~id3~0 >= 0; {89739#true} is VALID [2022-02-20 18:59:44,137 INFO L290 TraceCheckUtils]: 20: Hoare triple {89739#true} assume 0 == ~r1~0 % 256; {89739#true} is VALID [2022-02-20 18:59:44,138 INFO L290 TraceCheckUtils]: 21: Hoare triple {89739#true} assume 0 == ~r2~0 % 256; {89739#true} is VALID [2022-02-20 18:59:44,138 INFO L290 TraceCheckUtils]: 22: Hoare triple {89739#true} assume 0 == ~r3~0 % 256; {89739#true} is VALID [2022-02-20 18:59:44,138 INFO L290 TraceCheckUtils]: 23: Hoare triple {89739#true} assume !(0 == main_~init__r122~0#1 % 256); {89739#true} is VALID [2022-02-20 18:59:44,138 INFO L290 TraceCheckUtils]: 24: Hoare triple {89739#true} assume !(0 == main_~init__r132~0#1 % 256); {89739#true} is VALID [2022-02-20 18:59:44,138 INFO L290 TraceCheckUtils]: 25: Hoare triple {89739#true} assume !(0 == main_~init__r212~0#1 % 256); {89739#true} is VALID [2022-02-20 18:59:44,138 INFO L290 TraceCheckUtils]: 26: Hoare triple {89739#true} assume !(0 == main_~init__r232~0#1 % 256); {89739#true} is VALID [2022-02-20 18:59:44,138 INFO L290 TraceCheckUtils]: 27: Hoare triple {89739#true} assume !(0 == main_~init__r312~0#1 % 256); {89739#true} is VALID [2022-02-20 18:59:44,139 INFO L290 TraceCheckUtils]: 28: Hoare triple {89739#true} assume !(0 == main_~init__r322~0#1 % 256); {89739#true} is VALID [2022-02-20 18:59:44,139 INFO L290 TraceCheckUtils]: 29: Hoare triple {89739#true} assume ~max1~0 == ~id1~0; {89739#true} is VALID [2022-02-20 18:59:44,139 INFO L290 TraceCheckUtils]: 30: Hoare triple {89739#true} assume ~max2~0 == ~id2~0; {89739#true} is VALID [2022-02-20 18:59:44,139 INFO L290 TraceCheckUtils]: 31: Hoare triple {89739#true} assume ~max3~0 == ~id3~0; {89739#true} is VALID [2022-02-20 18:59:44,139 INFO L290 TraceCheckUtils]: 32: Hoare triple {89739#true} assume 0 == ~st1~0; {89739#true} is VALID [2022-02-20 18:59:44,139 INFO L290 TraceCheckUtils]: 33: Hoare triple {89739#true} assume 0 == ~st2~0; {89739#true} is VALID [2022-02-20 18:59:44,140 INFO L290 TraceCheckUtils]: 34: Hoare triple {89739#true} assume 0 == ~st3~0; {89739#true} is VALID [2022-02-20 18:59:44,140 INFO L290 TraceCheckUtils]: 35: Hoare triple {89739#true} assume 0 == ~nl1~0; {89739#true} is VALID [2022-02-20 18:59:44,140 INFO L290 TraceCheckUtils]: 36: Hoare triple {89739#true} assume 0 == ~nl2~0; {89739#true} is VALID [2022-02-20 18:59:44,140 INFO L290 TraceCheckUtils]: 37: Hoare triple {89739#true} assume 0 == ~nl3~0; {89739#true} is VALID [2022-02-20 18:59:44,141 INFO L290 TraceCheckUtils]: 38: Hoare triple {89739#true} assume 0 == ~mode1~0 % 256; {89741#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:59:44,141 INFO L290 TraceCheckUtils]: 39: Hoare triple {89741#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {89741#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:59:44,141 INFO L290 TraceCheckUtils]: 40: Hoare triple {89741#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {89741#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:59:44,142 INFO L290 TraceCheckUtils]: 41: Hoare triple {89741#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~newmax1~0 % 256); {89741#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:59:44,142 INFO L290 TraceCheckUtils]: 42: Hoare triple {89741#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~newmax2~0 % 256); {89741#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:59:44,143 INFO L290 TraceCheckUtils]: 43: Hoare triple {89741#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1916~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1916~0; {89741#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:59:44,143 INFO L290 TraceCheckUtils]: 44: Hoare triple {89741#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {89741#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:59:44,144 INFO L290 TraceCheckUtils]: 45: Hoare triple {89741#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {89741#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:59:44,144 INFO L290 TraceCheckUtils]: 46: Hoare triple {89741#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~mode1~0 % 256); {89740#false} is VALID [2022-02-20 18:59:44,144 INFO L290 TraceCheckUtils]: 47: Hoare triple {89740#false} assume !(255 == ~r1~0 % 256); {89740#false} is VALID [2022-02-20 18:59:44,144 INFO L290 TraceCheckUtils]: 48: Hoare triple {89740#false} ~r1~0 := 1 + ~r1~0 % 256; {89740#false} is VALID [2022-02-20 18:59:44,145 INFO L290 TraceCheckUtils]: 49: Hoare triple {89740#false} assume !!(0 == ~ep21~0 % 256); {89740#false} is VALID [2022-02-20 18:59:44,145 INFO L290 TraceCheckUtils]: 50: Hoare triple {89740#false} assume !!(0 == ~ep31~0 % 256); {89740#false} is VALID [2022-02-20 18:59:44,145 INFO L290 TraceCheckUtils]: 51: Hoare triple {89740#false} ~newmax1~0 := main_~node1__newmax~0#1; {89740#false} is VALID [2022-02-20 18:59:44,145 INFO L290 TraceCheckUtils]: 52: Hoare triple {89740#false} assume 2 == ~r1~0 % 256; {89740#false} is VALID [2022-02-20 18:59:44,145 INFO L290 TraceCheckUtils]: 53: Hoare triple {89740#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {89740#false} is VALID [2022-02-20 18:59:44,145 INFO L290 TraceCheckUtils]: 54: Hoare triple {89740#false} ~mode1~0 := 0; {89740#false} is VALID [2022-02-20 18:59:44,146 INFO L290 TraceCheckUtils]: 55: Hoare triple {89740#false} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {89740#false} is VALID [2022-02-20 18:59:44,146 INFO L290 TraceCheckUtils]: 56: Hoare triple {89740#false} assume !!(0 == ~mode2~0 % 256); {89740#false} is VALID [2022-02-20 18:59:44,146 INFO L290 TraceCheckUtils]: 57: Hoare triple {89740#false} assume ~r2~0 % 256 < 2; {89740#false} is VALID [2022-02-20 18:59:44,146 INFO L290 TraceCheckUtils]: 58: Hoare triple {89740#false} assume !!(0 == ~ep21~0 % 256); {89740#false} is VALID [2022-02-20 18:59:44,146 INFO L290 TraceCheckUtils]: 59: Hoare triple {89740#false} assume !!(0 == ~ep23~0 % 256); {89740#false} is VALID [2022-02-20 18:59:44,146 INFO L290 TraceCheckUtils]: 60: Hoare triple {89740#false} ~mode2~0 := 1; {89740#false} is VALID [2022-02-20 18:59:44,146 INFO L290 TraceCheckUtils]: 61: Hoare triple {89740#false} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {89740#false} is VALID [2022-02-20 18:59:44,147 INFO L290 TraceCheckUtils]: 62: Hoare triple {89740#false} assume !!(0 == ~mode3~0 % 256); {89740#false} is VALID [2022-02-20 18:59:44,147 INFO L290 TraceCheckUtils]: 63: Hoare triple {89740#false} assume ~r3~0 % 256 < 2; {89740#false} is VALID [2022-02-20 18:59:44,147 INFO L290 TraceCheckUtils]: 64: Hoare triple {89740#false} assume !!(0 == ~ep31~0 % 256); {89740#false} is VALID [2022-02-20 18:59:44,147 INFO L290 TraceCheckUtils]: 65: Hoare triple {89740#false} assume !!(0 == ~ep32~0 % 256); {89740#false} is VALID [2022-02-20 18:59:44,147 INFO L290 TraceCheckUtils]: 66: Hoare triple {89740#false} ~mode3~0 := 1; {89740#false} is VALID [2022-02-20 18:59:44,147 INFO L290 TraceCheckUtils]: 67: Hoare triple {89740#false} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {89740#false} is VALID [2022-02-20 18:59:44,147 INFO L290 TraceCheckUtils]: 68: Hoare triple {89740#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {89740#false} is VALID [2022-02-20 18:59:44,148 INFO L290 TraceCheckUtils]: 69: Hoare triple {89740#false} ~__return_2065~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2065~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {89740#false} is VALID [2022-02-20 18:59:44,148 INFO L290 TraceCheckUtils]: 70: Hoare triple {89740#false} assume 0 == main_~assert__arg~0#1 % 256; {89740#false} is VALID [2022-02-20 18:59:44,148 INFO L290 TraceCheckUtils]: 71: Hoare triple {89740#false} assume !false; {89740#false} is VALID [2022-02-20 18:59:44,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:59:44,148 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:59:44,149 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995059490] [2022-02-20 18:59:44,149 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995059490] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:59:44,149 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:59:44,149 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:59:44,149 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356258005] [2022-02-20 18:59:44,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:59:44,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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:59:44,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:59:44,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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:59:44,192 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:59:44,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:59:44,193 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:59:44,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:59:44,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:59:44,193 INFO L87 Difference]: Start difference. First operand 4805 states and 7664 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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)