./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 368647bf8c8fe53592ceb4314bbebffd0b8c087a8115d4714b27d4e56ab0a9cf --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:31:58,894 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:31:58,897 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:31:58,940 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:31:58,940 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:31:58,943 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:31:58,944 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:31:58,947 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:31:58,948 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:31:58,952 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:31:58,953 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:31:58,954 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:31:58,954 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:31:58,956 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:31:58,958 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:31:58,961 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:31:58,961 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:31:58,962 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:31:58,964 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:31:58,969 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:31:58,970 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:31:58,971 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:31:58,972 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:31:58,973 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:31:58,979 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:31:58,979 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:31:58,979 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:31:58,981 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:31:58,981 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:31:58,982 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:31:58,982 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:31:58,983 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:31:58,984 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:31:58,985 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:31:58,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:31:58,986 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:31:58,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:31:58,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:31:58,988 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:31:58,989 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:31:58,990 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:31:58,991 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:31:59,019 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:31:59,020 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:31:59,020 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:31:59,021 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:31:59,021 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:31:59,021 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:31:59,022 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:31:59,022 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:31:59,022 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:31:59,023 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:31:59,023 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:31:59,024 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:31:59,024 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:31:59,024 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:31:59,024 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:31:59,024 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:31:59,025 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:31:59,025 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:31:59,025 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:31:59,025 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:31:59,025 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:31:59,025 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:31:59,026 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:31:59,026 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:31:59,026 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:31:59,026 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:31:59,026 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:31:59,027 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:31:59,027 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:31:59,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:31:59,027 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:31:59,027 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:31:59,028 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:31:59,028 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 -> 368647bf8c8fe53592ceb4314bbebffd0b8c087a8115d4714b27d4e56ab0a9cf [2022-02-20 18:31:59,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:31:59,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:31:59,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:31:59,251 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:31:59,252 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:31:59,253 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c [2022-02-20 18:31:59,316 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b67814ceb/5be947a47c3f40ef83751f66948b15ae/FLAGd3a4c65a1 [2022-02-20 18:31:59,722 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:31:59,728 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c [2022-02-20 18:31:59,738 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b67814ceb/5be947a47c3f40ef83751f66948b15ae/FLAGd3a4c65a1 [2022-02-20 18:31:59,748 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b67814ceb/5be947a47c3f40ef83751f66948b15ae [2022-02-20 18:31:59,750 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:31:59,751 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:31:59,752 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:31:59,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:31:59,755 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:31:59,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:31:59" (1/1) ... [2022-02-20 18:31:59,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@241a8ffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:59, skipping insertion in model container [2022-02-20 18:31:59,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:31:59" (1/1) ... [2022-02-20 18:31:59,762 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:31:59,804 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:32:00,006 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c[14371,14384] [2022-02-20 18:32:00,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:32:00,018 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:32:00,089 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c[14371,14384] [2022-02-20 18:32:00,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:32:00,105 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:32:00,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:32:00 WrapperNode [2022-02-20 18:32:00,106 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:32:00,107 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:32:00,107 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:32:00,108 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:32:00,116 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:32:00" (1/1) ... [2022-02-20 18:32:00,126 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:32:00" (1/1) ... [2022-02-20 18:32:00,188 INFO L137 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 479 [2022-02-20 18:32:00,192 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:32:00,194 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:32:00,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:32:00,199 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:32:00,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:32:00" (1/1) ... [2022-02-20 18:32:00,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:32:00" (1/1) ... [2022-02-20 18:32:00,216 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:32:00" (1/1) ... [2022-02-20 18:32:00,219 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:32:00" (1/1) ... [2022-02-20 18:32:00,227 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:32:00" (1/1) ... [2022-02-20 18:32:00,240 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:32:00" (1/1) ... [2022-02-20 18:32:00,242 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:32:00" (1/1) ... [2022-02-20 18:32:00,256 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:32:00,258 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:32:00,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:32:00,260 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:32:00,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:32:00" (1/1) ... [2022-02-20 18:32:00,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:32:00,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:32:00,296 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:32:00,314 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:32:00,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:32:00,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:32:00,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:32:00,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:32:00,442 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:32:00,443 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:32:01,174 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:32:01,188 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:32:01,191 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:32:01,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:32:01 BoogieIcfgContainer [2022-02-20 18:32:01,194 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:32:01,196 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:32:01,196 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:32:01,199 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:32:01,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:31:59" (1/3) ... [2022-02-20 18:32:01,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7df180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:32:01, skipping insertion in model container [2022-02-20 18:32:01,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:32:00" (2/3) ... [2022-02-20 18:32:01,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7df180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:32:01, skipping insertion in model container [2022-02-20 18:32:01,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:32:01" (3/3) ... [2022-02-20 18:32:01,202 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c [2022-02-20 18:32:01,210 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:32:01,210 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:32:01,251 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:32:01,256 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:32:01,257 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:32:01,274 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 141 states have (on average 1.7588652482269505) internal successors, (248), 142 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:01,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:32:01,280 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:01,281 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:32:01,281 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:01,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:01,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1418405445, now seen corresponding path program 1 times [2022-02-20 18:32:01,291 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:01,291 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309902960] [2022-02-20 18:32:01,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:01,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:01,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:01,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {146#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {146#true} is VALID [2022-02-20 18:32:01,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {146#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {146#true} is VALID [2022-02-20 18:32:01,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {146#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {146#true} is VALID [2022-02-20 18:32:01,636 INFO L290 TraceCheckUtils]: 3: Hoare triple {146#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {146#true} is VALID [2022-02-20 18:32:01,640 INFO L290 TraceCheckUtils]: 4: Hoare triple {146#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {146#true} is VALID [2022-02-20 18:32:01,641 INFO L290 TraceCheckUtils]: 5: Hoare triple {146#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {146#true} is VALID [2022-02-20 18:32:01,641 INFO L290 TraceCheckUtils]: 6: Hoare triple {146#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {146#true} is VALID [2022-02-20 18:32:01,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {146#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {146#true} is VALID [2022-02-20 18:32:01,641 INFO L290 TraceCheckUtils]: 8: Hoare triple {146#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {146#true} is VALID [2022-02-20 18:32:01,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {146#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {146#true} is VALID [2022-02-20 18:32:01,642 INFO L290 TraceCheckUtils]: 10: Hoare triple {146#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {146#true} is VALID [2022-02-20 18:32:01,642 INFO L290 TraceCheckUtils]: 11: Hoare triple {146#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {146#true} is VALID [2022-02-20 18:32:01,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {146#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {146#true} is VALID [2022-02-20 18:32:01,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {146#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {146#true} is VALID [2022-02-20 18:32:01,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {146#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; {146#true} is VALID [2022-02-20 18:32:01,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {146#true} init_#res#1 := init_~tmp___5~0#1; {146#true} is VALID [2022-02-20 18:32:01,644 INFO L290 TraceCheckUtils]: 16: Hoare triple {146#true} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {146#true} is VALID [2022-02-20 18:32:01,645 INFO L290 TraceCheckUtils]: 17: Hoare triple {146#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {147#false} is VALID [2022-02-20 18:32:01,645 INFO L290 TraceCheckUtils]: 18: Hoare triple {147#false} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {147#false} is VALID [2022-02-20 18:32:01,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {147#false} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {147#false} is VALID [2022-02-20 18:32:01,645 INFO L290 TraceCheckUtils]: 20: Hoare triple {147#false} assume !(0 != ~mode1~0 % 256); {147#false} is VALID [2022-02-20 18:32:01,646 INFO L290 TraceCheckUtils]: 21: Hoare triple {147#false} assume !(~r1~0 < 2); {147#false} is VALID [2022-02-20 18:32:01,646 INFO L290 TraceCheckUtils]: 22: Hoare triple {147#false} ~mode1~0 := 1; {147#false} is VALID [2022-02-20 18:32:01,646 INFO L290 TraceCheckUtils]: 23: Hoare triple {147#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {147#false} is VALID [2022-02-20 18:32:01,646 INFO L290 TraceCheckUtils]: 24: Hoare triple {147#false} assume !(0 != ~mode2~0 % 256); {147#false} is VALID [2022-02-20 18:32:01,647 INFO L290 TraceCheckUtils]: 25: Hoare triple {147#false} assume !(~r2~0 < 2); {147#false} is VALID [2022-02-20 18:32:01,647 INFO L290 TraceCheckUtils]: 26: Hoare triple {147#false} ~mode2~0 := 1; {147#false} is VALID [2022-02-20 18:32:01,647 INFO L290 TraceCheckUtils]: 27: Hoare triple {147#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {147#false} is VALID [2022-02-20 18:32:01,648 INFO L290 TraceCheckUtils]: 28: Hoare triple {147#false} assume !(0 != ~mode3~0 % 256); {147#false} is VALID [2022-02-20 18:32:01,648 INFO L290 TraceCheckUtils]: 29: Hoare triple {147#false} assume !(~r3~0 < 2); {147#false} is VALID [2022-02-20 18:32:01,648 INFO L290 TraceCheckUtils]: 30: Hoare triple {147#false} ~mode3~0 := 1; {147#false} is VALID [2022-02-20 18:32:01,648 INFO L290 TraceCheckUtils]: 31: Hoare triple {147#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {147#false} is VALID [2022-02-20 18:32:01,649 INFO L290 TraceCheckUtils]: 32: Hoare triple {147#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {147#false} is VALID [2022-02-20 18:32:01,649 INFO L290 TraceCheckUtils]: 33: Hoare triple {147#false} check_#res#1 := check_~tmp~1#1; {147#false} is VALID [2022-02-20 18:32:01,649 INFO L290 TraceCheckUtils]: 34: Hoare triple {147#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {147#false} is VALID [2022-02-20 18:32:01,649 INFO L290 TraceCheckUtils]: 35: Hoare triple {147#false} assume 0 == assert_~arg#1 % 256; {147#false} is VALID [2022-02-20 18:32:01,650 INFO L290 TraceCheckUtils]: 36: Hoare triple {147#false} assume !false; {147#false} is VALID [2022-02-20 18:32:01,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:32:01,651 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:01,652 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309902960] [2022-02-20 18:32:01,652 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309902960] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:01,652 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:01,653 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:32:01,654 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757015304] [2022-02-20 18:32:01,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:01,663 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-02-20 18:32:01,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:01,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:01,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:01,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:32:01,706 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:01,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:32:01,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:32:01,738 INFO L87 Difference]: Start difference. First operand has 143 states, 141 states have (on average 1.7588652482269505) internal successors, (248), 142 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:01,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:01,905 INFO L93 Difference]: Finished difference Result 227 states and 388 transitions. [2022-02-20 18:32:01,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:32:01,906 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-02-20 18:32:01,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:01,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:01,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 388 transitions. [2022-02-20 18:32:01,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:01,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 388 transitions. [2022-02-20 18:32:01,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 388 transitions. [2022-02-20 18:32:02,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 388 edges. 388 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:02,255 INFO L225 Difference]: With dead ends: 227 [2022-02-20 18:32:02,256 INFO L226 Difference]: Without dead ends: 139 [2022-02-20 18:32:02,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:32:02,262 INFO L933 BasicCegarLoop]: 245 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:32:02,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:32:02,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-02-20 18:32:02,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-02-20 18:32:02,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:02,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 139 states, 138 states have (on average 1.7463768115942029) internal successors, (241), 138 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:02,306 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 139 states, 138 states have (on average 1.7463768115942029) internal successors, (241), 138 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:02,307 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 139 states, 138 states have (on average 1.7463768115942029) internal successors, (241), 138 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:02,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:02,320 INFO L93 Difference]: Finished difference Result 139 states and 241 transitions. [2022-02-20 18:32:02,320 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 241 transitions. [2022-02-20 18:32:02,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:02,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:02,322 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 138 states have (on average 1.7463768115942029) internal successors, (241), 138 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 139 states. [2022-02-20 18:32:02,322 INFO L87 Difference]: Start difference. First operand has 139 states, 138 states have (on average 1.7463768115942029) internal successors, (241), 138 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 139 states. [2022-02-20 18:32:02,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:02,329 INFO L93 Difference]: Finished difference Result 139 states and 241 transitions. [2022-02-20 18:32:02,329 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 241 transitions. [2022-02-20 18:32:02,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:02,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:02,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:02,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:02,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.7463768115942029) internal successors, (241), 138 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:02,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 241 transitions. [2022-02-20 18:32:02,337 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 241 transitions. Word has length 37 [2022-02-20 18:32:02,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:02,338 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 241 transitions. [2022-02-20 18:32:02,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:02,338 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 241 transitions. [2022-02-20 18:32:02,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:32:02,340 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:02,340 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:32:02,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:32:02,340 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:02,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:02,341 INFO L85 PathProgramCache]: Analyzing trace with hash 2058913401, now seen corresponding path program 1 times [2022-02-20 18:32:02,342 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:02,342 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135293579] [2022-02-20 18:32:02,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:02,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:02,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:02,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {822#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {822#true} is VALID [2022-02-20 18:32:02,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {822#true} is VALID [2022-02-20 18:32:02,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {822#true} is VALID [2022-02-20 18:32:02,436 INFO L290 TraceCheckUtils]: 3: Hoare triple {822#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {822#true} is VALID [2022-02-20 18:32:02,436 INFO L290 TraceCheckUtils]: 4: Hoare triple {822#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {822#true} is VALID [2022-02-20 18:32:02,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {822#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {822#true} is VALID [2022-02-20 18:32:02,437 INFO L290 TraceCheckUtils]: 6: Hoare triple {822#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {822#true} is VALID [2022-02-20 18:32:02,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {822#true} is VALID [2022-02-20 18:32:02,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {822#true} is VALID [2022-02-20 18:32:02,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {822#true} is VALID [2022-02-20 18:32:02,438 INFO L290 TraceCheckUtils]: 10: Hoare triple {822#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {822#true} is VALID [2022-02-20 18:32:02,438 INFO L290 TraceCheckUtils]: 11: Hoare triple {822#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {822#true} is VALID [2022-02-20 18:32:02,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {822#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {822#true} is VALID [2022-02-20 18:32:02,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {822#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {822#true} is VALID [2022-02-20 18:32:02,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {822#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; {824#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} is VALID [2022-02-20 18:32:02,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {824#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} init_#res#1 := init_~tmp___5~0#1; {825#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:32:02,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {825#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {826#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 18:32:02,441 INFO L290 TraceCheckUtils]: 17: Hoare triple {826#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {823#false} is VALID [2022-02-20 18:32:02,441 INFO L290 TraceCheckUtils]: 18: Hoare triple {823#false} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {823#false} is VALID [2022-02-20 18:32:02,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {823#false} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {823#false} is VALID [2022-02-20 18:32:02,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {823#false} assume !(0 != ~mode1~0 % 256); {823#false} is VALID [2022-02-20 18:32:02,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {823#false} assume !(~r1~0 < 2); {823#false} is VALID [2022-02-20 18:32:02,442 INFO L290 TraceCheckUtils]: 22: Hoare triple {823#false} ~mode1~0 := 1; {823#false} is VALID [2022-02-20 18:32:02,442 INFO L290 TraceCheckUtils]: 23: Hoare triple {823#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {823#false} is VALID [2022-02-20 18:32:02,442 INFO L290 TraceCheckUtils]: 24: Hoare triple {823#false} assume !(0 != ~mode2~0 % 256); {823#false} is VALID [2022-02-20 18:32:02,443 INFO L290 TraceCheckUtils]: 25: Hoare triple {823#false} assume !(~r2~0 < 2); {823#false} is VALID [2022-02-20 18:32:02,443 INFO L290 TraceCheckUtils]: 26: Hoare triple {823#false} ~mode2~0 := 1; {823#false} is VALID [2022-02-20 18:32:02,443 INFO L290 TraceCheckUtils]: 27: Hoare triple {823#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {823#false} is VALID [2022-02-20 18:32:02,443 INFO L290 TraceCheckUtils]: 28: Hoare triple {823#false} assume !(0 != ~mode3~0 % 256); {823#false} is VALID [2022-02-20 18:32:02,444 INFO L290 TraceCheckUtils]: 29: Hoare triple {823#false} assume !(~r3~0 < 2); {823#false} is VALID [2022-02-20 18:32:02,444 INFO L290 TraceCheckUtils]: 30: Hoare triple {823#false} ~mode3~0 := 1; {823#false} is VALID [2022-02-20 18:32:02,444 INFO L290 TraceCheckUtils]: 31: Hoare triple {823#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {823#false} is VALID [2022-02-20 18:32:02,444 INFO L290 TraceCheckUtils]: 32: Hoare triple {823#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {823#false} is VALID [2022-02-20 18:32:02,445 INFO L290 TraceCheckUtils]: 33: Hoare triple {823#false} check_#res#1 := check_~tmp~1#1; {823#false} is VALID [2022-02-20 18:32:02,445 INFO L290 TraceCheckUtils]: 34: Hoare triple {823#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {823#false} is VALID [2022-02-20 18:32:02,445 INFO L290 TraceCheckUtils]: 35: Hoare triple {823#false} assume 0 == assert_~arg#1 % 256; {823#false} is VALID [2022-02-20 18:32:02,445 INFO L290 TraceCheckUtils]: 36: Hoare triple {823#false} assume !false; {823#false} is VALID [2022-02-20 18:32:02,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:32:02,446 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:02,446 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135293579] [2022-02-20 18:32:02,447 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135293579] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:02,447 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:02,447 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:32:02,447 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341363765] [2022-02-20 18:32:02,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:02,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-02-20 18:32:02,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:02,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:02,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:02,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:32:02,476 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:02,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:32:02,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:32:02,477 INFO L87 Difference]: Start difference. First operand 139 states and 241 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:02,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:02,930 INFO L93 Difference]: Finished difference Result 222 states and 378 transitions. [2022-02-20 18:32:02,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:32:02,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-02-20 18:32:02,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:02,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:02,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 378 transitions. [2022-02-20 18:32:02,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:02,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 378 transitions. [2022-02-20 18:32:02,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 378 transitions. [2022-02-20 18:32:03,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 378 edges. 378 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:03,230 INFO L225 Difference]: With dead ends: 222 [2022-02-20 18:32:03,230 INFO L226 Difference]: Without dead ends: 139 [2022-02-20 18:32:03,231 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:32:03,232 INFO L933 BasicCegarLoop]: 239 mSDtfsCounter, 3 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:32:03,233 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 923 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:32:03,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-02-20 18:32:03,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-02-20 18:32:03,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:03,239 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 139 states, 138 states have (on average 1.5289855072463767) internal successors, (211), 138 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:03,240 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 139 states, 138 states have (on average 1.5289855072463767) internal successors, (211), 138 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:03,240 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 139 states, 138 states have (on average 1.5289855072463767) internal successors, (211), 138 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:03,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:03,244 INFO L93 Difference]: Finished difference Result 139 states and 211 transitions. [2022-02-20 18:32:03,245 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 211 transitions. [2022-02-20 18:32:03,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:03,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:03,246 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 138 states have (on average 1.5289855072463767) internal successors, (211), 138 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 139 states. [2022-02-20 18:32:03,246 INFO L87 Difference]: Start difference. First operand has 139 states, 138 states have (on average 1.5289855072463767) internal successors, (211), 138 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 139 states. [2022-02-20 18:32:03,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:03,251 INFO L93 Difference]: Finished difference Result 139 states and 211 transitions. [2022-02-20 18:32:03,251 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 211 transitions. [2022-02-20 18:32:03,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:03,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:03,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:03,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:03,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.5289855072463767) internal successors, (211), 138 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:03,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 211 transitions. [2022-02-20 18:32:03,256 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 211 transitions. Word has length 37 [2022-02-20 18:32:03,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:03,257 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 211 transitions. [2022-02-20 18:32:03,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:03,257 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 211 transitions. [2022-02-20 18:32:03,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:32:03,259 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:03,259 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:32:03,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:32:03,259 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:03,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:03,260 INFO L85 PathProgramCache]: Analyzing trace with hash -415118785, now seen corresponding path program 1 times [2022-02-20 18:32:03,260 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:03,261 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090198637] [2022-02-20 18:32:03,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:03,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:03,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {1499#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {1499#true} is VALID [2022-02-20 18:32:03,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {1499#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {1499#true} is VALID [2022-02-20 18:32:03,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {1499#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {1499#true} is VALID [2022-02-20 18:32:03,348 INFO L290 TraceCheckUtils]: 3: Hoare triple {1499#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {1499#true} is VALID [2022-02-20 18:32:03,348 INFO L290 TraceCheckUtils]: 4: Hoare triple {1499#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {1499#true} is VALID [2022-02-20 18:32:03,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {1499#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {1499#true} is VALID [2022-02-20 18:32:03,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {1499#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {1499#true} is VALID [2022-02-20 18:32:03,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {1499#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {1499#true} is VALID [2022-02-20 18:32:03,349 INFO L290 TraceCheckUtils]: 8: Hoare triple {1499#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {1499#true} is VALID [2022-02-20 18:32:03,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {1499#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {1499#true} is VALID [2022-02-20 18:32:03,349 INFO L290 TraceCheckUtils]: 10: Hoare triple {1499#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {1499#true} is VALID [2022-02-20 18:32:03,350 INFO L290 TraceCheckUtils]: 11: Hoare triple {1499#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {1499#true} is VALID [2022-02-20 18:32:03,350 INFO L290 TraceCheckUtils]: 12: Hoare triple {1499#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {1499#true} is VALID [2022-02-20 18:32:03,350 INFO L290 TraceCheckUtils]: 13: Hoare triple {1499#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {1499#true} is VALID [2022-02-20 18:32:03,350 INFO L290 TraceCheckUtils]: 14: Hoare triple {1499#true} assume ~id1~0 != ~id2~0; {1499#true} is VALID [2022-02-20 18:32:03,351 INFO L290 TraceCheckUtils]: 15: Hoare triple {1499#true} assume ~id1~0 != ~id3~0; {1499#true} is VALID [2022-02-20 18:32:03,351 INFO L290 TraceCheckUtils]: 16: Hoare triple {1499#true} assume ~id2~0 != ~id3~0; {1499#true} is VALID [2022-02-20 18:32:03,351 INFO L290 TraceCheckUtils]: 17: Hoare triple {1499#true} assume ~id1~0 >= 0; {1499#true} is VALID [2022-02-20 18:32:03,351 INFO L290 TraceCheckUtils]: 18: Hoare triple {1499#true} assume ~id2~0 >= 0; {1499#true} is VALID [2022-02-20 18:32:03,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {1499#true} assume ~id3~0 >= 0; {1499#true} is VALID [2022-02-20 18:32:03,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {1499#true} assume 0 == ~r1~0; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:32:03,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {1501#(<= ~r1~0 0)} assume 0 == ~r2~0; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:32:03,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {1501#(<= ~r1~0 0)} assume 0 == ~r3~0; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:32:03,353 INFO L290 TraceCheckUtils]: 23: Hoare triple {1501#(<= ~r1~0 0)} assume 0 != init_~r122~0#1 % 256; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:32:03,354 INFO L290 TraceCheckUtils]: 24: Hoare triple {1501#(<= ~r1~0 0)} assume 0 != init_~r132~0#1 % 256; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:32:03,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {1501#(<= ~r1~0 0)} assume 0 != init_~r212~0#1 % 256; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:32:03,355 INFO L290 TraceCheckUtils]: 26: Hoare triple {1501#(<= ~r1~0 0)} assume 0 != init_~r232~0#1 % 256; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:32:03,355 INFO L290 TraceCheckUtils]: 27: Hoare triple {1501#(<= ~r1~0 0)} assume 0 != init_~r312~0#1 % 256; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:32:03,355 INFO L290 TraceCheckUtils]: 28: Hoare triple {1501#(<= ~r1~0 0)} assume 0 != init_~r322~0#1 % 256; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:32:03,356 INFO L290 TraceCheckUtils]: 29: Hoare triple {1501#(<= ~r1~0 0)} assume ~max1~0 == ~id1~0; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:32:03,356 INFO L290 TraceCheckUtils]: 30: Hoare triple {1501#(<= ~r1~0 0)} assume ~max2~0 == ~id2~0; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:32:03,357 INFO L290 TraceCheckUtils]: 31: Hoare triple {1501#(<= ~r1~0 0)} assume ~max3~0 == ~id3~0; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:32:03,357 INFO L290 TraceCheckUtils]: 32: Hoare triple {1501#(<= ~r1~0 0)} assume 0 == ~st1~0; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:32:03,358 INFO L290 TraceCheckUtils]: 33: Hoare triple {1501#(<= ~r1~0 0)} assume 0 == ~st2~0; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:32:03,358 INFO L290 TraceCheckUtils]: 34: Hoare triple {1501#(<= ~r1~0 0)} assume 0 == ~st3~0; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:32:03,358 INFO L290 TraceCheckUtils]: 35: Hoare triple {1501#(<= ~r1~0 0)} assume 0 == ~nl1~0; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:32:03,359 INFO L290 TraceCheckUtils]: 36: Hoare triple {1501#(<= ~r1~0 0)} assume 0 == ~nl2~0; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:32:03,359 INFO L290 TraceCheckUtils]: 37: Hoare triple {1501#(<= ~r1~0 0)} assume 0 == ~nl3~0; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:32:03,360 INFO L290 TraceCheckUtils]: 38: Hoare triple {1501#(<= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:32:03,360 INFO L290 TraceCheckUtils]: 39: Hoare triple {1501#(<= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:32:03,361 INFO L290 TraceCheckUtils]: 40: Hoare triple {1501#(<= ~r1~0 0)} assume 0 == ~mode3~0 % 256; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:32:03,361 INFO L290 TraceCheckUtils]: 41: Hoare triple {1501#(<= ~r1~0 0)} assume 0 != ~newmax1~0 % 256; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:32:03,361 INFO L290 TraceCheckUtils]: 42: Hoare triple {1501#(<= ~r1~0 0)} assume 0 != ~newmax2~0 % 256; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:32:03,362 INFO L290 TraceCheckUtils]: 43: Hoare triple {1501#(<= ~r1~0 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:32:03,362 INFO L290 TraceCheckUtils]: 44: Hoare triple {1501#(<= ~r1~0 0)} init_#res#1 := init_~tmp___5~0#1; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:32:03,363 INFO L290 TraceCheckUtils]: 45: Hoare triple {1501#(<= ~r1~0 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:32:03,363 INFO L290 TraceCheckUtils]: 46: Hoare triple {1501#(<= ~r1~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:32:03,364 INFO L290 TraceCheckUtils]: 47: Hoare triple {1501#(<= ~r1~0 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:32:03,364 INFO L290 TraceCheckUtils]: 48: Hoare triple {1501#(<= ~r1~0 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:32:03,364 INFO L290 TraceCheckUtils]: 49: Hoare triple {1501#(<= ~r1~0 0)} assume !(0 != ~mode1~0 % 256); {1501#(<= ~r1~0 0)} is VALID [2022-02-20 18:32:03,365 INFO L290 TraceCheckUtils]: 50: Hoare triple {1501#(<= ~r1~0 0)} assume !(~r1~0 < 2); {1500#false} is VALID [2022-02-20 18:32:03,365 INFO L290 TraceCheckUtils]: 51: Hoare triple {1500#false} ~mode1~0 := 1; {1500#false} is VALID [2022-02-20 18:32:03,365 INFO L290 TraceCheckUtils]: 52: Hoare triple {1500#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {1500#false} is VALID [2022-02-20 18:32:03,366 INFO L290 TraceCheckUtils]: 53: Hoare triple {1500#false} assume !(0 != ~mode2~0 % 256); {1500#false} is VALID [2022-02-20 18:32:03,366 INFO L290 TraceCheckUtils]: 54: Hoare triple {1500#false} assume !(~r2~0 < 2); {1500#false} is VALID [2022-02-20 18:32:03,366 INFO L290 TraceCheckUtils]: 55: Hoare triple {1500#false} ~mode2~0 := 1; {1500#false} is VALID [2022-02-20 18:32:03,366 INFO L290 TraceCheckUtils]: 56: Hoare triple {1500#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {1500#false} is VALID [2022-02-20 18:32:03,366 INFO L290 TraceCheckUtils]: 57: Hoare triple {1500#false} assume !(0 != ~mode3~0 % 256); {1500#false} is VALID [2022-02-20 18:32:03,367 INFO L290 TraceCheckUtils]: 58: Hoare triple {1500#false} assume !(~r3~0 < 2); {1500#false} is VALID [2022-02-20 18:32:03,367 INFO L290 TraceCheckUtils]: 59: Hoare triple {1500#false} ~mode3~0 := 1; {1500#false} is VALID [2022-02-20 18:32:03,367 INFO L290 TraceCheckUtils]: 60: Hoare triple {1500#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1500#false} is VALID [2022-02-20 18:32:03,367 INFO L290 TraceCheckUtils]: 61: Hoare triple {1500#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {1500#false} is VALID [2022-02-20 18:32:03,367 INFO L290 TraceCheckUtils]: 62: Hoare triple {1500#false} check_#res#1 := check_~tmp~1#1; {1500#false} is VALID [2022-02-20 18:32:03,368 INFO L290 TraceCheckUtils]: 63: Hoare triple {1500#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1500#false} is VALID [2022-02-20 18:32:03,368 INFO L290 TraceCheckUtils]: 64: Hoare triple {1500#false} assume 0 == assert_~arg#1 % 256; {1500#false} is VALID [2022-02-20 18:32:03,368 INFO L290 TraceCheckUtils]: 65: Hoare triple {1500#false} assume !false; {1500#false} is VALID [2022-02-20 18:32:03,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:32:03,369 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:03,369 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090198637] [2022-02-20 18:32:03,369 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090198637] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:03,369 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:03,370 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:32:03,370 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075878608] [2022-02-20 18:32:03,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:03,370 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:32:03,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:03,371 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:32:03,416 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:32:03,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:32:03,417 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:03,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:32:03,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:32:03,418 INFO L87 Difference]: Start difference. First operand 139 states and 211 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:03,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:03,652 INFO L93 Difference]: Finished difference Result 287 states and 459 transitions. [2022-02-20 18:32:03,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:32:03,653 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:32:03,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:03,653 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:32:03,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2022-02-20 18:32:03,658 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:32:03,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2022-02-20 18:32:03,662 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 459 transitions. [2022-02-20 18:32:04,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 459 edges. 459 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:04,020 INFO L225 Difference]: With dead ends: 287 [2022-02-20 18:32:04,020 INFO L226 Difference]: Without dead ends: 208 [2022-02-20 18:32:04,021 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:32:04,022 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 107 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:32:04,022 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 374 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:32:04,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-02-20 18:32:04,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2022-02-20 18:32:04,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:04,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 208 states. Second operand has 206 states, 205 states have (on average 1.5609756097560976) internal successors, (320), 205 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:04,046 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states. Second operand has 206 states, 205 states have (on average 1.5609756097560976) internal successors, (320), 205 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:04,046 INFO L87 Difference]: Start difference. First operand 208 states. Second operand has 206 states, 205 states have (on average 1.5609756097560976) internal successors, (320), 205 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:04,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:04,052 INFO L93 Difference]: Finished difference Result 208 states and 321 transitions. [2022-02-20 18:32:04,052 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 321 transitions. [2022-02-20 18:32:04,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:04,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:04,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 206 states, 205 states have (on average 1.5609756097560976) internal successors, (320), 205 states have internal predecessors, (320), 0 states have call successors, (0), 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 208 states. [2022-02-20 18:32:04,054 INFO L87 Difference]: Start difference. First operand has 206 states, 205 states have (on average 1.5609756097560976) internal successors, (320), 205 states have internal predecessors, (320), 0 states have call successors, (0), 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 208 states. [2022-02-20 18:32:04,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:04,060 INFO L93 Difference]: Finished difference Result 208 states and 321 transitions. [2022-02-20 18:32:04,060 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 321 transitions. [2022-02-20 18:32:04,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:04,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:04,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:04,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:04,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.5609756097560976) internal successors, (320), 205 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:04,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 320 transitions. [2022-02-20 18:32:04,068 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 320 transitions. Word has length 66 [2022-02-20 18:32:04,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:04,068 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 320 transitions. [2022-02-20 18:32:04,068 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:32:04,069 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 320 transitions. [2022-02-20 18:32:04,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 18:32:04,069 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:04,070 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:32:04,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:32:04,070 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:04,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:04,071 INFO L85 PathProgramCache]: Analyzing trace with hash 928134868, now seen corresponding path program 1 times [2022-02-20 18:32:04,071 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:04,071 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802673578] [2022-02-20 18:32:04,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:04,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:04,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {2455#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {2455#true} is VALID [2022-02-20 18:32:04,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {2455#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {2455#true} is VALID [2022-02-20 18:32:04,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {2455#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {2455#true} is VALID [2022-02-20 18:32:04,167 INFO L290 TraceCheckUtils]: 3: Hoare triple {2455#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {2455#true} is VALID [2022-02-20 18:32:04,167 INFO L290 TraceCheckUtils]: 4: Hoare triple {2455#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {2455#true} is VALID [2022-02-20 18:32:04,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {2455#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {2455#true} is VALID [2022-02-20 18:32:04,168 INFO L290 TraceCheckUtils]: 6: Hoare triple {2455#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {2455#true} is VALID [2022-02-20 18:32:04,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {2455#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {2455#true} is VALID [2022-02-20 18:32:04,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {2455#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {2455#true} is VALID [2022-02-20 18:32:04,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {2455#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {2455#true} is VALID [2022-02-20 18:32:04,168 INFO L290 TraceCheckUtils]: 10: Hoare triple {2455#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {2455#true} is VALID [2022-02-20 18:32:04,168 INFO L290 TraceCheckUtils]: 11: Hoare triple {2455#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {2455#true} is VALID [2022-02-20 18:32:04,168 INFO L290 TraceCheckUtils]: 12: Hoare triple {2455#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {2455#true} is VALID [2022-02-20 18:32:04,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {2455#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {2455#true} is VALID [2022-02-20 18:32:04,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {2455#true} assume ~id1~0 != ~id2~0; {2455#true} is VALID [2022-02-20 18:32:04,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {2455#true} assume ~id1~0 != ~id3~0; {2455#true} is VALID [2022-02-20 18:32:04,169 INFO L290 TraceCheckUtils]: 16: Hoare triple {2455#true} assume ~id2~0 != ~id3~0; {2455#true} is VALID [2022-02-20 18:32:04,169 INFO L290 TraceCheckUtils]: 17: Hoare triple {2455#true} assume ~id1~0 >= 0; {2455#true} is VALID [2022-02-20 18:32:04,169 INFO L290 TraceCheckUtils]: 18: Hoare triple {2455#true} assume ~id2~0 >= 0; {2455#true} is VALID [2022-02-20 18:32:04,169 INFO L290 TraceCheckUtils]: 19: Hoare triple {2455#true} assume ~id3~0 >= 0; {2455#true} is VALID [2022-02-20 18:32:04,169 INFO L290 TraceCheckUtils]: 20: Hoare triple {2455#true} assume 0 == ~r1~0; {2455#true} is VALID [2022-02-20 18:32:04,170 INFO L290 TraceCheckUtils]: 21: Hoare triple {2455#true} assume 0 == ~r2~0; {2457#(<= ~r2~0 0)} is VALID [2022-02-20 18:32:04,171 INFO L290 TraceCheckUtils]: 22: Hoare triple {2457#(<= ~r2~0 0)} assume 0 == ~r3~0; {2457#(<= ~r2~0 0)} is VALID [2022-02-20 18:32:04,171 INFO L290 TraceCheckUtils]: 23: Hoare triple {2457#(<= ~r2~0 0)} assume 0 != init_~r122~0#1 % 256; {2457#(<= ~r2~0 0)} is VALID [2022-02-20 18:32:04,171 INFO L290 TraceCheckUtils]: 24: Hoare triple {2457#(<= ~r2~0 0)} assume 0 != init_~r132~0#1 % 256; {2457#(<= ~r2~0 0)} is VALID [2022-02-20 18:32:04,172 INFO L290 TraceCheckUtils]: 25: Hoare triple {2457#(<= ~r2~0 0)} assume 0 != init_~r212~0#1 % 256; {2457#(<= ~r2~0 0)} is VALID [2022-02-20 18:32:04,172 INFO L290 TraceCheckUtils]: 26: Hoare triple {2457#(<= ~r2~0 0)} assume 0 != init_~r232~0#1 % 256; {2457#(<= ~r2~0 0)} is VALID [2022-02-20 18:32:04,172 INFO L290 TraceCheckUtils]: 27: Hoare triple {2457#(<= ~r2~0 0)} assume 0 != init_~r312~0#1 % 256; {2457#(<= ~r2~0 0)} is VALID [2022-02-20 18:32:04,173 INFO L290 TraceCheckUtils]: 28: Hoare triple {2457#(<= ~r2~0 0)} assume 0 != init_~r322~0#1 % 256; {2457#(<= ~r2~0 0)} is VALID [2022-02-20 18:32:04,173 INFO L290 TraceCheckUtils]: 29: Hoare triple {2457#(<= ~r2~0 0)} assume ~max1~0 == ~id1~0; {2457#(<= ~r2~0 0)} is VALID [2022-02-20 18:32:04,174 INFO L290 TraceCheckUtils]: 30: Hoare triple {2457#(<= ~r2~0 0)} assume ~max2~0 == ~id2~0; {2457#(<= ~r2~0 0)} is VALID [2022-02-20 18:32:04,174 INFO L290 TraceCheckUtils]: 31: Hoare triple {2457#(<= ~r2~0 0)} assume ~max3~0 == ~id3~0; {2457#(<= ~r2~0 0)} is VALID [2022-02-20 18:32:04,174 INFO L290 TraceCheckUtils]: 32: Hoare triple {2457#(<= ~r2~0 0)} assume 0 == ~st1~0; {2457#(<= ~r2~0 0)} is VALID [2022-02-20 18:32:04,175 INFO L290 TraceCheckUtils]: 33: Hoare triple {2457#(<= ~r2~0 0)} assume 0 == ~st2~0; {2457#(<= ~r2~0 0)} is VALID [2022-02-20 18:32:04,175 INFO L290 TraceCheckUtils]: 34: Hoare triple {2457#(<= ~r2~0 0)} assume 0 == ~st3~0; {2457#(<= ~r2~0 0)} is VALID [2022-02-20 18:32:04,176 INFO L290 TraceCheckUtils]: 35: Hoare triple {2457#(<= ~r2~0 0)} assume 0 == ~nl1~0; {2457#(<= ~r2~0 0)} is VALID [2022-02-20 18:32:04,177 INFO L290 TraceCheckUtils]: 36: Hoare triple {2457#(<= ~r2~0 0)} assume 0 == ~nl2~0; {2457#(<= ~r2~0 0)} is VALID [2022-02-20 18:32:04,177 INFO L290 TraceCheckUtils]: 37: Hoare triple {2457#(<= ~r2~0 0)} assume 0 == ~nl3~0; {2457#(<= ~r2~0 0)} is VALID [2022-02-20 18:32:04,178 INFO L290 TraceCheckUtils]: 38: Hoare triple {2457#(<= ~r2~0 0)} assume 0 == ~mode1~0 % 256; {2457#(<= ~r2~0 0)} is VALID [2022-02-20 18:32:04,178 INFO L290 TraceCheckUtils]: 39: Hoare triple {2457#(<= ~r2~0 0)} assume 0 == ~mode2~0 % 256; {2457#(<= ~r2~0 0)} is VALID [2022-02-20 18:32:04,178 INFO L290 TraceCheckUtils]: 40: Hoare triple {2457#(<= ~r2~0 0)} assume 0 == ~mode3~0 % 256; {2457#(<= ~r2~0 0)} is VALID [2022-02-20 18:32:04,179 INFO L290 TraceCheckUtils]: 41: Hoare triple {2457#(<= ~r2~0 0)} assume 0 != ~newmax1~0 % 256; {2457#(<= ~r2~0 0)} is VALID [2022-02-20 18:32:04,179 INFO L290 TraceCheckUtils]: 42: Hoare triple {2457#(<= ~r2~0 0)} assume 0 != ~newmax2~0 % 256; {2457#(<= ~r2~0 0)} is VALID [2022-02-20 18:32:04,180 INFO L290 TraceCheckUtils]: 43: Hoare triple {2457#(<= ~r2~0 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {2457#(<= ~r2~0 0)} is VALID [2022-02-20 18:32:04,180 INFO L290 TraceCheckUtils]: 44: Hoare triple {2457#(<= ~r2~0 0)} init_#res#1 := init_~tmp___5~0#1; {2457#(<= ~r2~0 0)} is VALID [2022-02-20 18:32:04,182 INFO L290 TraceCheckUtils]: 45: Hoare triple {2457#(<= ~r2~0 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2457#(<= ~r2~0 0)} is VALID [2022-02-20 18:32:04,183 INFO L290 TraceCheckUtils]: 46: Hoare triple {2457#(<= ~r2~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {2457#(<= ~r2~0 0)} is VALID [2022-02-20 18:32:04,183 INFO L290 TraceCheckUtils]: 47: Hoare triple {2457#(<= ~r2~0 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {2457#(<= ~r2~0 0)} is VALID [2022-02-20 18:32:04,183 INFO L290 TraceCheckUtils]: 48: Hoare triple {2457#(<= ~r2~0 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {2457#(<= ~r2~0 0)} is VALID [2022-02-20 18:32:04,184 INFO L290 TraceCheckUtils]: 49: Hoare triple {2457#(<= ~r2~0 0)} assume !(0 != ~mode1~0 % 256); {2457#(<= ~r2~0 0)} is VALID [2022-02-20 18:32:04,184 INFO L290 TraceCheckUtils]: 50: Hoare triple {2457#(<= ~r2~0 0)} assume ~r1~0 < 2; {2457#(<= ~r2~0 0)} is VALID [2022-02-20 18:32:04,185 INFO L290 TraceCheckUtils]: 51: Hoare triple {2457#(<= ~r2~0 0)} assume !(0 != ~ep12~0 % 256); {2457#(<= ~r2~0 0)} is VALID [2022-02-20 18:32:04,185 INFO L290 TraceCheckUtils]: 52: Hoare triple {2457#(<= ~r2~0 0)} assume !(0 != ~ep13~0 % 256); {2457#(<= ~r2~0 0)} is VALID [2022-02-20 18:32:04,186 INFO L290 TraceCheckUtils]: 53: Hoare triple {2457#(<= ~r2~0 0)} ~mode1~0 := 1; {2457#(<= ~r2~0 0)} is VALID [2022-02-20 18:32:04,186 INFO L290 TraceCheckUtils]: 54: Hoare triple {2457#(<= ~r2~0 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {2457#(<= ~r2~0 0)} is VALID [2022-02-20 18:32:04,187 INFO L290 TraceCheckUtils]: 55: Hoare triple {2457#(<= ~r2~0 0)} assume !(0 != ~mode2~0 % 256); {2457#(<= ~r2~0 0)} is VALID [2022-02-20 18:32:04,187 INFO L290 TraceCheckUtils]: 56: Hoare triple {2457#(<= ~r2~0 0)} assume !(~r2~0 < 2); {2456#false} is VALID [2022-02-20 18:32:04,187 INFO L290 TraceCheckUtils]: 57: Hoare triple {2456#false} ~mode2~0 := 1; {2456#false} is VALID [2022-02-20 18:32:04,187 INFO L290 TraceCheckUtils]: 58: Hoare triple {2456#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {2456#false} is VALID [2022-02-20 18:32:04,188 INFO L290 TraceCheckUtils]: 59: Hoare triple {2456#false} assume !(0 != ~mode3~0 % 256); {2456#false} is VALID [2022-02-20 18:32:04,188 INFO L290 TraceCheckUtils]: 60: Hoare triple {2456#false} assume !(~r3~0 < 2); {2456#false} is VALID [2022-02-20 18:32:04,188 INFO L290 TraceCheckUtils]: 61: Hoare triple {2456#false} ~mode3~0 := 1; {2456#false} is VALID [2022-02-20 18:32:04,188 INFO L290 TraceCheckUtils]: 62: Hoare triple {2456#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {2456#false} is VALID [2022-02-20 18:32:04,188 INFO L290 TraceCheckUtils]: 63: Hoare triple {2456#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {2456#false} is VALID [2022-02-20 18:32:04,189 INFO L290 TraceCheckUtils]: 64: Hoare triple {2456#false} check_#res#1 := check_~tmp~1#1; {2456#false} is VALID [2022-02-20 18:32:04,189 INFO L290 TraceCheckUtils]: 65: Hoare triple {2456#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {2456#false} is VALID [2022-02-20 18:32:04,189 INFO L290 TraceCheckUtils]: 66: Hoare triple {2456#false} assume 0 == assert_~arg#1 % 256; {2456#false} is VALID [2022-02-20 18:32:04,189 INFO L290 TraceCheckUtils]: 67: Hoare triple {2456#false} assume !false; {2456#false} is VALID [2022-02-20 18:32:04,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:32:04,193 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:04,193 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802673578] [2022-02-20 18:32:04,193 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802673578] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:04,194 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:04,194 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:32:04,194 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40570087] [2022-02-20 18:32:04,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:04,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-02-20 18:32:04,195 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:04,195 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:04,238 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:32:04,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:32:04,239 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:04,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:32:04,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:32:04,239 INFO L87 Difference]: Start difference. First operand 206 states and 320 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:04,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:04,475 INFO L93 Difference]: Finished difference Result 482 states and 776 transitions. [2022-02-20 18:32:04,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:32:04,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-02-20 18:32:04,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:04,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:04,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 463 transitions. [2022-02-20 18:32:04,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:04,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 463 transitions. [2022-02-20 18:32:04,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 463 transitions. [2022-02-20 18:32:04,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 463 edges. 463 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:04,793 INFO L225 Difference]: With dead ends: 482 [2022-02-20 18:32:04,793 INFO L226 Difference]: Without dead ends: 336 [2022-02-20 18:32:04,794 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:32:04,795 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 109 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:32:04,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 386 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:32:04,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-02-20 18:32:04,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2022-02-20 18:32:04,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:04,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 336 states. Second operand has 334 states, 333 states have (on average 1.5945945945945945) internal successors, (531), 333 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:04,828 INFO L74 IsIncluded]: Start isIncluded. First operand 336 states. Second operand has 334 states, 333 states have (on average 1.5945945945945945) internal successors, (531), 333 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:04,829 INFO L87 Difference]: Start difference. First operand 336 states. Second operand has 334 states, 333 states have (on average 1.5945945945945945) internal successors, (531), 333 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:04,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:04,840 INFO L93 Difference]: Finished difference Result 336 states and 532 transitions. [2022-02-20 18:32:04,840 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 532 transitions. [2022-02-20 18:32:04,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:04,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:04,842 INFO L74 IsIncluded]: Start isIncluded. First operand has 334 states, 333 states have (on average 1.5945945945945945) internal successors, (531), 333 states have internal predecessors, (531), 0 states have call successors, (0), 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 336 states. [2022-02-20 18:32:04,842 INFO L87 Difference]: Start difference. First operand has 334 states, 333 states have (on average 1.5945945945945945) internal successors, (531), 333 states have internal predecessors, (531), 0 states have call successors, (0), 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 336 states. [2022-02-20 18:32:04,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:04,852 INFO L93 Difference]: Finished difference Result 336 states and 532 transitions. [2022-02-20 18:32:04,852 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 532 transitions. [2022-02-20 18:32:04,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:04,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:04,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:04,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:04,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 1.5945945945945945) internal successors, (531), 333 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:04,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 531 transitions. [2022-02-20 18:32:04,862 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 531 transitions. Word has length 68 [2022-02-20 18:32:04,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:04,862 INFO L470 AbstractCegarLoop]: Abstraction has 334 states and 531 transitions. [2022-02-20 18:32:04,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:04,863 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 531 transitions. [2022-02-20 18:32:04,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 18:32:04,864 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:04,864 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:32:04,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:32:04,864 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:04,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:04,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1295175881, now seen corresponding path program 1 times [2022-02-20 18:32:04,865 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:04,865 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904476505] [2022-02-20 18:32:04,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:04,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:04,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {4030#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {4030#true} is VALID [2022-02-20 18:32:04,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {4030#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {4030#true} is VALID [2022-02-20 18:32:04,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {4030#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {4030#true} is VALID [2022-02-20 18:32:04,940 INFO L290 TraceCheckUtils]: 3: Hoare triple {4030#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {4030#true} is VALID [2022-02-20 18:32:04,940 INFO L290 TraceCheckUtils]: 4: Hoare triple {4030#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {4030#true} is VALID [2022-02-20 18:32:04,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {4030#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {4030#true} is VALID [2022-02-20 18:32:04,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {4030#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {4030#true} is VALID [2022-02-20 18:32:04,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {4030#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {4030#true} is VALID [2022-02-20 18:32:04,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {4030#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {4030#true} is VALID [2022-02-20 18:32:04,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {4030#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {4030#true} is VALID [2022-02-20 18:32:04,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {4030#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {4030#true} is VALID [2022-02-20 18:32:04,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {4030#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {4030#true} is VALID [2022-02-20 18:32:04,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {4030#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {4030#true} is VALID [2022-02-20 18:32:04,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {4030#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {4030#true} is VALID [2022-02-20 18:32:04,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {4030#true} assume ~id1~0 != ~id2~0; {4030#true} is VALID [2022-02-20 18:32:04,942 INFO L290 TraceCheckUtils]: 15: Hoare triple {4030#true} assume ~id1~0 != ~id3~0; {4030#true} is VALID [2022-02-20 18:32:04,942 INFO L290 TraceCheckUtils]: 16: Hoare triple {4030#true} assume ~id2~0 != ~id3~0; {4030#true} is VALID [2022-02-20 18:32:04,943 INFO L290 TraceCheckUtils]: 17: Hoare triple {4030#true} assume ~id1~0 >= 0; {4030#true} is VALID [2022-02-20 18:32:04,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {4030#true} assume ~id2~0 >= 0; {4030#true} is VALID [2022-02-20 18:32:04,943 INFO L290 TraceCheckUtils]: 19: Hoare triple {4030#true} assume ~id3~0 >= 0; {4030#true} is VALID [2022-02-20 18:32:04,943 INFO L290 TraceCheckUtils]: 20: Hoare triple {4030#true} assume 0 == ~r1~0; {4030#true} is VALID [2022-02-20 18:32:04,943 INFO L290 TraceCheckUtils]: 21: Hoare triple {4030#true} assume 0 == ~r2~0; {4030#true} is VALID [2022-02-20 18:32:04,944 INFO L290 TraceCheckUtils]: 22: Hoare triple {4030#true} assume 0 == ~r3~0; {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,944 INFO L290 TraceCheckUtils]: 23: Hoare triple {4032#(<= ~r3~0 0)} assume 0 != init_~r122~0#1 % 256; {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,944 INFO L290 TraceCheckUtils]: 24: Hoare triple {4032#(<= ~r3~0 0)} assume 0 != init_~r132~0#1 % 256; {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,945 INFO L290 TraceCheckUtils]: 25: Hoare triple {4032#(<= ~r3~0 0)} assume 0 != init_~r212~0#1 % 256; {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,945 INFO L290 TraceCheckUtils]: 26: Hoare triple {4032#(<= ~r3~0 0)} assume 0 != init_~r232~0#1 % 256; {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,946 INFO L290 TraceCheckUtils]: 27: Hoare triple {4032#(<= ~r3~0 0)} assume 0 != init_~r312~0#1 % 256; {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,946 INFO L290 TraceCheckUtils]: 28: Hoare triple {4032#(<= ~r3~0 0)} assume 0 != init_~r322~0#1 % 256; {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,946 INFO L290 TraceCheckUtils]: 29: Hoare triple {4032#(<= ~r3~0 0)} assume ~max1~0 == ~id1~0; {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {4032#(<= ~r3~0 0)} assume ~max2~0 == ~id2~0; {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,947 INFO L290 TraceCheckUtils]: 31: Hoare triple {4032#(<= ~r3~0 0)} assume ~max3~0 == ~id3~0; {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,947 INFO L290 TraceCheckUtils]: 32: Hoare triple {4032#(<= ~r3~0 0)} assume 0 == ~st1~0; {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,948 INFO L290 TraceCheckUtils]: 33: Hoare triple {4032#(<= ~r3~0 0)} assume 0 == ~st2~0; {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,948 INFO L290 TraceCheckUtils]: 34: Hoare triple {4032#(<= ~r3~0 0)} assume 0 == ~st3~0; {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,949 INFO L290 TraceCheckUtils]: 35: Hoare triple {4032#(<= ~r3~0 0)} assume 0 == ~nl1~0; {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,949 INFO L290 TraceCheckUtils]: 36: Hoare triple {4032#(<= ~r3~0 0)} assume 0 == ~nl2~0; {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,949 INFO L290 TraceCheckUtils]: 37: Hoare triple {4032#(<= ~r3~0 0)} assume 0 == ~nl3~0; {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,950 INFO L290 TraceCheckUtils]: 38: Hoare triple {4032#(<= ~r3~0 0)} assume 0 == ~mode1~0 % 256; {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,950 INFO L290 TraceCheckUtils]: 39: Hoare triple {4032#(<= ~r3~0 0)} assume 0 == ~mode2~0 % 256; {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,950 INFO L290 TraceCheckUtils]: 40: Hoare triple {4032#(<= ~r3~0 0)} assume 0 == ~mode3~0 % 256; {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,951 INFO L290 TraceCheckUtils]: 41: Hoare triple {4032#(<= ~r3~0 0)} assume 0 != ~newmax1~0 % 256; {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,951 INFO L290 TraceCheckUtils]: 42: Hoare triple {4032#(<= ~r3~0 0)} assume 0 != ~newmax2~0 % 256; {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,952 INFO L290 TraceCheckUtils]: 43: Hoare triple {4032#(<= ~r3~0 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,952 INFO L290 TraceCheckUtils]: 44: Hoare triple {4032#(<= ~r3~0 0)} init_#res#1 := init_~tmp___5~0#1; {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,952 INFO L290 TraceCheckUtils]: 45: Hoare triple {4032#(<= ~r3~0 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,953 INFO L290 TraceCheckUtils]: 46: Hoare triple {4032#(<= ~r3~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,953 INFO L290 TraceCheckUtils]: 47: Hoare triple {4032#(<= ~r3~0 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,953 INFO L290 TraceCheckUtils]: 48: Hoare triple {4032#(<= ~r3~0 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,954 INFO L290 TraceCheckUtils]: 49: Hoare triple {4032#(<= ~r3~0 0)} assume !(0 != ~mode1~0 % 256); {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,954 INFO L290 TraceCheckUtils]: 50: Hoare triple {4032#(<= ~r3~0 0)} assume ~r1~0 < 2; {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,955 INFO L290 TraceCheckUtils]: 51: Hoare triple {4032#(<= ~r3~0 0)} assume !(0 != ~ep12~0 % 256); {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,955 INFO L290 TraceCheckUtils]: 52: Hoare triple {4032#(<= ~r3~0 0)} assume !(0 != ~ep13~0 % 256); {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,955 INFO L290 TraceCheckUtils]: 53: Hoare triple {4032#(<= ~r3~0 0)} ~mode1~0 := 1; {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,956 INFO L290 TraceCheckUtils]: 54: Hoare triple {4032#(<= ~r3~0 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,956 INFO L290 TraceCheckUtils]: 55: Hoare triple {4032#(<= ~r3~0 0)} assume !(0 != ~mode2~0 % 256); {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,956 INFO L290 TraceCheckUtils]: 56: Hoare triple {4032#(<= ~r3~0 0)} assume ~r2~0 < 2; {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,957 INFO L290 TraceCheckUtils]: 57: Hoare triple {4032#(<= ~r3~0 0)} assume !(0 != ~ep21~0 % 256); {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,957 INFO L290 TraceCheckUtils]: 58: Hoare triple {4032#(<= ~r3~0 0)} assume !(0 != ~ep23~0 % 256); {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,958 INFO L290 TraceCheckUtils]: 59: Hoare triple {4032#(<= ~r3~0 0)} ~mode2~0 := 1; {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,958 INFO L290 TraceCheckUtils]: 60: Hoare triple {4032#(<= ~r3~0 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,958 INFO L290 TraceCheckUtils]: 61: Hoare triple {4032#(<= ~r3~0 0)} assume !(0 != ~mode3~0 % 256); {4032#(<= ~r3~0 0)} is VALID [2022-02-20 18:32:04,959 INFO L290 TraceCheckUtils]: 62: Hoare triple {4032#(<= ~r3~0 0)} assume !(~r3~0 < 2); {4031#false} is VALID [2022-02-20 18:32:04,959 INFO L290 TraceCheckUtils]: 63: Hoare triple {4031#false} ~mode3~0 := 1; {4031#false} is VALID [2022-02-20 18:32:04,959 INFO L290 TraceCheckUtils]: 64: Hoare triple {4031#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {4031#false} is VALID [2022-02-20 18:32:04,959 INFO L290 TraceCheckUtils]: 65: Hoare triple {4031#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {4031#false} is VALID [2022-02-20 18:32:04,960 INFO L290 TraceCheckUtils]: 66: Hoare triple {4031#false} check_#res#1 := check_~tmp~1#1; {4031#false} is VALID [2022-02-20 18:32:04,960 INFO L290 TraceCheckUtils]: 67: Hoare triple {4031#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {4031#false} is VALID [2022-02-20 18:32:04,960 INFO L290 TraceCheckUtils]: 68: Hoare triple {4031#false} assume 0 == assert_~arg#1 % 256; {4031#false} is VALID [2022-02-20 18:32:04,960 INFO L290 TraceCheckUtils]: 69: Hoare triple {4031#false} assume !false; {4031#false} is VALID [2022-02-20 18:32:04,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:32:04,961 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:04,961 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904476505] [2022-02-20 18:32:04,961 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904476505] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:04,961 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:04,961 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:32:04,961 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73815402] [2022-02-20 18:32:04,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:04,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-02-20 18:32:04,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:04,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:05,006 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:32:05,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:32:05,007 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:05,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:32:05,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:32:05,007 INFO L87 Difference]: Start difference. First operand 334 states and 531 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:05,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:05,303 INFO L93 Difference]: Finished difference Result 850 states and 1381 transitions. [2022-02-20 18:32:05,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:32:05,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-02-20 18:32:05,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:05,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:05,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 463 transitions. [2022-02-20 18:32:05,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:05,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 463 transitions. [2022-02-20 18:32:05,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 463 transitions. [2022-02-20 18:32:05,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 463 edges. 463 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:05,647 INFO L225 Difference]: With dead ends: 850 [2022-02-20 18:32:05,647 INFO L226 Difference]: Without dead ends: 576 [2022-02-20 18:32:05,648 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:32:05,649 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 103 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:32:05,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 387 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:32:05,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2022-02-20 18:32:05,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 574. [2022-02-20 18:32:05,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:05,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 576 states. Second operand has 574 states, 573 states have (on average 1.6108202443280977) internal successors, (923), 573 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:05,711 INFO L74 IsIncluded]: Start isIncluded. First operand 576 states. Second operand has 574 states, 573 states have (on average 1.6108202443280977) internal successors, (923), 573 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:05,712 INFO L87 Difference]: Start difference. First operand 576 states. Second operand has 574 states, 573 states have (on average 1.6108202443280977) internal successors, (923), 573 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:05,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:05,730 INFO L93 Difference]: Finished difference Result 576 states and 924 transitions. [2022-02-20 18:32:05,730 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 924 transitions. [2022-02-20 18:32:05,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:05,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:05,733 INFO L74 IsIncluded]: Start isIncluded. First operand has 574 states, 573 states have (on average 1.6108202443280977) internal successors, (923), 573 states have internal predecessors, (923), 0 states have call successors, (0), 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 576 states. [2022-02-20 18:32:05,734 INFO L87 Difference]: Start difference. First operand has 574 states, 573 states have (on average 1.6108202443280977) internal successors, (923), 573 states have internal predecessors, (923), 0 states have call successors, (0), 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 576 states. [2022-02-20 18:32:05,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:05,752 INFO L93 Difference]: Finished difference Result 576 states and 924 transitions. [2022-02-20 18:32:05,753 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 924 transitions. [2022-02-20 18:32:05,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:05,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:05,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:05,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:05,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 573 states have (on average 1.6108202443280977) internal successors, (923), 573 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:05,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 923 transitions. [2022-02-20 18:32:05,774 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 923 transitions. Word has length 70 [2022-02-20 18:32:05,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:05,774 INFO L470 AbstractCegarLoop]: Abstraction has 574 states and 923 transitions. [2022-02-20 18:32:05,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:05,775 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 923 transitions. [2022-02-20 18:32:05,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 18:32:05,775 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:05,776 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:32:05,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:32:05,776 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:05,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:05,777 INFO L85 PathProgramCache]: Analyzing trace with hash -367652834, now seen corresponding path program 1 times [2022-02-20 18:32:05,777 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:05,777 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291511336] [2022-02-20 18:32:05,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:05,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:05,853 INFO L290 TraceCheckUtils]: 0: Hoare triple {6773#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {6773#true} is VALID [2022-02-20 18:32:05,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {6773#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {6773#true} is VALID [2022-02-20 18:32:05,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {6773#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {6773#true} is VALID [2022-02-20 18:32:05,854 INFO L290 TraceCheckUtils]: 3: Hoare triple {6773#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {6773#true} is VALID [2022-02-20 18:32:05,854 INFO L290 TraceCheckUtils]: 4: Hoare triple {6773#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {6773#true} is VALID [2022-02-20 18:32:05,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {6773#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {6773#true} is VALID [2022-02-20 18:32:05,855 INFO L290 TraceCheckUtils]: 6: Hoare triple {6773#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {6773#true} is VALID [2022-02-20 18:32:05,855 INFO L290 TraceCheckUtils]: 7: Hoare triple {6773#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {6773#true} is VALID [2022-02-20 18:32:05,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {6773#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {6773#true} is VALID [2022-02-20 18:32:05,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {6773#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {6773#true} is VALID [2022-02-20 18:32:05,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {6773#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {6773#true} is VALID [2022-02-20 18:32:05,856 INFO L290 TraceCheckUtils]: 11: Hoare triple {6773#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {6773#true} is VALID [2022-02-20 18:32:05,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {6773#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {6773#true} is VALID [2022-02-20 18:32:05,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {6773#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {6773#true} is VALID [2022-02-20 18:32:05,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {6773#true} assume ~id1~0 != ~id2~0; {6773#true} is VALID [2022-02-20 18:32:05,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {6773#true} assume ~id1~0 != ~id3~0; {6773#true} is VALID [2022-02-20 18:32:05,856 INFO L290 TraceCheckUtils]: 16: Hoare triple {6773#true} assume ~id2~0 != ~id3~0; {6773#true} is VALID [2022-02-20 18:32:05,857 INFO L290 TraceCheckUtils]: 17: Hoare triple {6773#true} assume ~id1~0 >= 0; {6773#true} is VALID [2022-02-20 18:32:05,857 INFO L290 TraceCheckUtils]: 18: Hoare triple {6773#true} assume ~id2~0 >= 0; {6773#true} is VALID [2022-02-20 18:32:05,857 INFO L290 TraceCheckUtils]: 19: Hoare triple {6773#true} assume ~id3~0 >= 0; {6773#true} is VALID [2022-02-20 18:32:05,857 INFO L290 TraceCheckUtils]: 20: Hoare triple {6773#true} assume 0 == ~r1~0; {6773#true} is VALID [2022-02-20 18:32:05,857 INFO L290 TraceCheckUtils]: 21: Hoare triple {6773#true} assume 0 == ~r2~0; {6773#true} is VALID [2022-02-20 18:32:05,857 INFO L290 TraceCheckUtils]: 22: Hoare triple {6773#true} assume 0 == ~r3~0; {6773#true} is VALID [2022-02-20 18:32:05,858 INFO L290 TraceCheckUtils]: 23: Hoare triple {6773#true} assume 0 != init_~r122~0#1 % 256; {6773#true} is VALID [2022-02-20 18:32:05,858 INFO L290 TraceCheckUtils]: 24: Hoare triple {6773#true} assume 0 != init_~r132~0#1 % 256; {6773#true} is VALID [2022-02-20 18:32:05,858 INFO L290 TraceCheckUtils]: 25: Hoare triple {6773#true} assume 0 != init_~r212~0#1 % 256; {6773#true} is VALID [2022-02-20 18:32:05,858 INFO L290 TraceCheckUtils]: 26: Hoare triple {6773#true} assume 0 != init_~r232~0#1 % 256; {6773#true} is VALID [2022-02-20 18:32:05,858 INFO L290 TraceCheckUtils]: 27: Hoare triple {6773#true} assume 0 != init_~r312~0#1 % 256; {6773#true} is VALID [2022-02-20 18:32:05,858 INFO L290 TraceCheckUtils]: 28: Hoare triple {6773#true} assume 0 != init_~r322~0#1 % 256; {6773#true} is VALID [2022-02-20 18:32:05,859 INFO L290 TraceCheckUtils]: 29: Hoare triple {6773#true} assume ~max1~0 == ~id1~0; {6773#true} is VALID [2022-02-20 18:32:05,859 INFO L290 TraceCheckUtils]: 30: Hoare triple {6773#true} assume ~max2~0 == ~id2~0; {6773#true} is VALID [2022-02-20 18:32:05,859 INFO L290 TraceCheckUtils]: 31: Hoare triple {6773#true} assume ~max3~0 == ~id3~0; {6773#true} is VALID [2022-02-20 18:32:05,859 INFO L290 TraceCheckUtils]: 32: Hoare triple {6773#true} assume 0 == ~st1~0; {6775#(<= ~st1~0 0)} is VALID [2022-02-20 18:32:05,860 INFO L290 TraceCheckUtils]: 33: Hoare triple {6775#(<= ~st1~0 0)} assume 0 == ~st2~0; {6776#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:05,860 INFO L290 TraceCheckUtils]: 34: Hoare triple {6776#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:05,861 INFO L290 TraceCheckUtils]: 35: Hoare triple {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl1~0; {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:05,861 INFO L290 TraceCheckUtils]: 36: Hoare triple {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl2~0; {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:05,861 INFO L290 TraceCheckUtils]: 37: Hoare triple {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl3~0; {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:05,862 INFO L290 TraceCheckUtils]: 38: Hoare triple {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:05,862 INFO L290 TraceCheckUtils]: 39: Hoare triple {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:05,863 INFO L290 TraceCheckUtils]: 40: Hoare triple {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:05,863 INFO L290 TraceCheckUtils]: 41: Hoare triple {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~newmax1~0 % 256; {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:05,863 INFO L290 TraceCheckUtils]: 42: Hoare triple {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~newmax2~0 % 256; {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:05,864 INFO L290 TraceCheckUtils]: 43: Hoare triple {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:05,864 INFO L290 TraceCheckUtils]: 44: Hoare triple {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:05,864 INFO L290 TraceCheckUtils]: 45: Hoare triple {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:05,865 INFO L290 TraceCheckUtils]: 46: Hoare triple {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:05,865 INFO L290 TraceCheckUtils]: 47: Hoare triple {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:05,865 INFO L290 TraceCheckUtils]: 48: Hoare triple {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:05,866 INFO L290 TraceCheckUtils]: 49: Hoare triple {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:05,866 INFO L290 TraceCheckUtils]: 50: Hoare triple {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 2; {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:05,867 INFO L290 TraceCheckUtils]: 51: Hoare triple {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep12~0 % 256); {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:05,867 INFO L290 TraceCheckUtils]: 52: Hoare triple {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep13~0 % 256); {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:05,867 INFO L290 TraceCheckUtils]: 53: Hoare triple {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:05,868 INFO L290 TraceCheckUtils]: 54: Hoare triple {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:05,868 INFO L290 TraceCheckUtils]: 55: Hoare triple {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:05,868 INFO L290 TraceCheckUtils]: 56: Hoare triple {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r2~0 < 2; {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:05,869 INFO L290 TraceCheckUtils]: 57: Hoare triple {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep21~0 % 256); {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:05,869 INFO L290 TraceCheckUtils]: 58: Hoare triple {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep23~0 % 256); {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:05,869 INFO L290 TraceCheckUtils]: 59: Hoare triple {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:05,870 INFO L290 TraceCheckUtils]: 60: Hoare triple {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:05,870 INFO L290 TraceCheckUtils]: 61: Hoare triple {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:05,871 INFO L290 TraceCheckUtils]: 62: Hoare triple {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r3~0 < 2; {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:05,871 INFO L290 TraceCheckUtils]: 63: Hoare triple {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep31~0 % 256); {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:05,871 INFO L290 TraceCheckUtils]: 64: Hoare triple {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep32~0 % 256); {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:05,872 INFO L290 TraceCheckUtils]: 65: Hoare triple {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:05,872 INFO L290 TraceCheckUtils]: 66: Hoare triple {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:05,873 INFO L290 TraceCheckUtils]: 67: Hoare triple {6777#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {6774#false} is VALID [2022-02-20 18:32:05,873 INFO L290 TraceCheckUtils]: 68: Hoare triple {6774#false} check_#res#1 := check_~tmp~1#1; {6774#false} is VALID [2022-02-20 18:32:05,873 INFO L290 TraceCheckUtils]: 69: Hoare triple {6774#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {6774#false} is VALID [2022-02-20 18:32:05,873 INFO L290 TraceCheckUtils]: 70: Hoare triple {6774#false} assume 0 == assert_~arg#1 % 256; {6774#false} is VALID [2022-02-20 18:32:05,873 INFO L290 TraceCheckUtils]: 71: Hoare triple {6774#false} assume !false; {6774#false} is VALID [2022-02-20 18:32:05,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:32:05,874 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:05,874 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291511336] [2022-02-20 18:32:05,874 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291511336] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:05,874 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:05,875 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:32:05,875 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444387773] [2022-02-20 18:32:05,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:05,875 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-02-20 18:32:05,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:05,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:05,922 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:32:05,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:32:05,923 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:05,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:32:05,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:32:05,924 INFO L87 Difference]: Start difference. First operand 574 states and 923 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:07,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:07,422 INFO L93 Difference]: Finished difference Result 2450 states and 4045 transitions. [2022-02-20 18:32:07,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:32:07,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-02-20 18:32:07,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:07,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:07,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1009 transitions. [2022-02-20 18:32:07,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:07,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1009 transitions. [2022-02-20 18:32:07,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1009 transitions. [2022-02-20 18:32:08,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1009 edges. 1009 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:08,318 INFO L225 Difference]: With dead ends: 2450 [2022-02-20 18:32:08,318 INFO L226 Difference]: Without dead ends: 1936 [2022-02-20 18:32:08,320 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:32:08,321 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 778 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:32:08,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [778 Valid, 1306 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:32:08,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2022-02-20 18:32:08,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1023. [2022-02-20 18:32:08,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:08,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1936 states. Second operand has 1023 states, 1022 states have (on average 1.6252446183953033) internal successors, (1661), 1022 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:08,534 INFO L74 IsIncluded]: Start isIncluded. First operand 1936 states. Second operand has 1023 states, 1022 states have (on average 1.6252446183953033) internal successors, (1661), 1022 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:08,536 INFO L87 Difference]: Start difference. First operand 1936 states. Second operand has 1023 states, 1022 states have (on average 1.6252446183953033) internal successors, (1661), 1022 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:08,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:08,733 INFO L93 Difference]: Finished difference Result 1936 states and 3174 transitions. [2022-02-20 18:32:08,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 3174 transitions. [2022-02-20 18:32:08,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:08,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:08,746 INFO L74 IsIncluded]: Start isIncluded. First operand has 1023 states, 1022 states have (on average 1.6252446183953033) internal successors, (1661), 1022 states have internal predecessors, (1661), 0 states have call successors, (0), 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 1936 states. [2022-02-20 18:32:08,748 INFO L87 Difference]: Start difference. First operand has 1023 states, 1022 states have (on average 1.6252446183953033) internal successors, (1661), 1022 states have internal predecessors, (1661), 0 states have call successors, (0), 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 1936 states. [2022-02-20 18:32:08,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:08,930 INFO L93 Difference]: Finished difference Result 1936 states and 3174 transitions. [2022-02-20 18:32:08,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 3174 transitions. [2022-02-20 18:32:08,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:08,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:08,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:08,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:08,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1022 states have (on average 1.6252446183953033) internal successors, (1661), 1022 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:08,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1661 transitions. [2022-02-20 18:32:08,998 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1661 transitions. Word has length 72 [2022-02-20 18:32:08,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:08,999 INFO L470 AbstractCegarLoop]: Abstraction has 1023 states and 1661 transitions. [2022-02-20 18:32:08,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:08,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1661 transitions. [2022-02-20 18:32:09,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 18:32:09,001 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:09,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, 1, 1] [2022-02-20 18:32:09,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:32:09,002 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:09,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:09,003 INFO L85 PathProgramCache]: Analyzing trace with hash -435168554, now seen corresponding path program 1 times [2022-02-20 18:32:09,003 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:09,003 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547748498] [2022-02-20 18:32:09,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:09,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:09,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {14521#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {14521#true} is VALID [2022-02-20 18:32:09,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {14521#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {14521#true} is VALID [2022-02-20 18:32:09,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {14521#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {14521#true} is VALID [2022-02-20 18:32:09,108 INFO L290 TraceCheckUtils]: 3: Hoare triple {14521#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {14521#true} is VALID [2022-02-20 18:32:09,108 INFO L290 TraceCheckUtils]: 4: Hoare triple {14521#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {14521#true} is VALID [2022-02-20 18:32:09,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {14521#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {14521#true} is VALID [2022-02-20 18:32:09,108 INFO L290 TraceCheckUtils]: 6: Hoare triple {14521#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {14521#true} is VALID [2022-02-20 18:32:09,109 INFO L290 TraceCheckUtils]: 7: Hoare triple {14521#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {14521#true} is VALID [2022-02-20 18:32:09,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {14521#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {14521#true} is VALID [2022-02-20 18:32:09,109 INFO L290 TraceCheckUtils]: 9: Hoare triple {14521#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {14521#true} is VALID [2022-02-20 18:32:09,109 INFO L290 TraceCheckUtils]: 10: Hoare triple {14521#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {14521#true} is VALID [2022-02-20 18:32:09,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {14521#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {14521#true} is VALID [2022-02-20 18:32:09,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {14521#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {14521#true} is VALID [2022-02-20 18:32:09,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {14521#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {14521#true} is VALID [2022-02-20 18:32:09,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {14521#true} assume ~id1~0 != ~id2~0; {14521#true} is VALID [2022-02-20 18:32:09,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {14521#true} assume ~id1~0 != ~id3~0; {14521#true} is VALID [2022-02-20 18:32:09,110 INFO L290 TraceCheckUtils]: 16: Hoare triple {14521#true} assume ~id2~0 != ~id3~0; {14521#true} is VALID [2022-02-20 18:32:09,110 INFO L290 TraceCheckUtils]: 17: Hoare triple {14521#true} assume ~id1~0 >= 0; {14521#true} is VALID [2022-02-20 18:32:09,110 INFO L290 TraceCheckUtils]: 18: Hoare triple {14521#true} assume ~id2~0 >= 0; {14521#true} is VALID [2022-02-20 18:32:09,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {14521#true} assume ~id3~0 >= 0; {14521#true} is VALID [2022-02-20 18:32:09,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {14521#true} assume 0 == ~r1~0; {14521#true} is VALID [2022-02-20 18:32:09,111 INFO L290 TraceCheckUtils]: 21: Hoare triple {14521#true} assume 0 == ~r2~0; {14521#true} is VALID [2022-02-20 18:32:09,112 INFO L290 TraceCheckUtils]: 22: Hoare triple {14521#true} assume 0 == ~r3~0; {14521#true} is VALID [2022-02-20 18:32:09,113 INFO L290 TraceCheckUtils]: 23: Hoare triple {14521#true} assume 0 != init_~r122~0#1 % 256; {14521#true} is VALID [2022-02-20 18:32:09,115 INFO L290 TraceCheckUtils]: 24: Hoare triple {14521#true} assume 0 != init_~r132~0#1 % 256; {14521#true} is VALID [2022-02-20 18:32:09,116 INFO L290 TraceCheckUtils]: 25: Hoare triple {14521#true} assume 0 != init_~r212~0#1 % 256; {14521#true} is VALID [2022-02-20 18:32:09,116 INFO L290 TraceCheckUtils]: 26: Hoare triple {14521#true} assume 0 != init_~r232~0#1 % 256; {14521#true} is VALID [2022-02-20 18:32:09,116 INFO L290 TraceCheckUtils]: 27: Hoare triple {14521#true} assume 0 != init_~r312~0#1 % 256; {14521#true} is VALID [2022-02-20 18:32:09,117 INFO L290 TraceCheckUtils]: 28: Hoare triple {14521#true} assume 0 != init_~r322~0#1 % 256; {14521#true} is VALID [2022-02-20 18:32:09,117 INFO L290 TraceCheckUtils]: 29: Hoare triple {14521#true} assume ~max1~0 == ~id1~0; {14521#true} is VALID [2022-02-20 18:32:09,118 INFO L290 TraceCheckUtils]: 30: Hoare triple {14521#true} assume ~max2~0 == ~id2~0; {14521#true} is VALID [2022-02-20 18:32:09,118 INFO L290 TraceCheckUtils]: 31: Hoare triple {14521#true} assume ~max3~0 == ~id3~0; {14521#true} is VALID [2022-02-20 18:32:09,120 INFO L290 TraceCheckUtils]: 32: Hoare triple {14521#true} assume 0 == ~st1~0; {14523#(<= ~st1~0 0)} is VALID [2022-02-20 18:32:09,123 INFO L290 TraceCheckUtils]: 33: Hoare triple {14523#(<= ~st1~0 0)} assume 0 == ~st2~0; {14523#(<= ~st1~0 0)} is VALID [2022-02-20 18:32:09,123 INFO L290 TraceCheckUtils]: 34: Hoare triple {14523#(<= ~st1~0 0)} assume 0 == ~st3~0; {14523#(<= ~st1~0 0)} is VALID [2022-02-20 18:32:09,124 INFO L290 TraceCheckUtils]: 35: Hoare triple {14523#(<= ~st1~0 0)} assume 0 == ~nl1~0; {14524#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,124 INFO L290 TraceCheckUtils]: 36: Hoare triple {14524#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl2~0; {14524#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,125 INFO L290 TraceCheckUtils]: 37: Hoare triple {14524#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl3~0; {14524#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,125 INFO L290 TraceCheckUtils]: 38: Hoare triple {14524#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {14524#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,125 INFO L290 TraceCheckUtils]: 39: Hoare triple {14524#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {14524#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,126 INFO L290 TraceCheckUtils]: 40: Hoare triple {14524#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {14524#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,126 INFO L290 TraceCheckUtils]: 41: Hoare triple {14524#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 != ~newmax1~0 % 256; {14524#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,126 INFO L290 TraceCheckUtils]: 42: Hoare triple {14524#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 != ~newmax2~0 % 256; {14524#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,127 INFO L290 TraceCheckUtils]: 43: Hoare triple {14524#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {14524#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,127 INFO L290 TraceCheckUtils]: 44: Hoare triple {14524#(<= (+ ~nl1~0 ~st1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {14524#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,127 INFO L290 TraceCheckUtils]: 45: Hoare triple {14524#(<= (+ ~nl1~0 ~st1~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {14524#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,128 INFO L290 TraceCheckUtils]: 46: Hoare triple {14524#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {14524#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,128 INFO L290 TraceCheckUtils]: 47: Hoare triple {14524#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {14524#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,128 INFO L290 TraceCheckUtils]: 48: Hoare triple {14524#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {14524#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,129 INFO L290 TraceCheckUtils]: 49: Hoare triple {14524#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {14524#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,129 INFO L290 TraceCheckUtils]: 50: Hoare triple {14524#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r1~0 < 2; {14524#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,129 INFO L290 TraceCheckUtils]: 51: Hoare triple {14524#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep12~0 % 256); {14524#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,130 INFO L290 TraceCheckUtils]: 52: Hoare triple {14524#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep13~0 % 256); {14524#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,130 INFO L290 TraceCheckUtils]: 53: Hoare triple {14524#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode1~0 := 1; {14524#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,130 INFO L290 TraceCheckUtils]: 54: Hoare triple {14524#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {14524#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,131 INFO L290 TraceCheckUtils]: 55: Hoare triple {14524#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {14524#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,131 INFO L290 TraceCheckUtils]: 56: Hoare triple {14524#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r2~0 < 2; {14524#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,131 INFO L290 TraceCheckUtils]: 57: Hoare triple {14524#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep21~0 % 256); {14524#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,132 INFO L290 TraceCheckUtils]: 58: Hoare triple {14524#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep23~0 % 256); {14524#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,133 INFO L290 TraceCheckUtils]: 59: Hoare triple {14524#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode2~0 := 1; {14524#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,133 INFO L290 TraceCheckUtils]: 60: Hoare triple {14524#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {14524#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,134 INFO L290 TraceCheckUtils]: 61: Hoare triple {14524#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {14524#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,134 INFO L290 TraceCheckUtils]: 62: Hoare triple {14524#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r3~0 < 2; {14524#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,134 INFO L290 TraceCheckUtils]: 63: Hoare triple {14524#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep31~0 % 256); {14524#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,135 INFO L290 TraceCheckUtils]: 64: Hoare triple {14524#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep32~0 % 256); {14524#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,135 INFO L290 TraceCheckUtils]: 65: Hoare triple {14524#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode3~0 := 1; {14524#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,135 INFO L290 TraceCheckUtils]: 66: Hoare triple {14524#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {14524#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,136 INFO L290 TraceCheckUtils]: 67: Hoare triple {14524#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {14524#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,136 INFO L290 TraceCheckUtils]: 68: Hoare triple {14524#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(~st1~0 + ~nl1~0 <= 1);check_~tmp~1#1 := 0; {14522#false} is VALID [2022-02-20 18:32:09,136 INFO L290 TraceCheckUtils]: 69: Hoare triple {14522#false} check_#res#1 := check_~tmp~1#1; {14522#false} is VALID [2022-02-20 18:32:09,136 INFO L290 TraceCheckUtils]: 70: Hoare triple {14522#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {14522#false} is VALID [2022-02-20 18:32:09,137 INFO L290 TraceCheckUtils]: 71: Hoare triple {14522#false} assume 0 == assert_~arg#1 % 256; {14522#false} is VALID [2022-02-20 18:32:09,137 INFO L290 TraceCheckUtils]: 72: Hoare triple {14522#false} assume !false; {14522#false} is VALID [2022-02-20 18:32:09,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:32:09,139 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:09,139 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547748498] [2022-02-20 18:32:09,139 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547748498] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:09,139 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:09,139 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:32:09,140 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779474587] [2022-02-20 18:32:09,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:09,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2022-02-20 18:32:09,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:09,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:09,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:09,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:32:09,188 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:09,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:32:09,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:32:09,189 INFO L87 Difference]: Start difference. First operand 1023 states and 1661 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:10,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:10,505 INFO L93 Difference]: Finished difference Result 2972 states and 4898 transitions. [2022-02-20 18:32:10,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:32:10,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2022-02-20 18:32:10,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:10,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:10,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 610 transitions. [2022-02-20 18:32:10,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:10,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 610 transitions. [2022-02-20 18:32:10,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 610 transitions. [2022-02-20 18:32:10,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 610 edges. 610 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:11,033 INFO L225 Difference]: With dead ends: 2972 [2022-02-20 18:32:11,034 INFO L226 Difference]: Without dead ends: 2009 [2022-02-20 18:32:11,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:32:11,035 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 385 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:32:11,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [385 Valid, 689 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:32:11,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2009 states. [2022-02-20 18:32:11,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2009 to 1507. [2022-02-20 18:32:11,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:11,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2009 states. Second operand has 1507 states, 1506 states have (on average 1.6328021248339974) internal successors, (2459), 1506 states have internal predecessors, (2459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:11,386 INFO L74 IsIncluded]: Start isIncluded. First operand 2009 states. Second operand has 1507 states, 1506 states have (on average 1.6328021248339974) internal successors, (2459), 1506 states have internal predecessors, (2459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:11,388 INFO L87 Difference]: Start difference. First operand 2009 states. Second operand has 1507 states, 1506 states have (on average 1.6328021248339974) internal successors, (2459), 1506 states have internal predecessors, (2459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:11,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:11,574 INFO L93 Difference]: Finished difference Result 2009 states and 3301 transitions. [2022-02-20 18:32:11,574 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 3301 transitions. [2022-02-20 18:32:11,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:11,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:11,580 INFO L74 IsIncluded]: Start isIncluded. First operand has 1507 states, 1506 states have (on average 1.6328021248339974) internal successors, (2459), 1506 states have internal predecessors, (2459), 0 states have call successors, (0), 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 2009 states. [2022-02-20 18:32:11,582 INFO L87 Difference]: Start difference. First operand has 1507 states, 1506 states have (on average 1.6328021248339974) internal successors, (2459), 1506 states have internal predecessors, (2459), 0 states have call successors, (0), 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 2009 states. [2022-02-20 18:32:11,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:11,720 INFO L93 Difference]: Finished difference Result 2009 states and 3301 transitions. [2022-02-20 18:32:11,720 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 3301 transitions. [2022-02-20 18:32:11,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:11,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:11,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:11,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:11,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1507 states, 1506 states have (on average 1.6328021248339974) internal successors, (2459), 1506 states have internal predecessors, (2459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:11,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 2459 transitions. [2022-02-20 18:32:11,806 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 2459 transitions. Word has length 73 [2022-02-20 18:32:11,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:11,806 INFO L470 AbstractCegarLoop]: Abstraction has 1507 states and 2459 transitions. [2022-02-20 18:32:11,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:11,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 2459 transitions. [2022-02-20 18:32:11,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 18:32:11,808 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:11,808 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:32:11,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:32:11,808 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:11,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:11,809 INFO L85 PathProgramCache]: Analyzing trace with hash 152415701, now seen corresponding path program 1 times [2022-02-20 18:32:11,809 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:11,809 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097963549] [2022-02-20 18:32:11,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:11,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:11,861 INFO L290 TraceCheckUtils]: 0: Hoare triple {23530#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {23530#true} is VALID [2022-02-20 18:32:11,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {23530#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {23530#true} is VALID [2022-02-20 18:32:11,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {23530#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {23530#true} is VALID [2022-02-20 18:32:11,862 INFO L290 TraceCheckUtils]: 3: Hoare triple {23530#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {23530#true} is VALID [2022-02-20 18:32:11,862 INFO L290 TraceCheckUtils]: 4: Hoare triple {23530#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {23530#true} is VALID [2022-02-20 18:32:11,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {23530#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {23530#true} is VALID [2022-02-20 18:32:11,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {23530#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {23530#true} is VALID [2022-02-20 18:32:11,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {23530#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {23530#true} is VALID [2022-02-20 18:32:11,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {23530#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {23530#true} is VALID [2022-02-20 18:32:11,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {23530#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {23530#true} is VALID [2022-02-20 18:32:11,863 INFO L290 TraceCheckUtils]: 10: Hoare triple {23530#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {23530#true} is VALID [2022-02-20 18:32:11,863 INFO L290 TraceCheckUtils]: 11: Hoare triple {23530#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {23530#true} is VALID [2022-02-20 18:32:11,863 INFO L290 TraceCheckUtils]: 12: Hoare triple {23530#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {23530#true} is VALID [2022-02-20 18:32:11,863 INFO L290 TraceCheckUtils]: 13: Hoare triple {23530#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {23530#true} is VALID [2022-02-20 18:32:11,863 INFO L290 TraceCheckUtils]: 14: Hoare triple {23530#true} assume ~id1~0 != ~id2~0; {23530#true} is VALID [2022-02-20 18:32:11,864 INFO L290 TraceCheckUtils]: 15: Hoare triple {23530#true} assume ~id1~0 != ~id3~0; {23530#true} is VALID [2022-02-20 18:32:11,864 INFO L290 TraceCheckUtils]: 16: Hoare triple {23530#true} assume ~id2~0 != ~id3~0; {23530#true} is VALID [2022-02-20 18:32:11,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {23530#true} assume ~id1~0 >= 0; {23530#true} is VALID [2022-02-20 18:32:11,864 INFO L290 TraceCheckUtils]: 18: Hoare triple {23530#true} assume ~id2~0 >= 0; {23530#true} is VALID [2022-02-20 18:32:11,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {23530#true} assume ~id3~0 >= 0; {23530#true} is VALID [2022-02-20 18:32:11,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {23530#true} assume 0 == ~r1~0; {23530#true} is VALID [2022-02-20 18:32:11,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {23530#true} assume 0 == ~r2~0; {23530#true} is VALID [2022-02-20 18:32:11,865 INFO L290 TraceCheckUtils]: 22: Hoare triple {23530#true} assume 0 == ~r3~0; {23530#true} is VALID [2022-02-20 18:32:11,865 INFO L290 TraceCheckUtils]: 23: Hoare triple {23530#true} assume 0 != init_~r122~0#1 % 256; {23530#true} is VALID [2022-02-20 18:32:11,865 INFO L290 TraceCheckUtils]: 24: Hoare triple {23530#true} assume 0 != init_~r132~0#1 % 256; {23530#true} is VALID [2022-02-20 18:32:11,865 INFO L290 TraceCheckUtils]: 25: Hoare triple {23530#true} assume 0 != init_~r212~0#1 % 256; {23530#true} is VALID [2022-02-20 18:32:11,865 INFO L290 TraceCheckUtils]: 26: Hoare triple {23530#true} assume 0 != init_~r232~0#1 % 256; {23530#true} is VALID [2022-02-20 18:32:11,865 INFO L290 TraceCheckUtils]: 27: Hoare triple {23530#true} assume 0 != init_~r312~0#1 % 256; {23530#true} is VALID [2022-02-20 18:32:11,866 INFO L290 TraceCheckUtils]: 28: Hoare triple {23530#true} assume 0 != init_~r322~0#1 % 256; {23530#true} is VALID [2022-02-20 18:32:11,866 INFO L290 TraceCheckUtils]: 29: Hoare triple {23530#true} assume ~max1~0 == ~id1~0; {23530#true} is VALID [2022-02-20 18:32:11,866 INFO L290 TraceCheckUtils]: 30: Hoare triple {23530#true} assume ~max2~0 == ~id2~0; {23530#true} is VALID [2022-02-20 18:32:11,866 INFO L290 TraceCheckUtils]: 31: Hoare triple {23530#true} assume ~max3~0 == ~id3~0; {23530#true} is VALID [2022-02-20 18:32:11,866 INFO L290 TraceCheckUtils]: 32: Hoare triple {23530#true} assume 0 == ~st1~0; {23530#true} is VALID [2022-02-20 18:32:11,866 INFO L290 TraceCheckUtils]: 33: Hoare triple {23530#true} assume 0 == ~st2~0; {23530#true} is VALID [2022-02-20 18:32:11,867 INFO L290 TraceCheckUtils]: 34: Hoare triple {23530#true} assume 0 == ~st3~0; {23530#true} is VALID [2022-02-20 18:32:11,867 INFO L290 TraceCheckUtils]: 35: Hoare triple {23530#true} assume 0 == ~nl1~0; {23530#true} is VALID [2022-02-20 18:32:11,867 INFO L290 TraceCheckUtils]: 36: Hoare triple {23530#true} assume 0 == ~nl2~0; {23530#true} is VALID [2022-02-20 18:32:11,867 INFO L290 TraceCheckUtils]: 37: Hoare triple {23530#true} assume 0 == ~nl3~0; {23530#true} is VALID [2022-02-20 18:32:11,867 INFO L290 TraceCheckUtils]: 38: Hoare triple {23530#true} assume 0 == ~mode1~0 % 256; {23530#true} is VALID [2022-02-20 18:32:11,868 INFO L290 TraceCheckUtils]: 39: Hoare triple {23530#true} assume 0 == ~mode2~0 % 256; {23532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:11,868 INFO L290 TraceCheckUtils]: 40: Hoare triple {23532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {23532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:11,869 INFO L290 TraceCheckUtils]: 41: Hoare triple {23532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~newmax1~0 % 256; {23532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:11,869 INFO L290 TraceCheckUtils]: 42: Hoare triple {23532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~newmax2~0 % 256; {23532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:11,870 INFO L290 TraceCheckUtils]: 43: Hoare triple {23532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {23532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:11,870 INFO L290 TraceCheckUtils]: 44: Hoare triple {23532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp___5~0#1; {23532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:11,871 INFO L290 TraceCheckUtils]: 45: Hoare triple {23532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {23532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:11,871 INFO L290 TraceCheckUtils]: 46: Hoare triple {23532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {23532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:11,872 INFO L290 TraceCheckUtils]: 47: Hoare triple {23532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {23532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:11,872 INFO L290 TraceCheckUtils]: 48: Hoare triple {23532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {23532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:11,872 INFO L290 TraceCheckUtils]: 49: Hoare triple {23532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {23532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:11,873 INFO L290 TraceCheckUtils]: 50: Hoare triple {23532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~r1~0 < 2; {23532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:11,873 INFO L290 TraceCheckUtils]: 51: Hoare triple {23532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~ep12~0 % 256); {23532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:11,874 INFO L290 TraceCheckUtils]: 52: Hoare triple {23532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~ep13~0 % 256); {23532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:11,874 INFO L290 TraceCheckUtils]: 53: Hoare triple {23532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {23532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:11,875 INFO L290 TraceCheckUtils]: 54: Hoare triple {23532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {23532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:11,875 INFO L290 TraceCheckUtils]: 55: Hoare triple {23532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256;~r2~0 := (if (1 + ~r2~0) % 256 <= 127 then (1 + ~r2~0) % 256 else (1 + ~r2~0) % 256 - 256); {23531#false} is VALID [2022-02-20 18:32:11,875 INFO L290 TraceCheckUtils]: 56: Hoare triple {23531#false} assume !(0 != ~ep12~0 % 256); {23531#false} is VALID [2022-02-20 18:32:11,876 INFO L290 TraceCheckUtils]: 57: Hoare triple {23531#false} assume !(0 != ~ep32~0 % 256); {23531#false} is VALID [2022-02-20 18:32:11,876 INFO L290 TraceCheckUtils]: 58: Hoare triple {23531#false} ~newmax2~0 := node2_~newmax~1#1; {23531#false} is VALID [2022-02-20 18:32:11,876 INFO L290 TraceCheckUtils]: 59: Hoare triple {23531#false} assume 2 == ~r2~0; {23531#false} is VALID [2022-02-20 18:32:11,876 INFO L290 TraceCheckUtils]: 60: Hoare triple {23531#false} assume ~max2~0 == ~id2~0;~st2~0 := 1; {23531#false} is VALID [2022-02-20 18:32:11,876 INFO L290 TraceCheckUtils]: 61: Hoare triple {23531#false} ~mode2~0 := 0; {23531#false} is VALID [2022-02-20 18:32:11,876 INFO L290 TraceCheckUtils]: 62: Hoare triple {23531#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {23531#false} is VALID [2022-02-20 18:32:11,877 INFO L290 TraceCheckUtils]: 63: Hoare triple {23531#false} assume !(0 != ~mode3~0 % 256); {23531#false} is VALID [2022-02-20 18:32:11,877 INFO L290 TraceCheckUtils]: 64: Hoare triple {23531#false} assume ~r3~0 < 2; {23531#false} is VALID [2022-02-20 18:32:11,877 INFO L290 TraceCheckUtils]: 65: Hoare triple {23531#false} assume !(0 != ~ep31~0 % 256); {23531#false} is VALID [2022-02-20 18:32:11,877 INFO L290 TraceCheckUtils]: 66: Hoare triple {23531#false} assume !(0 != ~ep32~0 % 256); {23531#false} is VALID [2022-02-20 18:32:11,877 INFO L290 TraceCheckUtils]: 67: Hoare triple {23531#false} ~mode3~0 := 1; {23531#false} is VALID [2022-02-20 18:32:11,877 INFO L290 TraceCheckUtils]: 68: Hoare triple {23531#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {23531#false} is VALID [2022-02-20 18:32:11,877 INFO L290 TraceCheckUtils]: 69: Hoare triple {23531#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {23531#false} is VALID [2022-02-20 18:32:11,878 INFO L290 TraceCheckUtils]: 70: Hoare triple {23531#false} check_#res#1 := check_~tmp~1#1; {23531#false} is VALID [2022-02-20 18:32:11,878 INFO L290 TraceCheckUtils]: 71: Hoare triple {23531#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {23531#false} is VALID [2022-02-20 18:32:11,878 INFO L290 TraceCheckUtils]: 72: Hoare triple {23531#false} assume 0 == assert_~arg#1 % 256; {23531#false} is VALID [2022-02-20 18:32:11,878 INFO L290 TraceCheckUtils]: 73: Hoare triple {23531#false} assume !false; {23531#false} is VALID [2022-02-20 18:32:11,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:32:11,879 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:11,879 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097963549] [2022-02-20 18:32:11,879 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097963549] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:11,879 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:11,879 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:32:11,879 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850748756] [2022-02-20 18:32:11,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:11,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-02-20 18:32:11,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:11,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:11,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:11,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:32:11,932 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:11,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:32:11,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:32:11,934 INFO L87 Difference]: Start difference. First operand 1507 states and 2459 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:13,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:13,012 INFO L93 Difference]: Finished difference Result 2973 states and 4868 transitions. [2022-02-20 18:32:13,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:32:13,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-02-20 18:32:13,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:13,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:13,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2022-02-20 18:32:13,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:13,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2022-02-20 18:32:13,016 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 446 transitions. [2022-02-20 18:32:13,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 446 edges. 446 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:13,432 INFO L225 Difference]: With dead ends: 2973 [2022-02-20 18:32:13,432 INFO L226 Difference]: Without dead ends: 2147 [2022-02-20 18:32:13,433 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:32:13,435 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 110 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:32:13,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 456 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:32:13,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2147 states. [2022-02-20 18:32:14,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2147 to 2145. [2022-02-20 18:32:14,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:14,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2147 states. Second operand has 2145 states, 2144 states have (on average 1.625) internal successors, (3484), 2144 states have internal predecessors, (3484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:14,008 INFO L74 IsIncluded]: Start isIncluded. First operand 2147 states. Second operand has 2145 states, 2144 states have (on average 1.625) internal successors, (3484), 2144 states have internal predecessors, (3484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:14,010 INFO L87 Difference]: Start difference. First operand 2147 states. Second operand has 2145 states, 2144 states have (on average 1.625) internal successors, (3484), 2144 states have internal predecessors, (3484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:14,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:14,230 INFO L93 Difference]: Finished difference Result 2147 states and 3485 transitions. [2022-02-20 18:32:14,230 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 3485 transitions. [2022-02-20 18:32:14,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:14,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:14,236 INFO L74 IsIncluded]: Start isIncluded. First operand has 2145 states, 2144 states have (on average 1.625) internal successors, (3484), 2144 states have internal predecessors, (3484), 0 states have call successors, (0), 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 2147 states. [2022-02-20 18:32:14,238 INFO L87 Difference]: Start difference. First operand has 2145 states, 2144 states have (on average 1.625) internal successors, (3484), 2144 states have internal predecessors, (3484), 0 states have call successors, (0), 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 2147 states. [2022-02-20 18:32:14,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:14,403 INFO L93 Difference]: Finished difference Result 2147 states and 3485 transitions. [2022-02-20 18:32:14,404 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 3485 transitions. [2022-02-20 18:32:14,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:14,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:14,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:14,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:14,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2145 states, 2144 states have (on average 1.625) internal successors, (3484), 2144 states have internal predecessors, (3484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:14,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 3484 transitions. [2022-02-20 18:32:14,574 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 3484 transitions. Word has length 74 [2022-02-20 18:32:14,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:14,575 INFO L470 AbstractCegarLoop]: Abstraction has 2145 states and 3484 transitions. [2022-02-20 18:32:14,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:14,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 3484 transitions. [2022-02-20 18:32:14,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 18:32:14,576 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:14,576 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:32:14,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:32:14,576 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:14,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:14,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1935815765, now seen corresponding path program 1 times [2022-02-20 18:32:14,577 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:14,577 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968437812] [2022-02-20 18:32:14,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:14,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:14,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {33563#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {33563#true} is VALID [2022-02-20 18:32:14,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {33563#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {33563#true} is VALID [2022-02-20 18:32:14,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {33563#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {33563#true} is VALID [2022-02-20 18:32:14,636 INFO L290 TraceCheckUtils]: 3: Hoare triple {33563#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {33563#true} is VALID [2022-02-20 18:32:14,636 INFO L290 TraceCheckUtils]: 4: Hoare triple {33563#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {33563#true} is VALID [2022-02-20 18:32:14,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {33563#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {33563#true} is VALID [2022-02-20 18:32:14,637 INFO L290 TraceCheckUtils]: 6: Hoare triple {33563#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {33563#true} is VALID [2022-02-20 18:32:14,637 INFO L290 TraceCheckUtils]: 7: Hoare triple {33563#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {33563#true} is VALID [2022-02-20 18:32:14,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {33563#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {33563#true} is VALID [2022-02-20 18:32:14,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {33563#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {33563#true} is VALID [2022-02-20 18:32:14,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {33563#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {33563#true} is VALID [2022-02-20 18:32:14,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {33563#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {33563#true} is VALID [2022-02-20 18:32:14,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {33563#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {33563#true} is VALID [2022-02-20 18:32:14,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {33563#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {33563#true} is VALID [2022-02-20 18:32:14,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {33563#true} assume ~id1~0 != ~id2~0; {33563#true} is VALID [2022-02-20 18:32:14,638 INFO L290 TraceCheckUtils]: 15: Hoare triple {33563#true} assume ~id1~0 != ~id3~0; {33563#true} is VALID [2022-02-20 18:32:14,638 INFO L290 TraceCheckUtils]: 16: Hoare triple {33563#true} assume ~id2~0 != ~id3~0; {33563#true} is VALID [2022-02-20 18:32:14,638 INFO L290 TraceCheckUtils]: 17: Hoare triple {33563#true} assume ~id1~0 >= 0; {33563#true} is VALID [2022-02-20 18:32:14,639 INFO L290 TraceCheckUtils]: 18: Hoare triple {33563#true} assume ~id2~0 >= 0; {33563#true} is VALID [2022-02-20 18:32:14,639 INFO L290 TraceCheckUtils]: 19: Hoare triple {33563#true} assume ~id3~0 >= 0; {33563#true} is VALID [2022-02-20 18:32:14,639 INFO L290 TraceCheckUtils]: 20: Hoare triple {33563#true} assume 0 == ~r1~0; {33563#true} is VALID [2022-02-20 18:32:14,639 INFO L290 TraceCheckUtils]: 21: Hoare triple {33563#true} assume 0 == ~r2~0; {33563#true} is VALID [2022-02-20 18:32:14,639 INFO L290 TraceCheckUtils]: 22: Hoare triple {33563#true} assume 0 == ~r3~0; {33563#true} is VALID [2022-02-20 18:32:14,639 INFO L290 TraceCheckUtils]: 23: Hoare triple {33563#true} assume 0 != init_~r122~0#1 % 256; {33563#true} is VALID [2022-02-20 18:32:14,640 INFO L290 TraceCheckUtils]: 24: Hoare triple {33563#true} assume 0 != init_~r132~0#1 % 256; {33563#true} is VALID [2022-02-20 18:32:14,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {33563#true} assume 0 != init_~r212~0#1 % 256; {33563#true} is VALID [2022-02-20 18:32:14,640 INFO L290 TraceCheckUtils]: 26: Hoare triple {33563#true} assume 0 != init_~r232~0#1 % 256; {33563#true} is VALID [2022-02-20 18:32:14,640 INFO L290 TraceCheckUtils]: 27: Hoare triple {33563#true} assume 0 != init_~r312~0#1 % 256; {33563#true} is VALID [2022-02-20 18:32:14,640 INFO L290 TraceCheckUtils]: 28: Hoare triple {33563#true} assume 0 != init_~r322~0#1 % 256; {33563#true} is VALID [2022-02-20 18:32:14,640 INFO L290 TraceCheckUtils]: 29: Hoare triple {33563#true} assume ~max1~0 == ~id1~0; {33563#true} is VALID [2022-02-20 18:32:14,640 INFO L290 TraceCheckUtils]: 30: Hoare triple {33563#true} assume ~max2~0 == ~id2~0; {33563#true} is VALID [2022-02-20 18:32:14,641 INFO L290 TraceCheckUtils]: 31: Hoare triple {33563#true} assume ~max3~0 == ~id3~0; {33563#true} is VALID [2022-02-20 18:32:14,641 INFO L290 TraceCheckUtils]: 32: Hoare triple {33563#true} assume 0 == ~st1~0; {33563#true} is VALID [2022-02-20 18:32:14,641 INFO L290 TraceCheckUtils]: 33: Hoare triple {33563#true} assume 0 == ~st2~0; {33565#(<= ~st2~0 0)} is VALID [2022-02-20 18:32:14,642 INFO L290 TraceCheckUtils]: 34: Hoare triple {33565#(<= ~st2~0 0)} assume 0 == ~st3~0; {33565#(<= ~st2~0 0)} is VALID [2022-02-20 18:32:14,642 INFO L290 TraceCheckUtils]: 35: Hoare triple {33565#(<= ~st2~0 0)} assume 0 == ~nl1~0; {33565#(<= ~st2~0 0)} is VALID [2022-02-20 18:32:14,642 INFO L290 TraceCheckUtils]: 36: Hoare triple {33565#(<= ~st2~0 0)} assume 0 == ~nl2~0; {33566#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:14,643 INFO L290 TraceCheckUtils]: 37: Hoare triple {33566#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~nl3~0; {33566#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:14,643 INFO L290 TraceCheckUtils]: 38: Hoare triple {33566#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode1~0 % 256; {33566#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:14,644 INFO L290 TraceCheckUtils]: 39: Hoare triple {33566#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode2~0 % 256; {33566#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:14,645 INFO L290 TraceCheckUtils]: 40: Hoare triple {33566#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {33566#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:14,645 INFO L290 TraceCheckUtils]: 41: Hoare triple {33566#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 != ~newmax1~0 % 256; {33566#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:14,646 INFO L290 TraceCheckUtils]: 42: Hoare triple {33566#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 != ~newmax2~0 % 256; {33566#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:14,646 INFO L290 TraceCheckUtils]: 43: Hoare triple {33566#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {33566#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:14,646 INFO L290 TraceCheckUtils]: 44: Hoare triple {33566#(<= (+ ~nl2~0 ~st2~0) 0)} init_#res#1 := init_~tmp___5~0#1; {33566#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:14,647 INFO L290 TraceCheckUtils]: 45: Hoare triple {33566#(<= (+ ~nl2~0 ~st2~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {33566#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:14,647 INFO L290 TraceCheckUtils]: 46: Hoare triple {33566#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {33566#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:14,648 INFO L290 TraceCheckUtils]: 47: Hoare triple {33566#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {33566#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:14,648 INFO L290 TraceCheckUtils]: 48: Hoare triple {33566#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {33566#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:14,649 INFO L290 TraceCheckUtils]: 49: Hoare triple {33566#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode1~0 % 256); {33566#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:14,649 INFO L290 TraceCheckUtils]: 50: Hoare triple {33566#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r1~0 < 2; {33566#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:14,649 INFO L290 TraceCheckUtils]: 51: Hoare triple {33566#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep12~0 % 256); {33566#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:14,650 INFO L290 TraceCheckUtils]: 52: Hoare triple {33566#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep13~0 % 256); {33566#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:14,650 INFO L290 TraceCheckUtils]: 53: Hoare triple {33566#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode1~0 := 1; {33566#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:14,651 INFO L290 TraceCheckUtils]: 54: Hoare triple {33566#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {33566#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:14,651 INFO L290 TraceCheckUtils]: 55: Hoare triple {33566#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode2~0 % 256); {33566#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:14,653 INFO L290 TraceCheckUtils]: 56: Hoare triple {33566#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r2~0 < 2; {33566#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:14,653 INFO L290 TraceCheckUtils]: 57: Hoare triple {33566#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep21~0 % 256); {33566#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:14,653 INFO L290 TraceCheckUtils]: 58: Hoare triple {33566#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep23~0 % 256); {33566#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:14,654 INFO L290 TraceCheckUtils]: 59: Hoare triple {33566#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode2~0 := 1; {33566#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:14,654 INFO L290 TraceCheckUtils]: 60: Hoare triple {33566#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {33566#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:14,655 INFO L290 TraceCheckUtils]: 61: Hoare triple {33566#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode3~0 % 256); {33566#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:14,655 INFO L290 TraceCheckUtils]: 62: Hoare triple {33566#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r3~0 < 2; {33566#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:14,655 INFO L290 TraceCheckUtils]: 63: Hoare triple {33566#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep31~0 % 256); {33566#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:14,656 INFO L290 TraceCheckUtils]: 64: Hoare triple {33566#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep32~0 % 256); {33566#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:14,656 INFO L290 TraceCheckUtils]: 65: Hoare triple {33566#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode3~0 := 1; {33566#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:14,657 INFO L290 TraceCheckUtils]: 66: Hoare triple {33566#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {33566#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:14,657 INFO L290 TraceCheckUtils]: 67: Hoare triple {33566#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {33566#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:14,658 INFO L290 TraceCheckUtils]: 68: Hoare triple {33566#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {33566#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:14,658 INFO L290 TraceCheckUtils]: 69: Hoare triple {33566#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(~st2~0 + ~nl2~0 <= 1);check_~tmp~1#1 := 0; {33564#false} is VALID [2022-02-20 18:32:14,658 INFO L290 TraceCheckUtils]: 70: Hoare triple {33564#false} check_#res#1 := check_~tmp~1#1; {33564#false} is VALID [2022-02-20 18:32:14,658 INFO L290 TraceCheckUtils]: 71: Hoare triple {33564#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {33564#false} is VALID [2022-02-20 18:32:14,658 INFO L290 TraceCheckUtils]: 72: Hoare triple {33564#false} assume 0 == assert_~arg#1 % 256; {33564#false} is VALID [2022-02-20 18:32:14,659 INFO L290 TraceCheckUtils]: 73: Hoare triple {33564#false} assume !false; {33564#false} is VALID [2022-02-20 18:32:14,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:32:14,660 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:14,660 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968437812] [2022-02-20 18:32:14,660 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968437812] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:14,660 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:14,660 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:32:14,660 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103831955] [2022-02-20 18:32:14,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:14,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-02-20 18:32:14,661 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:14,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:14,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:14,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:32:14,705 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:14,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:32:14,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:32:14,706 INFO L87 Difference]: Start difference. First operand 2145 states and 3484 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:17,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:17,883 INFO L93 Difference]: Finished difference Result 6648 states and 10865 transitions. [2022-02-20 18:32:17,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:32:17,884 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-02-20 18:32:17,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:17,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:17,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 610 transitions. [2022-02-20 18:32:17,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:17,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 610 transitions. [2022-02-20 18:32:17,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 610 transitions. [2022-02-20 18:32:18,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 610 edges. 610 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:19,008 INFO L225 Difference]: With dead ends: 6648 [2022-02-20 18:32:19,009 INFO L226 Difference]: Without dead ends: 4593 [2022-02-20 18:32:19,011 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:32:19,012 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 384 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:32:19,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [384 Valid, 686 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:32:19,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4593 states. [2022-02-20 18:32:20,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4593 to 3357. [2022-02-20 18:32:20,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:20,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4593 states. Second operand has 3357 states, 3356 states have (on average 1.6215733015494636) internal successors, (5442), 3356 states have internal predecessors, (5442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:20,100 INFO L74 IsIncluded]: Start isIncluded. First operand 4593 states. Second operand has 3357 states, 3356 states have (on average 1.6215733015494636) internal successors, (5442), 3356 states have internal predecessors, (5442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:20,103 INFO L87 Difference]: Start difference. First operand 4593 states. Second operand has 3357 states, 3356 states have (on average 1.6215733015494636) internal successors, (5442), 3356 states have internal predecessors, (5442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:20,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:20,723 INFO L93 Difference]: Finished difference Result 4593 states and 7472 transitions. [2022-02-20 18:32:20,723 INFO L276 IsEmpty]: Start isEmpty. Operand 4593 states and 7472 transitions. [2022-02-20 18:32:20,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:20,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:20,732 INFO L74 IsIncluded]: Start isIncluded. First operand has 3357 states, 3356 states have (on average 1.6215733015494636) internal successors, (5442), 3356 states have internal predecessors, (5442), 0 states have call successors, (0), 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 4593 states. [2022-02-20 18:32:20,735 INFO L87 Difference]: Start difference. First operand has 3357 states, 3356 states have (on average 1.6215733015494636) internal successors, (5442), 3356 states have internal predecessors, (5442), 0 states have call successors, (0), 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 4593 states. [2022-02-20 18:32:21,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:21,393 INFO L93 Difference]: Finished difference Result 4593 states and 7472 transitions. [2022-02-20 18:32:21,393 INFO L276 IsEmpty]: Start isEmpty. Operand 4593 states and 7472 transitions. [2022-02-20 18:32:21,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:21,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:21,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:21,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:21,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3357 states, 3356 states have (on average 1.6215733015494636) internal successors, (5442), 3356 states have internal predecessors, (5442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:21,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3357 states to 3357 states and 5442 transitions. [2022-02-20 18:32:21,803 INFO L78 Accepts]: Start accepts. Automaton has 3357 states and 5442 transitions. Word has length 74 [2022-02-20 18:32:21,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:21,803 INFO L470 AbstractCegarLoop]: Abstraction has 3357 states and 5442 transitions. [2022-02-20 18:32:21,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:21,803 INFO L276 IsEmpty]: Start isEmpty. Operand 3357 states and 5442 transitions. [2022-02-20 18:32:21,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 18:32:21,804 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:21,804 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:32:21,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:32:21,804 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:21,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:21,804 INFO L85 PathProgramCache]: Analyzing trace with hash -2130170379, now seen corresponding path program 1 times [2022-02-20 18:32:21,805 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:21,805 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375568671] [2022-02-20 18:32:21,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:21,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:21,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:21,863 INFO L290 TraceCheckUtils]: 0: Hoare triple {54008#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {54008#true} is VALID [2022-02-20 18:32:21,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {54008#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {54008#true} is VALID [2022-02-20 18:32:21,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {54008#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {54008#true} is VALID [2022-02-20 18:32:21,863 INFO L290 TraceCheckUtils]: 3: Hoare triple {54008#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {54008#true} is VALID [2022-02-20 18:32:21,863 INFO L290 TraceCheckUtils]: 4: Hoare triple {54008#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {54008#true} is VALID [2022-02-20 18:32:21,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {54008#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {54008#true} is VALID [2022-02-20 18:32:21,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {54008#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {54008#true} is VALID [2022-02-20 18:32:21,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {54008#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {54008#true} is VALID [2022-02-20 18:32:21,864 INFO L290 TraceCheckUtils]: 8: Hoare triple {54008#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {54008#true} is VALID [2022-02-20 18:32:21,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {54008#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {54008#true} is VALID [2022-02-20 18:32:21,864 INFO L290 TraceCheckUtils]: 10: Hoare triple {54008#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {54008#true} is VALID [2022-02-20 18:32:21,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {54008#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {54008#true} is VALID [2022-02-20 18:32:21,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {54008#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {54008#true} is VALID [2022-02-20 18:32:21,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {54008#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {54008#true} is VALID [2022-02-20 18:32:21,865 INFO L290 TraceCheckUtils]: 14: Hoare triple {54008#true} assume ~id1~0 != ~id2~0; {54008#true} is VALID [2022-02-20 18:32:21,865 INFO L290 TraceCheckUtils]: 15: Hoare triple {54008#true} assume ~id1~0 != ~id3~0; {54008#true} is VALID [2022-02-20 18:32:21,865 INFO L290 TraceCheckUtils]: 16: Hoare triple {54008#true} assume ~id2~0 != ~id3~0; {54008#true} is VALID [2022-02-20 18:32:21,865 INFO L290 TraceCheckUtils]: 17: Hoare triple {54008#true} assume ~id1~0 >= 0; {54008#true} is VALID [2022-02-20 18:32:21,866 INFO L290 TraceCheckUtils]: 18: Hoare triple {54008#true} assume ~id2~0 >= 0; {54008#true} is VALID [2022-02-20 18:32:21,866 INFO L290 TraceCheckUtils]: 19: Hoare triple {54008#true} assume ~id3~0 >= 0; {54008#true} is VALID [2022-02-20 18:32:21,866 INFO L290 TraceCheckUtils]: 20: Hoare triple {54008#true} assume 0 == ~r1~0; {54008#true} is VALID [2022-02-20 18:32:21,866 INFO L290 TraceCheckUtils]: 21: Hoare triple {54008#true} assume 0 == ~r2~0; {54008#true} is VALID [2022-02-20 18:32:21,866 INFO L290 TraceCheckUtils]: 22: Hoare triple {54008#true} assume 0 == ~r3~0; {54008#true} is VALID [2022-02-20 18:32:21,866 INFO L290 TraceCheckUtils]: 23: Hoare triple {54008#true} assume 0 != init_~r122~0#1 % 256; {54008#true} is VALID [2022-02-20 18:32:21,866 INFO L290 TraceCheckUtils]: 24: Hoare triple {54008#true} assume 0 != init_~r132~0#1 % 256; {54008#true} is VALID [2022-02-20 18:32:21,867 INFO L290 TraceCheckUtils]: 25: Hoare triple {54008#true} assume 0 != init_~r212~0#1 % 256; {54008#true} is VALID [2022-02-20 18:32:21,867 INFO L290 TraceCheckUtils]: 26: Hoare triple {54008#true} assume 0 != init_~r232~0#1 % 256; {54008#true} is VALID [2022-02-20 18:32:21,867 INFO L290 TraceCheckUtils]: 27: Hoare triple {54008#true} assume 0 != init_~r312~0#1 % 256; {54008#true} is VALID [2022-02-20 18:32:21,867 INFO L290 TraceCheckUtils]: 28: Hoare triple {54008#true} assume 0 != init_~r322~0#1 % 256; {54008#true} is VALID [2022-02-20 18:32:21,867 INFO L290 TraceCheckUtils]: 29: Hoare triple {54008#true} assume ~max1~0 == ~id1~0; {54008#true} is VALID [2022-02-20 18:32:21,867 INFO L290 TraceCheckUtils]: 30: Hoare triple {54008#true} assume ~max2~0 == ~id2~0; {54008#true} is VALID [2022-02-20 18:32:21,868 INFO L290 TraceCheckUtils]: 31: Hoare triple {54008#true} assume ~max3~0 == ~id3~0; {54008#true} is VALID [2022-02-20 18:32:21,868 INFO L290 TraceCheckUtils]: 32: Hoare triple {54008#true} assume 0 == ~st1~0; {54008#true} is VALID [2022-02-20 18:32:21,868 INFO L290 TraceCheckUtils]: 33: Hoare triple {54008#true} assume 0 == ~st2~0; {54008#true} is VALID [2022-02-20 18:32:21,868 INFO L290 TraceCheckUtils]: 34: Hoare triple {54008#true} assume 0 == ~st3~0; {54008#true} is VALID [2022-02-20 18:32:21,868 INFO L290 TraceCheckUtils]: 35: Hoare triple {54008#true} assume 0 == ~nl1~0; {54008#true} is VALID [2022-02-20 18:32:21,868 INFO L290 TraceCheckUtils]: 36: Hoare triple {54008#true} assume 0 == ~nl2~0; {54008#true} is VALID [2022-02-20 18:32:21,868 INFO L290 TraceCheckUtils]: 37: Hoare triple {54008#true} assume 0 == ~nl3~0; {54008#true} is VALID [2022-02-20 18:32:21,869 INFO L290 TraceCheckUtils]: 38: Hoare triple {54008#true} assume 0 == ~mode1~0 % 256; {54008#true} is VALID [2022-02-20 18:32:21,869 INFO L290 TraceCheckUtils]: 39: Hoare triple {54008#true} assume 0 == ~mode2~0 % 256; {54008#true} is VALID [2022-02-20 18:32:21,869 INFO L290 TraceCheckUtils]: 40: Hoare triple {54008#true} assume 0 == ~mode3~0 % 256; {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:21,870 INFO L290 TraceCheckUtils]: 41: Hoare triple {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~newmax1~0 % 256; {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:21,870 INFO L290 TraceCheckUtils]: 42: Hoare triple {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~newmax2~0 % 256; {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:21,871 INFO L290 TraceCheckUtils]: 43: Hoare triple {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:21,871 INFO L290 TraceCheckUtils]: 44: Hoare triple {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp___5~0#1; {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:21,872 INFO L290 TraceCheckUtils]: 45: Hoare triple {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:21,872 INFO L290 TraceCheckUtils]: 46: Hoare triple {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:21,872 INFO L290 TraceCheckUtils]: 47: Hoare triple {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:21,873 INFO L290 TraceCheckUtils]: 48: Hoare triple {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:21,873 INFO L290 TraceCheckUtils]: 49: Hoare triple {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:21,874 INFO L290 TraceCheckUtils]: 50: Hoare triple {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r1~0 < 2; {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:21,874 INFO L290 TraceCheckUtils]: 51: Hoare triple {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep12~0 % 256); {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:21,875 INFO L290 TraceCheckUtils]: 52: Hoare triple {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep13~0 % 256); {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:21,875 INFO L290 TraceCheckUtils]: 53: Hoare triple {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:21,875 INFO L290 TraceCheckUtils]: 54: Hoare triple {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:21,876 INFO L290 TraceCheckUtils]: 55: Hoare triple {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:21,876 INFO L290 TraceCheckUtils]: 56: Hoare triple {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r2~0 < 2; {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:21,877 INFO L290 TraceCheckUtils]: 57: Hoare triple {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep21~0 % 256); {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:21,877 INFO L290 TraceCheckUtils]: 58: Hoare triple {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep23~0 % 256); {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:21,878 INFO L290 TraceCheckUtils]: 59: Hoare triple {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:21,878 INFO L290 TraceCheckUtils]: 60: Hoare triple {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:21,879 INFO L290 TraceCheckUtils]: 61: Hoare triple {54010#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~mode3~0 % 256;~r3~0 := (if (1 + ~r3~0) % 256 <= 127 then (1 + ~r3~0) % 256 else (1 + ~r3~0) % 256 - 256); {54009#false} is VALID [2022-02-20 18:32:21,879 INFO L290 TraceCheckUtils]: 62: Hoare triple {54009#false} assume !(0 != ~ep13~0 % 256); {54009#false} is VALID [2022-02-20 18:32:21,879 INFO L290 TraceCheckUtils]: 63: Hoare triple {54009#false} assume !(0 != ~ep23~0 % 256); {54009#false} is VALID [2022-02-20 18:32:21,879 INFO L290 TraceCheckUtils]: 64: Hoare triple {54009#false} ~newmax3~0 := node3_~newmax~2#1; {54009#false} is VALID [2022-02-20 18:32:21,879 INFO L290 TraceCheckUtils]: 65: Hoare triple {54009#false} assume 2 == ~r3~0; {54009#false} is VALID [2022-02-20 18:32:21,879 INFO L290 TraceCheckUtils]: 66: Hoare triple {54009#false} assume ~max3~0 == ~id3~0;~st3~0 := 1; {54009#false} is VALID [2022-02-20 18:32:21,880 INFO L290 TraceCheckUtils]: 67: Hoare triple {54009#false} ~mode3~0 := 0; {54009#false} is VALID [2022-02-20 18:32:21,880 INFO L290 TraceCheckUtils]: 68: Hoare triple {54009#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {54009#false} is VALID [2022-02-20 18:32:21,880 INFO L290 TraceCheckUtils]: 69: Hoare triple {54009#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {54009#false} is VALID [2022-02-20 18:32:21,880 INFO L290 TraceCheckUtils]: 70: Hoare triple {54009#false} check_#res#1 := check_~tmp~1#1; {54009#false} is VALID [2022-02-20 18:32:21,880 INFO L290 TraceCheckUtils]: 71: Hoare triple {54009#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {54009#false} is VALID [2022-02-20 18:32:21,880 INFO L290 TraceCheckUtils]: 72: Hoare triple {54009#false} assume 0 == assert_~arg#1 % 256; {54009#false} is VALID [2022-02-20 18:32:21,880 INFO L290 TraceCheckUtils]: 73: Hoare triple {54009#false} assume !false; {54009#false} is VALID [2022-02-20 18:32:21,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:32:21,881 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:21,881 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375568671] [2022-02-20 18:32:21,881 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375568671] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:21,881 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:21,882 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:32:21,882 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070993387] [2022-02-20 18:32:21,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:21,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-02-20 18:32:21,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:21,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:21,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:21,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:32:21,934 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:21,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:32:21,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:32:21,935 INFO L87 Difference]: Start difference. First operand 3357 states and 5442 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:25,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:25,141 INFO L93 Difference]: Finished difference Result 6689 states and 10862 transitions. [2022-02-20 18:32:25,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:32:25,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-02-20 18:32:25,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:25,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:25,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2022-02-20 18:32:25,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:25,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2022-02-20 18:32:25,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 446 transitions. [2022-02-20 18:32:25,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 446 edges. 446 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:26,124 INFO L225 Difference]: With dead ends: 6689 [2022-02-20 18:32:26,125 INFO L226 Difference]: Without dead ends: 4777 [2022-02-20 18:32:26,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:32:26,128 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 104 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:32:26,128 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 439 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:32:26,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4777 states. [2022-02-20 18:32:27,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4777 to 4775. [2022-02-20 18:32:27,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:27,818 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4777 states. Second operand has 4775 states, 4774 states have (on average 1.6108085462924173) internal successors, (7690), 4774 states have internal predecessors, (7690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:27,821 INFO L74 IsIncluded]: Start isIncluded. First operand 4777 states. Second operand has 4775 states, 4774 states have (on average 1.6108085462924173) internal successors, (7690), 4774 states have internal predecessors, (7690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:27,823 INFO L87 Difference]: Start difference. First operand 4777 states. Second operand has 4775 states, 4774 states have (on average 1.6108085462924173) internal successors, (7690), 4774 states have internal predecessors, (7690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:28,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:28,447 INFO L93 Difference]: Finished difference Result 4777 states and 7691 transitions. [2022-02-20 18:32:28,447 INFO L276 IsEmpty]: Start isEmpty. Operand 4777 states and 7691 transitions. [2022-02-20 18:32:28,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:28,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:28,455 INFO L74 IsIncluded]: Start isIncluded. First operand has 4775 states, 4774 states have (on average 1.6108085462924173) internal successors, (7690), 4774 states have internal predecessors, (7690), 0 states have call successors, (0), 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 4777 states. [2022-02-20 18:32:28,457 INFO L87 Difference]: Start difference. First operand has 4775 states, 4774 states have (on average 1.6108085462924173) internal successors, (7690), 4774 states have internal predecessors, (7690), 0 states have call successors, (0), 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 4777 states. [2022-02-20 18:32:29,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:29,100 INFO L93 Difference]: Finished difference Result 4777 states and 7691 transitions. [2022-02-20 18:32:29,100 INFO L276 IsEmpty]: Start isEmpty. Operand 4777 states and 7691 transitions. [2022-02-20 18:32:29,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:29,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:29,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:29,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:29,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4775 states, 4774 states have (on average 1.6108085462924173) internal successors, (7690), 4774 states have internal predecessors, (7690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:29,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4775 states to 4775 states and 7690 transitions. [2022-02-20 18:32:29,835 INFO L78 Accepts]: Start accepts. Automaton has 4775 states and 7690 transitions. Word has length 74 [2022-02-20 18:32:29,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:29,835 INFO L470 AbstractCegarLoop]: Abstraction has 4775 states and 7690 transitions. [2022-02-20 18:32:29,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:29,835 INFO L276 IsEmpty]: Start isEmpty. Operand 4775 states and 7690 transitions. [2022-02-20 18:32:29,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 18:32:29,835 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:29,836 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:32:29,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:32:29,836 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:29,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:29,836 INFO L85 PathProgramCache]: Analyzing trace with hash 339461557, now seen corresponding path program 1 times [2022-02-20 18:32:29,836 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:29,837 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779510961] [2022-02-20 18:32:29,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:29,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:29,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:29,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {76548#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {76548#true} is VALID [2022-02-20 18:32:29,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {76548#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {76548#true} is VALID [2022-02-20 18:32:29,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {76548#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {76548#true} is VALID [2022-02-20 18:32:29,888 INFO L290 TraceCheckUtils]: 3: Hoare triple {76548#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {76548#true} is VALID [2022-02-20 18:32:29,888 INFO L290 TraceCheckUtils]: 4: Hoare triple {76548#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {76548#true} is VALID [2022-02-20 18:32:29,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {76548#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {76548#true} is VALID [2022-02-20 18:32:29,888 INFO L290 TraceCheckUtils]: 6: Hoare triple {76548#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {76548#true} is VALID [2022-02-20 18:32:29,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {76548#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {76548#true} is VALID [2022-02-20 18:32:29,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {76548#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {76548#true} is VALID [2022-02-20 18:32:29,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {76548#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {76548#true} is VALID [2022-02-20 18:32:29,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {76548#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {76548#true} is VALID [2022-02-20 18:32:29,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {76548#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {76548#true} is VALID [2022-02-20 18:32:29,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {76548#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {76548#true} is VALID [2022-02-20 18:32:29,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {76548#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {76548#true} is VALID [2022-02-20 18:32:29,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {76548#true} assume ~id1~0 != ~id2~0; {76548#true} is VALID [2022-02-20 18:32:29,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {76548#true} assume ~id1~0 != ~id3~0; {76548#true} is VALID [2022-02-20 18:32:29,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {76548#true} assume ~id2~0 != ~id3~0; {76548#true} is VALID [2022-02-20 18:32:29,890 INFO L290 TraceCheckUtils]: 17: Hoare triple {76548#true} assume ~id1~0 >= 0; {76548#true} is VALID [2022-02-20 18:32:29,890 INFO L290 TraceCheckUtils]: 18: Hoare triple {76548#true} assume ~id2~0 >= 0; {76548#true} is VALID [2022-02-20 18:32:29,890 INFO L290 TraceCheckUtils]: 19: Hoare triple {76548#true} assume ~id3~0 >= 0; {76548#true} is VALID [2022-02-20 18:32:29,890 INFO L290 TraceCheckUtils]: 20: Hoare triple {76548#true} assume 0 == ~r1~0; {76548#true} is VALID [2022-02-20 18:32:29,890 INFO L290 TraceCheckUtils]: 21: Hoare triple {76548#true} assume 0 == ~r2~0; {76548#true} is VALID [2022-02-20 18:32:29,891 INFO L290 TraceCheckUtils]: 22: Hoare triple {76548#true} assume 0 == ~r3~0; {76548#true} is VALID [2022-02-20 18:32:29,891 INFO L290 TraceCheckUtils]: 23: Hoare triple {76548#true} assume 0 != init_~r122~0#1 % 256; {76548#true} is VALID [2022-02-20 18:32:29,891 INFO L290 TraceCheckUtils]: 24: Hoare triple {76548#true} assume 0 != init_~r132~0#1 % 256; {76548#true} is VALID [2022-02-20 18:32:29,891 INFO L290 TraceCheckUtils]: 25: Hoare triple {76548#true} assume 0 != init_~r212~0#1 % 256; {76548#true} is VALID [2022-02-20 18:32:29,891 INFO L290 TraceCheckUtils]: 26: Hoare triple {76548#true} assume 0 != init_~r232~0#1 % 256; {76548#true} is VALID [2022-02-20 18:32:29,891 INFO L290 TraceCheckUtils]: 27: Hoare triple {76548#true} assume 0 != init_~r312~0#1 % 256; {76548#true} is VALID [2022-02-20 18:32:29,891 INFO L290 TraceCheckUtils]: 28: Hoare triple {76548#true} assume 0 != init_~r322~0#1 % 256; {76548#true} is VALID [2022-02-20 18:32:29,892 INFO L290 TraceCheckUtils]: 29: Hoare triple {76548#true} assume ~max1~0 == ~id1~0; {76548#true} is VALID [2022-02-20 18:32:29,892 INFO L290 TraceCheckUtils]: 30: Hoare triple {76548#true} assume ~max2~0 == ~id2~0; {76548#true} is VALID [2022-02-20 18:32:29,892 INFO L290 TraceCheckUtils]: 31: Hoare triple {76548#true} assume ~max3~0 == ~id3~0; {76548#true} is VALID [2022-02-20 18:32:29,892 INFO L290 TraceCheckUtils]: 32: Hoare triple {76548#true} assume 0 == ~st1~0; {76548#true} is VALID [2022-02-20 18:32:29,892 INFO L290 TraceCheckUtils]: 33: Hoare triple {76548#true} assume 0 == ~st2~0; {76548#true} is VALID [2022-02-20 18:32:29,892 INFO L290 TraceCheckUtils]: 34: Hoare triple {76548#true} assume 0 == ~st3~0; {76548#true} is VALID [2022-02-20 18:32:29,892 INFO L290 TraceCheckUtils]: 35: Hoare triple {76548#true} assume 0 == ~nl1~0; {76548#true} is VALID [2022-02-20 18:32:29,893 INFO L290 TraceCheckUtils]: 36: Hoare triple {76548#true} assume 0 == ~nl2~0; {76548#true} is VALID [2022-02-20 18:32:29,893 INFO L290 TraceCheckUtils]: 37: Hoare triple {76548#true} assume 0 == ~nl3~0; {76548#true} is VALID [2022-02-20 18:32:29,893 INFO L290 TraceCheckUtils]: 38: Hoare triple {76548#true} assume 0 == ~mode1~0 % 256; {76550#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:29,894 INFO L290 TraceCheckUtils]: 39: Hoare triple {76550#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {76550#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:29,894 INFO L290 TraceCheckUtils]: 40: Hoare triple {76550#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {76550#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:29,895 INFO L290 TraceCheckUtils]: 41: Hoare triple {76550#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~newmax1~0 % 256; {76550#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:29,897 INFO L290 TraceCheckUtils]: 42: Hoare triple {76550#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~newmax2~0 % 256; {76550#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:29,898 INFO L290 TraceCheckUtils]: 43: Hoare triple {76550#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {76550#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:29,898 INFO L290 TraceCheckUtils]: 44: Hoare triple {76550#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {76550#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:29,899 INFO L290 TraceCheckUtils]: 45: Hoare triple {76550#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {76550#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:29,899 INFO L290 TraceCheckUtils]: 46: Hoare triple {76550#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {76550#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:29,900 INFO L290 TraceCheckUtils]: 47: Hoare triple {76550#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {76550#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:29,900 INFO L290 TraceCheckUtils]: 48: Hoare triple {76550#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {76550#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:29,901 INFO L290 TraceCheckUtils]: 49: Hoare triple {76550#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); {76549#false} is VALID [2022-02-20 18:32:29,901 INFO L290 TraceCheckUtils]: 50: Hoare triple {76549#false} assume !(0 != ~ep21~0 % 256); {76549#false} is VALID [2022-02-20 18:32:29,901 INFO L290 TraceCheckUtils]: 51: Hoare triple {76549#false} assume !(0 != ~ep31~0 % 256); {76549#false} is VALID [2022-02-20 18:32:29,901 INFO L290 TraceCheckUtils]: 52: Hoare triple {76549#false} ~newmax1~0 := node1_~newmax~0#1; {76549#false} is VALID [2022-02-20 18:32:29,901 INFO L290 TraceCheckUtils]: 53: Hoare triple {76549#false} assume 2 == ~r1~0; {76549#false} is VALID [2022-02-20 18:32:29,901 INFO L290 TraceCheckUtils]: 54: Hoare triple {76549#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {76549#false} is VALID [2022-02-20 18:32:29,902 INFO L290 TraceCheckUtils]: 55: Hoare triple {76549#false} ~mode1~0 := 0; {76549#false} is VALID [2022-02-20 18:32:29,902 INFO L290 TraceCheckUtils]: 56: Hoare triple {76549#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {76549#false} is VALID [2022-02-20 18:32:29,902 INFO L290 TraceCheckUtils]: 57: Hoare triple {76549#false} assume !(0 != ~mode2~0 % 256); {76549#false} is VALID [2022-02-20 18:32:29,902 INFO L290 TraceCheckUtils]: 58: Hoare triple {76549#false} assume ~r2~0 < 2; {76549#false} is VALID [2022-02-20 18:32:29,902 INFO L290 TraceCheckUtils]: 59: Hoare triple {76549#false} assume !(0 != ~ep21~0 % 256); {76549#false} is VALID [2022-02-20 18:32:29,902 INFO L290 TraceCheckUtils]: 60: Hoare triple {76549#false} assume !(0 != ~ep23~0 % 256); {76549#false} is VALID [2022-02-20 18:32:29,902 INFO L290 TraceCheckUtils]: 61: Hoare triple {76549#false} ~mode2~0 := 1; {76549#false} is VALID [2022-02-20 18:32:29,903 INFO L290 TraceCheckUtils]: 62: Hoare triple {76549#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {76549#false} is VALID [2022-02-20 18:32:29,903 INFO L290 TraceCheckUtils]: 63: Hoare triple {76549#false} assume !(0 != ~mode3~0 % 256); {76549#false} is VALID [2022-02-20 18:32:29,903 INFO L290 TraceCheckUtils]: 64: Hoare triple {76549#false} assume ~r3~0 < 2; {76549#false} is VALID [2022-02-20 18:32:29,903 INFO L290 TraceCheckUtils]: 65: Hoare triple {76549#false} assume !(0 != ~ep31~0 % 256); {76549#false} is VALID [2022-02-20 18:32:29,903 INFO L290 TraceCheckUtils]: 66: Hoare triple {76549#false} assume !(0 != ~ep32~0 % 256); {76549#false} is VALID [2022-02-20 18:32:29,903 INFO L290 TraceCheckUtils]: 67: Hoare triple {76549#false} ~mode3~0 := 1; {76549#false} is VALID [2022-02-20 18:32:29,904 INFO L290 TraceCheckUtils]: 68: Hoare triple {76549#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {76549#false} is VALID [2022-02-20 18:32:29,904 INFO L290 TraceCheckUtils]: 69: Hoare triple {76549#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {76549#false} is VALID [2022-02-20 18:32:29,904 INFO L290 TraceCheckUtils]: 70: Hoare triple {76549#false} check_#res#1 := check_~tmp~1#1; {76549#false} is VALID [2022-02-20 18:32:29,904 INFO L290 TraceCheckUtils]: 71: Hoare triple {76549#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {76549#false} is VALID [2022-02-20 18:32:29,904 INFO L290 TraceCheckUtils]: 72: Hoare triple {76549#false} assume 0 == assert_~arg#1 % 256; {76549#false} is VALID [2022-02-20 18:32:29,904 INFO L290 TraceCheckUtils]: 73: Hoare triple {76549#false} assume !false; {76549#false} is VALID [2022-02-20 18:32:29,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:32:29,905 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:29,905 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779510961] [2022-02-20 18:32:29,905 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779510961] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:29,905 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:29,905 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:32:29,906 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601440577] [2022-02-20 18:32:29,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:29,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-02-20 18:32:29,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:29,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:29,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:29,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:32:29,954 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:29,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:32:29,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:32:29,955 INFO L87 Difference]: Start difference. First operand 4775 states and 7690 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:35,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:35,933 INFO L93 Difference]: Finished difference Result 10486 states and 17043 transitions. [2022-02-20 18:32:35,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:32:35,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-02-20 18:32:35,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:35,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:35,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2022-02-20 18:32:35,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:35,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2022-02-20 18:32:35,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 446 transitions. [2022-02-20 18:32:36,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 446 edges. 446 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:38,124 INFO L225 Difference]: With dead ends: 10486 [2022-02-20 18:32:38,125 INFO L226 Difference]: Without dead ends: 7079 [2022-02-20 18:32:38,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:32:38,128 INFO L933 BasicCegarLoop]: 300 mSDtfsCounter, 116 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:32:38,128 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 479 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:32:38,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7079 states. [2022-02-20 18:32:40,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7079 to 7077. [2022-02-20 18:32:40,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:40,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7079 states. Second operand has 7077 states, 7076 states have (on average 1.6075466365178066) internal successors, (11375), 7076 states have internal predecessors, (11375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:40,501 INFO L74 IsIncluded]: Start isIncluded. First operand 7079 states. Second operand has 7077 states, 7076 states have (on average 1.6075466365178066) internal successors, (11375), 7076 states have internal predecessors, (11375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:40,506 INFO L87 Difference]: Start difference. First operand 7079 states. Second operand has 7077 states, 7076 states have (on average 1.6075466365178066) internal successors, (11375), 7076 states have internal predecessors, (11375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:41,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:41,983 INFO L93 Difference]: Finished difference Result 7079 states and 11376 transitions. [2022-02-20 18:32:41,983 INFO L276 IsEmpty]: Start isEmpty. Operand 7079 states and 11376 transitions. [2022-02-20 18:32:41,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:41,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:41,996 INFO L74 IsIncluded]: Start isIncluded. First operand has 7077 states, 7076 states have (on average 1.6075466365178066) internal successors, (11375), 7076 states have internal predecessors, (11375), 0 states have call successors, (0), 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 7079 states. [2022-02-20 18:32:42,000 INFO L87 Difference]: Start difference. First operand has 7077 states, 7076 states have (on average 1.6075466365178066) internal successors, (11375), 7076 states have internal predecessors, (11375), 0 states have call successors, (0), 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 7079 states. [2022-02-20 18:32:43,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:43,445 INFO L93 Difference]: Finished difference Result 7079 states and 11376 transitions. [2022-02-20 18:32:43,445 INFO L276 IsEmpty]: Start isEmpty. Operand 7079 states and 11376 transitions. [2022-02-20 18:32:43,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:43,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:43,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:43,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:43,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7077 states, 7076 states have (on average 1.6075466365178066) internal successors, (11375), 7076 states have internal predecessors, (11375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:45,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7077 states to 7077 states and 11375 transitions. [2022-02-20 18:32:45,169 INFO L78 Accepts]: Start accepts. Automaton has 7077 states and 11375 transitions. Word has length 74 [2022-02-20 18:32:45,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:45,169 INFO L470 AbstractCegarLoop]: Abstraction has 7077 states and 11375 transitions. [2022-02-20 18:32:45,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:45,169 INFO L276 IsEmpty]: Start isEmpty. Operand 7077 states and 11375 transitions. [2022-02-20 18:32:45,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-20 18:32:45,169 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:45,169 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:32:45,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:32:45,170 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:45,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:45,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1704077331, now seen corresponding path program 1 times [2022-02-20 18:32:45,171 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:45,171 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986256335] [2022-02-20 18:32:45,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:45,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:45,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {110928#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {110928#true} is VALID [2022-02-20 18:32:45,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {110928#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {110928#true} is VALID [2022-02-20 18:32:45,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {110928#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {110928#true} is VALID [2022-02-20 18:32:45,231 INFO L290 TraceCheckUtils]: 3: Hoare triple {110928#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {110928#true} is VALID [2022-02-20 18:32:45,231 INFO L290 TraceCheckUtils]: 4: Hoare triple {110928#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {110928#true} is VALID [2022-02-20 18:32:45,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {110928#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {110928#true} is VALID [2022-02-20 18:32:45,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {110928#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {110928#true} is VALID [2022-02-20 18:32:45,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {110928#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {110928#true} is VALID [2022-02-20 18:32:45,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {110928#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {110928#true} is VALID [2022-02-20 18:32:45,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {110928#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {110928#true} is VALID [2022-02-20 18:32:45,232 INFO L290 TraceCheckUtils]: 10: Hoare triple {110928#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {110928#true} is VALID [2022-02-20 18:32:45,232 INFO L290 TraceCheckUtils]: 11: Hoare triple {110928#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {110928#true} is VALID [2022-02-20 18:32:45,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {110928#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {110928#true} is VALID [2022-02-20 18:32:45,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {110928#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {110928#true} is VALID [2022-02-20 18:32:45,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {110928#true} assume ~id1~0 != ~id2~0; {110928#true} is VALID [2022-02-20 18:32:45,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {110928#true} assume ~id1~0 != ~id3~0; {110928#true} is VALID [2022-02-20 18:32:45,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {110928#true} assume ~id2~0 != ~id3~0; {110928#true} is VALID [2022-02-20 18:32:45,233 INFO L290 TraceCheckUtils]: 17: Hoare triple {110928#true} assume ~id1~0 >= 0; {110928#true} is VALID [2022-02-20 18:32:45,233 INFO L290 TraceCheckUtils]: 18: Hoare triple {110928#true} assume ~id2~0 >= 0; {110928#true} is VALID [2022-02-20 18:32:45,233 INFO L290 TraceCheckUtils]: 19: Hoare triple {110928#true} assume ~id3~0 >= 0; {110928#true} is VALID [2022-02-20 18:32:45,233 INFO L290 TraceCheckUtils]: 20: Hoare triple {110928#true} assume 0 == ~r1~0; {110928#true} is VALID [2022-02-20 18:32:45,233 INFO L290 TraceCheckUtils]: 21: Hoare triple {110928#true} assume 0 == ~r2~0; {110928#true} is VALID [2022-02-20 18:32:45,233 INFO L290 TraceCheckUtils]: 22: Hoare triple {110928#true} assume 0 == ~r3~0; {110928#true} is VALID [2022-02-20 18:32:45,234 INFO L290 TraceCheckUtils]: 23: Hoare triple {110928#true} assume 0 != init_~r122~0#1 % 256; {110928#true} is VALID [2022-02-20 18:32:45,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {110928#true} assume 0 != init_~r132~0#1 % 256; {110928#true} is VALID [2022-02-20 18:32:45,234 INFO L290 TraceCheckUtils]: 25: Hoare triple {110928#true} assume 0 != init_~r212~0#1 % 256; {110928#true} is VALID [2022-02-20 18:32:45,234 INFO L290 TraceCheckUtils]: 26: Hoare triple {110928#true} assume 0 != init_~r232~0#1 % 256; {110928#true} is VALID [2022-02-20 18:32:45,234 INFO L290 TraceCheckUtils]: 27: Hoare triple {110928#true} assume 0 != init_~r312~0#1 % 256; {110928#true} is VALID [2022-02-20 18:32:45,234 INFO L290 TraceCheckUtils]: 28: Hoare triple {110928#true} assume 0 != init_~r322~0#1 % 256; {110928#true} is VALID [2022-02-20 18:32:45,235 INFO L290 TraceCheckUtils]: 29: Hoare triple {110928#true} assume ~max1~0 == ~id1~0; {110928#true} is VALID [2022-02-20 18:32:45,235 INFO L290 TraceCheckUtils]: 30: Hoare triple {110928#true} assume ~max2~0 == ~id2~0; {110928#true} is VALID [2022-02-20 18:32:45,235 INFO L290 TraceCheckUtils]: 31: Hoare triple {110928#true} assume ~max3~0 == ~id3~0; {110928#true} is VALID [2022-02-20 18:32:45,235 INFO L290 TraceCheckUtils]: 32: Hoare triple {110928#true} assume 0 == ~st1~0; {110928#true} is VALID [2022-02-20 18:32:45,235 INFO L290 TraceCheckUtils]: 33: Hoare triple {110928#true} assume 0 == ~st2~0; {110928#true} is VALID [2022-02-20 18:32:45,236 INFO L290 TraceCheckUtils]: 34: Hoare triple {110928#true} assume 0 == ~st3~0; {110930#(<= ~st3~0 0)} is VALID [2022-02-20 18:32:45,236 INFO L290 TraceCheckUtils]: 35: Hoare triple {110930#(<= ~st3~0 0)} assume 0 == ~nl1~0; {110930#(<= ~st3~0 0)} is VALID [2022-02-20 18:32:45,236 INFO L290 TraceCheckUtils]: 36: Hoare triple {110930#(<= ~st3~0 0)} assume 0 == ~nl2~0; {110930#(<= ~st3~0 0)} is VALID [2022-02-20 18:32:45,237 INFO L290 TraceCheckUtils]: 37: Hoare triple {110930#(<= ~st3~0 0)} assume 0 == ~nl3~0; {110931#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:45,237 INFO L290 TraceCheckUtils]: 38: Hoare triple {110931#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode1~0 % 256; {110931#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:45,237 INFO L290 TraceCheckUtils]: 39: Hoare triple {110931#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode2~0 % 256; {110931#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:45,238 INFO L290 TraceCheckUtils]: 40: Hoare triple {110931#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode3~0 % 256; {110931#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:45,238 INFO L290 TraceCheckUtils]: 41: Hoare triple {110931#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 != ~newmax1~0 % 256; {110931#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:45,239 INFO L290 TraceCheckUtils]: 42: Hoare triple {110931#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 != ~newmax2~0 % 256; {110931#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:45,239 INFO L290 TraceCheckUtils]: 43: Hoare triple {110931#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {110931#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:45,239 INFO L290 TraceCheckUtils]: 44: Hoare triple {110931#(<= (+ ~nl3~0 ~st3~0) 0)} init_#res#1 := init_~tmp___5~0#1; {110931#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:45,240 INFO L290 TraceCheckUtils]: 45: Hoare triple {110931#(<= (+ ~nl3~0 ~st3~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {110931#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:45,240 INFO L290 TraceCheckUtils]: 46: Hoare triple {110931#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {110931#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:45,241 INFO L290 TraceCheckUtils]: 47: Hoare triple {110931#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {110931#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:45,241 INFO L290 TraceCheckUtils]: 48: Hoare triple {110931#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {110931#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:45,241 INFO L290 TraceCheckUtils]: 49: Hoare triple {110931#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode1~0 % 256); {110931#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:45,242 INFO L290 TraceCheckUtils]: 50: Hoare triple {110931#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r1~0 < 2; {110931#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:45,242 INFO L290 TraceCheckUtils]: 51: Hoare triple {110931#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep12~0 % 256); {110931#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:45,243 INFO L290 TraceCheckUtils]: 52: Hoare triple {110931#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep13~0 % 256); {110931#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:45,243 INFO L290 TraceCheckUtils]: 53: Hoare triple {110931#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode1~0 := 1; {110931#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:45,243 INFO L290 TraceCheckUtils]: 54: Hoare triple {110931#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {110931#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:45,244 INFO L290 TraceCheckUtils]: 55: Hoare triple {110931#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode2~0 % 256); {110931#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:45,244 INFO L290 TraceCheckUtils]: 56: Hoare triple {110931#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r2~0 < 2; {110931#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:45,244 INFO L290 TraceCheckUtils]: 57: Hoare triple {110931#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep21~0 % 256); {110931#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:45,245 INFO L290 TraceCheckUtils]: 58: Hoare triple {110931#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep23~0 % 256); {110931#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:45,245 INFO L290 TraceCheckUtils]: 59: Hoare triple {110931#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode2~0 := 1; {110931#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:45,245 INFO L290 TraceCheckUtils]: 60: Hoare triple {110931#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {110931#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:45,246 INFO L290 TraceCheckUtils]: 61: Hoare triple {110931#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode3~0 % 256); {110931#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:45,246 INFO L290 TraceCheckUtils]: 62: Hoare triple {110931#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r3~0 < 2; {110931#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:45,247 INFO L290 TraceCheckUtils]: 63: Hoare triple {110931#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep31~0 % 256); {110931#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:45,247 INFO L290 TraceCheckUtils]: 64: Hoare triple {110931#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep32~0 % 256); {110931#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:45,247 INFO L290 TraceCheckUtils]: 65: Hoare triple {110931#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode3~0 := 1; {110931#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:45,248 INFO L290 TraceCheckUtils]: 66: Hoare triple {110931#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {110931#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:45,248 INFO L290 TraceCheckUtils]: 67: Hoare triple {110931#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {110931#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:45,249 INFO L290 TraceCheckUtils]: 68: Hoare triple {110931#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {110931#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:45,249 INFO L290 TraceCheckUtils]: 69: Hoare triple {110931#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st2~0 + ~nl2~0 <= 1; {110931#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:45,250 INFO L290 TraceCheckUtils]: 70: Hoare triple {110931#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(~st3~0 + ~nl3~0 <= 1);check_~tmp~1#1 := 0; {110929#false} is VALID [2022-02-20 18:32:45,250 INFO L290 TraceCheckUtils]: 71: Hoare triple {110929#false} check_#res#1 := check_~tmp~1#1; {110929#false} is VALID [2022-02-20 18:32:45,250 INFO L290 TraceCheckUtils]: 72: Hoare triple {110929#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {110929#false} is VALID [2022-02-20 18:32:45,250 INFO L290 TraceCheckUtils]: 73: Hoare triple {110929#false} assume 0 == assert_~arg#1 % 256; {110929#false} is VALID [2022-02-20 18:32:45,250 INFO L290 TraceCheckUtils]: 74: Hoare triple {110929#false} assume !false; {110929#false} is VALID [2022-02-20 18:32:45,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:32:45,251 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:45,251 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986256335] [2022-02-20 18:32:45,251 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986256335] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:45,251 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:45,251 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:32:45,252 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139012631] [2022-02-20 18:32:45,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:45,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2022-02-20 18:32:45,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:45,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:45,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:45,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:32:45,310 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:45,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:32:45,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:32:45,311 INFO L87 Difference]: Start difference. First operand 7077 states and 11375 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)