./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label35.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/eca-rers2012/Problem12_label35.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 d2c88e57f95302454037a8b8cda92c4c6c828f58a1c1642f9d0e242d65cc598d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 15:30:58,113 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 15:30:58,114 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 15:30:58,132 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 15:30:58,133 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 15:30:58,134 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 15:30:58,135 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 15:30:58,136 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 15:30:58,137 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 15:30:58,138 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 15:30:58,138 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 15:30:58,139 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 15:30:58,140 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 15:30:58,140 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 15:30:58,141 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 15:30:58,142 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 15:30:58,142 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 15:30:58,143 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 15:30:58,144 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 15:30:58,145 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 15:30:58,146 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 15:30:58,147 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 15:30:58,153 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 15:30:58,154 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 15:30:58,156 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 15:30:58,163 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 15:30:58,163 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 15:30:58,164 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 15:30:58,164 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 15:30:58,165 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 15:30:58,165 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 15:30:58,166 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 15:30:58,166 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 15:30:58,167 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 15:30:58,168 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 15:30:58,168 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 15:30:58,169 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 15:30:58,170 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 15:30:58,170 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 15:30:58,171 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 15:30:58,171 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 15:30:58,172 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 15:30:58,188 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 15:30:58,195 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 15:30:58,196 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 15:30:58,196 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 15:30:58,196 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 15:30:58,197 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 15:30:58,197 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 15:30:58,197 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 15:30:58,197 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 15:30:58,197 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 15:30:58,198 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 15:30:58,198 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 15:30:58,198 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 15:30:58,199 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 15:30:58,199 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 15:30:58,199 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 15:30:58,199 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 15:30:58,199 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 15:30:58,199 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 15:30:58,200 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 15:30:58,200 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 15:30:58,200 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 15:30:58,200 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 15:30:58,200 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 15:30:58,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 15:30:58,201 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 15:30:58,201 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 15:30:58,202 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 15:30:58,202 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 15:30:58,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 15:30:58,202 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 15:30:58,202 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 15:30:58,202 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 15:30:58,203 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 -> d2c88e57f95302454037a8b8cda92c4c6c828f58a1c1642f9d0e242d65cc598d [2022-02-20 15:30:58,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 15:30:58,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 15:30:58,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 15:30:58,417 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 15:30:58,417 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 15:30:58,418 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label35.c [2022-02-20 15:30:58,474 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/144c1ed36/9cdfa9e3a8c743deabd0f3cc55fd3a29/FLAG43f47a4d4 [2022-02-20 15:30:59,004 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 15:30:59,005 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label35.c [2022-02-20 15:30:59,029 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/144c1ed36/9cdfa9e3a8c743deabd0f3cc55fd3a29/FLAG43f47a4d4 [2022-02-20 15:30:59,489 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/144c1ed36/9cdfa9e3a8c743deabd0f3cc55fd3a29 [2022-02-20 15:30:59,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 15:30:59,492 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 15:30:59,494 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 15:30:59,494 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 15:30:59,496 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 15:30:59,497 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 03:30:59" (1/1) ... [2022-02-20 15:30:59,497 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e647fe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:30:59, skipping insertion in model container [2022-02-20 15:30:59,497 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 03:30:59" (1/1) ... [2022-02-20 15:30:59,502 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 15:30:59,594 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 15:30:59,792 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/eca-rers2012/Problem12_label35.c[1310,1323] [2022-02-20 15:31:00,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 15:31:00,514 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 15:31:00,523 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/eca-rers2012/Problem12_label35.c[1310,1323] [2022-02-20 15:31:00,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 15:31:00,857 INFO L208 MainTranslator]: Completed translation [2022-02-20 15:31:00,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:31:00 WrapperNode [2022-02-20 15:31:00,857 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 15:31:00,858 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 15:31:00,858 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 15:31:00,859 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 15:31:00,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:31:00" (1/1) ... [2022-02-20 15:31:00,920 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:31:00" (1/1) ... [2022-02-20 15:31:01,202 INFO L137 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4757 [2022-02-20 15:31:01,203 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 15:31:01,204 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 15:31:01,204 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 15:31:01,204 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 15:31:01,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:31:00" (1/1) ... [2022-02-20 15:31:01,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:31:00" (1/1) ... [2022-02-20 15:31:01,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:31:00" (1/1) ... [2022-02-20 15:31:01,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:31:00" (1/1) ... [2022-02-20 15:31:01,394 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:31:00" (1/1) ... [2022-02-20 15:31:01,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:31:00" (1/1) ... [2022-02-20 15:31:01,433 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:31:00" (1/1) ... [2022-02-20 15:31:01,506 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 15:31:01,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 15:31:01,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 15:31:01,517 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 15:31:01,523 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:31:00" (1/1) ... [2022-02-20 15:31:01,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 15:31:01,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 15:31:01,547 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 15:31:01,563 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 15:31:01,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 15:31:01,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 15:31:01,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 15:31:01,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 15:31:01,655 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 15:31:01,672 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 15:31:08,013 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 15:31:08,023 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 15:31:08,023 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 15:31:08,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 03:31:08 BoogieIcfgContainer [2022-02-20 15:31:08,025 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 15:31:08,026 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 15:31:08,027 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 15:31:08,029 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 15:31:08,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 03:30:59" (1/3) ... [2022-02-20 15:31:08,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ccb54d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 03:31:08, skipping insertion in model container [2022-02-20 15:31:08,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:31:00" (2/3) ... [2022-02-20 15:31:08,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ccb54d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 03:31:08, skipping insertion in model container [2022-02-20 15:31:08,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 03:31:08" (3/3) ... [2022-02-20 15:31:08,031 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem12_label35.c [2022-02-20 15:31:08,035 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 15:31:08,035 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 15:31:08,071 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 15:31:08,075 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 15:31:08,075 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 15:31:08,107 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9178921568627452) internal successors, (1565), 817 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:31:08,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 15:31:08,110 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 15:31:08,110 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 15:31:08,111 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 15:31:08,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 15:31:08,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1810726993, now seen corresponding path program 1 times [2022-02-20 15:31:08,123 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 15:31:08,124 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144105167] [2022-02-20 15:31:08,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 15:31:08,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 15:31:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 15:31:08,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {821#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(20, 2);call #Ultimate.allocInit(12, 3);~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {823#(<= 15 ~a24~0)} is VALID [2022-02-20 15:31:08,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {823#(<= 15 ~a24~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1; {823#(<= 15 ~a24~0)} is VALID [2022-02-20 15:31:08,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {823#(<= 15 ~a24~0)} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~input~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {823#(<= 15 ~a24~0)} is VALID [2022-02-20 15:31:08,293 INFO L290 TraceCheckUtils]: 3: Hoare triple {823#(<= 15 ~a24~0)} assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret9#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {823#(<= 15 ~a24~0)} is VALID [2022-02-20 15:31:08,293 INFO L290 TraceCheckUtils]: 4: Hoare triple {823#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {823#(<= 15 ~a24~0)} is VALID [2022-02-20 15:31:08,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {823#(<= 15 ~a24~0)} assume (((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0; {822#false} is VALID [2022-02-20 15:31:08,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {822#false} assume !false; {822#false} is VALID [2022-02-20 15:31:08,295 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 15:31:08,295 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 15:31:08,295 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144105167] [2022-02-20 15:31:08,296 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144105167] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 15:31:08,296 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 15:31:08,296 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 15:31:08,297 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847811676] [2022-02-20 15:31:08,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 15:31:08,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-20 15:31:08,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 15:31:08,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:31:08,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:31:08,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 15:31:08,315 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 15:31:08,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 15:31:08,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 15:31:08,338 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9178921568627452) internal successors, (1565), 817 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:31:13,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:31:13,547 INFO L93 Difference]: Finished difference Result 2388 states and 4629 transitions. [2022-02-20 15:31:13,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 15:31:13,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-20 15:31:13,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 15:31:13,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:31:13,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4629 transitions. [2022-02-20 15:31:13,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:31:13,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4629 transitions. [2022-02-20 15:31:13,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4629 transitions. [2022-02-20 15:31:16,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4629 edges. 4629 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:31:17,077 INFO L225 Difference]: With dead ends: 2388 [2022-02-20 15:31:17,078 INFO L226 Difference]: Without dead ends: 1506 [2022-02-20 15:31:17,085 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 15:31:17,087 INFO L933 BasicCegarLoop]: 471 mSDtfsCounter, 827 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 2334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-20 15:31:17,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [827 Valid, 481 Invalid, 2985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 2334 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-02-20 15:31:17,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2022-02-20 15:31:17,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2022-02-20 15:31:17,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 15:31:17,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1506 states. Second operand has 1506 states, 1505 states have (on average 1.6385382059800664) internal successors, (2466), 1505 states have internal predecessors, (2466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:31:17,174 INFO L74 IsIncluded]: Start isIncluded. First operand 1506 states. Second operand has 1506 states, 1505 states have (on average 1.6385382059800664) internal successors, (2466), 1505 states have internal predecessors, (2466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:31:17,176 INFO L87 Difference]: Start difference. First operand 1506 states. Second operand has 1506 states, 1505 states have (on average 1.6385382059800664) internal successors, (2466), 1505 states have internal predecessors, (2466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:31:17,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:31:17,237 INFO L93 Difference]: Finished difference Result 1506 states and 2466 transitions. [2022-02-20 15:31:17,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2466 transitions. [2022-02-20 15:31:17,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:31:17,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:31:17,249 INFO L74 IsIncluded]: Start isIncluded. First operand has 1506 states, 1505 states have (on average 1.6385382059800664) internal successors, (2466), 1505 states have internal predecessors, (2466), 0 states have call successors, (0), 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 1506 states. [2022-02-20 15:31:17,251 INFO L87 Difference]: Start difference. First operand has 1506 states, 1505 states have (on average 1.6385382059800664) internal successors, (2466), 1505 states have internal predecessors, (2466), 0 states have call successors, (0), 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 1506 states. [2022-02-20 15:31:17,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:31:17,311 INFO L93 Difference]: Finished difference Result 1506 states and 2466 transitions. [2022-02-20 15:31:17,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2466 transitions. [2022-02-20 15:31:17,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:31:17,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:31:17,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 15:31:17,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 15:31:17,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1505 states have (on average 1.6385382059800664) internal successors, (2466), 1505 states have internal predecessors, (2466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:31:17,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2466 transitions. [2022-02-20 15:31:17,380 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2466 transitions. Word has length 7 [2022-02-20 15:31:17,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 15:31:17,381 INFO L470 AbstractCegarLoop]: Abstraction has 1506 states and 2466 transitions. [2022-02-20 15:31:17,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:31:17,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2466 transitions. [2022-02-20 15:31:17,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 15:31:17,383 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 15:31:17,384 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:31:17,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 15:31:17,384 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 15:31:17,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 15:31:17,386 INFO L85 PathProgramCache]: Analyzing trace with hash 26642083, now seen corresponding path program 1 times [2022-02-20 15:31:17,387 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 15:31:17,387 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652618401] [2022-02-20 15:31:17,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 15:31:17,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 15:31:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 15:31:17,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {7760#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(20, 2);call #Ultimate.allocInit(12, 3);~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {7760#true} is VALID [2022-02-20 15:31:17,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {7760#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1; {7760#true} is VALID [2022-02-20 15:31:17,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {7760#true} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~input~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {7760#true} is VALID [2022-02-20 15:31:17,578 INFO L290 TraceCheckUtils]: 3: Hoare triple {7760#true} assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret9#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {7760#true} is VALID [2022-02-20 15:31:17,578 INFO L290 TraceCheckUtils]: 4: Hoare triple {7760#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {7760#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {7760#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {7760#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {7760#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,579 INFO L290 TraceCheckUtils]: 9: Hoare triple {7760#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,582 INFO L290 TraceCheckUtils]: 10: Hoare triple {7760#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,582 INFO L290 TraceCheckUtils]: 11: Hoare triple {7760#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {7760#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {7760#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {7760#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {7760#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,587 INFO L290 TraceCheckUtils]: 16: Hoare triple {7760#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,587 INFO L290 TraceCheckUtils]: 17: Hoare triple {7760#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {7760#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,587 INFO L290 TraceCheckUtils]: 19: Hoare triple {7760#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {7760#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,588 INFO L290 TraceCheckUtils]: 21: Hoare triple {7760#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,588 INFO L290 TraceCheckUtils]: 22: Hoare triple {7760#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,588 INFO L290 TraceCheckUtils]: 23: Hoare triple {7760#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,588 INFO L290 TraceCheckUtils]: 24: Hoare triple {7760#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,589 INFO L290 TraceCheckUtils]: 25: Hoare triple {7760#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,589 INFO L290 TraceCheckUtils]: 26: Hoare triple {7760#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,590 INFO L290 TraceCheckUtils]: 27: Hoare triple {7760#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,590 INFO L290 TraceCheckUtils]: 28: Hoare triple {7760#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,590 INFO L290 TraceCheckUtils]: 29: Hoare triple {7760#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,590 INFO L290 TraceCheckUtils]: 30: Hoare triple {7760#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,591 INFO L290 TraceCheckUtils]: 31: Hoare triple {7760#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,591 INFO L290 TraceCheckUtils]: 32: Hoare triple {7760#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,591 INFO L290 TraceCheckUtils]: 33: Hoare triple {7760#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,591 INFO L290 TraceCheckUtils]: 34: Hoare triple {7760#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,591 INFO L290 TraceCheckUtils]: 35: Hoare triple {7760#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,592 INFO L290 TraceCheckUtils]: 36: Hoare triple {7760#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,592 INFO L290 TraceCheckUtils]: 37: Hoare triple {7760#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,592 INFO L290 TraceCheckUtils]: 38: Hoare triple {7760#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,592 INFO L290 TraceCheckUtils]: 39: Hoare triple {7760#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,592 INFO L290 TraceCheckUtils]: 40: Hoare triple {7760#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,593 INFO L290 TraceCheckUtils]: 41: Hoare triple {7760#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,593 INFO L290 TraceCheckUtils]: 42: Hoare triple {7760#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,596 INFO L290 TraceCheckUtils]: 43: Hoare triple {7760#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,596 INFO L290 TraceCheckUtils]: 44: Hoare triple {7760#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,597 INFO L290 TraceCheckUtils]: 45: Hoare triple {7760#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,597 INFO L290 TraceCheckUtils]: 46: Hoare triple {7760#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,597 INFO L290 TraceCheckUtils]: 47: Hoare triple {7760#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,597 INFO L290 TraceCheckUtils]: 48: Hoare triple {7760#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,598 INFO L290 TraceCheckUtils]: 49: Hoare triple {7760#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,598 INFO L290 TraceCheckUtils]: 50: Hoare triple {7760#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,598 INFO L290 TraceCheckUtils]: 51: Hoare triple {7760#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,598 INFO L290 TraceCheckUtils]: 52: Hoare triple {7760#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,598 INFO L290 TraceCheckUtils]: 53: Hoare triple {7760#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,599 INFO L290 TraceCheckUtils]: 54: Hoare triple {7760#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,599 INFO L290 TraceCheckUtils]: 55: Hoare triple {7760#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,599 INFO L290 TraceCheckUtils]: 56: Hoare triple {7760#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,599 INFO L290 TraceCheckUtils]: 57: Hoare triple {7760#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,599 INFO L290 TraceCheckUtils]: 58: Hoare triple {7760#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,600 INFO L290 TraceCheckUtils]: 59: Hoare triple {7760#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,600 INFO L290 TraceCheckUtils]: 60: Hoare triple {7760#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,600 INFO L290 TraceCheckUtils]: 61: Hoare triple {7760#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,600 INFO L290 TraceCheckUtils]: 62: Hoare triple {7760#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,601 INFO L290 TraceCheckUtils]: 63: Hoare triple {7760#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,601 INFO L290 TraceCheckUtils]: 64: Hoare triple {7760#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,601 INFO L290 TraceCheckUtils]: 65: Hoare triple {7760#true} assume !((((189 < ~a2~0 && 281 >= ~a2~0) && 4 == calculate_output_~input#1 && ((12 == ~a7~0 && 255 < ~a17~0) || (13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a7~0))) && 4 == ~a5~0) && 14 == ~a24~0); {7760#true} is VALID [2022-02-20 15:31:17,601 INFO L290 TraceCheckUtils]: 66: Hoare triple {7760#true} assume !(((13 == ~a24~0 && (2 == calculate_output_~input#1 && (13 == ~a7~0 || 14 == ~a7~0)) && 3 == ~a5~0) && ~a17~0 <= -108) && 189 < ~a2~0 && 281 >= ~a2~0); {7760#true} is VALID [2022-02-20 15:31:17,601 INFO L290 TraceCheckUtils]: 67: Hoare triple {7760#true} assume !((((((12 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a7~0) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a7~0)) && 1 == calculate_output_~input#1) && 14 == ~a24~0) && 189 < ~a2~0 && 281 >= ~a2~0) && 5 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,602 INFO L290 TraceCheckUtils]: 68: Hoare triple {7760#true} assume !((((189 < ~a2~0 && 281 >= ~a2~0) && (((~a17~0 <= -108 && 13 == ~a7~0) || (~a17~0 <= -108 && 14 == ~a7~0)) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 12 == ~a7~0)) && 4 == calculate_output_~input#1) && 3 == ~a5~0) && 14 == ~a24~0); {7760#true} is VALID [2022-02-20 15:31:17,602 INFO L290 TraceCheckUtils]: 69: Hoare triple {7760#true} assume !(6 == ~a5~0 && (13 == ~a24~0 && 6 == calculate_output_~input#1 && (((13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || (14 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0)) || (255 < ~a17~0 && 12 == ~a7~0))) && ~a2~0 <= 189); {7760#true} is VALID [2022-02-20 15:31:17,602 INFO L290 TraceCheckUtils]: 70: Hoare triple {7760#true} assume !((13 == ~a24~0 && (189 < ~a2~0 && 281 >= ~a2~0) && (((13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a7~0)) || (255 < ~a17~0 && 12 == ~a7~0)) && 3 == calculate_output_~input#1) && 6 == ~a5~0); {7760#true} is VALID [2022-02-20 15:31:17,603 INFO L290 TraceCheckUtils]: 71: Hoare triple {7760#true} assume 4 == ~a5~0 && ~a2~0 <= 189 && ((1 == calculate_output_~input#1 && (13 == ~a7~0 || 14 == ~a7~0)) && ~a17~0 <= -108) && 15 == ~a24~0;~a7~0 := 12;~a24~0 := 13;~a5~0 := 3;calculate_output_#res#1 := -1; {7762#(= 3 ~a5~0)} is VALID [2022-02-20 15:31:17,603 INFO L290 TraceCheckUtils]: 72: Hoare triple {7762#(= 3 ~a5~0)} main_#t~ret13#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647;main_~output~0#1 := main_#t~ret13#1;havoc main_#t~ret13#1; {7762#(= 3 ~a5~0)} is VALID [2022-02-20 15:31:17,604 INFO L290 TraceCheckUtils]: 73: Hoare triple {7762#(= 3 ~a5~0)} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~input~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {7762#(= 3 ~a5~0)} is VALID [2022-02-20 15:31:17,604 INFO L290 TraceCheckUtils]: 74: Hoare triple {7762#(= 3 ~a5~0)} assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret9#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {7762#(= 3 ~a5~0)} is VALID [2022-02-20 15:31:17,605 INFO L290 TraceCheckUtils]: 75: Hoare triple {7762#(= 3 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {7762#(= 3 ~a5~0)} is VALID [2022-02-20 15:31:17,605 INFO L290 TraceCheckUtils]: 76: Hoare triple {7762#(= 3 ~a5~0)} assume (((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0; {7761#false} is VALID [2022-02-20 15:31:17,605 INFO L290 TraceCheckUtils]: 77: Hoare triple {7761#false} assume !false; {7761#false} is VALID [2022-02-20 15:31:17,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 15:31:17,606 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 15:31:17,607 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652618401] [2022-02-20 15:31:17,607 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652618401] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 15:31:17,607 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 15:31:17,607 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 15:31:17,607 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564934718] [2022-02-20 15:31:17,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 15:31:17,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 15:31:17,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 15:31:17,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:31:17,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:31:17,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 15:31:17,662 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 15:31:17,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 15:31:17,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 15:31:17,663 INFO L87 Difference]: Start difference. First operand 1506 states and 2466 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:31:22,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:31:22,957 INFO L93 Difference]: Finished difference Result 4512 states and 7393 transitions. [2022-02-20 15:31:22,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 15:31:22,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 15:31:22,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 15:31:22,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:31:22,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4312 transitions. [2022-02-20 15:31:22,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:31:22,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4312 transitions. [2022-02-20 15:31:22,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4312 transitions. [2022-02-20 15:31:26,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4312 edges. 4312 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:31:26,266 INFO L225 Difference]: With dead ends: 4512 [2022-02-20 15:31:26,267 INFO L226 Difference]: Without dead ends: 3008 [2022-02-20 15:31:26,268 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 15:31:26,269 INFO L933 BasicCegarLoop]: 1383 mSDtfsCounter, 772 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1982 mSolverCounterSat, 885 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 2867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 885 IncrementalHoareTripleChecker+Valid, 1982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-02-20 15:31:26,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [772 Valid, 1391 Invalid, 2867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [885 Valid, 1982 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-02-20 15:31:26,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2022-02-20 15:31:26,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 3008. [2022-02-20 15:31:26,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 15:31:26,327 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3008 states. Second operand has 3008 states, 3007 states have (on average 1.3634852011972065) internal successors, (4100), 3007 states have internal predecessors, (4100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:31:26,331 INFO L74 IsIncluded]: Start isIncluded. First operand 3008 states. Second operand has 3008 states, 3007 states have (on average 1.3634852011972065) internal successors, (4100), 3007 states have internal predecessors, (4100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:31:26,334 INFO L87 Difference]: Start difference. First operand 3008 states. Second operand has 3008 states, 3007 states have (on average 1.3634852011972065) internal successors, (4100), 3007 states have internal predecessors, (4100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:31:26,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:31:26,606 INFO L93 Difference]: Finished difference Result 3008 states and 4100 transitions. [2022-02-20 15:31:26,606 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 4100 transitions. [2022-02-20 15:31:26,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:31:26,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:31:26,614 INFO L74 IsIncluded]: Start isIncluded. First operand has 3008 states, 3007 states have (on average 1.3634852011972065) internal successors, (4100), 3007 states have internal predecessors, (4100), 0 states have call successors, (0), 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 3008 states. [2022-02-20 15:31:26,622 INFO L87 Difference]: Start difference. First operand has 3008 states, 3007 states have (on average 1.3634852011972065) internal successors, (4100), 3007 states have internal predecessors, (4100), 0 states have call successors, (0), 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 3008 states. [2022-02-20 15:31:26,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:31:26,908 INFO L93 Difference]: Finished difference Result 3008 states and 4100 transitions. [2022-02-20 15:31:26,908 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 4100 transitions. [2022-02-20 15:31:26,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:31:26,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:31:26,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 15:31:26,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 15:31:26,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 3007 states have (on average 1.3634852011972065) internal successors, (4100), 3007 states have internal predecessors, (4100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:31:27,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4100 transitions. [2022-02-20 15:31:27,147 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 4100 transitions. Word has length 78 [2022-02-20 15:31:27,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 15:31:27,148 INFO L470 AbstractCegarLoop]: Abstraction has 3008 states and 4100 transitions. [2022-02-20 15:31:27,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:31:27,148 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 4100 transitions. [2022-02-20 15:31:27,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-02-20 15:31:27,149 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 15:31:27,149 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:31:27,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 15:31:27,150 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 15:31:27,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 15:31:27,150 INFO L85 PathProgramCache]: Analyzing trace with hash 940371373, now seen corresponding path program 1 times [2022-02-20 15:31:27,150 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 15:31:27,150 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676507289] [2022-02-20 15:31:27,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 15:31:27,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 15:31:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 15:31:27,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {21351#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(20, 2);call #Ultimate.allocInit(12, 3);~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {21353#(<= ~a5~0 4)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1; {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {21353#(<= ~a5~0 4)} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~input~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,257 INFO L290 TraceCheckUtils]: 3: Hoare triple {21353#(<= ~a5~0 4)} assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret9#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,257 INFO L290 TraceCheckUtils]: 4: Hoare triple {21353#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {21353#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,258 INFO L290 TraceCheckUtils]: 6: Hoare triple {21353#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {21353#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {21353#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {21353#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,259 INFO L290 TraceCheckUtils]: 10: Hoare triple {21353#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {21353#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,260 INFO L290 TraceCheckUtils]: 12: Hoare triple {21353#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {21353#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {21353#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,261 INFO L290 TraceCheckUtils]: 15: Hoare triple {21353#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,261 INFO L290 TraceCheckUtils]: 16: Hoare triple {21353#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {21353#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,262 INFO L290 TraceCheckUtils]: 18: Hoare triple {21353#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,262 INFO L290 TraceCheckUtils]: 19: Hoare triple {21353#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,263 INFO L290 TraceCheckUtils]: 20: Hoare triple {21353#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,263 INFO L290 TraceCheckUtils]: 21: Hoare triple {21353#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,263 INFO L290 TraceCheckUtils]: 22: Hoare triple {21353#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {21353#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {21353#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,264 INFO L290 TraceCheckUtils]: 25: Hoare triple {21353#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,265 INFO L290 TraceCheckUtils]: 26: Hoare triple {21353#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,265 INFO L290 TraceCheckUtils]: 27: Hoare triple {21353#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,265 INFO L290 TraceCheckUtils]: 28: Hoare triple {21353#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,265 INFO L290 TraceCheckUtils]: 29: Hoare triple {21353#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,266 INFO L290 TraceCheckUtils]: 30: Hoare triple {21353#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,266 INFO L290 TraceCheckUtils]: 31: Hoare triple {21353#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,266 INFO L290 TraceCheckUtils]: 32: Hoare triple {21353#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,267 INFO L290 TraceCheckUtils]: 33: Hoare triple {21353#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,267 INFO L290 TraceCheckUtils]: 34: Hoare triple {21353#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,267 INFO L290 TraceCheckUtils]: 35: Hoare triple {21353#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,268 INFO L290 TraceCheckUtils]: 36: Hoare triple {21353#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,268 INFO L290 TraceCheckUtils]: 37: Hoare triple {21353#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,268 INFO L290 TraceCheckUtils]: 38: Hoare triple {21353#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,269 INFO L290 TraceCheckUtils]: 39: Hoare triple {21353#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,269 INFO L290 TraceCheckUtils]: 40: Hoare triple {21353#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,269 INFO L290 TraceCheckUtils]: 41: Hoare triple {21353#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,270 INFO L290 TraceCheckUtils]: 42: Hoare triple {21353#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,270 INFO L290 TraceCheckUtils]: 43: Hoare triple {21353#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,270 INFO L290 TraceCheckUtils]: 44: Hoare triple {21353#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,270 INFO L290 TraceCheckUtils]: 45: Hoare triple {21353#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,271 INFO L290 TraceCheckUtils]: 46: Hoare triple {21353#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,271 INFO L290 TraceCheckUtils]: 47: Hoare triple {21353#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,271 INFO L290 TraceCheckUtils]: 48: Hoare triple {21353#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,272 INFO L290 TraceCheckUtils]: 49: Hoare triple {21353#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,272 INFO L290 TraceCheckUtils]: 50: Hoare triple {21353#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,272 INFO L290 TraceCheckUtils]: 51: Hoare triple {21353#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,273 INFO L290 TraceCheckUtils]: 52: Hoare triple {21353#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,273 INFO L290 TraceCheckUtils]: 53: Hoare triple {21353#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,273 INFO L290 TraceCheckUtils]: 54: Hoare triple {21353#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,274 INFO L290 TraceCheckUtils]: 55: Hoare triple {21353#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,274 INFO L290 TraceCheckUtils]: 56: Hoare triple {21353#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,274 INFO L290 TraceCheckUtils]: 57: Hoare triple {21353#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,275 INFO L290 TraceCheckUtils]: 58: Hoare triple {21353#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,275 INFO L290 TraceCheckUtils]: 59: Hoare triple {21353#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,275 INFO L290 TraceCheckUtils]: 60: Hoare triple {21353#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,275 INFO L290 TraceCheckUtils]: 61: Hoare triple {21353#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,276 INFO L290 TraceCheckUtils]: 62: Hoare triple {21353#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,276 INFO L290 TraceCheckUtils]: 63: Hoare triple {21353#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,276 INFO L290 TraceCheckUtils]: 64: Hoare triple {21353#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,277 INFO L290 TraceCheckUtils]: 65: Hoare triple {21353#(<= ~a5~0 4)} assume !((((189 < ~a2~0 && 281 >= ~a2~0) && 4 == calculate_output_~input#1 && ((12 == ~a7~0 && 255 < ~a17~0) || (13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a7~0))) && 4 == ~a5~0) && 14 == ~a24~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,277 INFO L290 TraceCheckUtils]: 66: Hoare triple {21353#(<= ~a5~0 4)} assume !(((13 == ~a24~0 && (2 == calculate_output_~input#1 && (13 == ~a7~0 || 14 == ~a7~0)) && 3 == ~a5~0) && ~a17~0 <= -108) && 189 < ~a2~0 && 281 >= ~a2~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,277 INFO L290 TraceCheckUtils]: 67: Hoare triple {21353#(<= ~a5~0 4)} assume !((((((12 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a7~0) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a7~0)) && 1 == calculate_output_~input#1) && 14 == ~a24~0) && 189 < ~a2~0 && 281 >= ~a2~0) && 5 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,278 INFO L290 TraceCheckUtils]: 68: Hoare triple {21353#(<= ~a5~0 4)} assume !((((189 < ~a2~0 && 281 >= ~a2~0) && (((~a17~0 <= -108 && 13 == ~a7~0) || (~a17~0 <= -108 && 14 == ~a7~0)) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 12 == ~a7~0)) && 4 == calculate_output_~input#1) && 3 == ~a5~0) && 14 == ~a24~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,278 INFO L290 TraceCheckUtils]: 69: Hoare triple {21353#(<= ~a5~0 4)} assume !(6 == ~a5~0 && (13 == ~a24~0 && 6 == calculate_output_~input#1 && (((13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || (14 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0)) || (255 < ~a17~0 && 12 == ~a7~0))) && ~a2~0 <= 189); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,278 INFO L290 TraceCheckUtils]: 70: Hoare triple {21353#(<= ~a5~0 4)} assume !((13 == ~a24~0 && (189 < ~a2~0 && 281 >= ~a2~0) && (((13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a7~0)) || (255 < ~a17~0 && 12 == ~a7~0)) && 3 == calculate_output_~input#1) && 6 == ~a5~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,279 INFO L290 TraceCheckUtils]: 71: Hoare triple {21353#(<= ~a5~0 4)} assume !(4 == ~a5~0 && ~a2~0 <= 189 && ((1 == calculate_output_~input#1 && (13 == ~a7~0 || 14 == ~a7~0)) && ~a17~0 <= -108) && 15 == ~a24~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,279 INFO L290 TraceCheckUtils]: 72: Hoare triple {21353#(<= ~a5~0 4)} assume !(15 == ~a24~0 && (((189 < ~a2~0 && 281 >= ~a2~0) && 1 == calculate_output_~input#1 && 4 == ~a5~0) && 13 == ~a7~0) && 255 < ~a17~0); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,279 INFO L290 TraceCheckUtils]: 73: Hoare triple {21353#(<= ~a5~0 4)} assume !(4 == ~a5~0 && (189 < ~a2~0 && 281 >= ~a2~0) && 14 == ~a24~0 && (((-108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a7~0) || (12 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0)) && 4 == calculate_output_~input#1); {21353#(<= ~a5~0 4)} is VALID [2022-02-20 15:31:27,280 INFO L290 TraceCheckUtils]: 74: Hoare triple {21353#(<= ~a5~0 4)} assume ((5 == ~a5~0 && ~a2~0 <= 189 && 1 == calculate_output_~input#1 && 15 == ~a24~0) && 255 < ~a17~0) && 14 == ~a7~0;~a2~0 := (if 5 * (236 + (if ~a2~0 < 0 && 0 != ~a2~0 % 45 then ~a2~0 % 45 - 45 else ~a2~0 % 45)) < 0 && 0 != 5 * (236 + (if ~a2~0 < 0 && 0 != ~a2~0 % 45 then ~a2~0 % 45 - 45 else ~a2~0 % 45)) % 45 then 5 * (236 + (if ~a2~0 < 0 && 0 != ~a2~0 % 45 then ~a2~0 % 45 - 45 else ~a2~0 % 45)) % 45 - 45 else 5 * (236 + (if ~a2~0 < 0 && 0 != ~a2~0 % 45 then ~a2~0 % 45 - 45 else ~a2~0 % 45)) % 45) - -199;~a7~0 := 13;~a24~0 := 14;calculate_output_#res#1 := 26; {21352#false} is VALID [2022-02-20 15:31:27,280 INFO L290 TraceCheckUtils]: 75: Hoare triple {21352#false} main_#t~ret13#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647;main_~output~0#1 := main_#t~ret13#1;havoc main_#t~ret13#1; {21352#false} is VALID [2022-02-20 15:31:27,280 INFO L290 TraceCheckUtils]: 76: Hoare triple {21352#false} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~input~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {21352#false} is VALID [2022-02-20 15:31:27,280 INFO L290 TraceCheckUtils]: 77: Hoare triple {21352#false} assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret9#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {21352#false} is VALID [2022-02-20 15:31:27,281 INFO L290 TraceCheckUtils]: 78: Hoare triple {21352#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {21352#false} is VALID [2022-02-20 15:31:27,281 INFO L290 TraceCheckUtils]: 79: Hoare triple {21352#false} assume (((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0; {21352#false} is VALID [2022-02-20 15:31:27,281 INFO L290 TraceCheckUtils]: 80: Hoare triple {21352#false} assume !false; {21352#false} is VALID [2022-02-20 15:31:27,281 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 15:31:27,281 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 15:31:27,282 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676507289] [2022-02-20 15:31:27,282 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676507289] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 15:31:27,283 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 15:31:27,283 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 15:31:27,283 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253391441] [2022-02-20 15:31:27,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 15:31:27,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2022-02-20 15:31:27,284 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 15:31:27,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:31:27,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:31:27,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 15:31:27,334 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 15:31:27,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 15:31:27,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 15:31:27,335 INFO L87 Difference]: Start difference. First operand 3008 states and 4100 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:31:33,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:31:33,458 INFO L93 Difference]: Finished difference Result 7516 states and 10661 transitions. [2022-02-20 15:31:33,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 15:31:33,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2022-02-20 15:31:33,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 15:31:33,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:31:33,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4312 transitions. [2022-02-20 15:31:33,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:31:33,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4312 transitions. [2022-02-20 15:31:33,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4312 transitions. [2022-02-20 15:31:36,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4312 edges. 4312 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:31:37,095 INFO L225 Difference]: With dead ends: 7516 [2022-02-20 15:31:37,095 INFO L226 Difference]: Without dead ends: 4510 [2022-02-20 15:31:37,098 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 15:31:37,098 INFO L933 BasicCegarLoop]: 514 mSDtfsCounter, 748 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2016 mSolverCounterSat, 910 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 2926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 910 IncrementalHoareTripleChecker+Valid, 2016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-02-20 15:31:37,099 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [748 Valid, 520 Invalid, 2926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [910 Valid, 2016 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-02-20 15:31:37,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4510 states. [2022-02-20 15:31:37,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4510 to 4510. [2022-02-20 15:31:37,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 15:31:37,164 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4510 states. Second operand has 4510 states, 4509 states have (on average 1.3251275227323132) internal successors, (5975), 4509 states have internal predecessors, (5975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:31:37,169 INFO L74 IsIncluded]: Start isIncluded. First operand 4510 states. Second operand has 4510 states, 4509 states have (on average 1.3251275227323132) internal successors, (5975), 4509 states have internal predecessors, (5975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:31:37,173 INFO L87 Difference]: Start difference. First operand 4510 states. Second operand has 4510 states, 4509 states have (on average 1.3251275227323132) internal successors, (5975), 4509 states have internal predecessors, (5975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:31:37,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:31:37,722 INFO L93 Difference]: Finished difference Result 4510 states and 5975 transitions. [2022-02-20 15:31:37,722 INFO L276 IsEmpty]: Start isEmpty. Operand 4510 states and 5975 transitions. [2022-02-20 15:31:37,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:31:37,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:31:37,732 INFO L74 IsIncluded]: Start isIncluded. First operand has 4510 states, 4509 states have (on average 1.3251275227323132) internal successors, (5975), 4509 states have internal predecessors, (5975), 0 states have call successors, (0), 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 4510 states. [2022-02-20 15:31:37,736 INFO L87 Difference]: Start difference. First operand has 4510 states, 4509 states have (on average 1.3251275227323132) internal successors, (5975), 4509 states have internal predecessors, (5975), 0 states have call successors, (0), 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 4510 states. [2022-02-20 15:31:38,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:31:38,285 INFO L93 Difference]: Finished difference Result 4510 states and 5975 transitions. [2022-02-20 15:31:38,285 INFO L276 IsEmpty]: Start isEmpty. Operand 4510 states and 5975 transitions. [2022-02-20 15:31:38,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:31:38,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:31:38,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 15:31:38,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 15:31:38,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4510 states, 4509 states have (on average 1.3251275227323132) internal successors, (5975), 4509 states have internal predecessors, (5975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:31:38,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4510 states to 4510 states and 5975 transitions. [2022-02-20 15:31:38,874 INFO L78 Accepts]: Start accepts. Automaton has 4510 states and 5975 transitions. Word has length 81 [2022-02-20 15:31:38,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 15:31:38,875 INFO L470 AbstractCegarLoop]: Abstraction has 4510 states and 5975 transitions. [2022-02-20 15:31:38,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:31:38,876 INFO L276 IsEmpty]: Start isEmpty. Operand 4510 states and 5975 transitions. [2022-02-20 15:31:38,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-20 15:31:38,877 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 15:31:38,877 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:31:38,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 15:31:38,878 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 15:31:38,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 15:31:38,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1146415334, now seen corresponding path program 1 times [2022-02-20 15:31:38,879 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 15:31:38,879 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482307318] [2022-02-20 15:31:38,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 15:31:38,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 15:31:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 15:31:39,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {42482#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(20, 2);call #Ultimate.allocInit(12, 3);~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1; {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~input~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,034 INFO L290 TraceCheckUtils]: 3: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret9#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,035 INFO L290 TraceCheckUtils]: 4: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,036 INFO L290 TraceCheckUtils]: 6: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,037 INFO L290 TraceCheckUtils]: 8: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,038 INFO L290 TraceCheckUtils]: 10: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,039 INFO L290 TraceCheckUtils]: 11: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,039 INFO L290 TraceCheckUtils]: 12: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,042 INFO L290 TraceCheckUtils]: 16: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,043 INFO L290 TraceCheckUtils]: 18: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,043 INFO L290 TraceCheckUtils]: 19: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,044 INFO L290 TraceCheckUtils]: 20: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,044 INFO L290 TraceCheckUtils]: 21: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,045 INFO L290 TraceCheckUtils]: 22: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,046 INFO L290 TraceCheckUtils]: 23: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,046 INFO L290 TraceCheckUtils]: 24: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,047 INFO L290 TraceCheckUtils]: 25: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,047 INFO L290 TraceCheckUtils]: 26: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,048 INFO L290 TraceCheckUtils]: 27: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,048 INFO L290 TraceCheckUtils]: 28: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,049 INFO L290 TraceCheckUtils]: 29: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,050 INFO L290 TraceCheckUtils]: 30: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,050 INFO L290 TraceCheckUtils]: 31: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,051 INFO L290 TraceCheckUtils]: 32: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,051 INFO L290 TraceCheckUtils]: 33: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,052 INFO L290 TraceCheckUtils]: 34: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,052 INFO L290 TraceCheckUtils]: 35: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,053 INFO L290 TraceCheckUtils]: 36: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,056 INFO L290 TraceCheckUtils]: 37: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,057 INFO L290 TraceCheckUtils]: 38: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,057 INFO L290 TraceCheckUtils]: 39: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,058 INFO L290 TraceCheckUtils]: 40: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,058 INFO L290 TraceCheckUtils]: 41: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 15:31:39,059 INFO L290 TraceCheckUtils]: 42: Hoare triple {42484#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,059 INFO L290 TraceCheckUtils]: 43: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,059 INFO L290 TraceCheckUtils]: 44: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,060 INFO L290 TraceCheckUtils]: 45: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,061 INFO L290 TraceCheckUtils]: 46: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,061 INFO L290 TraceCheckUtils]: 47: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,061 INFO L290 TraceCheckUtils]: 48: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,061 INFO L290 TraceCheckUtils]: 49: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,062 INFO L290 TraceCheckUtils]: 50: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,062 INFO L290 TraceCheckUtils]: 51: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,062 INFO L290 TraceCheckUtils]: 52: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,063 INFO L290 TraceCheckUtils]: 53: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,063 INFO L290 TraceCheckUtils]: 54: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,063 INFO L290 TraceCheckUtils]: 55: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,064 INFO L290 TraceCheckUtils]: 56: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,064 INFO L290 TraceCheckUtils]: 57: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,065 INFO L290 TraceCheckUtils]: 58: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,065 INFO L290 TraceCheckUtils]: 59: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,065 INFO L290 TraceCheckUtils]: 60: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,065 INFO L290 TraceCheckUtils]: 61: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,066 INFO L290 TraceCheckUtils]: 62: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,066 INFO L290 TraceCheckUtils]: 63: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,066 INFO L290 TraceCheckUtils]: 64: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,067 INFO L290 TraceCheckUtils]: 65: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((189 < ~a2~0 && 281 >= ~a2~0) && 4 == calculate_output_~input#1 && ((12 == ~a7~0 && 255 < ~a17~0) || (13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a7~0))) && 4 == ~a5~0) && 14 == ~a24~0); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,067 INFO L290 TraceCheckUtils]: 66: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !(((13 == ~a24~0 && (2 == calculate_output_~input#1 && (13 == ~a7~0 || 14 == ~a7~0)) && 3 == ~a5~0) && ~a17~0 <= -108) && 189 < ~a2~0 && 281 >= ~a2~0); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,067 INFO L290 TraceCheckUtils]: 67: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((((12 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a7~0) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a7~0)) && 1 == calculate_output_~input#1) && 14 == ~a24~0) && 189 < ~a2~0 && 281 >= ~a2~0) && 5 == ~a5~0); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,068 INFO L290 TraceCheckUtils]: 68: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((189 < ~a2~0 && 281 >= ~a2~0) && (((~a17~0 <= -108 && 13 == ~a7~0) || (~a17~0 <= -108 && 14 == ~a7~0)) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 12 == ~a7~0)) && 4 == calculate_output_~input#1) && 3 == ~a5~0) && 14 == ~a24~0); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,068 INFO L290 TraceCheckUtils]: 69: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !(6 == ~a5~0 && (13 == ~a24~0 && 6 == calculate_output_~input#1 && (((13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || (14 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0)) || (255 < ~a17~0 && 12 == ~a7~0))) && ~a2~0 <= 189); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,072 INFO L290 TraceCheckUtils]: 70: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !((13 == ~a24~0 && (189 < ~a2~0 && 281 >= ~a2~0) && (((13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a7~0)) || (255 < ~a17~0 && 12 == ~a7~0)) && 3 == calculate_output_~input#1) && 6 == ~a5~0); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,073 INFO L290 TraceCheckUtils]: 71: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !(4 == ~a5~0 && ~a2~0 <= 189 && ((1 == calculate_output_~input#1 && (13 == ~a7~0 || 14 == ~a7~0)) && ~a17~0 <= -108) && 15 == ~a24~0); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,073 INFO L290 TraceCheckUtils]: 72: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !(15 == ~a24~0 && (((189 < ~a2~0 && 281 >= ~a2~0) && 1 == calculate_output_~input#1 && 4 == ~a5~0) && 13 == ~a7~0) && 255 < ~a17~0); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,074 INFO L290 TraceCheckUtils]: 73: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !(4 == ~a5~0 && (189 < ~a2~0 && 281 >= ~a2~0) && 14 == ~a24~0 && (((-108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a7~0) || (12 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0)) && 4 == calculate_output_~input#1); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,074 INFO L290 TraceCheckUtils]: 74: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !(((5 == ~a5~0 && ~a2~0 <= 189 && 1 == calculate_output_~input#1 && 15 == ~a24~0) && 255 < ~a17~0) && 14 == ~a7~0); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,074 INFO L290 TraceCheckUtils]: 75: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !((~a17~0 <= -108 && (189 < ~a2~0 && 281 >= ~a2~0) && ((14 == ~a7~0 || 12 == ~a7~0 || 13 == ~a7~0) && 1 == calculate_output_~input#1) && 15 == ~a24~0) && 5 == ~a5~0); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,075 INFO L290 TraceCheckUtils]: 76: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !((~a17~0 <= -108 && ((189 < ~a2~0 && 281 >= ~a2~0) && (12 == ~a7~0 || 13 == ~a7~0) && 5 == calculate_output_~input#1) && 13 == ~a24~0) && 6 == ~a5~0); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,075 INFO L290 TraceCheckUtils]: 77: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !((13 == ~a24~0 && ~a17~0 <= -108 && (4 == ~a5~0 && 2 == calculate_output_~input#1) && 189 < ~a2~0 && 281 >= ~a2~0) && 12 == ~a7~0); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,075 INFO L290 TraceCheckUtils]: 78: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !((3 == ~a5~0 && (-108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0 && (12 == ~a7~0 || 13 == ~a7~0) && 4 == calculate_output_~input#1) && 189 < ~a2~0 && 281 >= ~a2~0); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,075 INFO L290 TraceCheckUtils]: 79: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !((111 < ~a17~0 && 255 >= ~a17~0) && 4 == ~a5~0 && ~a2~0 <= 189 && 15 == ~a24~0 && (13 == ~a7~0 || 14 == ~a7~0) && 5 == calculate_output_~input#1); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,076 INFO L290 TraceCheckUtils]: 80: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !(~a2~0 <= 189 && (((((-108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a7~0) || ((111 < ~a17~0 && 255 >= ~a17~0) && 12 == ~a7~0)) && 6 == calculate_output_~input#1) && 7 == ~a5~0) && 13 == ~a24~0); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,076 INFO L290 TraceCheckUtils]: 81: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !(((((13 == ~a24~0 && ~a17~0 <= -108 && 13 == ~a7~0) && 5 == ~a5~0) || (4 == ~a5~0 && 15 == ~a24~0 && 14 == ~a7~0 && 255 < ~a17~0) || (5 == ~a5~0 && 13 == ~a24~0 && 12 == ~a7~0 && ~a17~0 <= -108)) && 1 == calculate_output_~input#1) && 189 < ~a2~0 && 281 >= ~a2~0); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,076 INFO L290 TraceCheckUtils]: 82: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !(((13 == ~a24~0 && ((13 == ~a7~0 || 14 == ~a7~0) && 5 == calculate_output_~input#1) && 189 < ~a2~0 && 281 >= ~a2~0) && 3 == ~a5~0) && ~a17~0 <= -108); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,077 INFO L290 TraceCheckUtils]: 83: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !((4 == ~a5~0 && ((5 == calculate_output_~input#1 && (12 == ~a7~0 || 13 == ~a7~0)) && 14 == ~a24~0) && 189 < ~a2~0 && 281 >= ~a2~0) && ~a17~0 <= -108); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,077 INFO L290 TraceCheckUtils]: 84: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume !(14 == ~a24~0 && 3 == ~a5~0 && ((((-108 < ~a17~0 && 111 >= ~a17~0) && 12 == ~a7~0) || (~a17~0 <= -108 && 13 == ~a7~0) || (14 == ~a7~0 && ~a17~0 <= -108)) && 2 == calculate_output_~input#1) && 189 < ~a2~0 && 281 >= ~a2~0); {42485#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 15:31:39,077 INFO L290 TraceCheckUtils]: 85: Hoare triple {42485#(not (= (+ ~a7~0 (- 12)) 0))} assume ((4 == ~a5~0 && (1 == calculate_output_~input#1 && 15 == ~a24~0) && -108 < ~a17~0 && 111 >= ~a17~0) && ~a2~0 <= 189) && 12 == ~a7~0;~a24~0 := 13;~a5~0 := 5;calculate_output_#res#1 := 23; {42483#false} is VALID [2022-02-20 15:31:39,077 INFO L290 TraceCheckUtils]: 86: Hoare triple {42483#false} main_#t~ret13#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647;main_~output~0#1 := main_#t~ret13#1;havoc main_#t~ret13#1; {42483#false} is VALID [2022-02-20 15:31:39,077 INFO L290 TraceCheckUtils]: 87: Hoare triple {42483#false} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~input~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {42483#false} is VALID [2022-02-20 15:31:39,077 INFO L290 TraceCheckUtils]: 88: Hoare triple {42483#false} assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret9#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {42483#false} is VALID [2022-02-20 15:31:39,077 INFO L290 TraceCheckUtils]: 89: Hoare triple {42483#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {42483#false} is VALID [2022-02-20 15:31:39,078 INFO L290 TraceCheckUtils]: 90: Hoare triple {42483#false} assume (((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0; {42483#false} is VALID [2022-02-20 15:31:39,078 INFO L290 TraceCheckUtils]: 91: Hoare triple {42483#false} assume !false; {42483#false} is VALID [2022-02-20 15:31:39,078 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 15:31:39,078 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 15:31:39,078 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482307318] [2022-02-20 15:31:39,078 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482307318] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 15:31:39,078 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 15:31:39,079 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 15:31:39,079 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894733957] [2022-02-20 15:31:39,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 15:31:39,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2022-02-20 15:31:39,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 15:31:39,079 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:31:39,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:31:39,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 15:31:39,145 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 15:31:39,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 15:31:39,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 15:31:39,146 INFO L87 Difference]: Start difference. First operand 4510 states and 5975 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:31:53,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:31:53,193 INFO L93 Difference]: Finished difference Result 14275 states and 18791 transitions. [2022-02-20 15:31:53,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 15:31:53,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2022-02-20 15:31:53,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 15:31:53,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:31:53,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5183 transitions. [2022-02-20 15:31:53,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:31:53,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5183 transitions. [2022-02-20 15:31:53,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 5183 transitions. [2022-02-20 15:31:56,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5183 edges. 5183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:31:59,356 INFO L225 Difference]: With dead ends: 14275 [2022-02-20 15:31:59,357 INFO L226 Difference]: Without dead ends: 9767 [2022-02-20 15:31:59,360 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 15:31:59,361 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 2160 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4749 mSolverCounterSat, 778 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2160 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 5527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 778 IncrementalHoareTripleChecker+Valid, 4749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-02-20 15:31:59,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2160 Valid, 187 Invalid, 5527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [778 Valid, 4749 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-02-20 15:31:59,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9767 states. [2022-02-20 15:31:59,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9767 to 9016. [2022-02-20 15:31:59,505 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 15:31:59,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9767 states. Second operand has 9016 states, 9015 states have (on average 1.303716028840821) internal successors, (11753), 9015 states have internal predecessors, (11753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:31:59,524 INFO L74 IsIncluded]: Start isIncluded. First operand 9767 states. Second operand has 9016 states, 9015 states have (on average 1.303716028840821) internal successors, (11753), 9015 states have internal predecessors, (11753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:31:59,534 INFO L87 Difference]: Start difference. First operand 9767 states. Second operand has 9016 states, 9015 states have (on average 1.303716028840821) internal successors, (11753), 9015 states have internal predecessors, (11753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:32:02,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:32:02,025 INFO L93 Difference]: Finished difference Result 9767 states and 12540 transitions. [2022-02-20 15:32:02,025 INFO L276 IsEmpty]: Start isEmpty. Operand 9767 states and 12540 transitions. [2022-02-20 15:32:02,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:32:02,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:32:02,043 INFO L74 IsIncluded]: Start isIncluded. First operand has 9016 states, 9015 states have (on average 1.303716028840821) internal successors, (11753), 9015 states have internal predecessors, (11753), 0 states have call successors, (0), 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 9767 states. [2022-02-20 15:32:02,051 INFO L87 Difference]: Start difference. First operand has 9016 states, 9015 states have (on average 1.303716028840821) internal successors, (11753), 9015 states have internal predecessors, (11753), 0 states have call successors, (0), 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 9767 states.