./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.ufo.UNBOUNDED.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.UNBOUNDED.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 558f970b63375a18824a4471ce91e71e4e14632a20bfa5002df552fa8b202ea3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:32:00,380 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:32:00,381 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:32:00,403 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:32:00,405 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:32:00,407 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:32:00,409 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:32:00,414 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:32:00,416 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:32:00,419 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:32:00,420 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:32:00,421 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:32:00,421 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:32:00,423 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:32:00,424 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:32:00,425 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:32:00,426 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:32:00,427 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:32:00,429 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:32:00,435 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:32:00,436 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:32:00,437 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:32:00,438 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:32:00,438 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:32:00,440 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:32:00,440 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:32:00,440 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:32:00,441 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:32:00,442 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:32:00,442 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:32:00,443 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:32:00,443 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:32:00,445 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:32:00,445 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:32:00,446 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:32:00,446 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:32:00,447 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:32:00,447 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:32:00,447 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:32:00,448 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:32:00,448 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:32:00,449 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:32:00,476 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:32:00,476 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:32:00,477 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:32:00,477 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:32:00,477 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:32:00,478 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:32:00,478 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:32:00,478 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:32:00,478 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:32:00,478 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:32:00,479 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:32:00,479 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:32:00,479 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:32:00,480 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:32:00,480 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:32:00,480 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:32:00,480 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:32:00,480 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:32:00,480 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:32:00,480 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:32:00,481 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:32:00,481 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:32:00,481 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:32:00,481 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:32:00,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:32:00,481 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:32:00,481 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:32:00,482 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:32:00,482 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:32:00,482 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:32:00,482 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:32:00,482 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:32:00,482 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:32:00,483 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 -> 558f970b63375a18824a4471ce91e71e4e14632a20bfa5002df552fa8b202ea3 [2022-02-20 18:32:00,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:32:00,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:32:00,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:32:00,709 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:32:00,709 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:32:00,710 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.UNBOUNDED.pals.c [2022-02-20 18:32:00,760 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0201972e5/f0c1e1255acc47e78ae9d501c247708b/FLAG53d2b2764 [2022-02-20 18:32:01,142 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:32:01,142 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c [2022-02-20 18:32:01,152 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0201972e5/f0c1e1255acc47e78ae9d501c247708b/FLAG53d2b2764 [2022-02-20 18:32:01,163 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0201972e5/f0c1e1255acc47e78ae9d501c247708b [2022-02-20 18:32:01,165 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:32:01,166 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:32:01,167 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:32:01,167 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:32:01,174 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:32:01,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:32:01" (1/1) ... [2022-02-20 18:32:01,179 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4db6b75f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:32:01, skipping insertion in model container [2022-02-20 18:32:01,179 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:32:01" (1/1) ... [2022-02-20 18:32:01,183 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:32:01,213 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:32:01,427 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.UNBOUNDED.pals.c[14509,14522] [2022-02-20 18:32:01,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:32:01,434 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:32:01,475 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.UNBOUNDED.pals.c[14509,14522] [2022-02-20 18:32:01,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:32:01,485 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:32:01,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:32:01 WrapperNode [2022-02-20 18:32:01,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:32:01,486 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:32:01,486 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:32:01,487 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:32:01,491 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:01" (1/1) ... [2022-02-20 18:32:01,498 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:01" (1/1) ... [2022-02-20 18:32:01,531 INFO L137 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 479 [2022-02-20 18:32:01,531 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:32:01,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:32:01,532 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:32:01,532 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:32:01,540 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:01" (1/1) ... [2022-02-20 18:32:01,540 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:01" (1/1) ... [2022-02-20 18:32:01,543 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:01" (1/1) ... [2022-02-20 18:32:01,543 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:01" (1/1) ... [2022-02-20 18:32:01,549 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:01" (1/1) ... [2022-02-20 18:32:01,555 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:01" (1/1) ... [2022-02-20 18:32:01,557 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:01" (1/1) ... [2022-02-20 18:32:01,560 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:32:01,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:32:01,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:32:01,560 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:32:01,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:32:01" (1/1) ... [2022-02-20 18:32:01,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:32:01,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:32:01,600 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:01,604 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:01,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:32:01,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:32:01,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:32:01,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:32:01,720 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:32:01,730 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:32:02,249 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:32:02,255 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:32:02,255 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:32:02,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:32:02 BoogieIcfgContainer [2022-02-20 18:32:02,256 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:32:02,258 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:32:02,258 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:32:02,261 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:32:02,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:32:01" (1/3) ... [2022-02-20 18:32:02,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ae819a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:32:02, skipping insertion in model container [2022-02-20 18:32:02,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:32:01" (2/3) ... [2022-02-20 18:32:02,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ae819a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:32:02, skipping insertion in model container [2022-02-20 18:32:02,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:32:02" (3/3) ... [2022-02-20 18:32:02,265 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c [2022-02-20 18:32:02,269 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:32:02,269 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:32:02,305 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:32:02,313 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:02,313 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:32:02,336 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 147 states have (on average 1.748299319727891) internal successors, (257), 148 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call 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,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:32:02,344 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:02,345 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,346 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:02,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:02,350 INFO L85 PathProgramCache]: Analyzing trace with hash -812713456, now seen corresponding path program 1 times [2022-02-20 18:32:02,356 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:02,357 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14236362] [2022-02-20 18:32:02,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:02,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:02,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {152#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; {152#true} is VALID [2022-02-20 18:32:02,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {152#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_~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;~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;~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;~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; {152#true} is VALID [2022-02-20 18:32:02,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {152#true} is VALID [2022-02-20 18:32:02,582 INFO L290 TraceCheckUtils]: 3: Hoare triple {152#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {152#true} is VALID [2022-02-20 18:32:02,582 INFO L290 TraceCheckUtils]: 4: Hoare triple {152#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {152#true} is VALID [2022-02-20 18:32:02,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {152#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {152#true} is VALID [2022-02-20 18:32:02,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {152#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {152#true} is VALID [2022-02-20 18:32:02,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {152#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {152#true} is VALID [2022-02-20 18:32:02,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {152#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {152#true} is VALID [2022-02-20 18:32:02,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {152#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {152#true} is VALID [2022-02-20 18:32:02,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {152#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {152#true} is VALID [2022-02-20 18:32:02,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {152#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {152#true} is VALID [2022-02-20 18:32:02,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {152#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {152#true} is VALID [2022-02-20 18:32:02,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {152#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {152#true} is VALID [2022-02-20 18:32:02,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {152#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; {152#true} is VALID [2022-02-20 18:32:02,589 INFO L290 TraceCheckUtils]: 15: Hoare triple {152#true} init_#res#1 := init_~tmp___5~0#1; {152#true} is VALID [2022-02-20 18:32:02,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {152#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; {152#true} is VALID [2022-02-20 18:32:02,589 INFO L290 TraceCheckUtils]: 17: Hoare triple {152#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {153#false} is VALID [2022-02-20 18:32:02,590 INFO L290 TraceCheckUtils]: 18: Hoare triple {153#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; {153#false} is VALID [2022-02-20 18:32:02,612 INFO L290 TraceCheckUtils]: 19: Hoare triple {153#false} assume !false;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; {153#false} is VALID [2022-02-20 18:32:02,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {153#false} assume !(0 != ~mode1~0 % 256); {153#false} is VALID [2022-02-20 18:32:02,612 INFO L290 TraceCheckUtils]: 21: Hoare triple {153#false} assume !(~r1~0 % 256 < 2); {153#false} is VALID [2022-02-20 18:32:02,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {153#false} ~mode1~0 := 1; {153#false} is VALID [2022-02-20 18:32:02,613 INFO L290 TraceCheckUtils]: 23: Hoare triple {153#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; {153#false} is VALID [2022-02-20 18:32:02,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {153#false} assume !(0 != ~mode2~0 % 256); {153#false} is VALID [2022-02-20 18:32:02,613 INFO L290 TraceCheckUtils]: 25: Hoare triple {153#false} assume !(~r2~0 % 256 < 2); {153#false} is VALID [2022-02-20 18:32:02,613 INFO L290 TraceCheckUtils]: 26: Hoare triple {153#false} ~mode2~0 := 1; {153#false} is VALID [2022-02-20 18:32:02,614 INFO L290 TraceCheckUtils]: 27: Hoare triple {153#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; {153#false} is VALID [2022-02-20 18:32:02,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {153#false} assume !(0 != ~mode3~0 % 256); {153#false} is VALID [2022-02-20 18:32:02,614 INFO L290 TraceCheckUtils]: 29: Hoare triple {153#false} assume !(~r3~0 % 256 < 2); {153#false} is VALID [2022-02-20 18:32:02,614 INFO L290 TraceCheckUtils]: 30: Hoare triple {153#false} ~mode3~0 := 1; {153#false} is VALID [2022-02-20 18:32:02,615 INFO L290 TraceCheckUtils]: 31: Hoare triple {153#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; {153#false} is VALID [2022-02-20 18:32:02,615 INFO L290 TraceCheckUtils]: 32: Hoare triple {153#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {153#false} is VALID [2022-02-20 18:32:02,615 INFO L290 TraceCheckUtils]: 33: Hoare triple {153#false} check_#res#1 := check_~tmp~1#1; {153#false} is VALID [2022-02-20 18:32:02,615 INFO L290 TraceCheckUtils]: 34: Hoare triple {153#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; {153#false} is VALID [2022-02-20 18:32:02,615 INFO L290 TraceCheckUtils]: 35: Hoare triple {153#false} assume 0 == assert_~arg#1 % 256; {153#false} is VALID [2022-02-20 18:32:02,616 INFO L290 TraceCheckUtils]: 36: Hoare triple {153#false} assume !false; {153#false} is VALID [2022-02-20 18:32:02,617 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,617 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:02,617 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14236362] [2022-02-20 18:32:02,618 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14236362] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:02,618 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:02,618 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:32:02,619 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752001259] [2022-02-20 18:32:02,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:02,623 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:02,624 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:02,627 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:02,658 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,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:32:02,659 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:02,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:32:02,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:32:02,684 INFO L87 Difference]: Start difference. First operand has 149 states, 147 states have (on average 1.748299319727891) internal successors, (257), 148 states have internal predecessors, (257), 0 states have call successors, (0), 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:02,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:02,844 INFO L93 Difference]: Finished difference Result 235 states and 403 transitions. [2022-02-20 18:32:02,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:32:02,844 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:02,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:02,845 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:02,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 403 transitions. [2022-02-20 18:32:02,851 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:02,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 403 transitions. [2022-02-20 18:32:02,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 403 transitions. [2022-02-20 18:32:03,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 403 edges. 403 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:03,157 INFO L225 Difference]: With dead ends: 235 [2022-02-20 18:32:03,157 INFO L226 Difference]: Without dead ends: 145 [2022-02-20 18:32:03,159 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:03,163 INFO L933 BasicCegarLoop]: 250 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, 250 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:03,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 250 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:03,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-02-20 18:32:03,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2022-02-20 18:32:03,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:03,188 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand has 145 states, 144 states have (on average 1.7361111111111112) internal successors, (250), 144 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call 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,189 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand has 145 states, 144 states have (on average 1.7361111111111112) internal successors, (250), 144 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call 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,189 INFO L87 Difference]: Start difference. First operand 145 states. Second operand has 145 states, 144 states have (on average 1.7361111111111112) internal successors, (250), 144 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call 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,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:03,195 INFO L93 Difference]: Finished difference Result 145 states and 250 transitions. [2022-02-20 18:32:03,195 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 250 transitions. [2022-02-20 18:32:03,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:03,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:03,196 INFO L74 IsIncluded]: Start isIncluded. First operand has 145 states, 144 states have (on average 1.7361111111111112) internal successors, (250), 144 states have internal predecessors, (250), 0 states have call successors, (0), 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 145 states. [2022-02-20 18:32:03,197 INFO L87 Difference]: Start difference. First operand has 145 states, 144 states have (on average 1.7361111111111112) internal successors, (250), 144 states have internal predecessors, (250), 0 states have call successors, (0), 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 145 states. [2022-02-20 18:32:03,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:03,201 INFO L93 Difference]: Finished difference Result 145 states and 250 transitions. [2022-02-20 18:32:03,202 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 250 transitions. [2022-02-20 18:32:03,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:03,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:03,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:03,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:03,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.7361111111111112) internal successors, (250), 144 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call 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,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 250 transitions. [2022-02-20 18:32:03,208 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 250 transitions. Word has length 37 [2022-02-20 18:32:03,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:03,209 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 250 transitions. [2022-02-20 18:32:03,209 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:03,209 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 250 transitions. [2022-02-20 18:32:03,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:32:03,210 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:03,210 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:03,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:32:03,211 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:03,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:03,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1630361906, now seen corresponding path program 1 times [2022-02-20 18:32:03,212 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:03,212 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501501960] [2022-02-20 18:32:03,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:03,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:03,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {853#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; {853#true} is VALID [2022-02-20 18:32:03,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {853#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_~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;~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;~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;~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; {853#true} is VALID [2022-02-20 18:32:03,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {853#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {853#true} is VALID [2022-02-20 18:32:03,290 INFO L290 TraceCheckUtils]: 3: Hoare triple {853#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {853#true} is VALID [2022-02-20 18:32:03,290 INFO L290 TraceCheckUtils]: 4: Hoare triple {853#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {853#true} is VALID [2022-02-20 18:32:03,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {853#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {853#true} is VALID [2022-02-20 18:32:03,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {853#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {853#true} is VALID [2022-02-20 18:32:03,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {853#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {853#true} is VALID [2022-02-20 18:32:03,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {853#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {853#true} is VALID [2022-02-20 18:32:03,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {853#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {853#true} is VALID [2022-02-20 18:32:03,291 INFO L290 TraceCheckUtils]: 10: Hoare triple {853#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {853#true} is VALID [2022-02-20 18:32:03,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {853#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {853#true} is VALID [2022-02-20 18:32:03,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {853#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {853#true} is VALID [2022-02-20 18:32:03,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {853#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {853#true} is VALID [2022-02-20 18:32:03,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {853#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; {855#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} is VALID [2022-02-20 18:32:03,293 INFO L290 TraceCheckUtils]: 15: Hoare triple {855#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} init_#res#1 := init_~tmp___5~0#1; {856#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:32:03,293 INFO L290 TraceCheckUtils]: 16: Hoare triple {856#(= |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; {857#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 18:32:03,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {857#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {854#false} is VALID [2022-02-20 18:32:03,294 INFO L290 TraceCheckUtils]: 18: Hoare triple {854#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; {854#false} is VALID [2022-02-20 18:32:03,294 INFO L290 TraceCheckUtils]: 19: Hoare triple {854#false} assume !false;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; {854#false} is VALID [2022-02-20 18:32:03,294 INFO L290 TraceCheckUtils]: 20: Hoare triple {854#false} assume !(0 != ~mode1~0 % 256); {854#false} is VALID [2022-02-20 18:32:03,295 INFO L290 TraceCheckUtils]: 21: Hoare triple {854#false} assume !(~r1~0 % 256 < 2); {854#false} is VALID [2022-02-20 18:32:03,295 INFO L290 TraceCheckUtils]: 22: Hoare triple {854#false} ~mode1~0 := 1; {854#false} is VALID [2022-02-20 18:32:03,295 INFO L290 TraceCheckUtils]: 23: Hoare triple {854#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; {854#false} is VALID [2022-02-20 18:32:03,295 INFO L290 TraceCheckUtils]: 24: Hoare triple {854#false} assume !(0 != ~mode2~0 % 256); {854#false} is VALID [2022-02-20 18:32:03,295 INFO L290 TraceCheckUtils]: 25: Hoare triple {854#false} assume !(~r2~0 % 256 < 2); {854#false} is VALID [2022-02-20 18:32:03,295 INFO L290 TraceCheckUtils]: 26: Hoare triple {854#false} ~mode2~0 := 1; {854#false} is VALID [2022-02-20 18:32:03,296 INFO L290 TraceCheckUtils]: 27: Hoare triple {854#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; {854#false} is VALID [2022-02-20 18:32:03,296 INFO L290 TraceCheckUtils]: 28: Hoare triple {854#false} assume !(0 != ~mode3~0 % 256); {854#false} is VALID [2022-02-20 18:32:03,296 INFO L290 TraceCheckUtils]: 29: Hoare triple {854#false} assume !(~r3~0 % 256 < 2); {854#false} is VALID [2022-02-20 18:32:03,296 INFO L290 TraceCheckUtils]: 30: Hoare triple {854#false} ~mode3~0 := 1; {854#false} is VALID [2022-02-20 18:32:03,296 INFO L290 TraceCheckUtils]: 31: Hoare triple {854#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; {854#false} is VALID [2022-02-20 18:32:03,297 INFO L290 TraceCheckUtils]: 32: Hoare triple {854#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {854#false} is VALID [2022-02-20 18:32:03,297 INFO L290 TraceCheckUtils]: 33: Hoare triple {854#false} check_#res#1 := check_~tmp~1#1; {854#false} is VALID [2022-02-20 18:32:03,297 INFO L290 TraceCheckUtils]: 34: Hoare triple {854#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; {854#false} is VALID [2022-02-20 18:32:03,297 INFO L290 TraceCheckUtils]: 35: Hoare triple {854#false} assume 0 == assert_~arg#1 % 256; {854#false} is VALID [2022-02-20 18:32:03,297 INFO L290 TraceCheckUtils]: 36: Hoare triple {854#false} assume !false; {854#false} is VALID [2022-02-20 18:32:03,298 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,298 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:03,298 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501501960] [2022-02-20 18:32:03,298 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501501960] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:03,298 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:03,298 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:32:03,299 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872823874] [2022-02-20 18:32:03,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:03,300 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:03,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:03,300 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:03,323 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:03,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:32:03,324 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:03,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:32:03,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:32:03,324 INFO L87 Difference]: Start difference. First operand 145 states and 250 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:03,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:03,733 INFO L93 Difference]: Finished difference Result 234 states and 396 transitions. [2022-02-20 18:32:03,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:32:03,734 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:03,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:03,734 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:03,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 396 transitions. [2022-02-20 18:32:03,738 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:03,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 396 transitions. [2022-02-20 18:32:03,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 396 transitions. [2022-02-20 18:32:04,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 396 edges. 396 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:04,015 INFO L225 Difference]: With dead ends: 234 [2022-02-20 18:32:04,015 INFO L226 Difference]: Without dead ends: 145 [2022-02-20 18:32:04,016 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:04,017 INFO L933 BasicCegarLoop]: 248 mSDtfsCounter, 3 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 959 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:04,017 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 959 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:04,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-02-20 18:32:04,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2022-02-20 18:32:04,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:04,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand has 145 states, 144 states have (on average 1.5277777777777777) internal successors, (220), 144 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call 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,022 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand has 145 states, 144 states have (on average 1.5277777777777777) internal successors, (220), 144 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call 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,023 INFO L87 Difference]: Start difference. First operand 145 states. Second operand has 145 states, 144 states have (on average 1.5277777777777777) internal successors, (220), 144 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call 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,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:04,039 INFO L93 Difference]: Finished difference Result 145 states and 220 transitions. [2022-02-20 18:32:04,039 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 220 transitions. [2022-02-20 18:32:04,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:04,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:04,041 INFO L74 IsIncluded]: Start isIncluded. First operand has 145 states, 144 states have (on average 1.5277777777777777) internal successors, (220), 144 states have internal predecessors, (220), 0 states have call successors, (0), 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 145 states. [2022-02-20 18:32:04,041 INFO L87 Difference]: Start difference. First operand has 145 states, 144 states have (on average 1.5277777777777777) internal successors, (220), 144 states have internal predecessors, (220), 0 states have call successors, (0), 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 145 states. [2022-02-20 18:32:04,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:04,045 INFO L93 Difference]: Finished difference Result 145 states and 220 transitions. [2022-02-20 18:32:04,045 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 220 transitions. [2022-02-20 18:32:04,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:04,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:04,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:04,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:04,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.5277777777777777) internal successors, (220), 144 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call 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,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 220 transitions. [2022-02-20 18:32:04,050 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 220 transitions. Word has length 37 [2022-02-20 18:32:04,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:04,050 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 220 transitions. [2022-02-20 18:32:04,050 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:04,050 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 220 transitions. [2022-02-20 18:32:04,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:32:04,056 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:04,057 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:04,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:32:04,057 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:04,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:04,058 INFO L85 PathProgramCache]: Analyzing trace with hash 190573204, now seen corresponding path program 1 times [2022-02-20 18:32:04,058 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:04,058 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638193214] [2022-02-20 18:32:04,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:04,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:04,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:04,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {1560#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; {1560#true} is VALID [2022-02-20 18:32:04,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {1560#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_~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;~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;~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;~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; {1560#true} is VALID [2022-02-20 18:32:04,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {1560#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {1560#true} is VALID [2022-02-20 18:32:04,192 INFO L290 TraceCheckUtils]: 3: Hoare triple {1560#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {1560#true} is VALID [2022-02-20 18:32:04,192 INFO L290 TraceCheckUtils]: 4: Hoare triple {1560#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {1560#true} is VALID [2022-02-20 18:32:04,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {1560#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {1560#true} is VALID [2022-02-20 18:32:04,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {1560#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {1560#true} is VALID [2022-02-20 18:32:04,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {1560#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {1560#true} is VALID [2022-02-20 18:32:04,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {1560#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {1560#true} is VALID [2022-02-20 18:32:04,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {1560#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {1560#true} is VALID [2022-02-20 18:32:04,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {1560#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {1560#true} is VALID [2022-02-20 18:32:04,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {1560#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {1560#true} is VALID [2022-02-20 18:32:04,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {1560#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {1560#true} is VALID [2022-02-20 18:32:04,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {1560#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {1560#true} is VALID [2022-02-20 18:32:04,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {1560#true} assume ~id1~0 != ~id2~0; {1560#true} is VALID [2022-02-20 18:32:04,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {1560#true} assume ~id1~0 != ~id3~0; {1560#true} is VALID [2022-02-20 18:32:04,195 INFO L290 TraceCheckUtils]: 16: Hoare triple {1560#true} assume ~id2~0 != ~id3~0; {1560#true} is VALID [2022-02-20 18:32:04,195 INFO L290 TraceCheckUtils]: 17: Hoare triple {1560#true} assume ~id1~0 >= 0; {1560#true} is VALID [2022-02-20 18:32:04,195 INFO L290 TraceCheckUtils]: 18: Hoare triple {1560#true} assume ~id2~0 >= 0; {1560#true} is VALID [2022-02-20 18:32:04,195 INFO L290 TraceCheckUtils]: 19: Hoare triple {1560#true} assume ~id3~0 >= 0; {1560#true} is VALID [2022-02-20 18:32:04,196 INFO L290 TraceCheckUtils]: 20: Hoare triple {1560#true} assume 0 == ~r1~0 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:04,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~r2~0 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:04,197 INFO L290 TraceCheckUtils]: 22: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~r3~0 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:04,197 INFO L290 TraceCheckUtils]: 23: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r122~0#1 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:04,198 INFO L290 TraceCheckUtils]: 24: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r132~0#1 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:04,198 INFO L290 TraceCheckUtils]: 25: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r212~0#1 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:04,198 INFO L290 TraceCheckUtils]: 26: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r232~0#1 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:04,199 INFO L290 TraceCheckUtils]: 27: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r312~0#1 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:04,199 INFO L290 TraceCheckUtils]: 28: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r322~0#1 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:04,200 INFO L290 TraceCheckUtils]: 29: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max1~0 == ~id1~0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:04,200 INFO L290 TraceCheckUtils]: 30: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max2~0 == ~id2~0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:04,202 INFO L290 TraceCheckUtils]: 31: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max3~0 == ~id3~0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:04,203 INFO L290 TraceCheckUtils]: 32: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:04,203 INFO L290 TraceCheckUtils]: 33: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:04,204 INFO L290 TraceCheckUtils]: 34: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:04,204 INFO L290 TraceCheckUtils]: 35: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl1~0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:04,205 INFO L290 TraceCheckUtils]: 36: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl2~0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:04,206 INFO L290 TraceCheckUtils]: 37: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl3~0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:04,206 INFO L290 TraceCheckUtils]: 38: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:04,207 INFO L290 TraceCheckUtils]: 39: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:04,208 INFO L290 TraceCheckUtils]: 40: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:04,211 INFO L290 TraceCheckUtils]: 41: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != ~newmax1~0 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:04,221 INFO L290 TraceCheckUtils]: 42: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != ~newmax2~0 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:04,222 INFO L290 TraceCheckUtils]: 43: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:04,223 INFO L290 TraceCheckUtils]: 44: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} init_#res#1 := init_~tmp___5~0#1; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:04,223 INFO L290 TraceCheckUtils]: 45: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} 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; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:04,223 INFO L290 TraceCheckUtils]: 46: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == assume_abort_if_not_~cond#1); {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:04,224 INFO L290 TraceCheckUtils]: 47: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} 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; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:04,224 INFO L290 TraceCheckUtils]: 48: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !false;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; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:04,224 INFO L290 TraceCheckUtils]: 49: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode1~0 % 256); {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:04,225 INFO L290 TraceCheckUtils]: 50: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~r1~0 % 256 < 2); {1561#false} is VALID [2022-02-20 18:32:04,225 INFO L290 TraceCheckUtils]: 51: Hoare triple {1561#false} ~mode1~0 := 1; {1561#false} is VALID [2022-02-20 18:32:04,225 INFO L290 TraceCheckUtils]: 52: Hoare triple {1561#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; {1561#false} is VALID [2022-02-20 18:32:04,225 INFO L290 TraceCheckUtils]: 53: Hoare triple {1561#false} assume !(0 != ~mode2~0 % 256); {1561#false} is VALID [2022-02-20 18:32:04,226 INFO L290 TraceCheckUtils]: 54: Hoare triple {1561#false} assume !(~r2~0 % 256 < 2); {1561#false} is VALID [2022-02-20 18:32:04,226 INFO L290 TraceCheckUtils]: 55: Hoare triple {1561#false} ~mode2~0 := 1; {1561#false} is VALID [2022-02-20 18:32:04,226 INFO L290 TraceCheckUtils]: 56: Hoare triple {1561#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; {1561#false} is VALID [2022-02-20 18:32:04,226 INFO L290 TraceCheckUtils]: 57: Hoare triple {1561#false} assume !(0 != ~mode3~0 % 256); {1561#false} is VALID [2022-02-20 18:32:04,226 INFO L290 TraceCheckUtils]: 58: Hoare triple {1561#false} assume !(~r3~0 % 256 < 2); {1561#false} is VALID [2022-02-20 18:32:04,226 INFO L290 TraceCheckUtils]: 59: Hoare triple {1561#false} ~mode3~0 := 1; {1561#false} is VALID [2022-02-20 18:32:04,227 INFO L290 TraceCheckUtils]: 60: Hoare triple {1561#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; {1561#false} is VALID [2022-02-20 18:32:04,227 INFO L290 TraceCheckUtils]: 61: Hoare triple {1561#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {1561#false} is VALID [2022-02-20 18:32:04,227 INFO L290 TraceCheckUtils]: 62: Hoare triple {1561#false} check_#res#1 := check_~tmp~1#1; {1561#false} is VALID [2022-02-20 18:32:04,227 INFO L290 TraceCheckUtils]: 63: Hoare triple {1561#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; {1561#false} is VALID [2022-02-20 18:32:04,227 INFO L290 TraceCheckUtils]: 64: Hoare triple {1561#false} assume 0 == assert_~arg#1 % 256; {1561#false} is VALID [2022-02-20 18:32:04,227 INFO L290 TraceCheckUtils]: 65: Hoare triple {1561#false} assume !false; {1561#false} is VALID [2022-02-20 18:32:04,228 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,228 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:04,228 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638193214] [2022-02-20 18:32:04,229 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638193214] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:04,229 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:04,229 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:32:04,232 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396675795] [2022-02-20 18:32:04,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:04,233 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:04,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:04,233 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:04,268 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:04,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:32:04,268 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:04,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:32:04,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:32:04,269 INFO L87 Difference]: Start difference. First operand 145 states and 220 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:04,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:04,477 INFO L93 Difference]: Finished difference Result 305 states and 486 transitions. [2022-02-20 18:32:04,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:32:04,477 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:04,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:04,478 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:04,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 486 transitions. [2022-02-20 18:32:04,481 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:04,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 486 transitions. [2022-02-20 18:32:04,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 486 transitions. [2022-02-20 18:32:04,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 486 edges. 486 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:04,775 INFO L225 Difference]: With dead ends: 305 [2022-02-20 18:32:04,775 INFO L226 Difference]: Without dead ends: 220 [2022-02-20 18:32:04,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:32:04,776 INFO L933 BasicCegarLoop]: 213 mSDtfsCounter, 115 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:32:04,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 388 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:32:04,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-02-20 18:32:04,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2022-02-20 18:32:04,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:04,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 220 states. Second operand has 217 states, 216 states have (on average 1.5555555555555556) internal successors, (336), 216 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call 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,797 INFO L74 IsIncluded]: Start isIncluded. First operand 220 states. Second operand has 217 states, 216 states have (on average 1.5555555555555556) internal successors, (336), 216 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call 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,798 INFO L87 Difference]: Start difference. First operand 220 states. Second operand has 217 states, 216 states have (on average 1.5555555555555556) internal successors, (336), 216 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call 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,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:04,802 INFO L93 Difference]: Finished difference Result 220 states and 338 transitions. [2022-02-20 18:32:04,802 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 338 transitions. [2022-02-20 18:32:04,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:04,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:04,804 INFO L74 IsIncluded]: Start isIncluded. First operand has 217 states, 216 states have (on average 1.5555555555555556) internal successors, (336), 216 states have internal predecessors, (336), 0 states have call successors, (0), 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 220 states. [2022-02-20 18:32:04,804 INFO L87 Difference]: Start difference. First operand has 217 states, 216 states have (on average 1.5555555555555556) internal successors, (336), 216 states have internal predecessors, (336), 0 states have call successors, (0), 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 220 states. [2022-02-20 18:32:04,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:04,809 INFO L93 Difference]: Finished difference Result 220 states and 338 transitions. [2022-02-20 18:32:04,809 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 338 transitions. [2022-02-20 18:32:04,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:04,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:04,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:04,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:04,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.5555555555555556) internal successors, (336), 216 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call 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,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 336 transitions. [2022-02-20 18:32:04,816 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 336 transitions. Word has length 66 [2022-02-20 18:32:04,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:04,816 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 336 transitions. [2022-02-20 18:32:04,816 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,816 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 336 transitions. [2022-02-20 18:32:04,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 18:32:04,818 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:04,818 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,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:32:04,818 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:04,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:04,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1527919177, now seen corresponding path program 1 times [2022-02-20 18:32:04,819 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:04,819 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102877523] [2022-02-20 18:32:04,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:04,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:04,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {2569#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; {2569#true} is VALID [2022-02-20 18:32:04,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {2569#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_~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;~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;~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;~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; {2569#true} is VALID [2022-02-20 18:32:04,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {2569#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {2569#true} is VALID [2022-02-20 18:32:04,901 INFO L290 TraceCheckUtils]: 3: Hoare triple {2569#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {2569#true} is VALID [2022-02-20 18:32:04,901 INFO L290 TraceCheckUtils]: 4: Hoare triple {2569#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {2569#true} is VALID [2022-02-20 18:32:04,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {2569#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {2569#true} is VALID [2022-02-20 18:32:04,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {2569#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {2569#true} is VALID [2022-02-20 18:32:04,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {2569#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {2569#true} is VALID [2022-02-20 18:32:04,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {2569#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {2569#true} is VALID [2022-02-20 18:32:04,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {2569#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {2569#true} is VALID [2022-02-20 18:32:04,901 INFO L290 TraceCheckUtils]: 10: Hoare triple {2569#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {2569#true} is VALID [2022-02-20 18:32:04,901 INFO L290 TraceCheckUtils]: 11: Hoare triple {2569#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {2569#true} is VALID [2022-02-20 18:32:04,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {2569#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {2569#true} is VALID [2022-02-20 18:32:04,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {2569#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {2569#true} is VALID [2022-02-20 18:32:04,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {2569#true} assume ~id1~0 != ~id2~0; {2569#true} is VALID [2022-02-20 18:32:04,902 INFO L290 TraceCheckUtils]: 15: Hoare triple {2569#true} assume ~id1~0 != ~id3~0; {2569#true} is VALID [2022-02-20 18:32:04,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {2569#true} assume ~id2~0 != ~id3~0; {2569#true} is VALID [2022-02-20 18:32:04,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {2569#true} assume ~id1~0 >= 0; {2569#true} is VALID [2022-02-20 18:32:04,902 INFO L290 TraceCheckUtils]: 18: Hoare triple {2569#true} assume ~id2~0 >= 0; {2569#true} is VALID [2022-02-20 18:32:04,902 INFO L290 TraceCheckUtils]: 19: Hoare triple {2569#true} assume ~id3~0 >= 0; {2569#true} is VALID [2022-02-20 18:32:04,902 INFO L290 TraceCheckUtils]: 20: Hoare triple {2569#true} assume 0 == ~r1~0 % 256; {2569#true} is VALID [2022-02-20 18:32:04,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {2569#true} assume 0 == ~r2~0 % 256; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:04,903 INFO L290 TraceCheckUtils]: 22: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~r3~0 % 256; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:04,904 INFO L290 TraceCheckUtils]: 23: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r122~0#1 % 256; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:04,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r132~0#1 % 256; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:04,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r212~0#1 % 256; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:04,905 INFO L290 TraceCheckUtils]: 26: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r232~0#1 % 256; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:04,905 INFO L290 TraceCheckUtils]: 27: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r312~0#1 % 256; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:04,905 INFO L290 TraceCheckUtils]: 28: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r322~0#1 % 256; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:04,905 INFO L290 TraceCheckUtils]: 29: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max1~0 == ~id1~0; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:04,906 INFO L290 TraceCheckUtils]: 30: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max2~0 == ~id2~0; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:04,906 INFO L290 TraceCheckUtils]: 31: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max3~0 == ~id3~0; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:04,906 INFO L290 TraceCheckUtils]: 32: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st1~0; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:04,906 INFO L290 TraceCheckUtils]: 33: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st2~0; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:04,907 INFO L290 TraceCheckUtils]: 34: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st3~0; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:04,908 INFO L290 TraceCheckUtils]: 35: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl1~0; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:04,908 INFO L290 TraceCheckUtils]: 36: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl2~0; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:04,908 INFO L290 TraceCheckUtils]: 37: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl3~0; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:04,908 INFO L290 TraceCheckUtils]: 38: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode1~0 % 256; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:04,909 INFO L290 TraceCheckUtils]: 39: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode2~0 % 256; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:04,909 INFO L290 TraceCheckUtils]: 40: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode3~0 % 256; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:04,909 INFO L290 TraceCheckUtils]: 41: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != ~newmax1~0 % 256; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:04,909 INFO L290 TraceCheckUtils]: 42: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != ~newmax2~0 % 256; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:04,910 INFO L290 TraceCheckUtils]: 43: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:04,910 INFO L290 TraceCheckUtils]: 44: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} init_#res#1 := init_~tmp___5~0#1; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:04,910 INFO L290 TraceCheckUtils]: 45: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} 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; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:04,910 INFO L290 TraceCheckUtils]: 46: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == assume_abort_if_not_~cond#1); {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:04,911 INFO L290 TraceCheckUtils]: 47: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} 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; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:04,911 INFO L290 TraceCheckUtils]: 48: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !false;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; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:04,911 INFO L290 TraceCheckUtils]: 49: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~mode1~0 % 256); {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:04,912 INFO L290 TraceCheckUtils]: 50: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~r1~0 % 256 < 2; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:04,912 INFO L290 TraceCheckUtils]: 51: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~ep12~0 % 256); {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:04,913 INFO L290 TraceCheckUtils]: 52: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~ep13~0 % 256); {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:04,914 INFO L290 TraceCheckUtils]: 53: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} ~mode1~0 := 1; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:04,914 INFO L290 TraceCheckUtils]: 54: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} 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; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:04,914 INFO L290 TraceCheckUtils]: 55: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~mode2~0 % 256); {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:04,915 INFO L290 TraceCheckUtils]: 56: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(~r2~0 % 256 < 2); {2570#false} is VALID [2022-02-20 18:32:04,915 INFO L290 TraceCheckUtils]: 57: Hoare triple {2570#false} ~mode2~0 := 1; {2570#false} is VALID [2022-02-20 18:32:04,915 INFO L290 TraceCheckUtils]: 58: Hoare triple {2570#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; {2570#false} is VALID [2022-02-20 18:32:04,915 INFO L290 TraceCheckUtils]: 59: Hoare triple {2570#false} assume !(0 != ~mode3~0 % 256); {2570#false} is VALID [2022-02-20 18:32:04,915 INFO L290 TraceCheckUtils]: 60: Hoare triple {2570#false} assume !(~r3~0 % 256 < 2); {2570#false} is VALID [2022-02-20 18:32:04,915 INFO L290 TraceCheckUtils]: 61: Hoare triple {2570#false} ~mode3~0 := 1; {2570#false} is VALID [2022-02-20 18:32:04,917 INFO L290 TraceCheckUtils]: 62: Hoare triple {2570#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; {2570#false} is VALID [2022-02-20 18:32:04,920 INFO L290 TraceCheckUtils]: 63: Hoare triple {2570#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {2570#false} is VALID [2022-02-20 18:32:04,920 INFO L290 TraceCheckUtils]: 64: Hoare triple {2570#false} check_#res#1 := check_~tmp~1#1; {2570#false} is VALID [2022-02-20 18:32:04,920 INFO L290 TraceCheckUtils]: 65: Hoare triple {2570#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; {2570#false} is VALID [2022-02-20 18:32:04,920 INFO L290 TraceCheckUtils]: 66: Hoare triple {2570#false} assume 0 == assert_~arg#1 % 256; {2570#false} is VALID [2022-02-20 18:32:04,920 INFO L290 TraceCheckUtils]: 67: Hoare triple {2570#false} assume !false; {2570#false} is VALID [2022-02-20 18:32:04,921 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,921 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:04,921 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102877523] [2022-02-20 18:32:04,921 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102877523] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:04,921 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:04,922 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:32:04,922 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673743871] [2022-02-20 18:32:04,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:04,922 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,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:04,922 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,961 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,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:32:04,961 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:04,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:32:04,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:32:04,963 INFO L87 Difference]: Start difference. First operand 217 states and 336 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:05,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:05,198 INFO L93 Difference]: Finished difference Result 515 states and 824 transitions. [2022-02-20 18:32:05,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:32:05,199 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:05,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:05,199 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:05,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions. [2022-02-20 18:32:05,212 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:05,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions. [2022-02-20 18:32:05,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 490 transitions. [2022-02-20 18:32:05,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 490 edges. 490 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:05,513 INFO L225 Difference]: With dead ends: 515 [2022-02-20 18:32:05,513 INFO L226 Difference]: Without dead ends: 358 [2022-02-20 18:32:05,513 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,514 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 117 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:32:05,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 401 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:32:05,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-02-20 18:32:05,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 354. [2022-02-20 18:32:05,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:05,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 358 states. Second operand has 354 states, 353 states have (on average 1.5835694050991502) internal successors, (559), 353 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call 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,539 INFO L74 IsIncluded]: Start isIncluded. First operand 358 states. Second operand has 354 states, 353 states have (on average 1.5835694050991502) internal successors, (559), 353 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call 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,539 INFO L87 Difference]: Start difference. First operand 358 states. Second operand has 354 states, 353 states have (on average 1.5835694050991502) internal successors, (559), 353 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call 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,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:05,546 INFO L93 Difference]: Finished difference Result 358 states and 562 transitions. [2022-02-20 18:32:05,546 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 562 transitions. [2022-02-20 18:32:05,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:05,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:05,547 INFO L74 IsIncluded]: Start isIncluded. First operand has 354 states, 353 states have (on average 1.5835694050991502) internal successors, (559), 353 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 358 states. [2022-02-20 18:32:05,548 INFO L87 Difference]: Start difference. First operand has 354 states, 353 states have (on average 1.5835694050991502) internal successors, (559), 353 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 358 states. [2022-02-20 18:32:05,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:05,554 INFO L93 Difference]: Finished difference Result 358 states and 562 transitions. [2022-02-20 18:32:05,554 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 562 transitions. [2022-02-20 18:32:05,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:05,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:05,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:05,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:05,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 1.5835694050991502) internal successors, (559), 353 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call 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,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 559 transitions. [2022-02-20 18:32:05,562 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 559 transitions. Word has length 68 [2022-02-20 18:32:05,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:05,562 INFO L470 AbstractCegarLoop]: Abstraction has 354 states and 559 transitions. [2022-02-20 18:32:05,562 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:05,562 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 559 transitions. [2022-02-20 18:32:05,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 18:32:05,563 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:05,563 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:05,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:32:05,564 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:05,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:05,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1063335298, now seen corresponding path program 1 times [2022-02-20 18:32:05,564 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:05,564 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948667106] [2022-02-20 18:32:05,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:05,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:05,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {4241#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; {4241#true} is VALID [2022-02-20 18:32:05,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {4241#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_~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;~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;~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;~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; {4241#true} is VALID [2022-02-20 18:32:05,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {4241#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {4241#true} is VALID [2022-02-20 18:32:05,652 INFO L290 TraceCheckUtils]: 3: Hoare triple {4241#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {4241#true} is VALID [2022-02-20 18:32:05,652 INFO L290 TraceCheckUtils]: 4: Hoare triple {4241#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {4241#true} is VALID [2022-02-20 18:32:05,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {4241#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {4241#true} is VALID [2022-02-20 18:32:05,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {4241#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {4241#true} is VALID [2022-02-20 18:32:05,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {4241#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {4241#true} is VALID [2022-02-20 18:32:05,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {4241#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {4241#true} is VALID [2022-02-20 18:32:05,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {4241#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {4241#true} is VALID [2022-02-20 18:32:05,652 INFO L290 TraceCheckUtils]: 10: Hoare triple {4241#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {4241#true} is VALID [2022-02-20 18:32:05,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {4241#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {4241#true} is VALID [2022-02-20 18:32:05,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {4241#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {4241#true} is VALID [2022-02-20 18:32:05,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {4241#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {4241#true} is VALID [2022-02-20 18:32:05,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {4241#true} assume ~id1~0 != ~id2~0; {4241#true} is VALID [2022-02-20 18:32:05,653 INFO L290 TraceCheckUtils]: 15: Hoare triple {4241#true} assume ~id1~0 != ~id3~0; {4241#true} is VALID [2022-02-20 18:32:05,653 INFO L290 TraceCheckUtils]: 16: Hoare triple {4241#true} assume ~id2~0 != ~id3~0; {4241#true} is VALID [2022-02-20 18:32:05,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {4241#true} assume ~id1~0 >= 0; {4241#true} is VALID [2022-02-20 18:32:05,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {4241#true} assume ~id2~0 >= 0; {4241#true} is VALID [2022-02-20 18:32:05,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {4241#true} assume ~id3~0 >= 0; {4241#true} is VALID [2022-02-20 18:32:05,653 INFO L290 TraceCheckUtils]: 20: Hoare triple {4241#true} assume 0 == ~r1~0 % 256; {4241#true} is VALID [2022-02-20 18:32:05,653 INFO L290 TraceCheckUtils]: 21: Hoare triple {4241#true} assume 0 == ~r2~0 % 256; {4241#true} is VALID [2022-02-20 18:32:05,653 INFO L290 TraceCheckUtils]: 22: Hoare triple {4241#true} assume 0 == ~r3~0 % 256; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,654 INFO L290 TraceCheckUtils]: 23: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r122~0#1 % 256; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,654 INFO L290 TraceCheckUtils]: 24: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r132~0#1 % 256; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,654 INFO L290 TraceCheckUtils]: 25: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r212~0#1 % 256; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,654 INFO L290 TraceCheckUtils]: 26: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r232~0#1 % 256; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,655 INFO L290 TraceCheckUtils]: 27: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r312~0#1 % 256; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,655 INFO L290 TraceCheckUtils]: 28: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r322~0#1 % 256; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,655 INFO L290 TraceCheckUtils]: 29: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max1~0 == ~id1~0; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,655 INFO L290 TraceCheckUtils]: 30: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max2~0 == ~id2~0; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,656 INFO L290 TraceCheckUtils]: 31: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max3~0 == ~id3~0; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,656 INFO L290 TraceCheckUtils]: 32: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st1~0; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,656 INFO L290 TraceCheckUtils]: 33: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st2~0; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,656 INFO L290 TraceCheckUtils]: 34: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st3~0; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,657 INFO L290 TraceCheckUtils]: 35: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl1~0; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,657 INFO L290 TraceCheckUtils]: 36: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl2~0; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,657 INFO L290 TraceCheckUtils]: 37: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl3~0; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,657 INFO L290 TraceCheckUtils]: 38: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode1~0 % 256; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,658 INFO L290 TraceCheckUtils]: 39: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode2~0 % 256; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,658 INFO L290 TraceCheckUtils]: 40: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode3~0 % 256; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,658 INFO L290 TraceCheckUtils]: 41: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != ~newmax1~0 % 256; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,658 INFO L290 TraceCheckUtils]: 42: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != ~newmax2~0 % 256; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,659 INFO L290 TraceCheckUtils]: 43: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,659 INFO L290 TraceCheckUtils]: 44: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} init_#res#1 := init_~tmp___5~0#1; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,659 INFO L290 TraceCheckUtils]: 45: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} 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; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,659 INFO L290 TraceCheckUtils]: 46: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == assume_abort_if_not_~cond#1); {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,660 INFO L290 TraceCheckUtils]: 47: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} 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; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,660 INFO L290 TraceCheckUtils]: 48: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !false;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; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,660 INFO L290 TraceCheckUtils]: 49: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~mode1~0 % 256); {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,660 INFO L290 TraceCheckUtils]: 50: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~r1~0 % 256 < 2; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,661 INFO L290 TraceCheckUtils]: 51: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep12~0 % 256); {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,661 INFO L290 TraceCheckUtils]: 52: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep13~0 % 256); {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,661 INFO L290 TraceCheckUtils]: 53: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} ~mode1~0 := 1; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,661 INFO L290 TraceCheckUtils]: 54: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} 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; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,662 INFO L290 TraceCheckUtils]: 55: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~mode2~0 % 256); {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,662 INFO L290 TraceCheckUtils]: 56: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~r2~0 % 256 < 2; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,662 INFO L290 TraceCheckUtils]: 57: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep21~0 % 256); {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,662 INFO L290 TraceCheckUtils]: 58: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep23~0 % 256); {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,663 INFO L290 TraceCheckUtils]: 59: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} ~mode2~0 := 1; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,663 INFO L290 TraceCheckUtils]: 60: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} 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; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,663 INFO L290 TraceCheckUtils]: 61: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~mode3~0 % 256); {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:05,664 INFO L290 TraceCheckUtils]: 62: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(~r3~0 % 256 < 2); {4242#false} is VALID [2022-02-20 18:32:05,664 INFO L290 TraceCheckUtils]: 63: Hoare triple {4242#false} ~mode3~0 := 1; {4242#false} is VALID [2022-02-20 18:32:05,664 INFO L290 TraceCheckUtils]: 64: Hoare triple {4242#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; {4242#false} is VALID [2022-02-20 18:32:05,664 INFO L290 TraceCheckUtils]: 65: Hoare triple {4242#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {4242#false} is VALID [2022-02-20 18:32:05,664 INFO L290 TraceCheckUtils]: 66: Hoare triple {4242#false} check_#res#1 := check_~tmp~1#1; {4242#false} is VALID [2022-02-20 18:32:05,664 INFO L290 TraceCheckUtils]: 67: Hoare triple {4242#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; {4242#false} is VALID [2022-02-20 18:32:05,664 INFO L290 TraceCheckUtils]: 68: Hoare triple {4242#false} assume 0 == assert_~arg#1 % 256; {4242#false} is VALID [2022-02-20 18:32:05,664 INFO L290 TraceCheckUtils]: 69: Hoare triple {4242#false} assume !false; {4242#false} is VALID [2022-02-20 18:32:05,664 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,665 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:05,665 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948667106] [2022-02-20 18:32:05,665 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948667106] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:05,665 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:05,665 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:32:05,665 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034340183] [2022-02-20 18:32:05,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:05,665 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,665 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:05,666 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,705 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,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:32:05,706 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:05,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:32:05,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:32:05,706 INFO L87 Difference]: Start difference. First operand 354 states and 559 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:06,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:06,016 INFO L93 Difference]: Finished difference Result 910 states and 1465 transitions. [2022-02-20 18:32:06,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:32:06,016 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:06,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:06,017 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:06,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions. [2022-02-20 18:32:06,019 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:06,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions. [2022-02-20 18:32:06,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 490 transitions. [2022-02-20 18:32:06,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 490 edges. 490 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:06,323 INFO L225 Difference]: With dead ends: 910 [2022-02-20 18:32:06,323 INFO L226 Difference]: Without dead ends: 616 [2022-02-20 18:32:06,324 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:06,325 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 111 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:32:06,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 402 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:32:06,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2022-02-20 18:32:06,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 610. [2022-02-20 18:32:06,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:06,377 INFO L82 GeneralOperation]: Start isEquivalent. First operand 616 states. Second operand has 610 states, 609 states have (on average 1.5944170771756978) internal successors, (971), 609 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call 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:06,378 INFO L74 IsIncluded]: Start isIncluded. First operand 616 states. Second operand has 610 states, 609 states have (on average 1.5944170771756978) internal successors, (971), 609 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call 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:06,379 INFO L87 Difference]: Start difference. First operand 616 states. Second operand has 610 states, 609 states have (on average 1.5944170771756978) internal successors, (971), 609 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call 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:06,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:06,393 INFO L93 Difference]: Finished difference Result 616 states and 976 transitions. [2022-02-20 18:32:06,393 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 976 transitions. [2022-02-20 18:32:06,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:06,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:06,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 610 states, 609 states have (on average 1.5944170771756978) internal successors, (971), 609 states have internal predecessors, (971), 0 states have call successors, (0), 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 616 states. [2022-02-20 18:32:06,396 INFO L87 Difference]: Start difference. First operand has 610 states, 609 states have (on average 1.5944170771756978) internal successors, (971), 609 states have internal predecessors, (971), 0 states have call successors, (0), 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 616 states. [2022-02-20 18:32:06,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:06,411 INFO L93 Difference]: Finished difference Result 616 states and 976 transitions. [2022-02-20 18:32:06,411 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 976 transitions. [2022-02-20 18:32:06,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:06,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:06,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:06,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:06,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 609 states have (on average 1.5944170771756978) internal successors, (971), 609 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call 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:06,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 971 transitions. [2022-02-20 18:32:06,428 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 971 transitions. Word has length 70 [2022-02-20 18:32:06,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:06,428 INFO L470 AbstractCegarLoop]: Abstraction has 610 states and 971 transitions. [2022-02-20 18:32:06,429 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:06,429 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 971 transitions. [2022-02-20 18:32:06,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 18:32:06,429 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:06,429 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:32:06,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:32:06,430 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:06,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:06,430 INFO L85 PathProgramCache]: Analyzing trace with hash 845837107, now seen corresponding path program 1 times [2022-02-20 18:32:06,430 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:06,431 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002002397] [2022-02-20 18:32:06,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:06,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:06,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {7160#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; {7160#true} is VALID [2022-02-20 18:32:06,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {7160#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_~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;~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;~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;~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; {7160#true} is VALID [2022-02-20 18:32:06,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {7160#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {7160#true} is VALID [2022-02-20 18:32:06,480 INFO L290 TraceCheckUtils]: 3: Hoare triple {7160#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {7160#true} is VALID [2022-02-20 18:32:06,480 INFO L290 TraceCheckUtils]: 4: Hoare triple {7160#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {7160#true} is VALID [2022-02-20 18:32:06,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {7160#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {7160#true} is VALID [2022-02-20 18:32:06,480 INFO L290 TraceCheckUtils]: 6: Hoare triple {7160#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {7160#true} is VALID [2022-02-20 18:32:06,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {7160#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {7160#true} is VALID [2022-02-20 18:32:06,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {7160#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {7160#true} is VALID [2022-02-20 18:32:06,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {7160#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {7160#true} is VALID [2022-02-20 18:32:06,481 INFO L290 TraceCheckUtils]: 10: Hoare triple {7160#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {7160#true} is VALID [2022-02-20 18:32:06,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {7160#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {7160#true} is VALID [2022-02-20 18:32:06,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {7160#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {7160#true} is VALID [2022-02-20 18:32:06,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {7160#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {7160#true} is VALID [2022-02-20 18:32:06,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {7160#true} assume ~id1~0 != ~id2~0; {7160#true} is VALID [2022-02-20 18:32:06,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {7160#true} assume ~id1~0 != ~id3~0; {7160#true} is VALID [2022-02-20 18:32:06,481 INFO L290 TraceCheckUtils]: 16: Hoare triple {7160#true} assume ~id2~0 != ~id3~0; {7160#true} is VALID [2022-02-20 18:32:06,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {7160#true} assume ~id1~0 >= 0; {7160#true} is VALID [2022-02-20 18:32:06,482 INFO L290 TraceCheckUtils]: 18: Hoare triple {7160#true} assume ~id2~0 >= 0; {7160#true} is VALID [2022-02-20 18:32:06,482 INFO L290 TraceCheckUtils]: 19: Hoare triple {7160#true} assume ~id3~0 >= 0; {7160#true} is VALID [2022-02-20 18:32:06,482 INFO L290 TraceCheckUtils]: 20: Hoare triple {7160#true} assume 0 == ~r1~0 % 256; {7160#true} is VALID [2022-02-20 18:32:06,482 INFO L290 TraceCheckUtils]: 21: Hoare triple {7160#true} assume 0 == ~r2~0 % 256; {7160#true} is VALID [2022-02-20 18:32:06,482 INFO L290 TraceCheckUtils]: 22: Hoare triple {7160#true} assume 0 == ~r3~0 % 256; {7160#true} is VALID [2022-02-20 18:32:06,482 INFO L290 TraceCheckUtils]: 23: Hoare triple {7160#true} assume 0 != init_~r122~0#1 % 256; {7160#true} is VALID [2022-02-20 18:32:06,482 INFO L290 TraceCheckUtils]: 24: Hoare triple {7160#true} assume 0 != init_~r132~0#1 % 256; {7160#true} is VALID [2022-02-20 18:32:06,482 INFO L290 TraceCheckUtils]: 25: Hoare triple {7160#true} assume 0 != init_~r212~0#1 % 256; {7160#true} is VALID [2022-02-20 18:32:06,483 INFO L290 TraceCheckUtils]: 26: Hoare triple {7160#true} assume 0 != init_~r232~0#1 % 256; {7160#true} is VALID [2022-02-20 18:32:06,483 INFO L290 TraceCheckUtils]: 27: Hoare triple {7160#true} assume 0 != init_~r312~0#1 % 256; {7160#true} is VALID [2022-02-20 18:32:06,483 INFO L290 TraceCheckUtils]: 28: Hoare triple {7160#true} assume 0 != init_~r322~0#1 % 256; {7160#true} is VALID [2022-02-20 18:32:06,483 INFO L290 TraceCheckUtils]: 29: Hoare triple {7160#true} assume ~max1~0 == ~id1~0; {7160#true} is VALID [2022-02-20 18:32:06,483 INFO L290 TraceCheckUtils]: 30: Hoare triple {7160#true} assume ~max2~0 == ~id2~0; {7160#true} is VALID [2022-02-20 18:32:06,483 INFO L290 TraceCheckUtils]: 31: Hoare triple {7160#true} assume ~max3~0 == ~id3~0; {7160#true} is VALID [2022-02-20 18:32:06,484 INFO L290 TraceCheckUtils]: 32: Hoare triple {7160#true} assume 0 == ~st1~0; {7162#(<= ~st1~0 0)} is VALID [2022-02-20 18:32:06,484 INFO L290 TraceCheckUtils]: 33: Hoare triple {7162#(<= ~st1~0 0)} assume 0 == ~st2~0; {7163#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:06,484 INFO L290 TraceCheckUtils]: 34: Hoare triple {7163#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:06,485 INFO L290 TraceCheckUtils]: 35: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl1~0; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:06,485 INFO L290 TraceCheckUtils]: 36: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl2~0; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:06,485 INFO L290 TraceCheckUtils]: 37: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl3~0; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:06,485 INFO L290 TraceCheckUtils]: 38: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:06,486 INFO L290 TraceCheckUtils]: 39: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:06,486 INFO L290 TraceCheckUtils]: 40: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:06,486 INFO L290 TraceCheckUtils]: 41: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~newmax1~0 % 256; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:06,486 INFO L290 TraceCheckUtils]: 42: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~newmax2~0 % 256; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:06,487 INFO L290 TraceCheckUtils]: 43: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:06,487 INFO L290 TraceCheckUtils]: 44: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:06,487 INFO L290 TraceCheckUtils]: 45: Hoare triple {7164#(<= (+ ~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; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:06,487 INFO L290 TraceCheckUtils]: 46: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:06,488 INFO L290 TraceCheckUtils]: 47: Hoare triple {7164#(<= (+ ~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; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:06,488 INFO L290 TraceCheckUtils]: 48: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !false;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; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:06,488 INFO L290 TraceCheckUtils]: 49: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:06,488 INFO L290 TraceCheckUtils]: 50: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 2; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:06,489 INFO L290 TraceCheckUtils]: 51: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep12~0 % 256); {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:06,489 INFO L290 TraceCheckUtils]: 52: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep13~0 % 256); {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:06,489 INFO L290 TraceCheckUtils]: 53: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:06,490 INFO L290 TraceCheckUtils]: 54: Hoare triple {7164#(<= (+ ~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; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:06,490 INFO L290 TraceCheckUtils]: 55: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:06,490 INFO L290 TraceCheckUtils]: 56: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r2~0 % 256 < 2; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:06,490 INFO L290 TraceCheckUtils]: 57: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep21~0 % 256); {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:06,491 INFO L290 TraceCheckUtils]: 58: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep23~0 % 256); {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:06,491 INFO L290 TraceCheckUtils]: 59: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:06,491 INFO L290 TraceCheckUtils]: 60: Hoare triple {7164#(<= (+ ~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; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:06,491 INFO L290 TraceCheckUtils]: 61: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:06,492 INFO L290 TraceCheckUtils]: 62: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r3~0 % 256 < 2; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:06,492 INFO L290 TraceCheckUtils]: 63: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep31~0 % 256); {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:06,492 INFO L290 TraceCheckUtils]: 64: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep32~0 % 256); {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:06,492 INFO L290 TraceCheckUtils]: 65: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:06,493 INFO L290 TraceCheckUtils]: 66: Hoare triple {7164#(<= (+ ~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; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:06,493 INFO L290 TraceCheckUtils]: 67: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {7161#false} is VALID [2022-02-20 18:32:06,493 INFO L290 TraceCheckUtils]: 68: Hoare triple {7161#false} check_#res#1 := check_~tmp~1#1; {7161#false} is VALID [2022-02-20 18:32:06,493 INFO L290 TraceCheckUtils]: 69: Hoare triple {7161#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; {7161#false} is VALID [2022-02-20 18:32:06,494 INFO L290 TraceCheckUtils]: 70: Hoare triple {7161#false} assume 0 == assert_~arg#1 % 256; {7161#false} is VALID [2022-02-20 18:32:06,494 INFO L290 TraceCheckUtils]: 71: Hoare triple {7161#false} assume !false; {7161#false} is VALID [2022-02-20 18:32:06,494 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:06,494 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:06,494 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002002397] [2022-02-20 18:32:06,494 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002002397] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:06,495 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:06,495 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:32:06,495 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513457853] [2022-02-20 18:32:06,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:06,495 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:06,495 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:06,496 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:06,532 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:06,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:32:06,532 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:06,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:32:06,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:32:06,533 INFO L87 Difference]: Start difference. First operand 610 states and 971 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,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:07,791 INFO L93 Difference]: Finished difference Result 2622 states and 4281 transitions. [2022-02-20 18:32:07,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:32:07,792 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,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:07,792 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,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1072 transitions. [2022-02-20 18:32:07,796 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,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1072 transitions. [2022-02-20 18:32:07,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1072 transitions. [2022-02-20 18:32:08,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1072 edges. 1072 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:08,548 INFO L225 Difference]: With dead ends: 2622 [2022-02-20 18:32:08,549 INFO L226 Difference]: Without dead ends: 2072 [2022-02-20 18:32:08,550 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,550 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 936 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:32:08,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [936 Valid, 1286 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:32:08,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2022-02-20 18:32:08,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 1092. [2022-02-20 18:32:08,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:08,737 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2072 states. Second operand has 1092 states, 1091 states have (on average 1.6076993583868011) internal successors, (1754), 1091 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call 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,739 INFO L74 IsIncluded]: Start isIncluded. First operand 2072 states. Second operand has 1092 states, 1091 states have (on average 1.6076993583868011) internal successors, (1754), 1091 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call 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,740 INFO L87 Difference]: Start difference. First operand 2072 states. Second operand has 1092 states, 1091 states have (on average 1.6076993583868011) internal successors, (1754), 1091 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call 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,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:08,868 INFO L93 Difference]: Finished difference Result 2072 states and 3362 transitions. [2022-02-20 18:32:08,868 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 3362 transitions. [2022-02-20 18:32:08,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:08,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:08,873 INFO L74 IsIncluded]: Start isIncluded. First operand has 1092 states, 1091 states have (on average 1.6076993583868011) internal successors, (1754), 1091 states have internal predecessors, (1754), 0 states have call successors, (0), 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 2072 states. [2022-02-20 18:32:08,874 INFO L87 Difference]: Start difference. First operand has 1092 states, 1091 states have (on average 1.6076993583868011) internal successors, (1754), 1091 states have internal predecessors, (1754), 0 states have call successors, (0), 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 2072 states. [2022-02-20 18:32:08,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:08,999 INFO L93 Difference]: Finished difference Result 2072 states and 3362 transitions. [2022-02-20 18:32:08,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 3362 transitions. [2022-02-20 18:32:09,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:09,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:09,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:09,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:09,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1091 states have (on average 1.6076993583868011) internal successors, (1754), 1091 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call 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,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1754 transitions. [2022-02-20 18:32:09,043 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1754 transitions. Word has length 72 [2022-02-20 18:32:09,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:09,044 INFO L470 AbstractCegarLoop]: Abstraction has 1092 states and 1754 transitions. [2022-02-20 18:32:09,044 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:09,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1754 transitions. [2022-02-20 18:32:09,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 18:32:09,045 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:09,045 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,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:32:09,045 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:09,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:09,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1471686026, now seen corresponding path program 1 times [2022-02-20 18:32:09,046 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:09,046 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860505596] [2022-02-20 18:32:09,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:09,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:09,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {15421#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; {15421#true} is VALID [2022-02-20 18:32:09,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {15421#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_~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;~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;~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;~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; {15421#true} is VALID [2022-02-20 18:32:09,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {15421#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {15421#true} is VALID [2022-02-20 18:32:09,113 INFO L290 TraceCheckUtils]: 3: Hoare triple {15421#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {15421#true} is VALID [2022-02-20 18:32:09,114 INFO L290 TraceCheckUtils]: 4: Hoare triple {15421#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {15421#true} is VALID [2022-02-20 18:32:09,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {15421#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {15421#true} is VALID [2022-02-20 18:32:09,114 INFO L290 TraceCheckUtils]: 6: Hoare triple {15421#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {15421#true} is VALID [2022-02-20 18:32:09,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {15421#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {15421#true} is VALID [2022-02-20 18:32:09,114 INFO L290 TraceCheckUtils]: 8: Hoare triple {15421#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {15421#true} is VALID [2022-02-20 18:32:09,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {15421#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {15421#true} is VALID [2022-02-20 18:32:09,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {15421#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {15421#true} is VALID [2022-02-20 18:32:09,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {15421#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {15421#true} is VALID [2022-02-20 18:32:09,115 INFO L290 TraceCheckUtils]: 12: Hoare triple {15421#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {15421#true} is VALID [2022-02-20 18:32:09,115 INFO L290 TraceCheckUtils]: 13: Hoare triple {15421#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {15421#true} is VALID [2022-02-20 18:32:09,115 INFO L290 TraceCheckUtils]: 14: Hoare triple {15421#true} assume ~id1~0 != ~id2~0; {15421#true} is VALID [2022-02-20 18:32:09,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {15421#true} assume ~id1~0 != ~id3~0; {15421#true} is VALID [2022-02-20 18:32:09,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {15421#true} assume ~id2~0 != ~id3~0; {15421#true} is VALID [2022-02-20 18:32:09,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {15421#true} assume ~id1~0 >= 0; {15421#true} is VALID [2022-02-20 18:32:09,115 INFO L290 TraceCheckUtils]: 18: Hoare triple {15421#true} assume ~id2~0 >= 0; {15421#true} is VALID [2022-02-20 18:32:09,116 INFO L290 TraceCheckUtils]: 19: Hoare triple {15421#true} assume ~id3~0 >= 0; {15421#true} is VALID [2022-02-20 18:32:09,116 INFO L290 TraceCheckUtils]: 20: Hoare triple {15421#true} assume 0 == ~r1~0 % 256; {15421#true} is VALID [2022-02-20 18:32:09,119 INFO L290 TraceCheckUtils]: 21: Hoare triple {15421#true} assume 0 == ~r2~0 % 256; {15421#true} is VALID [2022-02-20 18:32:09,120 INFO L290 TraceCheckUtils]: 22: Hoare triple {15421#true} assume 0 == ~r3~0 % 256; {15421#true} is VALID [2022-02-20 18:32:09,120 INFO L290 TraceCheckUtils]: 23: Hoare triple {15421#true} assume 0 != init_~r122~0#1 % 256; {15421#true} is VALID [2022-02-20 18:32:09,121 INFO L290 TraceCheckUtils]: 24: Hoare triple {15421#true} assume 0 != init_~r132~0#1 % 256; {15421#true} is VALID [2022-02-20 18:32:09,121 INFO L290 TraceCheckUtils]: 25: Hoare triple {15421#true} assume 0 != init_~r212~0#1 % 256; {15421#true} is VALID [2022-02-20 18:32:09,121 INFO L290 TraceCheckUtils]: 26: Hoare triple {15421#true} assume 0 != init_~r232~0#1 % 256; {15421#true} is VALID [2022-02-20 18:32:09,122 INFO L290 TraceCheckUtils]: 27: Hoare triple {15421#true} assume 0 != init_~r312~0#1 % 256; {15421#true} is VALID [2022-02-20 18:32:09,122 INFO L290 TraceCheckUtils]: 28: Hoare triple {15421#true} assume 0 != init_~r322~0#1 % 256; {15421#true} is VALID [2022-02-20 18:32:09,122 INFO L290 TraceCheckUtils]: 29: Hoare triple {15421#true} assume ~max1~0 == ~id1~0; {15421#true} is VALID [2022-02-20 18:32:09,122 INFO L290 TraceCheckUtils]: 30: Hoare triple {15421#true} assume ~max2~0 == ~id2~0; {15421#true} is VALID [2022-02-20 18:32:09,123 INFO L290 TraceCheckUtils]: 31: Hoare triple {15421#true} assume ~max3~0 == ~id3~0; {15421#true} is VALID [2022-02-20 18:32:09,123 INFO L290 TraceCheckUtils]: 32: Hoare triple {15421#true} assume 0 == ~st1~0; {15423#(<= ~st1~0 0)} is VALID [2022-02-20 18:32:09,126 INFO L290 TraceCheckUtils]: 33: Hoare triple {15423#(<= ~st1~0 0)} assume 0 == ~st2~0; {15423#(<= ~st1~0 0)} is VALID [2022-02-20 18:32:09,126 INFO L290 TraceCheckUtils]: 34: Hoare triple {15423#(<= ~st1~0 0)} assume 0 == ~st3~0; {15423#(<= ~st1~0 0)} is VALID [2022-02-20 18:32:09,126 INFO L290 TraceCheckUtils]: 35: Hoare triple {15423#(<= ~st1~0 0)} assume 0 == ~nl1~0; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,127 INFO L290 TraceCheckUtils]: 36: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl2~0; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,127 INFO L290 TraceCheckUtils]: 37: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl3~0; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,127 INFO L290 TraceCheckUtils]: 38: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,127 INFO L290 TraceCheckUtils]: 39: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,128 INFO L290 TraceCheckUtils]: 40: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,128 INFO L290 TraceCheckUtils]: 41: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 != ~newmax1~0 % 256; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,128 INFO L290 TraceCheckUtils]: 42: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 != ~newmax2~0 % 256; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,129 INFO L290 TraceCheckUtils]: 43: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,129 INFO L290 TraceCheckUtils]: 44: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,129 INFO L290 TraceCheckUtils]: 45: Hoare triple {15424#(<= (+ ~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; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,129 INFO L290 TraceCheckUtils]: 46: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,130 INFO L290 TraceCheckUtils]: 47: Hoare triple {15424#(<= (+ ~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; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,130 INFO L290 TraceCheckUtils]: 48: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume !false;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; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,130 INFO L290 TraceCheckUtils]: 49: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,130 INFO L290 TraceCheckUtils]: 50: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r1~0 % 256 < 2; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,131 INFO L290 TraceCheckUtils]: 51: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep12~0 % 256); {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,131 INFO L290 TraceCheckUtils]: 52: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep13~0 % 256); {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,131 INFO L290 TraceCheckUtils]: 53: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode1~0 := 1; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,131 INFO L290 TraceCheckUtils]: 54: Hoare triple {15424#(<= (+ ~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; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,132 INFO L290 TraceCheckUtils]: 55: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,132 INFO L290 TraceCheckUtils]: 56: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r2~0 % 256 < 2; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,132 INFO L290 TraceCheckUtils]: 57: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep21~0 % 256); {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,133 INFO L290 TraceCheckUtils]: 58: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep23~0 % 256); {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,133 INFO L290 TraceCheckUtils]: 59: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode2~0 := 1; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,133 INFO L290 TraceCheckUtils]: 60: Hoare triple {15424#(<= (+ ~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; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,133 INFO L290 TraceCheckUtils]: 61: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,134 INFO L290 TraceCheckUtils]: 62: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r3~0 % 256 < 2; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,134 INFO L290 TraceCheckUtils]: 63: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep31~0 % 256); {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,134 INFO L290 TraceCheckUtils]: 64: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep32~0 % 256); {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,134 INFO L290 TraceCheckUtils]: 65: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode3~0 := 1; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,135 INFO L290 TraceCheckUtils]: 66: Hoare triple {15424#(<= (+ ~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; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,135 INFO L290 TraceCheckUtils]: 67: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:09,135 INFO L290 TraceCheckUtils]: 68: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(~st1~0 + ~nl1~0 <= 1);check_~tmp~1#1 := 0; {15422#false} is VALID [2022-02-20 18:32:09,135 INFO L290 TraceCheckUtils]: 69: Hoare triple {15422#false} check_#res#1 := check_~tmp~1#1; {15422#false} is VALID [2022-02-20 18:32:09,136 INFO L290 TraceCheckUtils]: 70: Hoare triple {15422#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; {15422#false} is VALID [2022-02-20 18:32:09,136 INFO L290 TraceCheckUtils]: 71: Hoare triple {15422#false} assume 0 == assert_~arg#1 % 256; {15422#false} is VALID [2022-02-20 18:32:09,136 INFO L290 TraceCheckUtils]: 72: Hoare triple {15422#false} assume !false; {15422#false} is VALID [2022-02-20 18:32:09,138 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,138 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:09,138 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860505596] [2022-02-20 18:32:09,138 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860505596] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:09,138 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:09,138 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:32:09,139 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634591085] [2022-02-20 18:32:09,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:09,140 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,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:09,140 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,178 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,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:32:09,178 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:09,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:32:09,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:32:09,179 INFO L87 Difference]: Start difference. First operand 1092 states and 1754 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,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:10,278 INFO L93 Difference]: Finished difference Result 3182 states and 5186 transitions. [2022-02-20 18:32:10,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:32:10,279 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,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:10,279 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,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 646 transitions. [2022-02-20 18:32:10,281 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,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 646 transitions. [2022-02-20 18:32:10,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 646 transitions. [2022-02-20 18:32:10,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 646 edges. 646 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:10,756 INFO L225 Difference]: With dead ends: 3182 [2022-02-20 18:32:10,756 INFO L226 Difference]: Without dead ends: 2150 [2022-02-20 18:32:10,757 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:10,757 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 413 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:32:10,758 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [413 Valid, 638 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:32:10,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2150 states. [2022-02-20 18:32:11,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2150 to 1612. [2022-02-20 18:32:11,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:11,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2150 states. Second operand has 1612 states, 1611 states have (on average 1.6157666045934203) internal successors, (2603), 1611 states have internal predecessors, (2603), 0 states have call successors, (0), 0 states have call 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,099 INFO L74 IsIncluded]: Start isIncluded. First operand 2150 states. Second operand has 1612 states, 1611 states have (on average 1.6157666045934203) internal successors, (2603), 1611 states have internal predecessors, (2603), 0 states have call successors, (0), 0 states have call 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,101 INFO L87 Difference]: Start difference. First operand 2150 states. Second operand has 1612 states, 1611 states have (on average 1.6157666045934203) internal successors, (2603), 1611 states have internal predecessors, (2603), 0 states have call successors, (0), 0 states have call 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,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:11,229 INFO L93 Difference]: Finished difference Result 2150 states and 3496 transitions. [2022-02-20 18:32:11,229 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 3496 transitions. [2022-02-20 18:32:11,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:11,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:11,234 INFO L74 IsIncluded]: Start isIncluded. First operand has 1612 states, 1611 states have (on average 1.6157666045934203) internal successors, (2603), 1611 states have internal predecessors, (2603), 0 states have call successors, (0), 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 2150 states. [2022-02-20 18:32:11,235 INFO L87 Difference]: Start difference. First operand has 1612 states, 1611 states have (on average 1.6157666045934203) internal successors, (2603), 1611 states have internal predecessors, (2603), 0 states have call successors, (0), 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 2150 states. [2022-02-20 18:32:11,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:11,365 INFO L93 Difference]: Finished difference Result 2150 states and 3496 transitions. [2022-02-20 18:32:11,365 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 3496 transitions. [2022-02-20 18:32:11,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:11,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:11,367 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:11,367 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:11,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1612 states, 1611 states have (on average 1.6157666045934203) internal successors, (2603), 1611 states have internal predecessors, (2603), 0 states have call successors, (0), 0 states have call 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,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 2603 transitions. [2022-02-20 18:32:11,452 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 2603 transitions. Word has length 73 [2022-02-20 18:32:11,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:11,452 INFO L470 AbstractCegarLoop]: Abstraction has 1612 states and 2603 transitions. [2022-02-20 18:32:11,452 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,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2603 transitions. [2022-02-20 18:32:11,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 18:32:11,453 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:11,453 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,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:32:11,453 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:11,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:11,454 INFO L85 PathProgramCache]: Analyzing trace with hash -131454774, now seen corresponding path program 1 times [2022-02-20 18:32:11,454 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:11,454 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865252798] [2022-02-20 18:32:11,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:11,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:11,494 INFO L290 TraceCheckUtils]: 0: Hoare triple {25027#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; {25027#true} is VALID [2022-02-20 18:32:11,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {25027#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_~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;~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;~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;~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; {25027#true} is VALID [2022-02-20 18:32:11,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {25027#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {25027#true} is VALID [2022-02-20 18:32:11,495 INFO L290 TraceCheckUtils]: 3: Hoare triple {25027#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {25027#true} is VALID [2022-02-20 18:32:11,495 INFO L290 TraceCheckUtils]: 4: Hoare triple {25027#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {25027#true} is VALID [2022-02-20 18:32:11,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {25027#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {25027#true} is VALID [2022-02-20 18:32:11,495 INFO L290 TraceCheckUtils]: 6: Hoare triple {25027#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {25027#true} is VALID [2022-02-20 18:32:11,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {25027#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {25027#true} is VALID [2022-02-20 18:32:11,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {25027#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {25027#true} is VALID [2022-02-20 18:32:11,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {25027#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {25027#true} is VALID [2022-02-20 18:32:11,496 INFO L290 TraceCheckUtils]: 10: Hoare triple {25027#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {25027#true} is VALID [2022-02-20 18:32:11,496 INFO L290 TraceCheckUtils]: 11: Hoare triple {25027#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {25027#true} is VALID [2022-02-20 18:32:11,496 INFO L290 TraceCheckUtils]: 12: Hoare triple {25027#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {25027#true} is VALID [2022-02-20 18:32:11,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {25027#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {25027#true} is VALID [2022-02-20 18:32:11,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {25027#true} assume ~id1~0 != ~id2~0; {25027#true} is VALID [2022-02-20 18:32:11,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {25027#true} assume ~id1~0 != ~id3~0; {25027#true} is VALID [2022-02-20 18:32:11,497 INFO L290 TraceCheckUtils]: 16: Hoare triple {25027#true} assume ~id2~0 != ~id3~0; {25027#true} is VALID [2022-02-20 18:32:11,497 INFO L290 TraceCheckUtils]: 17: Hoare triple {25027#true} assume ~id1~0 >= 0; {25027#true} is VALID [2022-02-20 18:32:11,497 INFO L290 TraceCheckUtils]: 18: Hoare triple {25027#true} assume ~id2~0 >= 0; {25027#true} is VALID [2022-02-20 18:32:11,497 INFO L290 TraceCheckUtils]: 19: Hoare triple {25027#true} assume ~id3~0 >= 0; {25027#true} is VALID [2022-02-20 18:32:11,497 INFO L290 TraceCheckUtils]: 20: Hoare triple {25027#true} assume 0 == ~r1~0 % 256; {25027#true} is VALID [2022-02-20 18:32:11,497 INFO L290 TraceCheckUtils]: 21: Hoare triple {25027#true} assume 0 == ~r2~0 % 256; {25027#true} is VALID [2022-02-20 18:32:11,497 INFO L290 TraceCheckUtils]: 22: Hoare triple {25027#true} assume 0 == ~r3~0 % 256; {25027#true} is VALID [2022-02-20 18:32:11,497 INFO L290 TraceCheckUtils]: 23: Hoare triple {25027#true} assume 0 != init_~r122~0#1 % 256; {25027#true} is VALID [2022-02-20 18:32:11,497 INFO L290 TraceCheckUtils]: 24: Hoare triple {25027#true} assume 0 != init_~r132~0#1 % 256; {25027#true} is VALID [2022-02-20 18:32:11,497 INFO L290 TraceCheckUtils]: 25: Hoare triple {25027#true} assume 0 != init_~r212~0#1 % 256; {25027#true} is VALID [2022-02-20 18:32:11,498 INFO L290 TraceCheckUtils]: 26: Hoare triple {25027#true} assume 0 != init_~r232~0#1 % 256; {25027#true} is VALID [2022-02-20 18:32:11,498 INFO L290 TraceCheckUtils]: 27: Hoare triple {25027#true} assume 0 != init_~r312~0#1 % 256; {25027#true} is VALID [2022-02-20 18:32:11,498 INFO L290 TraceCheckUtils]: 28: Hoare triple {25027#true} assume 0 != init_~r322~0#1 % 256; {25027#true} is VALID [2022-02-20 18:32:11,498 INFO L290 TraceCheckUtils]: 29: Hoare triple {25027#true} assume ~max1~0 == ~id1~0; {25027#true} is VALID [2022-02-20 18:32:11,498 INFO L290 TraceCheckUtils]: 30: Hoare triple {25027#true} assume ~max2~0 == ~id2~0; {25027#true} is VALID [2022-02-20 18:32:11,498 INFO L290 TraceCheckUtils]: 31: Hoare triple {25027#true} assume ~max3~0 == ~id3~0; {25027#true} is VALID [2022-02-20 18:32:11,498 INFO L290 TraceCheckUtils]: 32: Hoare triple {25027#true} assume 0 == ~st1~0; {25027#true} is VALID [2022-02-20 18:32:11,499 INFO L290 TraceCheckUtils]: 33: Hoare triple {25027#true} assume 0 == ~st2~0; {25029#(<= ~st2~0 0)} is VALID [2022-02-20 18:32:11,499 INFO L290 TraceCheckUtils]: 34: Hoare triple {25029#(<= ~st2~0 0)} assume 0 == ~st3~0; {25029#(<= ~st2~0 0)} is VALID [2022-02-20 18:32:11,499 INFO L290 TraceCheckUtils]: 35: Hoare triple {25029#(<= ~st2~0 0)} assume 0 == ~nl1~0; {25029#(<= ~st2~0 0)} is VALID [2022-02-20 18:32:11,499 INFO L290 TraceCheckUtils]: 36: Hoare triple {25029#(<= ~st2~0 0)} assume 0 == ~nl2~0; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:11,500 INFO L290 TraceCheckUtils]: 37: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~nl3~0; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:11,500 INFO L290 TraceCheckUtils]: 38: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode1~0 % 256; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:11,500 INFO L290 TraceCheckUtils]: 39: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode2~0 % 256; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:11,501 INFO L290 TraceCheckUtils]: 40: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:11,501 INFO L290 TraceCheckUtils]: 41: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 != ~newmax1~0 % 256; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:11,501 INFO L290 TraceCheckUtils]: 42: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 != ~newmax2~0 % 256; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:11,501 INFO L290 TraceCheckUtils]: 43: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:11,502 INFO L290 TraceCheckUtils]: 44: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} init_#res#1 := init_~tmp___5~0#1; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:11,502 INFO L290 TraceCheckUtils]: 45: Hoare triple {25030#(<= (+ ~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; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:11,502 INFO L290 TraceCheckUtils]: 46: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:11,503 INFO L290 TraceCheckUtils]: 47: Hoare triple {25030#(<= (+ ~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; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:11,503 INFO L290 TraceCheckUtils]: 48: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume !false;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; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:11,503 INFO L290 TraceCheckUtils]: 49: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode1~0 % 256); {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:11,504 INFO L290 TraceCheckUtils]: 50: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r1~0 % 256 < 2; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:11,504 INFO L290 TraceCheckUtils]: 51: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep12~0 % 256); {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:11,504 INFO L290 TraceCheckUtils]: 52: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep13~0 % 256); {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:11,504 INFO L290 TraceCheckUtils]: 53: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode1~0 := 1; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:11,505 INFO L290 TraceCheckUtils]: 54: Hoare triple {25030#(<= (+ ~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; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:11,505 INFO L290 TraceCheckUtils]: 55: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode2~0 % 256); {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:11,505 INFO L290 TraceCheckUtils]: 56: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r2~0 % 256 < 2; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:11,506 INFO L290 TraceCheckUtils]: 57: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep21~0 % 256); {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:11,506 INFO L290 TraceCheckUtils]: 58: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep23~0 % 256); {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:11,506 INFO L290 TraceCheckUtils]: 59: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode2~0 := 1; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:11,506 INFO L290 TraceCheckUtils]: 60: Hoare triple {25030#(<= (+ ~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; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:11,507 INFO L290 TraceCheckUtils]: 61: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode3~0 % 256); {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:11,507 INFO L290 TraceCheckUtils]: 62: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r3~0 % 256 < 2; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:11,507 INFO L290 TraceCheckUtils]: 63: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep31~0 % 256); {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:11,508 INFO L290 TraceCheckUtils]: 64: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep32~0 % 256); {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:11,508 INFO L290 TraceCheckUtils]: 65: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode3~0 := 1; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:11,508 INFO L290 TraceCheckUtils]: 66: Hoare triple {25030#(<= (+ ~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; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:11,509 INFO L290 TraceCheckUtils]: 67: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:11,509 INFO L290 TraceCheckUtils]: 68: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:11,509 INFO L290 TraceCheckUtils]: 69: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(~st2~0 + ~nl2~0 <= 1);check_~tmp~1#1 := 0; {25028#false} is VALID [2022-02-20 18:32:11,509 INFO L290 TraceCheckUtils]: 70: Hoare triple {25028#false} check_#res#1 := check_~tmp~1#1; {25028#false} is VALID [2022-02-20 18:32:11,510 INFO L290 TraceCheckUtils]: 71: Hoare triple {25028#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; {25028#false} is VALID [2022-02-20 18:32:11,510 INFO L290 TraceCheckUtils]: 72: Hoare triple {25028#false} assume 0 == assert_~arg#1 % 256; {25028#false} is VALID [2022-02-20 18:32:11,510 INFO L290 TraceCheckUtils]: 73: Hoare triple {25028#false} assume !false; {25028#false} is VALID [2022-02-20 18:32:11,510 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,510 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:11,510 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865252798] [2022-02-20 18:32:11,510 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865252798] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:11,511 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:11,511 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:32:11,511 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462826539] [2022-02-20 18:32:11,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:11,511 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:11,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:11,512 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:11,552 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,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:32:11,553 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:11,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:32:11,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:32:11,554 INFO L87 Difference]: Start difference. First operand 1612 states and 2603 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:13,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:13,337 INFO L93 Difference]: Finished difference Result 4676 states and 7610 transitions. [2022-02-20 18:32:13,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:32:13,337 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:13,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:13,338 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:13,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 646 transitions. [2022-02-20 18:32:13,340 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:13,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 646 transitions. [2022-02-20 18:32:13,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 646 transitions. [2022-02-20 18:32:13,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 646 edges. 646 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:13,981 INFO L225 Difference]: With dead ends: 4676 [2022-02-20 18:32:13,981 INFO L226 Difference]: Without dead ends: 3124 [2022-02-20 18:32:13,983 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:13,986 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 411 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 724 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:13,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [411 Valid, 724 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:13,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3124 states. [2022-02-20 18:32:14,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3124 to 2356. [2022-02-20 18:32:14,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:14,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3124 states. Second operand has 2356 states, 2355 states have (on average 1.6148619957537156) internal successors, (3803), 2355 states have internal predecessors, (3803), 0 states have call successors, (0), 0 states have call 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,598 INFO L74 IsIncluded]: Start isIncluded. First operand 3124 states. Second operand has 2356 states, 2355 states have (on average 1.6148619957537156) internal successors, (3803), 2355 states have internal predecessors, (3803), 0 states have call successors, (0), 0 states have call 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,600 INFO L87 Difference]: Start difference. First operand 3124 states. Second operand has 2356 states, 2355 states have (on average 1.6148619957537156) internal successors, (3803), 2355 states have internal predecessors, (3803), 0 states have call successors, (0), 0 states have call 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,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:14,893 INFO L93 Difference]: Finished difference Result 3124 states and 5065 transitions. [2022-02-20 18:32:14,893 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 5065 transitions. [2022-02-20 18:32:14,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:14,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:14,900 INFO L74 IsIncluded]: Start isIncluded. First operand has 2356 states, 2355 states have (on average 1.6148619957537156) internal successors, (3803), 2355 states have internal predecessors, (3803), 0 states have call successors, (0), 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 3124 states. [2022-02-20 18:32:14,901 INFO L87 Difference]: Start difference. First operand has 2356 states, 2355 states have (on average 1.6148619957537156) internal successors, (3803), 2355 states have internal predecessors, (3803), 0 states have call successors, (0), 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 3124 states. [2022-02-20 18:32:15,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:15,190 INFO L93 Difference]: Finished difference Result 3124 states and 5065 transitions. [2022-02-20 18:32:15,190 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 5065 transitions. [2022-02-20 18:32:15,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:15,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:15,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:15,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:15,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2356 states, 2355 states have (on average 1.6148619957537156) internal successors, (3803), 2355 states have internal predecessors, (3803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:15,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 2356 states and 3803 transitions. [2022-02-20 18:32:15,369 INFO L78 Accepts]: Start accepts. Automaton has 2356 states and 3803 transitions. Word has length 74 [2022-02-20 18:32:15,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:15,371 INFO L470 AbstractCegarLoop]: Abstraction has 2356 states and 3803 transitions. [2022-02-20 18:32:15,371 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:15,371 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 3803 transitions. [2022-02-20 18:32:15,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-20 18:32:15,372 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:15,372 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:15,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:32:15,372 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:15,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:15,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1364954579, now seen corresponding path program 1 times [2022-02-20 18:32:15,373 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:15,373 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140810705] [2022-02-20 18:32:15,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:15,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:15,413 INFO L290 TraceCheckUtils]: 0: Hoare triple {39050#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; {39050#true} is VALID [2022-02-20 18:32:15,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {39050#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_~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;~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;~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;~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; {39050#true} is VALID [2022-02-20 18:32:15,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {39050#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {39050#true} is VALID [2022-02-20 18:32:15,414 INFO L290 TraceCheckUtils]: 3: Hoare triple {39050#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {39050#true} is VALID [2022-02-20 18:32:15,414 INFO L290 TraceCheckUtils]: 4: Hoare triple {39050#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {39050#true} is VALID [2022-02-20 18:32:15,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {39050#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {39050#true} is VALID [2022-02-20 18:32:15,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {39050#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {39050#true} is VALID [2022-02-20 18:32:15,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {39050#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {39050#true} is VALID [2022-02-20 18:32:15,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {39050#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {39050#true} is VALID [2022-02-20 18:32:15,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {39050#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {39050#true} is VALID [2022-02-20 18:32:15,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {39050#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {39050#true} is VALID [2022-02-20 18:32:15,415 INFO L290 TraceCheckUtils]: 11: Hoare triple {39050#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {39050#true} is VALID [2022-02-20 18:32:15,415 INFO L290 TraceCheckUtils]: 12: Hoare triple {39050#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {39050#true} is VALID [2022-02-20 18:32:15,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {39050#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {39050#true} is VALID [2022-02-20 18:32:15,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {39050#true} assume ~id1~0 != ~id2~0; {39050#true} is VALID [2022-02-20 18:32:15,415 INFO L290 TraceCheckUtils]: 15: Hoare triple {39050#true} assume ~id1~0 != ~id3~0; {39050#true} is VALID [2022-02-20 18:32:15,415 INFO L290 TraceCheckUtils]: 16: Hoare triple {39050#true} assume ~id2~0 != ~id3~0; {39050#true} is VALID [2022-02-20 18:32:15,415 INFO L290 TraceCheckUtils]: 17: Hoare triple {39050#true} assume ~id1~0 >= 0; {39050#true} is VALID [2022-02-20 18:32:15,415 INFO L290 TraceCheckUtils]: 18: Hoare triple {39050#true} assume ~id2~0 >= 0; {39050#true} is VALID [2022-02-20 18:32:15,416 INFO L290 TraceCheckUtils]: 19: Hoare triple {39050#true} assume ~id3~0 >= 0; {39050#true} is VALID [2022-02-20 18:32:15,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {39050#true} assume 0 == ~r1~0 % 256; {39050#true} is VALID [2022-02-20 18:32:15,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {39050#true} assume 0 == ~r2~0 % 256; {39050#true} is VALID [2022-02-20 18:32:15,416 INFO L290 TraceCheckUtils]: 22: Hoare triple {39050#true} assume 0 == ~r3~0 % 256; {39050#true} is VALID [2022-02-20 18:32:15,416 INFO L290 TraceCheckUtils]: 23: Hoare triple {39050#true} assume 0 != init_~r122~0#1 % 256; {39050#true} is VALID [2022-02-20 18:32:15,416 INFO L290 TraceCheckUtils]: 24: Hoare triple {39050#true} assume 0 != init_~r132~0#1 % 256; {39050#true} is VALID [2022-02-20 18:32:15,416 INFO L290 TraceCheckUtils]: 25: Hoare triple {39050#true} assume 0 != init_~r212~0#1 % 256; {39050#true} is VALID [2022-02-20 18:32:15,416 INFO L290 TraceCheckUtils]: 26: Hoare triple {39050#true} assume 0 != init_~r232~0#1 % 256; {39050#true} is VALID [2022-02-20 18:32:15,416 INFO L290 TraceCheckUtils]: 27: Hoare triple {39050#true} assume 0 != init_~r312~0#1 % 256; {39050#true} is VALID [2022-02-20 18:32:15,417 INFO L290 TraceCheckUtils]: 28: Hoare triple {39050#true} assume 0 != init_~r322~0#1 % 256; {39050#true} is VALID [2022-02-20 18:32:15,417 INFO L290 TraceCheckUtils]: 29: Hoare triple {39050#true} assume ~max1~0 == ~id1~0; {39050#true} is VALID [2022-02-20 18:32:15,417 INFO L290 TraceCheckUtils]: 30: Hoare triple {39050#true} assume ~max2~0 == ~id2~0; {39050#true} is VALID [2022-02-20 18:32:15,417 INFO L290 TraceCheckUtils]: 31: Hoare triple {39050#true} assume ~max3~0 == ~id3~0; {39050#true} is VALID [2022-02-20 18:32:15,417 INFO L290 TraceCheckUtils]: 32: Hoare triple {39050#true} assume 0 == ~st1~0; {39050#true} is VALID [2022-02-20 18:32:15,417 INFO L290 TraceCheckUtils]: 33: Hoare triple {39050#true} assume 0 == ~st2~0; {39050#true} is VALID [2022-02-20 18:32:15,417 INFO L290 TraceCheckUtils]: 34: Hoare triple {39050#true} assume 0 == ~st3~0; {39052#(<= ~st3~0 0)} is VALID [2022-02-20 18:32:15,418 INFO L290 TraceCheckUtils]: 35: Hoare triple {39052#(<= ~st3~0 0)} assume 0 == ~nl1~0; {39052#(<= ~st3~0 0)} is VALID [2022-02-20 18:32:15,418 INFO L290 TraceCheckUtils]: 36: Hoare triple {39052#(<= ~st3~0 0)} assume 0 == ~nl2~0; {39052#(<= ~st3~0 0)} is VALID [2022-02-20 18:32:15,418 INFO L290 TraceCheckUtils]: 37: Hoare triple {39052#(<= ~st3~0 0)} assume 0 == ~nl3~0; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:15,419 INFO L290 TraceCheckUtils]: 38: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode1~0 % 256; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:15,419 INFO L290 TraceCheckUtils]: 39: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode2~0 % 256; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:15,419 INFO L290 TraceCheckUtils]: 40: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode3~0 % 256; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:15,419 INFO L290 TraceCheckUtils]: 41: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 != ~newmax1~0 % 256; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:15,420 INFO L290 TraceCheckUtils]: 42: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 != ~newmax2~0 % 256; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:15,420 INFO L290 TraceCheckUtils]: 43: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:15,420 INFO L290 TraceCheckUtils]: 44: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} init_#res#1 := init_~tmp___5~0#1; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:15,421 INFO L290 TraceCheckUtils]: 45: Hoare triple {39053#(<= (+ ~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; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:15,421 INFO L290 TraceCheckUtils]: 46: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:15,421 INFO L290 TraceCheckUtils]: 47: Hoare triple {39053#(<= (+ ~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; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:15,422 INFO L290 TraceCheckUtils]: 48: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume !false;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; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:15,422 INFO L290 TraceCheckUtils]: 49: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode1~0 % 256); {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:15,422 INFO L290 TraceCheckUtils]: 50: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r1~0 % 256 < 2; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:15,423 INFO L290 TraceCheckUtils]: 51: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep12~0 % 256); {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:15,423 INFO L290 TraceCheckUtils]: 52: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep13~0 % 256); {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:15,423 INFO L290 TraceCheckUtils]: 53: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode1~0 := 1; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:15,423 INFO L290 TraceCheckUtils]: 54: Hoare triple {39053#(<= (+ ~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; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:15,424 INFO L290 TraceCheckUtils]: 55: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode2~0 % 256); {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:15,424 INFO L290 TraceCheckUtils]: 56: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r2~0 % 256 < 2; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:15,424 INFO L290 TraceCheckUtils]: 57: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep21~0 % 256); {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:15,425 INFO L290 TraceCheckUtils]: 58: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep23~0 % 256); {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:15,425 INFO L290 TraceCheckUtils]: 59: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode2~0 := 1; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:15,425 INFO L290 TraceCheckUtils]: 60: Hoare triple {39053#(<= (+ ~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; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:15,425 INFO L290 TraceCheckUtils]: 61: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode3~0 % 256); {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:15,426 INFO L290 TraceCheckUtils]: 62: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r3~0 % 256 < 2; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:15,426 INFO L290 TraceCheckUtils]: 63: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep31~0 % 256); {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:15,426 INFO L290 TraceCheckUtils]: 64: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep32~0 % 256); {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:15,427 INFO L290 TraceCheckUtils]: 65: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode3~0 := 1; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:15,427 INFO L290 TraceCheckUtils]: 66: Hoare triple {39053#(<= (+ ~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; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:15,427 INFO L290 TraceCheckUtils]: 67: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:15,428 INFO L290 TraceCheckUtils]: 68: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:15,428 INFO L290 TraceCheckUtils]: 69: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st2~0 + ~nl2~0 <= 1; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:15,428 INFO L290 TraceCheckUtils]: 70: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(~st3~0 + ~nl3~0 <= 1);check_~tmp~1#1 := 0; {39051#false} is VALID [2022-02-20 18:32:15,428 INFO L290 TraceCheckUtils]: 71: Hoare triple {39051#false} check_#res#1 := check_~tmp~1#1; {39051#false} is VALID [2022-02-20 18:32:15,429 INFO L290 TraceCheckUtils]: 72: Hoare triple {39051#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; {39051#false} is VALID [2022-02-20 18:32:15,429 INFO L290 TraceCheckUtils]: 73: Hoare triple {39051#false} assume 0 == assert_~arg#1 % 256; {39051#false} is VALID [2022-02-20 18:32:15,429 INFO L290 TraceCheckUtils]: 74: Hoare triple {39051#false} assume !false; {39051#false} is VALID [2022-02-20 18:32:15,429 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:15,429 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:15,429 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140810705] [2022-02-20 18:32:15,429 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140810705] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:15,430 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:15,430 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:32:15,430 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527149232] [2022-02-20 18:32:15,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:15,430 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:15,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:15,431 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:15,469 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:15,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:32:15,470 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:15,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:32:15,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:32:15,470 INFO L87 Difference]: Start difference. First operand 2356 states and 3803 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) [2022-02-20 18:32:18,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:18,509 INFO L93 Difference]: Finished difference Result 6796 states and 11038 transitions. [2022-02-20 18:32:18,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:32:18,509 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:18,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:18,509 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 18:32:18,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 646 transitions. [2022-02-20 18:32:18,511 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 18:32:18,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 646 transitions. [2022-02-20 18:32:18,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 646 transitions. [2022-02-20 18:32:18,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 646 edges. 646 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:19,456 INFO L225 Difference]: With dead ends: 6796 [2022-02-20 18:32:19,456 INFO L226 Difference]: Without dead ends: 4500 [2022-02-20 18:32:19,458 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,458 INFO L933 BasicCegarLoop]: 218 mSDtfsCounter, 409 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 733 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,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [409 Valid, 733 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,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4500 states. [2022-02-20 18:32:20,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4500 to 3412. [2022-02-20 18:32:20,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:20,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4500 states. Second operand has 3412 states, 3411 states have (on average 1.612723541483436) internal successors, (5501), 3411 states have internal predecessors, (5501), 0 states have call successors, (0), 0 states have call 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,419 INFO L74 IsIncluded]: Start isIncluded. First operand 4500 states. Second operand has 3412 states, 3411 states have (on average 1.612723541483436) internal successors, (5501), 3411 states have internal predecessors, (5501), 0 states have call successors, (0), 0 states have call 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,422 INFO L87 Difference]: Start difference. First operand 4500 states. Second operand has 3412 states, 3411 states have (on average 1.612723541483436) internal successors, (5501), 3411 states have internal predecessors, (5501), 0 states have call successors, (0), 0 states have call 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,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:20,992 INFO L93 Difference]: Finished difference Result 4500 states and 7285 transitions. [2022-02-20 18:32:20,992 INFO L276 IsEmpty]: Start isEmpty. Operand 4500 states and 7285 transitions. [2022-02-20 18:32:20,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:20,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:21,001 INFO L74 IsIncluded]: Start isIncluded. First operand has 3412 states, 3411 states have (on average 1.612723541483436) internal successors, (5501), 3411 states have internal predecessors, (5501), 0 states have call successors, (0), 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 4500 states. [2022-02-20 18:32:21,003 INFO L87 Difference]: Start difference. First operand has 3412 states, 3411 states have (on average 1.612723541483436) internal successors, (5501), 3411 states have internal predecessors, (5501), 0 states have call successors, (0), 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 4500 states. [2022-02-20 18:32:21,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:21,580 INFO L93 Difference]: Finished difference Result 4500 states and 7285 transitions. [2022-02-20 18:32:21,580 INFO L276 IsEmpty]: Start isEmpty. Operand 4500 states and 7285 transitions. [2022-02-20 18:32:21,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:21,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:21,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:21,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:21,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3412 states, 3411 states have (on average 1.612723541483436) internal successors, (5501), 3411 states have internal predecessors, (5501), 0 states have call successors, (0), 0 states have call 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,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3412 states to 3412 states and 5501 transitions. [2022-02-20 18:32:21,959 INFO L78 Accepts]: Start accepts. Automaton has 3412 states and 5501 transitions. Word has length 75 [2022-02-20 18:32:21,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:21,960 INFO L470 AbstractCegarLoop]: Abstraction has 3412 states and 5501 transitions. [2022-02-20 18:32:21,960 INFO L471 AbstractCegarLoop]: INTERPOLANT 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) [2022-02-20 18:32:21,960 INFO L276 IsEmpty]: Start isEmpty. Operand 3412 states and 5501 transitions. [2022-02-20 18:32:21,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 18:32:21,961 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:21,961 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:32:21,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:32:21,961 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:21,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:21,961 INFO L85 PathProgramCache]: Analyzing trace with hash 915332421, now seen corresponding path program 1 times [2022-02-20 18:32:21,962 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:21,962 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893671399] [2022-02-20 18:32:21,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:21,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:21,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:21,994 INFO L290 TraceCheckUtils]: 0: Hoare triple {59328#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; {59328#true} is VALID [2022-02-20 18:32:21,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {59328#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_~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;~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;~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;~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; {59328#true} is VALID [2022-02-20 18:32:21,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {59328#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {59328#true} is VALID [2022-02-20 18:32:21,994 INFO L290 TraceCheckUtils]: 3: Hoare triple {59328#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {59328#true} is VALID [2022-02-20 18:32:21,994 INFO L290 TraceCheckUtils]: 4: Hoare triple {59328#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {59328#true} is VALID [2022-02-20 18:32:21,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {59328#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {59328#true} is VALID [2022-02-20 18:32:21,995 INFO L290 TraceCheckUtils]: 6: Hoare triple {59328#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {59328#true} is VALID [2022-02-20 18:32:21,995 INFO L290 TraceCheckUtils]: 7: Hoare triple {59328#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {59328#true} is VALID [2022-02-20 18:32:21,995 INFO L290 TraceCheckUtils]: 8: Hoare triple {59328#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {59328#true} is VALID [2022-02-20 18:32:21,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {59328#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {59328#true} is VALID [2022-02-20 18:32:21,995 INFO L290 TraceCheckUtils]: 10: Hoare triple {59328#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {59328#true} is VALID [2022-02-20 18:32:21,995 INFO L290 TraceCheckUtils]: 11: Hoare triple {59328#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {59328#true} is VALID [2022-02-20 18:32:21,995 INFO L290 TraceCheckUtils]: 12: Hoare triple {59328#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {59328#true} is VALID [2022-02-20 18:32:21,995 INFO L290 TraceCheckUtils]: 13: Hoare triple {59328#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {59328#true} is VALID [2022-02-20 18:32:21,996 INFO L290 TraceCheckUtils]: 14: Hoare triple {59328#true} assume ~id1~0 != ~id2~0; {59328#true} is VALID [2022-02-20 18:32:21,996 INFO L290 TraceCheckUtils]: 15: Hoare triple {59328#true} assume ~id1~0 != ~id3~0; {59328#true} is VALID [2022-02-20 18:32:21,996 INFO L290 TraceCheckUtils]: 16: Hoare triple {59328#true} assume ~id2~0 != ~id3~0; {59328#true} is VALID [2022-02-20 18:32:21,996 INFO L290 TraceCheckUtils]: 17: Hoare triple {59328#true} assume ~id1~0 >= 0; {59328#true} is VALID [2022-02-20 18:32:21,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {59328#true} assume ~id2~0 >= 0; {59328#true} is VALID [2022-02-20 18:32:21,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {59328#true} assume ~id3~0 >= 0; {59328#true} is VALID [2022-02-20 18:32:21,996 INFO L290 TraceCheckUtils]: 20: Hoare triple {59328#true} assume 0 == ~r1~0 % 256; {59328#true} is VALID [2022-02-20 18:32:21,996 INFO L290 TraceCheckUtils]: 21: Hoare triple {59328#true} assume 0 == ~r2~0 % 256; {59328#true} is VALID [2022-02-20 18:32:21,996 INFO L290 TraceCheckUtils]: 22: Hoare triple {59328#true} assume 0 == ~r3~0 % 256; {59328#true} is VALID [2022-02-20 18:32:21,996 INFO L290 TraceCheckUtils]: 23: Hoare triple {59328#true} assume 0 != init_~r122~0#1 % 256; {59328#true} is VALID [2022-02-20 18:32:21,997 INFO L290 TraceCheckUtils]: 24: Hoare triple {59328#true} assume 0 != init_~r132~0#1 % 256; {59328#true} is VALID [2022-02-20 18:32:21,997 INFO L290 TraceCheckUtils]: 25: Hoare triple {59328#true} assume 0 != init_~r212~0#1 % 256; {59328#true} is VALID [2022-02-20 18:32:21,997 INFO L290 TraceCheckUtils]: 26: Hoare triple {59328#true} assume 0 != init_~r232~0#1 % 256; {59328#true} is VALID [2022-02-20 18:32:21,997 INFO L290 TraceCheckUtils]: 27: Hoare triple {59328#true} assume 0 != init_~r312~0#1 % 256; {59328#true} is VALID [2022-02-20 18:32:21,997 INFO L290 TraceCheckUtils]: 28: Hoare triple {59328#true} assume 0 != init_~r322~0#1 % 256; {59328#true} is VALID [2022-02-20 18:32:21,997 INFO L290 TraceCheckUtils]: 29: Hoare triple {59328#true} assume ~max1~0 == ~id1~0; {59328#true} is VALID [2022-02-20 18:32:21,997 INFO L290 TraceCheckUtils]: 30: Hoare triple {59328#true} assume ~max2~0 == ~id2~0; {59328#true} is VALID [2022-02-20 18:32:21,997 INFO L290 TraceCheckUtils]: 31: Hoare triple {59328#true} assume ~max3~0 == ~id3~0; {59328#true} is VALID [2022-02-20 18:32:21,997 INFO L290 TraceCheckUtils]: 32: Hoare triple {59328#true} assume 0 == ~st1~0; {59328#true} is VALID [2022-02-20 18:32:21,998 INFO L290 TraceCheckUtils]: 33: Hoare triple {59328#true} assume 0 == ~st2~0; {59328#true} is VALID [2022-02-20 18:32:21,998 INFO L290 TraceCheckUtils]: 34: Hoare triple {59328#true} assume 0 == ~st3~0; {59328#true} is VALID [2022-02-20 18:32:21,998 INFO L290 TraceCheckUtils]: 35: Hoare triple {59328#true} assume 0 == ~nl1~0; {59328#true} is VALID [2022-02-20 18:32:21,998 INFO L290 TraceCheckUtils]: 36: Hoare triple {59328#true} assume 0 == ~nl2~0; {59328#true} is VALID [2022-02-20 18:32:21,998 INFO L290 TraceCheckUtils]: 37: Hoare triple {59328#true} assume 0 == ~nl3~0; {59328#true} is VALID [2022-02-20 18:32:21,998 INFO L290 TraceCheckUtils]: 38: Hoare triple {59328#true} assume 0 == ~mode1~0 % 256; {59328#true} is VALID [2022-02-20 18:32:21,998 INFO L290 TraceCheckUtils]: 39: Hoare triple {59328#true} assume 0 == ~mode2~0 % 256; {59328#true} is VALID [2022-02-20 18:32:21,999 INFO L290 TraceCheckUtils]: 40: Hoare triple {59328#true} assume 0 == ~mode3~0 % 256; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:21,999 INFO L290 TraceCheckUtils]: 41: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~newmax1~0 % 256; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:21,999 INFO L290 TraceCheckUtils]: 42: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~newmax2~0 % 256; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:22,000 INFO L290 TraceCheckUtils]: 43: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:22,000 INFO L290 TraceCheckUtils]: 44: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp___5~0#1; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:22,000 INFO L290 TraceCheckUtils]: 45: Hoare triple {59330#(= (+ (* (- 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; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:22,001 INFO L290 TraceCheckUtils]: 46: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:22,001 INFO L290 TraceCheckUtils]: 47: Hoare triple {59330#(= (+ (* (- 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; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:22,001 INFO L290 TraceCheckUtils]: 48: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;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; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:22,002 INFO L290 TraceCheckUtils]: 49: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:22,002 INFO L290 TraceCheckUtils]: 50: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r1~0 % 256 < 2; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:22,002 INFO L290 TraceCheckUtils]: 51: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep12~0 % 256); {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:22,003 INFO L290 TraceCheckUtils]: 52: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep13~0 % 256); {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:22,003 INFO L290 TraceCheckUtils]: 53: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:22,003 INFO L290 TraceCheckUtils]: 54: Hoare triple {59330#(= (+ (* (- 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; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:22,004 INFO L290 TraceCheckUtils]: 55: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:22,004 INFO L290 TraceCheckUtils]: 56: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r2~0 % 256 < 2; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:22,004 INFO L290 TraceCheckUtils]: 57: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep21~0 % 256); {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:22,005 INFO L290 TraceCheckUtils]: 58: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep23~0 % 256); {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:22,005 INFO L290 TraceCheckUtils]: 59: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:22,005 INFO L290 TraceCheckUtils]: 60: Hoare triple {59330#(= (+ (* (- 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; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:22,006 INFO L290 TraceCheckUtils]: 61: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~mode3~0 % 256; {59329#false} is VALID [2022-02-20 18:32:22,006 INFO L290 TraceCheckUtils]: 62: Hoare triple {59329#false} assume !(255 == ~r3~0 % 256); {59329#false} is VALID [2022-02-20 18:32:22,006 INFO L290 TraceCheckUtils]: 63: Hoare triple {59329#false} ~r3~0 := 1 + ~r3~0 % 256; {59329#false} is VALID [2022-02-20 18:32:22,006 INFO L290 TraceCheckUtils]: 64: Hoare triple {59329#false} assume !(0 != ~ep13~0 % 256); {59329#false} is VALID [2022-02-20 18:32:22,006 INFO L290 TraceCheckUtils]: 65: Hoare triple {59329#false} assume !(0 != ~ep23~0 % 256); {59329#false} is VALID [2022-02-20 18:32:22,006 INFO L290 TraceCheckUtils]: 66: Hoare triple {59329#false} ~newmax3~0 := node3_~newmax~2#1; {59329#false} is VALID [2022-02-20 18:32:22,006 INFO L290 TraceCheckUtils]: 67: Hoare triple {59329#false} assume 2 == ~r3~0 % 256; {59329#false} is VALID [2022-02-20 18:32:22,006 INFO L290 TraceCheckUtils]: 68: Hoare triple {59329#false} assume ~max3~0 == ~id3~0;~st3~0 := 1; {59329#false} is VALID [2022-02-20 18:32:22,007 INFO L290 TraceCheckUtils]: 69: Hoare triple {59329#false} ~mode3~0 := 0; {59329#false} is VALID [2022-02-20 18:32:22,007 INFO L290 TraceCheckUtils]: 70: Hoare triple {59329#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; {59329#false} is VALID [2022-02-20 18:32:22,007 INFO L290 TraceCheckUtils]: 71: Hoare triple {59329#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {59329#false} is VALID [2022-02-20 18:32:22,007 INFO L290 TraceCheckUtils]: 72: Hoare triple {59329#false} check_#res#1 := check_~tmp~1#1; {59329#false} is VALID [2022-02-20 18:32:22,007 INFO L290 TraceCheckUtils]: 73: Hoare triple {59329#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; {59329#false} is VALID [2022-02-20 18:32:22,007 INFO L290 TraceCheckUtils]: 74: Hoare triple {59329#false} assume 0 == assert_~arg#1 % 256; {59329#false} is VALID [2022-02-20 18:32:22,007 INFO L290 TraceCheckUtils]: 75: Hoare triple {59329#false} assume !false; {59329#false} is VALID [2022-02-20 18:32:22,007 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:22,008 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:22,008 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893671399] [2022-02-20 18:32:22,008 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893671399] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:22,008 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:22,008 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:32:22,008 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254922153] [2022-02-20 18:32:22,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:22,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:32:22,009 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:22,009 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call 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:22,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:22,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:32:22,049 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:22,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:32:22,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:32:22,050 INFO L87 Difference]: Start difference. First operand 3412 states and 5501 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call 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,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:25,787 INFO L93 Difference]: Finished difference Result 7762 states and 12522 transitions. [2022-02-20 18:32:25,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:32:25,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:32:25,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:25,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call 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,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2022-02-20 18:32:25,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call 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,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2022-02-20 18:32:25,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 470 transitions. [2022-02-20 18:32:26,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 470 edges. 470 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:26,801 INFO L225 Difference]: With dead ends: 7762 [2022-02-20 18:32:26,801 INFO L226 Difference]: Without dead ends: 5340 [2022-02-20 18:32:26,803 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,803 INFO L933 BasicCegarLoop]: 253 mSDtfsCounter, 110 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 443 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,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 443 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,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5340 states. [2022-02-20 18:32:28,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5340 to 5338. [2022-02-20 18:32:28,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:28,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5340 states. Second operand has 5338 states, 5337 states have (on average 1.6001498969458496) internal successors, (8540), 5337 states have internal predecessors, (8540), 0 states have call successors, (0), 0 states have call 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,487 INFO L74 IsIncluded]: Start isIncluded. First operand 5340 states. Second operand has 5338 states, 5337 states have (on average 1.6001498969458496) internal successors, (8540), 5337 states have internal predecessors, (8540), 0 states have call successors, (0), 0 states have call 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,491 INFO L87 Difference]: Start difference. First operand 5340 states. Second operand has 5338 states, 5337 states have (on average 1.6001498969458496) internal successors, (8540), 5337 states have internal predecessors, (8540), 0 states have call successors, (0), 0 states have call 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,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:29,304 INFO L93 Difference]: Finished difference Result 5340 states and 8541 transitions. [2022-02-20 18:32:29,304 INFO L276 IsEmpty]: Start isEmpty. Operand 5340 states and 8541 transitions. [2022-02-20 18:32:29,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:29,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:29,314 INFO L74 IsIncluded]: Start isIncluded. First operand has 5338 states, 5337 states have (on average 1.6001498969458496) internal successors, (8540), 5337 states have internal predecessors, (8540), 0 states have call successors, (0), 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 5340 states. [2022-02-20 18:32:29,318 INFO L87 Difference]: Start difference. First operand has 5338 states, 5337 states have (on average 1.6001498969458496) internal successors, (8540), 5337 states have internal predecessors, (8540), 0 states have call successors, (0), 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 5340 states. [2022-02-20 18:32:30,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:30,120 INFO L93 Difference]: Finished difference Result 5340 states and 8541 transitions. [2022-02-20 18:32:30,121 INFO L276 IsEmpty]: Start isEmpty. Operand 5340 states and 8541 transitions. [2022-02-20 18:32:30,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:30,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:30,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:30,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:30,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5338 states, 5337 states have (on average 1.6001498969458496) internal successors, (8540), 5337 states have internal predecessors, (8540), 0 states have call successors, (0), 0 states have call 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:31,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5338 states to 5338 states and 8540 transitions. [2022-02-20 18:32:31,006 INFO L78 Accepts]: Start accepts. Automaton has 5338 states and 8540 transitions. Word has length 76 [2022-02-20 18:32:31,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:31,006 INFO L470 AbstractCegarLoop]: Abstraction has 5338 states and 8540 transitions. [2022-02-20 18:32:31,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call 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:31,006 INFO L276 IsEmpty]: Start isEmpty. Operand 5338 states and 8540 transitions. [2022-02-20 18:32:31,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 18:32:31,007 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:31,007 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:32:31,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:32:31,007 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:31,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:31,008 INFO L85 PathProgramCache]: Analyzing trace with hash -318395451, now seen corresponding path program 1 times [2022-02-20 18:32:31,008 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:31,008 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235523074] [2022-02-20 18:32:31,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:31,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:31,039 INFO L290 TraceCheckUtils]: 0: Hoare triple {84591#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; {84591#true} is VALID [2022-02-20 18:32:31,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {84591#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_~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;~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;~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;~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; {84591#true} is VALID [2022-02-20 18:32:31,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {84591#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {84591#true} is VALID [2022-02-20 18:32:31,040 INFO L290 TraceCheckUtils]: 3: Hoare triple {84591#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {84591#true} is VALID [2022-02-20 18:32:31,040 INFO L290 TraceCheckUtils]: 4: Hoare triple {84591#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {84591#true} is VALID [2022-02-20 18:32:31,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {84591#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {84591#true} is VALID [2022-02-20 18:32:31,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {84591#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {84591#true} is VALID [2022-02-20 18:32:31,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {84591#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {84591#true} is VALID [2022-02-20 18:32:31,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {84591#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {84591#true} is VALID [2022-02-20 18:32:31,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {84591#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {84591#true} is VALID [2022-02-20 18:32:31,041 INFO L290 TraceCheckUtils]: 10: Hoare triple {84591#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {84591#true} is VALID [2022-02-20 18:32:31,041 INFO L290 TraceCheckUtils]: 11: Hoare triple {84591#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {84591#true} is VALID [2022-02-20 18:32:31,041 INFO L290 TraceCheckUtils]: 12: Hoare triple {84591#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {84591#true} is VALID [2022-02-20 18:32:31,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {84591#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {84591#true} is VALID [2022-02-20 18:32:31,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {84591#true} assume ~id1~0 != ~id2~0; {84591#true} is VALID [2022-02-20 18:32:31,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {84591#true} assume ~id1~0 != ~id3~0; {84591#true} is VALID [2022-02-20 18:32:31,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {84591#true} assume ~id2~0 != ~id3~0; {84591#true} is VALID [2022-02-20 18:32:31,041 INFO L290 TraceCheckUtils]: 17: Hoare triple {84591#true} assume ~id1~0 >= 0; {84591#true} is VALID [2022-02-20 18:32:31,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {84591#true} assume ~id2~0 >= 0; {84591#true} is VALID [2022-02-20 18:32:31,042 INFO L290 TraceCheckUtils]: 19: Hoare triple {84591#true} assume ~id3~0 >= 0; {84591#true} is VALID [2022-02-20 18:32:31,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {84591#true} assume 0 == ~r1~0 % 256; {84591#true} is VALID [2022-02-20 18:32:31,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {84591#true} assume 0 == ~r2~0 % 256; {84591#true} is VALID [2022-02-20 18:32:31,042 INFO L290 TraceCheckUtils]: 22: Hoare triple {84591#true} assume 0 == ~r3~0 % 256; {84591#true} is VALID [2022-02-20 18:32:31,042 INFO L290 TraceCheckUtils]: 23: Hoare triple {84591#true} assume 0 != init_~r122~0#1 % 256; {84591#true} is VALID [2022-02-20 18:32:31,042 INFO L290 TraceCheckUtils]: 24: Hoare triple {84591#true} assume 0 != init_~r132~0#1 % 256; {84591#true} is VALID [2022-02-20 18:32:31,042 INFO L290 TraceCheckUtils]: 25: Hoare triple {84591#true} assume 0 != init_~r212~0#1 % 256; {84591#true} is VALID [2022-02-20 18:32:31,042 INFO L290 TraceCheckUtils]: 26: Hoare triple {84591#true} assume 0 != init_~r232~0#1 % 256; {84591#true} is VALID [2022-02-20 18:32:31,042 INFO L290 TraceCheckUtils]: 27: Hoare triple {84591#true} assume 0 != init_~r312~0#1 % 256; {84591#true} is VALID [2022-02-20 18:32:31,043 INFO L290 TraceCheckUtils]: 28: Hoare triple {84591#true} assume 0 != init_~r322~0#1 % 256; {84591#true} is VALID [2022-02-20 18:32:31,043 INFO L290 TraceCheckUtils]: 29: Hoare triple {84591#true} assume ~max1~0 == ~id1~0; {84591#true} is VALID [2022-02-20 18:32:31,043 INFO L290 TraceCheckUtils]: 30: Hoare triple {84591#true} assume ~max2~0 == ~id2~0; {84591#true} is VALID [2022-02-20 18:32:31,043 INFO L290 TraceCheckUtils]: 31: Hoare triple {84591#true} assume ~max3~0 == ~id3~0; {84591#true} is VALID [2022-02-20 18:32:31,043 INFO L290 TraceCheckUtils]: 32: Hoare triple {84591#true} assume 0 == ~st1~0; {84591#true} is VALID [2022-02-20 18:32:31,043 INFO L290 TraceCheckUtils]: 33: Hoare triple {84591#true} assume 0 == ~st2~0; {84591#true} is VALID [2022-02-20 18:32:31,043 INFO L290 TraceCheckUtils]: 34: Hoare triple {84591#true} assume 0 == ~st3~0; {84591#true} is VALID [2022-02-20 18:32:31,043 INFO L290 TraceCheckUtils]: 35: Hoare triple {84591#true} assume 0 == ~nl1~0; {84591#true} is VALID [2022-02-20 18:32:31,043 INFO L290 TraceCheckUtils]: 36: Hoare triple {84591#true} assume 0 == ~nl2~0; {84591#true} is VALID [2022-02-20 18:32:31,044 INFO L290 TraceCheckUtils]: 37: Hoare triple {84591#true} assume 0 == ~nl3~0; {84591#true} is VALID [2022-02-20 18:32:31,044 INFO L290 TraceCheckUtils]: 38: Hoare triple {84591#true} assume 0 == ~mode1~0 % 256; {84591#true} is VALID [2022-02-20 18:32:31,044 INFO L290 TraceCheckUtils]: 39: Hoare triple {84591#true} assume 0 == ~mode2~0 % 256; {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:31,044 INFO L290 TraceCheckUtils]: 40: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:31,045 INFO L290 TraceCheckUtils]: 41: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~newmax1~0 % 256; {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:31,045 INFO L290 TraceCheckUtils]: 42: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~newmax2~0 % 256; {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:31,045 INFO L290 TraceCheckUtils]: 43: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:31,046 INFO L290 TraceCheckUtils]: 44: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp___5~0#1; {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:31,046 INFO L290 TraceCheckUtils]: 45: Hoare triple {84593#(= (+ (* (- 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; {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:31,046 INFO L290 TraceCheckUtils]: 46: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:31,047 INFO L290 TraceCheckUtils]: 47: Hoare triple {84593#(= (+ (* (- 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; {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:31,047 INFO L290 TraceCheckUtils]: 48: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;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; {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:31,048 INFO L290 TraceCheckUtils]: 49: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:31,048 INFO L290 TraceCheckUtils]: 50: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~r1~0 % 256 < 2; {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:31,048 INFO L290 TraceCheckUtils]: 51: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~ep12~0 % 256); {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:31,048 INFO L290 TraceCheckUtils]: 52: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~ep13~0 % 256); {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:31,049 INFO L290 TraceCheckUtils]: 53: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:31,049 INFO L290 TraceCheckUtils]: 54: Hoare triple {84593#(= (+ (* (- 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; {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:31,050 INFO L290 TraceCheckUtils]: 55: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256; {84592#false} is VALID [2022-02-20 18:32:31,050 INFO L290 TraceCheckUtils]: 56: Hoare triple {84592#false} assume !(255 == ~r2~0 % 256); {84592#false} is VALID [2022-02-20 18:32:31,050 INFO L290 TraceCheckUtils]: 57: Hoare triple {84592#false} ~r2~0 := 1 + ~r2~0 % 256; {84592#false} is VALID [2022-02-20 18:32:31,050 INFO L290 TraceCheckUtils]: 58: Hoare triple {84592#false} assume !(0 != ~ep12~0 % 256); {84592#false} is VALID [2022-02-20 18:32:31,050 INFO L290 TraceCheckUtils]: 59: Hoare triple {84592#false} assume !(0 != ~ep32~0 % 256); {84592#false} is VALID [2022-02-20 18:32:31,050 INFO L290 TraceCheckUtils]: 60: Hoare triple {84592#false} ~newmax2~0 := node2_~newmax~1#1; {84592#false} is VALID [2022-02-20 18:32:31,050 INFO L290 TraceCheckUtils]: 61: Hoare triple {84592#false} assume 2 == ~r2~0 % 256; {84592#false} is VALID [2022-02-20 18:32:31,050 INFO L290 TraceCheckUtils]: 62: Hoare triple {84592#false} assume ~max2~0 == ~id2~0;~st2~0 := 1; {84592#false} is VALID [2022-02-20 18:32:31,050 INFO L290 TraceCheckUtils]: 63: Hoare triple {84592#false} ~mode2~0 := 0; {84592#false} is VALID [2022-02-20 18:32:31,051 INFO L290 TraceCheckUtils]: 64: Hoare triple {84592#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; {84592#false} is VALID [2022-02-20 18:32:31,051 INFO L290 TraceCheckUtils]: 65: Hoare triple {84592#false} assume !(0 != ~mode3~0 % 256); {84592#false} is VALID [2022-02-20 18:32:31,051 INFO L290 TraceCheckUtils]: 66: Hoare triple {84592#false} assume ~r3~0 % 256 < 2; {84592#false} is VALID [2022-02-20 18:32:31,051 INFO L290 TraceCheckUtils]: 67: Hoare triple {84592#false} assume !(0 != ~ep31~0 % 256); {84592#false} is VALID [2022-02-20 18:32:31,051 INFO L290 TraceCheckUtils]: 68: Hoare triple {84592#false} assume !(0 != ~ep32~0 % 256); {84592#false} is VALID [2022-02-20 18:32:31,051 INFO L290 TraceCheckUtils]: 69: Hoare triple {84592#false} ~mode3~0 := 1; {84592#false} is VALID [2022-02-20 18:32:31,051 INFO L290 TraceCheckUtils]: 70: Hoare triple {84592#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; {84592#false} is VALID [2022-02-20 18:32:31,051 INFO L290 TraceCheckUtils]: 71: Hoare triple {84592#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {84592#false} is VALID [2022-02-20 18:32:31,051 INFO L290 TraceCheckUtils]: 72: Hoare triple {84592#false} check_#res#1 := check_~tmp~1#1; {84592#false} is VALID [2022-02-20 18:32:31,051 INFO L290 TraceCheckUtils]: 73: Hoare triple {84592#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; {84592#false} is VALID [2022-02-20 18:32:31,052 INFO L290 TraceCheckUtils]: 74: Hoare triple {84592#false} assume 0 == assert_~arg#1 % 256; {84592#false} is VALID [2022-02-20 18:32:31,052 INFO L290 TraceCheckUtils]: 75: Hoare triple {84592#false} assume !false; {84592#false} is VALID [2022-02-20 18:32:31,052 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:31,052 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:31,052 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235523074] [2022-02-20 18:32:31,052 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235523074] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:31,052 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:31,053 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:32:31,053 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261371533] [2022-02-20 18:32:31,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:31,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:32:31,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:31,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call 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:31,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:31,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:32:31,094 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:31,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:32:31,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:32:31,094 INFO L87 Difference]: Start difference. First operand 5338 states and 8540 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call 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:38,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:38,114 INFO L93 Difference]: Finished difference Result 11658 states and 18702 transitions. [2022-02-20 18:32:38,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:32:38,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:32:38,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:38,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call 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:38,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2022-02-20 18:32:38,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call 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:38,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2022-02-20 18:32:38,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 470 transitions. [2022-02-20 18:32:38,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 470 edges. 470 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:40,192 INFO L225 Difference]: With dead ends: 11658 [2022-02-20 18:32:40,193 INFO L226 Difference]: Without dead ends: 7904 [2022-02-20 18:32:40,195 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:40,196 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 116 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 477 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:40,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 477 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:40,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7904 states. [2022-02-20 18:32:42,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7904 to 7902. [2022-02-20 18:32:42,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:42,775 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7904 states. Second operand has 7902 states, 7901 states have (on average 1.5919503860270852) internal successors, (12578), 7901 states have internal predecessors, (12578), 0 states have call successors, (0), 0 states have call 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:42,781 INFO L74 IsIncluded]: Start isIncluded. First operand 7904 states. Second operand has 7902 states, 7901 states have (on average 1.5919503860270852) internal successors, (12578), 7901 states have internal predecessors, (12578), 0 states have call successors, (0), 0 states have call 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:42,786 INFO L87 Difference]: Start difference. First operand 7904 states. Second operand has 7902 states, 7901 states have (on average 1.5919503860270852) internal successors, (12578), 7901 states have internal predecessors, (12578), 0 states have call successors, (0), 0 states have call 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:44,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:44,601 INFO L93 Difference]: Finished difference Result 7904 states and 12579 transitions. [2022-02-20 18:32:44,601 INFO L276 IsEmpty]: Start isEmpty. Operand 7904 states and 12579 transitions. [2022-02-20 18:32:44,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:44,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:44,615 INFO L74 IsIncluded]: Start isIncluded. First operand has 7902 states, 7901 states have (on average 1.5919503860270852) internal successors, (12578), 7901 states have internal predecessors, (12578), 0 states have call successors, (0), 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 7904 states. [2022-02-20 18:32:44,620 INFO L87 Difference]: Start difference. First operand has 7902 states, 7901 states have (on average 1.5919503860270852) internal successors, (12578), 7901 states have internal predecessors, (12578), 0 states have call successors, (0), 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 7904 states. [2022-02-20 18:32:46,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:46,381 INFO L93 Difference]: Finished difference Result 7904 states and 12579 transitions. [2022-02-20 18:32:46,381 INFO L276 IsEmpty]: Start isEmpty. Operand 7904 states and 12579 transitions. [2022-02-20 18:32:46,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:46,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:46,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:46,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:46,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7902 states, 7901 states have (on average 1.5919503860270852) internal successors, (12578), 7901 states have internal predecessors, (12578), 0 states have call successors, (0), 0 states have call 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:48,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7902 states to 7902 states and 12578 transitions. [2022-02-20 18:32:48,403 INFO L78 Accepts]: Start accepts. Automaton has 7902 states and 12578 transitions. Word has length 76 [2022-02-20 18:32:48,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:48,403 INFO L470 AbstractCegarLoop]: Abstraction has 7902 states and 12578 transitions. [2022-02-20 18:32:48,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call 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:48,404 INFO L276 IsEmpty]: Start isEmpty. Operand 7902 states and 12578 transitions. [2022-02-20 18:32:48,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 18:32:48,404 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:48,404 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:32:48,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:32:48,405 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:48,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:48,405 INFO L85 PathProgramCache]: Analyzing trace with hash 700947013, now seen corresponding path program 1 times [2022-02-20 18:32:48,405 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:48,405 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962248002] [2022-02-20 18:32:48,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:48,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:48,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {122421#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; {122421#true} is VALID [2022-02-20 18:32:48,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {122421#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_~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;~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;~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;~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; {122421#true} is VALID [2022-02-20 18:32:48,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {122421#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {122421#true} is VALID [2022-02-20 18:32:48,436 INFO L290 TraceCheckUtils]: 3: Hoare triple {122421#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {122421#true} is VALID [2022-02-20 18:32:48,436 INFO L290 TraceCheckUtils]: 4: Hoare triple {122421#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {122421#true} is VALID [2022-02-20 18:32:48,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {122421#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {122421#true} is VALID [2022-02-20 18:32:48,436 INFO L290 TraceCheckUtils]: 6: Hoare triple {122421#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {122421#true} is VALID [2022-02-20 18:32:48,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {122421#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {122421#true} is VALID [2022-02-20 18:32:48,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {122421#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {122421#true} is VALID [2022-02-20 18:32:48,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {122421#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {122421#true} is VALID [2022-02-20 18:32:48,437 INFO L290 TraceCheckUtils]: 10: Hoare triple {122421#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {122421#true} is VALID [2022-02-20 18:32:48,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {122421#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {122421#true} is VALID [2022-02-20 18:32:48,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {122421#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {122421#true} is VALID [2022-02-20 18:32:48,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {122421#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {122421#true} is VALID [2022-02-20 18:32:48,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {122421#true} assume ~id1~0 != ~id2~0; {122421#true} is VALID [2022-02-20 18:32:48,437 INFO L290 TraceCheckUtils]: 15: Hoare triple {122421#true} assume ~id1~0 != ~id3~0; {122421#true} is VALID [2022-02-20 18:32:48,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {122421#true} assume ~id2~0 != ~id3~0; {122421#true} is VALID [2022-02-20 18:32:48,437 INFO L290 TraceCheckUtils]: 17: Hoare triple {122421#true} assume ~id1~0 >= 0; {122421#true} is VALID [2022-02-20 18:32:48,438 INFO L290 TraceCheckUtils]: 18: Hoare triple {122421#true} assume ~id2~0 >= 0; {122421#true} is VALID [2022-02-20 18:32:48,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {122421#true} assume ~id3~0 >= 0; {122421#true} is VALID [2022-02-20 18:32:48,438 INFO L290 TraceCheckUtils]: 20: Hoare triple {122421#true} assume 0 == ~r1~0 % 256; {122421#true} is VALID [2022-02-20 18:32:48,438 INFO L290 TraceCheckUtils]: 21: Hoare triple {122421#true} assume 0 == ~r2~0 % 256; {122421#true} is VALID [2022-02-20 18:32:48,438 INFO L290 TraceCheckUtils]: 22: Hoare triple {122421#true} assume 0 == ~r3~0 % 256; {122421#true} is VALID [2022-02-20 18:32:48,438 INFO L290 TraceCheckUtils]: 23: Hoare triple {122421#true} assume 0 != init_~r122~0#1 % 256; {122421#true} is VALID [2022-02-20 18:32:48,438 INFO L290 TraceCheckUtils]: 24: Hoare triple {122421#true} assume 0 != init_~r132~0#1 % 256; {122421#true} is VALID [2022-02-20 18:32:48,438 INFO L290 TraceCheckUtils]: 25: Hoare triple {122421#true} assume 0 != init_~r212~0#1 % 256; {122421#true} is VALID [2022-02-20 18:32:48,438 INFO L290 TraceCheckUtils]: 26: Hoare triple {122421#true} assume 0 != init_~r232~0#1 % 256; {122421#true} is VALID [2022-02-20 18:32:48,439 INFO L290 TraceCheckUtils]: 27: Hoare triple {122421#true} assume 0 != init_~r312~0#1 % 256; {122421#true} is VALID [2022-02-20 18:32:48,439 INFO L290 TraceCheckUtils]: 28: Hoare triple {122421#true} assume 0 != init_~r322~0#1 % 256; {122421#true} is VALID [2022-02-20 18:32:48,439 INFO L290 TraceCheckUtils]: 29: Hoare triple {122421#true} assume ~max1~0 == ~id1~0; {122421#true} is VALID [2022-02-20 18:32:48,439 INFO L290 TraceCheckUtils]: 30: Hoare triple {122421#true} assume ~max2~0 == ~id2~0; {122421#true} is VALID [2022-02-20 18:32:48,439 INFO L290 TraceCheckUtils]: 31: Hoare triple {122421#true} assume ~max3~0 == ~id3~0; {122421#true} is VALID [2022-02-20 18:32:48,439 INFO L290 TraceCheckUtils]: 32: Hoare triple {122421#true} assume 0 == ~st1~0; {122421#true} is VALID [2022-02-20 18:32:48,439 INFO L290 TraceCheckUtils]: 33: Hoare triple {122421#true} assume 0 == ~st2~0; {122421#true} is VALID [2022-02-20 18:32:48,439 INFO L290 TraceCheckUtils]: 34: Hoare triple {122421#true} assume 0 == ~st3~0; {122421#true} is VALID [2022-02-20 18:32:48,439 INFO L290 TraceCheckUtils]: 35: Hoare triple {122421#true} assume 0 == ~nl1~0; {122421#true} is VALID [2022-02-20 18:32:48,439 INFO L290 TraceCheckUtils]: 36: Hoare triple {122421#true} assume 0 == ~nl2~0; {122421#true} is VALID [2022-02-20 18:32:48,440 INFO L290 TraceCheckUtils]: 37: Hoare triple {122421#true} assume 0 == ~nl3~0; {122421#true} is VALID [2022-02-20 18:32:48,440 INFO L290 TraceCheckUtils]: 38: Hoare triple {122421#true} assume 0 == ~mode1~0 % 256; {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:48,440 INFO L290 TraceCheckUtils]: 39: Hoare triple {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:48,441 INFO L290 TraceCheckUtils]: 40: Hoare triple {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:48,441 INFO L290 TraceCheckUtils]: 41: Hoare triple {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~newmax1~0 % 256; {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:48,441 INFO L290 TraceCheckUtils]: 42: Hoare triple {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~newmax2~0 % 256; {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:48,442 INFO L290 TraceCheckUtils]: 43: Hoare triple {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:48,442 INFO L290 TraceCheckUtils]: 44: Hoare triple {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:48,442 INFO L290 TraceCheckUtils]: 45: Hoare triple {122423#(= (+ (* (- 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; {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:48,443 INFO L290 TraceCheckUtils]: 46: Hoare triple {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:48,443 INFO L290 TraceCheckUtils]: 47: Hoare triple {122423#(= (+ (* (- 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; {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:48,444 INFO L290 TraceCheckUtils]: 48: Hoare triple {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !false;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; {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:48,444 INFO L290 TraceCheckUtils]: 49: Hoare triple {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256; {122422#false} is VALID [2022-02-20 18:32:48,444 INFO L290 TraceCheckUtils]: 50: Hoare triple {122422#false} assume !(255 == ~r1~0 % 256); {122422#false} is VALID [2022-02-20 18:32:48,444 INFO L290 TraceCheckUtils]: 51: Hoare triple {122422#false} ~r1~0 := 1 + ~r1~0 % 256; {122422#false} is VALID [2022-02-20 18:32:48,444 INFO L290 TraceCheckUtils]: 52: Hoare triple {122422#false} assume !(0 != ~ep21~0 % 256); {122422#false} is VALID [2022-02-20 18:32:48,445 INFO L290 TraceCheckUtils]: 53: Hoare triple {122422#false} assume !(0 != ~ep31~0 % 256); {122422#false} is VALID [2022-02-20 18:32:48,445 INFO L290 TraceCheckUtils]: 54: Hoare triple {122422#false} ~newmax1~0 := node1_~newmax~0#1; {122422#false} is VALID [2022-02-20 18:32:48,445 INFO L290 TraceCheckUtils]: 55: Hoare triple {122422#false} assume 2 == ~r1~0 % 256; {122422#false} is VALID [2022-02-20 18:32:48,445 INFO L290 TraceCheckUtils]: 56: Hoare triple {122422#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {122422#false} is VALID [2022-02-20 18:32:48,445 INFO L290 TraceCheckUtils]: 57: Hoare triple {122422#false} ~mode1~0 := 0; {122422#false} is VALID [2022-02-20 18:32:48,445 INFO L290 TraceCheckUtils]: 58: Hoare triple {122422#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; {122422#false} is VALID [2022-02-20 18:32:48,445 INFO L290 TraceCheckUtils]: 59: Hoare triple {122422#false} assume !(0 != ~mode2~0 % 256); {122422#false} is VALID [2022-02-20 18:32:48,445 INFO L290 TraceCheckUtils]: 60: Hoare triple {122422#false} assume ~r2~0 % 256 < 2; {122422#false} is VALID [2022-02-20 18:32:48,445 INFO L290 TraceCheckUtils]: 61: Hoare triple {122422#false} assume !(0 != ~ep21~0 % 256); {122422#false} is VALID [2022-02-20 18:32:48,446 INFO L290 TraceCheckUtils]: 62: Hoare triple {122422#false} assume !(0 != ~ep23~0 % 256); {122422#false} is VALID [2022-02-20 18:32:48,446 INFO L290 TraceCheckUtils]: 63: Hoare triple {122422#false} ~mode2~0 := 1; {122422#false} is VALID [2022-02-20 18:32:48,446 INFO L290 TraceCheckUtils]: 64: Hoare triple {122422#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; {122422#false} is VALID [2022-02-20 18:32:48,446 INFO L290 TraceCheckUtils]: 65: Hoare triple {122422#false} assume !(0 != ~mode3~0 % 256); {122422#false} is VALID [2022-02-20 18:32:48,446 INFO L290 TraceCheckUtils]: 66: Hoare triple {122422#false} assume ~r3~0 % 256 < 2; {122422#false} is VALID [2022-02-20 18:32:48,446 INFO L290 TraceCheckUtils]: 67: Hoare triple {122422#false} assume !(0 != ~ep31~0 % 256); {122422#false} is VALID [2022-02-20 18:32:48,446 INFO L290 TraceCheckUtils]: 68: Hoare triple {122422#false} assume !(0 != ~ep32~0 % 256); {122422#false} is VALID [2022-02-20 18:32:48,446 INFO L290 TraceCheckUtils]: 69: Hoare triple {122422#false} ~mode3~0 := 1; {122422#false} is VALID [2022-02-20 18:32:48,446 INFO L290 TraceCheckUtils]: 70: Hoare triple {122422#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; {122422#false} is VALID [2022-02-20 18:32:48,447 INFO L290 TraceCheckUtils]: 71: Hoare triple {122422#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {122422#false} is VALID [2022-02-20 18:32:48,447 INFO L290 TraceCheckUtils]: 72: Hoare triple {122422#false} check_#res#1 := check_~tmp~1#1; {122422#false} is VALID [2022-02-20 18:32:48,447 INFO L290 TraceCheckUtils]: 73: Hoare triple {122422#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; {122422#false} is VALID [2022-02-20 18:32:48,447 INFO L290 TraceCheckUtils]: 74: Hoare triple {122422#false} assume 0 == assert_~arg#1 % 256; {122422#false} is VALID [2022-02-20 18:32:48,447 INFO L290 TraceCheckUtils]: 75: Hoare triple {122422#false} assume !false; {122422#false} is VALID [2022-02-20 18:32:48,447 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:48,447 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:48,448 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962248002] [2022-02-20 18:32:48,448 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962248002] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:48,448 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:48,448 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:32:48,448 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878192592] [2022-02-20 18:32:48,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:48,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:32:48,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:48,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call 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:48,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:48,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:32:48,487 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:48,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:32:48,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:32:48,488 INFO L87 Difference]: Start difference. First operand 7902 states and 12578 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:33:03,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:33:03,299 INFO L93 Difference]: Finished difference Result 17511 states and 28108 transitions. [2022-02-20 18:33:03,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:33:03,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:33:03,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:33:03,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:33:03,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2022-02-20 18:33:03,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:33:03,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2022-02-20 18:33:03,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 470 transitions. [2022-02-20 18:33:03,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 470 edges. 470 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:33:07,419 INFO L225 Difference]: With dead ends: 17511 [2022-02-20 18:33:07,419 INFO L226 Difference]: Without dead ends: 11763 [2022-02-20 18:33:07,423 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:33:07,424 INFO L933 BasicCegarLoop]: 315 mSDtfsCounter, 122 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 503 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:33:07,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 503 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:33:07,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11763 states.