./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem18_label57.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/Problem18_label57.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 16f5fbe4e4f43b4f458c808219051e20c4982642680d27057faf1e29b0e8c222 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:01:47,219 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:01:47,221 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:01:47,254 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:01:47,255 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:01:47,257 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:01:47,258 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:01:47,260 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:01:47,261 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:01:47,264 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:01:47,265 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:01:47,266 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:01:47,266 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:01:47,268 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:01:47,269 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:01:47,271 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:01:47,272 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:01:47,272 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:01:47,274 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:01:47,278 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:01:47,279 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:01:47,279 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:01:47,281 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:01:47,281 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:01:47,286 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:01:47,286 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:01:47,286 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:01:47,287 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:01:47,287 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:01:47,288 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:01:47,288 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:01:47,289 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:01:47,290 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:01:47,291 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:01:47,291 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:01:47,291 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:01:47,293 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:01:47,293 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:01:47,293 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:01:47,294 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:01:47,294 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:01:47,295 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:01:47,316 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:01:47,316 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:01:47,316 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:01:47,316 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:01:47,317 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:01:47,317 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:01:47,318 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:01:47,318 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:01:47,318 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:01:47,318 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:01:47,319 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:01:47,319 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:01:47,319 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:01:47,319 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:01:47,319 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:01:47,319 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:01:47,320 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:01:47,320 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:01:47,320 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:01:47,320 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:01:47,320 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:01:47,320 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:01:47,320 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:01:47,321 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:01:47,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:01:47,321 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:01:47,321 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:01:47,322 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:01:47,322 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:01:47,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:01:47,322 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:01:47,322 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:01:47,323 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:01:47,323 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 -> 16f5fbe4e4f43b4f458c808219051e20c4982642680d27057faf1e29b0e8c222 [2022-02-20 16:01:47,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:01:47,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:01:47,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:01:47,550 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:01:47,552 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:01:47,553 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label57.c [2022-02-20 16:01:47,626 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d1b562aa/d8afddde3b484eea876f536f2721988d/FLAGb412bcc25 [2022-02-20 16:01:48,076 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:01:48,077 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label57.c [2022-02-20 16:01:48,100 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d1b562aa/d8afddde3b484eea876f536f2721988d/FLAGb412bcc25 [2022-02-20 16:01:48,123 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d1b562aa/d8afddde3b484eea876f536f2721988d [2022-02-20 16:01:48,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:01:48,127 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:01:48,128 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:01:48,128 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:01:48,131 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:01:48,132 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:01:48" (1/1) ... [2022-02-20 16:01:48,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ae514e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:01:48, skipping insertion in model container [2022-02-20 16:01:48,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:01:48" (1/1) ... [2022-02-20 16:01:48,137 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:01:48,204 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:01:48,320 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/Problem18_label57.c[1255,1268] [2022-02-20 16:01:48,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:01:48,850 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:01:48,859 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/Problem18_label57.c[1255,1268] [2022-02-20 16:01:49,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:01:49,110 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:01:49,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:01:49 WrapperNode [2022-02-20 16:01:49,111 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:01:49,112 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:01:49,112 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:01:49,112 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:01:49,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:01:49" (1/1) ... [2022-02-20 16:01:49,145 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:01:49" (1/1) ... [2022-02-20 16:01:49,351 INFO L137 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4132 [2022-02-20 16:01:49,352 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:01:49,353 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:01:49,353 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:01:49,353 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:01:49,358 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:01:49" (1/1) ... [2022-02-20 16:01:49,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:01:49" (1/1) ... [2022-02-20 16:01:49,378 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:01:49" (1/1) ... [2022-02-20 16:01:49,378 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:01:49" (1/1) ... [2022-02-20 16:01:49,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:01:49" (1/1) ... [2022-02-20 16:01:49,505 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:01:49" (1/1) ... [2022-02-20 16:01:49,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:01:49" (1/1) ... [2022-02-20 16:01:49,534 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:01:49,535 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:01:49,535 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:01:49,536 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:01:49,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:01:49" (1/1) ... [2022-02-20 16:01:49,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:01:49,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:01:49,557 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 16:01:49,561 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 16:01:49,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:01:49,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:01:49,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:01:49,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:01:49,633 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:01:49,635 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:01:53,625 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:01:53,640 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:01:53,640 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 16:01:53,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:01:53 BoogieIcfgContainer [2022-02-20 16:01:53,642 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:01:53,643 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:01:53,643 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:01:53,645 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:01:53,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:01:48" (1/3) ... [2022-02-20 16:01:53,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3206d16e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:01:53, skipping insertion in model container [2022-02-20 16:01:53,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:01:49" (2/3) ... [2022-02-20 16:01:53,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3206d16e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:01:53, skipping insertion in model container [2022-02-20 16:01:53,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:01:53" (3/3) ... [2022-02-20 16:01:53,647 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem18_label57.c [2022-02-20 16:01:53,650 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:01:53,651 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:01:53,682 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:01:53,686 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 16:01:53,686 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:01:53,712 INFO L276 IsEmpty]: Start isEmpty. Operand has 757 states, 755 states have (on average 1.9125827814569536) internal successors, (1444), 756 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:01:53,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 16:01:53,720 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:01:53,720 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:01:53,721 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:01:53,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:01:53,728 INFO L85 PathProgramCache]: Analyzing trace with hash 297966002, now seen corresponding path program 1 times [2022-02-20 16:01:53,733 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:01:53,734 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758134397] [2022-02-20 16:01:53,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:01:53,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:01:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:01:53,871 INFO L290 TraceCheckUtils]: 0: Hoare triple {760#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);~inputD~0 := 4;~inputA~0 := 1;~inputC~0 := 3;~inputE~0 := 5;~inputB~0 := 2;~inputF~0 := 6;~a18~0 := 9;~a24~0 := 3;~a3~0 := 99;~a15~0 := 4; {762#(<= ~a18~0 9)} is VALID [2022-02-20 16:01:53,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {762#(<= ~a18~0 9)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~ret11#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1; {762#(<= ~a18~0 9)} is VALID [2022-02-20 16:01:53,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {762#(<= ~a18~0 9)} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~input~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {762#(<= ~a18~0 9)} is VALID [2022-02-20 16:01:53,873 INFO L290 TraceCheckUtils]: 3: Hoare triple {762#(<= ~a18~0 9)} 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~ret8#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {762#(<= ~a18~0 9)} is VALID [2022-02-20 16:01:53,873 INFO L290 TraceCheckUtils]: 4: Hoare triple {762#(<= ~a18~0 9)} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {762#(<= ~a18~0 9)} is VALID [2022-02-20 16:01:53,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {762#(<= ~a18~0 9)} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {762#(<= ~a18~0 9)} is VALID [2022-02-20 16:01:53,875 INFO L290 TraceCheckUtils]: 6: Hoare triple {762#(<= ~a18~0 9)} assume ((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0; {761#false} is VALID [2022-02-20 16:01:53,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {761#false} assume !false; {761#false} is VALID [2022-02-20 16:01:53,876 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 16:01:53,876 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:01:53,877 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758134397] [2022-02-20 16:01:53,877 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758134397] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:01:53,877 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:01:53,878 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:01:53,879 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506127728] [2022-02-20 16:01:53,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:01:53,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-02-20 16:01:53,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:01:53,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:01:53,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:01:53,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:01:53,899 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:01:53,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:01:53,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:01:53,930 INFO L87 Difference]: Start difference. First operand has 757 states, 755 states have (on average 1.9125827814569536) internal successors, (1444), 756 states have internal predecessors, (1444), 0 states have call successors, (0), 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.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:01:58,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:01:58,385 INFO L93 Difference]: Finished difference Result 2205 states and 4266 transitions. [2022-02-20 16:01:58,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:01:58,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-02-20 16:01:58,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:01:58,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:01:58,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4266 transitions. [2022-02-20 16:01:58,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:01:58,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4266 transitions. [2022-02-20 16:01:58,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4266 transitions. [2022-02-20 16:02:01,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4266 edges. 4266 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:02:01,502 INFO L225 Difference]: With dead ends: 2205 [2022-02-20 16:02:01,502 INFO L226 Difference]: Without dead ends: 1384 [2022-02-20 16:02:01,507 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 16:02:01,509 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 740 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2018 mSolverCounterSat, 967 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 967 IncrementalHoareTripleChecker+Valid, 2018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:02:01,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [740 Valid, 291 Invalid, 2985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [967 Valid, 2018 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-02-20 16:02:01,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2022-02-20 16:02:01,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1384. [2022-02-20 16:02:01,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:02:01,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1384 states. Second operand has 1384 states, 1383 states have (on average 1.7339117859725235) internal successors, (2398), 1383 states have internal predecessors, (2398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:02:01,585 INFO L74 IsIncluded]: Start isIncluded. First operand 1384 states. Second operand has 1384 states, 1383 states have (on average 1.7339117859725235) internal successors, (2398), 1383 states have internal predecessors, (2398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:02:01,587 INFO L87 Difference]: Start difference. First operand 1384 states. Second operand has 1384 states, 1383 states have (on average 1.7339117859725235) internal successors, (2398), 1383 states have internal predecessors, (2398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:02:01,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:02:01,658 INFO L93 Difference]: Finished difference Result 1384 states and 2398 transitions. [2022-02-20 16:02:01,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2398 transitions. [2022-02-20 16:02:01,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:02:01,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:02:01,672 INFO L74 IsIncluded]: Start isIncluded. First operand has 1384 states, 1383 states have (on average 1.7339117859725235) internal successors, (2398), 1383 states have internal predecessors, (2398), 0 states have call successors, (0), 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 1384 states. [2022-02-20 16:02:01,674 INFO L87 Difference]: Start difference. First operand has 1384 states, 1383 states have (on average 1.7339117859725235) internal successors, (2398), 1383 states have internal predecessors, (2398), 0 states have call successors, (0), 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 1384 states. [2022-02-20 16:02:01,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:02:01,732 INFO L93 Difference]: Finished difference Result 1384 states and 2398 transitions. [2022-02-20 16:02:01,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2398 transitions. [2022-02-20 16:02:01,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:02:01,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:02:01,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:02:01,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:02:01,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1383 states have (on average 1.7339117859725235) internal successors, (2398), 1383 states have internal predecessors, (2398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:02:01,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2398 transitions. [2022-02-20 16:02:01,797 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2398 transitions. Word has length 8 [2022-02-20 16:02:01,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:02:01,798 INFO L470 AbstractCegarLoop]: Abstraction has 1384 states and 2398 transitions. [2022-02-20 16:02:01,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:02:01,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2398 transitions. [2022-02-20 16:02:01,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 16:02:01,801 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:02:01,801 INFO L514 BasicCegarLoop]: trace histogram [2, 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] [2022-02-20 16:02:01,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:02:01,802 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:02:01,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:02:01,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1296644696, now seen corresponding path program 1 times [2022-02-20 16:02:01,804 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:02:01,805 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023486381] [2022-02-20 16:02:01,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:02:01,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:02:01,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:02:01,988 INFO L290 TraceCheckUtils]: 0: Hoare triple {7145#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);~inputD~0 := 4;~inputA~0 := 1;~inputC~0 := 3;~inputE~0 := 5;~inputB~0 := 2;~inputF~0 := 6;~a18~0 := 9;~a24~0 := 3;~a3~0 := 99;~a15~0 := 4; {7147#(and (= (+ (- 9) ~a18~0) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:01,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {7147#(and (= (+ (- 9) ~a18~0) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~ret11#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1; {7147#(and (= (+ (- 9) ~a18~0) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:01,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {7147#(and (= (+ (- 9) ~a18~0) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~input~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {7147#(and (= (+ (- 9) ~a18~0) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:01,990 INFO L290 TraceCheckUtils]: 3: Hoare triple {7147#(and (= (+ (- 9) ~a18~0) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} 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~ret8#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {7147#(and (= (+ (- 9) ~a18~0) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:01,991 INFO L290 TraceCheckUtils]: 4: Hoare triple {7147#(and (= (+ (- 9) ~a18~0) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:01,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:01,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:01,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:01,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:01,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:01,996 INFO L290 TraceCheckUtils]: 10: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((2 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:01,996 INFO L290 TraceCheckUtils]: 11: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((2 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:01,996 INFO L290 TraceCheckUtils]: 12: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:01,997 INFO L290 TraceCheckUtils]: 13: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((1 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:01,997 INFO L290 TraceCheckUtils]: 14: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:01,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((0 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:01,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((0 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:01,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((0 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:01,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((1 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:01,999 INFO L290 TraceCheckUtils]: 19: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:01,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((2 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,000 INFO L290 TraceCheckUtils]: 21: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((1 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,000 INFO L290 TraceCheckUtils]: 22: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,000 INFO L290 TraceCheckUtils]: 23: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((0 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,001 INFO L290 TraceCheckUtils]: 24: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((0 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,001 INFO L290 TraceCheckUtils]: 25: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((1 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,002 INFO L290 TraceCheckUtils]: 26: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((1 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,002 INFO L290 TraceCheckUtils]: 27: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((2 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,002 INFO L290 TraceCheckUtils]: 28: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((1 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,003 INFO L290 TraceCheckUtils]: 29: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((0 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,003 INFO L290 TraceCheckUtils]: 30: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((2 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,003 INFO L290 TraceCheckUtils]: 31: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((2 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,004 INFO L290 TraceCheckUtils]: 32: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((2 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,004 INFO L290 TraceCheckUtils]: 33: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((0 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,005 INFO L290 TraceCheckUtils]: 34: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((2 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,005 INFO L290 TraceCheckUtils]: 35: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((3 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,005 INFO L290 TraceCheckUtils]: 36: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((0 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,006 INFO L290 TraceCheckUtils]: 37: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,006 INFO L290 TraceCheckUtils]: 38: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((2 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,006 INFO L290 TraceCheckUtils]: 39: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((1 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,007 INFO L290 TraceCheckUtils]: 40: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((0 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,007 INFO L290 TraceCheckUtils]: 41: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,007 INFO L290 TraceCheckUtils]: 42: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((2 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,008 INFO L290 TraceCheckUtils]: 43: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,008 INFO L290 TraceCheckUtils]: 44: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((0 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,009 INFO L290 TraceCheckUtils]: 45: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((0 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,009 INFO L290 TraceCheckUtils]: 46: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((2 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,009 INFO L290 TraceCheckUtils]: 47: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,010 INFO L290 TraceCheckUtils]: 48: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,010 INFO L290 TraceCheckUtils]: 49: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,010 INFO L290 TraceCheckUtils]: 50: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,011 INFO L290 TraceCheckUtils]: 51: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,011 INFO L290 TraceCheckUtils]: 52: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((2 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,011 INFO L290 TraceCheckUtils]: 53: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((1 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,012 INFO L290 TraceCheckUtils]: 54: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((1 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,012 INFO L290 TraceCheckUtils]: 55: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,013 INFO L290 TraceCheckUtils]: 56: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((1 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,013 INFO L290 TraceCheckUtils]: 57: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,013 INFO L290 TraceCheckUtils]: 58: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((2 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,014 INFO L290 TraceCheckUtils]: 59: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((0 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,014 INFO L290 TraceCheckUtils]: 60: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((1 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,014 INFO L290 TraceCheckUtils]: 61: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((2 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,015 INFO L290 TraceCheckUtils]: 62: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((1 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,015 INFO L290 TraceCheckUtils]: 63: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((2 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,015 INFO L290 TraceCheckUtils]: 64: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(((2 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,016 INFO L290 TraceCheckUtils]: 65: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !((5 == calculate_output_~input#1 && ((~a3~0 <= 115 && 9 == ~a18~0 && 3 == ~a24~0) || (417 < ~a3~0 && 12 == ~a18~0 && 2 == ~a24~0) || (~a3~0 <= 115 && 3 == ~a24~0 && 8 == ~a18~0))) && 6 == ~a15~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,016 INFO L290 TraceCheckUtils]: 66: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !(5 == ~a15~0 && ((6 == calculate_output_~input#1 && (8 == ~a18~0 || 9 == ~a18~0)) && 3 == ~a24~0) && 417 < ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,017 INFO L290 TraceCheckUtils]: 67: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !((4 == ~a15~0 && 4 == ~a24~0 && (11 == ~a18~0 || 12 == ~a18~0) && 5 == calculate_output_~input#1) && 115 < ~a3~0 && 306 >= ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,017 INFO L290 TraceCheckUtils]: 68: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume !((4 == ~a24~0 && (3 == calculate_output_~input#1 && (9 == ~a18~0 || 10 == ~a18~0)) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {7148#(not (= (+ (- 1) ~a24~0) 0))} is VALID [2022-02-20 16:02:02,018 INFO L290 TraceCheckUtils]: 69: Hoare triple {7148#(not (= (+ (- 1) ~a24~0) 0))} assume ~a3~0 <= 115 && ((5 == calculate_output_~input#1 && (9 == ~a18~0 || 10 == ~a18~0)) && 5 == ~a15~0) && 1 == ~a24~0;~a3~0 := 211 + (if ~a3~0 < 0 && 0 != ~a3~0 % 95 then ~a3~0 % 95 - 95 else ~a3~0 % 95) - 1;~a24~0 := 0;~a18~0 := 10;~a15~0 := 6;calculate_output_#res#1 := 21; {7146#false} is VALID [2022-02-20 16:02:02,018 INFO L290 TraceCheckUtils]: 70: Hoare triple {7146#false} main_#t~ret11#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~output~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1; {7146#false} is VALID [2022-02-20 16:02:02,018 INFO L290 TraceCheckUtils]: 71: Hoare triple {7146#false} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~input~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {7146#false} is VALID [2022-02-20 16:02:02,018 INFO L290 TraceCheckUtils]: 72: Hoare triple {7146#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~ret8#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {7146#false} is VALID [2022-02-20 16:02:02,018 INFO L290 TraceCheckUtils]: 73: Hoare triple {7146#false} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {7146#false} is VALID [2022-02-20 16:02:02,019 INFO L290 TraceCheckUtils]: 74: Hoare triple {7146#false} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {7146#false} is VALID [2022-02-20 16:02:02,019 INFO L290 TraceCheckUtils]: 75: Hoare triple {7146#false} assume ((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0; {7146#false} is VALID [2022-02-20 16:02:02,019 INFO L290 TraceCheckUtils]: 76: Hoare triple {7146#false} assume !false; {7146#false} is VALID [2022-02-20 16:02:02,020 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:02:02,020 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:02:02,020 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023486381] [2022-02-20 16:02:02,020 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023486381] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:02:02,020 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:02:02,021 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:02:02,021 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951533592] [2022-02-20 16:02:02,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:02:02,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 16:02:02,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:02:02,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:02:02,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:02:02,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:02:02,080 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:02:02,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:02:02,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:02:02,081 INFO L87 Difference]: Start difference. First operand 1384 states and 2398 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:02:09,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:02:09,332 INFO L93 Difference]: Finished difference Result 4842 states and 8275 transitions. [2022-02-20 16:02:09,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:02:09,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 16:02:09,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:02:09,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:02:09,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5035 transitions. [2022-02-20 16:02:09,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:02:09,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5035 transitions. [2022-02-20 16:02:09,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 5035 transitions. [2022-02-20 16:02:12,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5035 edges. 5035 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:02:13,150 INFO L225 Difference]: With dead ends: 4842 [2022-02-20 16:02:13,150 INFO L226 Difference]: Without dead ends: 3460 [2022-02-20 16:02:13,151 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 16:02:13,152 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 2035 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 3268 mSolverCounterSat, 1421 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2035 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 4689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1421 IncrementalHoareTripleChecker+Valid, 3268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:02:13,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2035 Valid, 135 Invalid, 4689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1421 Valid, 3268 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-02-20 16:02:13,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3460 states. [2022-02-20 16:02:13,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3460 to 3454. [2022-02-20 16:02:13,199 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:02:13,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3460 states. Second operand has 3454 states, 3453 states have (on average 1.5409788589632203) internal successors, (5321), 3453 states have internal predecessors, (5321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:02:13,210 INFO L74 IsIncluded]: Start isIncluded. First operand 3460 states. Second operand has 3454 states, 3453 states have (on average 1.5409788589632203) internal successors, (5321), 3453 states have internal predecessors, (5321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:02:13,216 INFO L87 Difference]: Start difference. First operand 3460 states. Second operand has 3454 states, 3453 states have (on average 1.5409788589632203) internal successors, (5321), 3453 states have internal predecessors, (5321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:02:13,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:02:13,604 INFO L93 Difference]: Finished difference Result 3460 states and 5327 transitions. [2022-02-20 16:02:13,604 INFO L276 IsEmpty]: Start isEmpty. Operand 3460 states and 5327 transitions. [2022-02-20 16:02:13,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:02:13,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:02:13,614 INFO L74 IsIncluded]: Start isIncluded. First operand has 3454 states, 3453 states have (on average 1.5409788589632203) internal successors, (5321), 3453 states have internal predecessors, (5321), 0 states have call successors, (0), 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 3460 states. [2022-02-20 16:02:13,620 INFO L87 Difference]: Start difference. First operand has 3454 states, 3453 states have (on average 1.5409788589632203) internal successors, (5321), 3453 states have internal predecessors, (5321), 0 states have call successors, (0), 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 3460 states. [2022-02-20 16:02:13,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:02:13,978 INFO L93 Difference]: Finished difference Result 3460 states and 5327 transitions. [2022-02-20 16:02:13,978 INFO L276 IsEmpty]: Start isEmpty. Operand 3460 states and 5327 transitions. [2022-02-20 16:02:13,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:02:13,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:02:13,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:02:13,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:02:13,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3454 states, 3453 states have (on average 1.5409788589632203) internal successors, (5321), 3453 states have internal predecessors, (5321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:02:14,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 3454 states and 5321 transitions. [2022-02-20 16:02:14,370 INFO L78 Accepts]: Start accepts. Automaton has 3454 states and 5321 transitions. Word has length 77 [2022-02-20 16:02:14,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:02:14,371 INFO L470 AbstractCegarLoop]: Abstraction has 3454 states and 5321 transitions. [2022-02-20 16:02:14,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:02:14,371 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 5321 transitions. [2022-02-20 16:02:14,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-02-20 16:02:14,374 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:02:14,374 INFO L514 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:02:14,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:02:14,374 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:02:14,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:02:14,375 INFO L85 PathProgramCache]: Analyzing trace with hash 782408697, now seen corresponding path program 1 times [2022-02-20 16:02:14,375 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:02:14,375 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404127285] [2022-02-20 16:02:14,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:02:14,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:02:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:02:14,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {22421#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);~inputD~0 := 4;~inputA~0 := 1;~inputC~0 := 3;~inputE~0 := 5;~inputB~0 := 2;~inputF~0 := 6;~a18~0 := 9;~a24~0 := 3;~a3~0 := 99;~a15~0 := 4; {22421#true} is VALID [2022-02-20 16:02:14,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {22421#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~ret11#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1; {22421#true} is VALID [2022-02-20 16:02:14,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {22421#true} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~input~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {22421#true} is VALID [2022-02-20 16:02:14,541 INFO L290 TraceCheckUtils]: 3: Hoare triple {22421#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~ret8#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {22421#true} is VALID [2022-02-20 16:02:14,541 INFO L290 TraceCheckUtils]: 4: Hoare triple {22421#true} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {22421#true} is VALID [2022-02-20 16:02:14,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {22421#true} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,542 INFO L290 TraceCheckUtils]: 6: Hoare triple {22421#true} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {22421#true} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {22421#true} is VALID [2022-02-20 16:02:14,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {22421#true} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {22421#true} assume !(((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {22421#true} is VALID [2022-02-20 16:02:14,542 INFO L290 TraceCheckUtils]: 10: Hoare triple {22421#true} assume !(((2 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {22421#true} assume !(((2 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {22421#true} is VALID [2022-02-20 16:02:14,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {22421#true} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {22421#true} assume !(((1 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {22421#true} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {22421#true} assume !(((0 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,544 INFO L290 TraceCheckUtils]: 16: Hoare triple {22421#true} assume !(((0 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,544 INFO L290 TraceCheckUtils]: 17: Hoare triple {22421#true} assume !(((0 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {22421#true} is VALID [2022-02-20 16:02:14,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {22421#true} assume !(((1 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,544 INFO L290 TraceCheckUtils]: 19: Hoare triple {22421#true} assume !(((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,546 INFO L290 TraceCheckUtils]: 20: Hoare triple {22421#true} assume !(((2 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,547 INFO L290 TraceCheckUtils]: 21: Hoare triple {22421#true} assume !(((1 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,547 INFO L290 TraceCheckUtils]: 22: Hoare triple {22421#true} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,547 INFO L290 TraceCheckUtils]: 23: Hoare triple {22421#true} assume !(((0 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,547 INFO L290 TraceCheckUtils]: 24: Hoare triple {22421#true} assume !(((0 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {22421#true} is VALID [2022-02-20 16:02:14,547 INFO L290 TraceCheckUtils]: 25: Hoare triple {22421#true} assume !(((1 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,549 INFO L290 TraceCheckUtils]: 26: Hoare triple {22421#true} assume !(((1 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,549 INFO L290 TraceCheckUtils]: 27: Hoare triple {22421#true} assume !(((2 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,549 INFO L290 TraceCheckUtils]: 28: Hoare triple {22421#true} assume !(((1 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,550 INFO L290 TraceCheckUtils]: 29: Hoare triple {22421#true} assume !(((0 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,550 INFO L290 TraceCheckUtils]: 30: Hoare triple {22421#true} assume !(((2 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,555 INFO L290 TraceCheckUtils]: 31: Hoare triple {22421#true} assume !(((2 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,556 INFO L290 TraceCheckUtils]: 32: Hoare triple {22421#true} assume !(((2 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,556 INFO L290 TraceCheckUtils]: 33: Hoare triple {22421#true} assume !(((0 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,556 INFO L290 TraceCheckUtils]: 34: Hoare triple {22421#true} assume !(((2 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,556 INFO L290 TraceCheckUtils]: 35: Hoare triple {22421#true} assume !(((3 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {22421#true} is VALID [2022-02-20 16:02:14,556 INFO L290 TraceCheckUtils]: 36: Hoare triple {22421#true} assume !(((0 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,556 INFO L290 TraceCheckUtils]: 37: Hoare triple {22421#true} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,557 INFO L290 TraceCheckUtils]: 38: Hoare triple {22421#true} assume !(((2 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,557 INFO L290 TraceCheckUtils]: 39: Hoare triple {22421#true} assume !(((1 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {22421#true} is VALID [2022-02-20 16:02:14,557 INFO L290 TraceCheckUtils]: 40: Hoare triple {22421#true} assume !(((0 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,557 INFO L290 TraceCheckUtils]: 41: Hoare triple {22421#true} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,557 INFO L290 TraceCheckUtils]: 42: Hoare triple {22421#true} assume !(((2 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {22421#true} is VALID [2022-02-20 16:02:14,557 INFO L290 TraceCheckUtils]: 43: Hoare triple {22421#true} assume !(((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,558 INFO L290 TraceCheckUtils]: 44: Hoare triple {22421#true} assume !(((0 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,558 INFO L290 TraceCheckUtils]: 45: Hoare triple {22421#true} assume !(((0 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,558 INFO L290 TraceCheckUtils]: 46: Hoare triple {22421#true} assume !(((2 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,558 INFO L290 TraceCheckUtils]: 47: Hoare triple {22421#true} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {22421#true} is VALID [2022-02-20 16:02:14,558 INFO L290 TraceCheckUtils]: 48: Hoare triple {22421#true} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,558 INFO L290 TraceCheckUtils]: 49: Hoare triple {22421#true} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,559 INFO L290 TraceCheckUtils]: 50: Hoare triple {22421#true} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,559 INFO L290 TraceCheckUtils]: 51: Hoare triple {22421#true} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {22421#true} is VALID [2022-02-20 16:02:14,559 INFO L290 TraceCheckUtils]: 52: Hoare triple {22421#true} assume !(((2 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,559 INFO L290 TraceCheckUtils]: 53: Hoare triple {22421#true} assume !(((1 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {22421#true} is VALID [2022-02-20 16:02:14,559 INFO L290 TraceCheckUtils]: 54: Hoare triple {22421#true} assume !(((1 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,559 INFO L290 TraceCheckUtils]: 55: Hoare triple {22421#true} assume !(((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,559 INFO L290 TraceCheckUtils]: 56: Hoare triple {22421#true} assume !(((1 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {22421#true} is VALID [2022-02-20 16:02:14,560 INFO L290 TraceCheckUtils]: 57: Hoare triple {22421#true} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,560 INFO L290 TraceCheckUtils]: 58: Hoare triple {22421#true} assume !(((2 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,560 INFO L290 TraceCheckUtils]: 59: Hoare triple {22421#true} assume !(((0 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {22421#true} is VALID [2022-02-20 16:02:14,560 INFO L290 TraceCheckUtils]: 60: Hoare triple {22421#true} assume !(((1 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,560 INFO L290 TraceCheckUtils]: 61: Hoare triple {22421#true} assume !(((2 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,561 INFO L290 TraceCheckUtils]: 62: Hoare triple {22421#true} assume !(((1 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,561 INFO L290 TraceCheckUtils]: 63: Hoare triple {22421#true} assume !(((2 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {22421#true} is VALID [2022-02-20 16:02:14,561 INFO L290 TraceCheckUtils]: 64: Hoare triple {22421#true} assume !(((2 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {22421#true} is VALID [2022-02-20 16:02:14,561 INFO L290 TraceCheckUtils]: 65: Hoare triple {22421#true} assume !((5 == calculate_output_~input#1 && ((~a3~0 <= 115 && 9 == ~a18~0 && 3 == ~a24~0) || (417 < ~a3~0 && 12 == ~a18~0 && 2 == ~a24~0) || (~a3~0 <= 115 && 3 == ~a24~0 && 8 == ~a18~0))) && 6 == ~a15~0); {22421#true} is VALID [2022-02-20 16:02:14,561 INFO L290 TraceCheckUtils]: 66: Hoare triple {22421#true} assume !(5 == ~a15~0 && ((6 == calculate_output_~input#1 && (8 == ~a18~0 || 9 == ~a18~0)) && 3 == ~a24~0) && 417 < ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,561 INFO L290 TraceCheckUtils]: 67: Hoare triple {22421#true} assume !((4 == ~a15~0 && 4 == ~a24~0 && (11 == ~a18~0 || 12 == ~a18~0) && 5 == calculate_output_~input#1) && 115 < ~a3~0 && 306 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,561 INFO L290 TraceCheckUtils]: 68: Hoare triple {22421#true} assume !((4 == ~a24~0 && (3 == calculate_output_~input#1 && (9 == ~a18~0 || 10 == ~a18~0)) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,562 INFO L290 TraceCheckUtils]: 69: Hoare triple {22421#true} assume !(~a3~0 <= 115 && ((5 == calculate_output_~input#1 && (9 == ~a18~0 || 10 == ~a18~0)) && 5 == ~a15~0) && 1 == ~a24~0); {22421#true} is VALID [2022-02-20 16:02:14,562 INFO L290 TraceCheckUtils]: 70: Hoare triple {22421#true} assume !((10 == ~a18~0 && (417 < ~a3~0 && 3 == calculate_output_~input#1) && 5 == ~a15~0) && 3 == ~a24~0); {22421#true} is VALID [2022-02-20 16:02:14,562 INFO L290 TraceCheckUtils]: 71: Hoare triple {22421#true} assume !((((((8 == ~a18~0 || 9 == ~a18~0) || 10 == ~a18~0) && 2 == calculate_output_~input#1) && 4 == ~a15~0) && 4 == ~a24~0) && 306 < ~a3~0 && 417 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,562 INFO L290 TraceCheckUtils]: 72: Hoare triple {22421#true} assume !(((((11 == ~a18~0 || 12 == ~a18~0) && 5 == calculate_output_~input#1) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0) && 3 == ~a24~0); {22421#true} is VALID [2022-02-20 16:02:14,562 INFO L290 TraceCheckUtils]: 73: Hoare triple {22421#true} assume !(12 == ~a18~0 && ((6 == calculate_output_~input#1 && ~a3~0 <= 115) && 2 == ~a24~0) && 5 == ~a15~0); {22421#true} is VALID [2022-02-20 16:02:14,563 INFO L290 TraceCheckUtils]: 74: Hoare triple {22421#true} assume !((417 < ~a3~0 && (((10 == ~a18~0 || 11 == ~a18~0) || 12 == ~a18~0) && 6 == calculate_output_~input#1) && 0 == ~a24~0) && 5 == ~a15~0); {22421#true} is VALID [2022-02-20 16:02:14,563 INFO L290 TraceCheckUtils]: 75: Hoare triple {22421#true} assume !(2 == ~a24~0 && (2 == calculate_output_~input#1 && ((12 == ~a18~0 && 306 < ~a3~0 && 417 >= ~a3~0) || (8 == ~a18~0 && 417 < ~a3~0))) && 6 == ~a15~0); {22421#true} is VALID [2022-02-20 16:02:14,563 INFO L290 TraceCheckUtils]: 76: Hoare triple {22421#true} assume !(6 == ~a15~0 && ((((8 == ~a18~0 || 9 == ~a18~0) || 10 == ~a18~0) && 3 == calculate_output_~input#1) && 115 < ~a3~0 && 306 >= ~a3~0) && 1 == ~a24~0); {22421#true} is VALID [2022-02-20 16:02:14,563 INFO L290 TraceCheckUtils]: 77: Hoare triple {22421#true} assume !((0 == ~a24~0 && 6 == ~a15~0 && 2 == calculate_output_~input#1 && (9 == ~a18~0 || 10 == ~a18~0)) && 115 < ~a3~0 && 306 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,563 INFO L290 TraceCheckUtils]: 78: Hoare triple {22421#true} assume !((306 < ~a3~0 && 417 >= ~a3~0) && (5 == ~a15~0 && 2 == calculate_output_~input#1 && 12 == ~a18~0) && 3 == ~a24~0); {22421#true} is VALID [2022-02-20 16:02:14,563 INFO L290 TraceCheckUtils]: 79: Hoare triple {22421#true} assume !(5 == ~a15~0 && 2 == ~a24~0 && (306 < ~a3~0 && 417 >= ~a3~0) && (9 == ~a18~0 || 10 == ~a18~0) && 5 == calculate_output_~input#1); {22421#true} is VALID [2022-02-20 16:02:14,563 INFO L290 TraceCheckUtils]: 80: Hoare triple {22421#true} assume !(1 == ~a24~0 && (4 == calculate_output_~input#1 && (((11 == ~a18~0 && 115 < ~a3~0 && 306 >= ~a3~0) || (12 == ~a18~0 && 115 < ~a3~0 && 306 >= ~a3~0)) || (8 == ~a18~0 && 306 < ~a3~0 && 417 >= ~a3~0))) && 5 == ~a15~0); {22421#true} is VALID [2022-02-20 16:02:14,563 INFO L290 TraceCheckUtils]: 81: Hoare triple {22421#true} assume !((1 == ~a24~0 && (~a3~0 <= 115 && 6 == calculate_output_~input#1) && 5 == ~a15~0) && 11 == ~a18~0); {22421#true} is VALID [2022-02-20 16:02:14,563 INFO L290 TraceCheckUtils]: 82: Hoare triple {22421#true} assume !(10 == ~a18~0 && (306 < ~a3~0 && 417 >= ~a3~0) && 6 == ~a15~0 && 0 == ~a24~0 && 1 == calculate_output_~input#1); {22421#true} is VALID [2022-02-20 16:02:14,564 INFO L290 TraceCheckUtils]: 83: Hoare triple {22421#true} assume !(3 == ~a24~0 && 6 == ~a15~0 && (4 == calculate_output_~input#1 && (10 == ~a18~0 || 11 == ~a18~0)) && 417 < ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,564 INFO L290 TraceCheckUtils]: 84: Hoare triple {22421#true} assume !(((((((306 < ~a3~0 && 417 >= ~a3~0) && 12 == ~a18~0) || (8 == ~a18~0 && 417 < ~a3~0)) || (417 < ~a3~0 && 9 == ~a18~0)) && 2 == calculate_output_~input#1) && 3 == ~a24~0) && 6 == ~a15~0); {22421#true} is VALID [2022-02-20 16:02:14,564 INFO L290 TraceCheckUtils]: 85: Hoare triple {22421#true} assume !(4 == ~a24~0 && 4 == ~a15~0 && (306 < ~a3~0 && 417 >= ~a3~0) && (10 == ~a18~0 || 8 == ~a18~0 || 9 == ~a18~0) && 1 == calculate_output_~input#1); {22421#true} is VALID [2022-02-20 16:02:14,564 INFO L290 TraceCheckUtils]: 86: Hoare triple {22421#true} assume !(4 == ~a15~0 && ((306 < ~a3~0 && 417 >= ~a3~0) && 1 == calculate_output_~input#1 && (10 == ~a18~0 || 8 == ~a18~0 || 9 == ~a18~0)) && 3 == ~a24~0); {22421#true} is VALID [2022-02-20 16:02:14,564 INFO L290 TraceCheckUtils]: 87: Hoare triple {22421#true} assume !(2 == ~a24~0 && 6 == ~a15~0 && 417 < ~a3~0 && ((9 == ~a18~0 || 10 == ~a18~0) || 11 == ~a18~0) && 2 == calculate_output_~input#1); {22421#true} is VALID [2022-02-20 16:02:14,564 INFO L290 TraceCheckUtils]: 88: Hoare triple {22421#true} assume !((((6 == calculate_output_~input#1 && ((9 == ~a18~0 || 10 == ~a18~0) || 11 == ~a18~0)) && 2 == ~a24~0) && 6 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,564 INFO L290 TraceCheckUtils]: 89: Hoare triple {22421#true} assume !((6 == ~a15~0 && 0 == ~a24~0 && (11 == ~a18~0 || 12 == ~a18~0) && 1 == calculate_output_~input#1) && 306 < ~a3~0 && 417 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,564 INFO L290 TraceCheckUtils]: 90: Hoare triple {22421#true} assume !(5 == ~a15~0 && 12 == ~a18~0 && (~a3~0 <= 115 && 1 == calculate_output_~input#1) && 2 == ~a24~0); {22421#true} is VALID [2022-02-20 16:02:14,564 INFO L290 TraceCheckUtils]: 91: Hoare triple {22421#true} assume !((3 == ~a24~0 && 4 == calculate_output_~input#1 && ((9 == ~a18~0 && 417 < ~a3~0) || ((306 < ~a3~0 && 417 >= ~a3~0) && 12 == ~a18~0) || (417 < ~a3~0 && 8 == ~a18~0))) && 6 == ~a15~0); {22421#true} is VALID [2022-02-20 16:02:14,565 INFO L290 TraceCheckUtils]: 92: Hoare triple {22421#true} assume !(((1 == ~a24~0 && 1 == calculate_output_~input#1 && 8 == ~a18~0) && ~a3~0 <= 115) && 5 == ~a15~0); {22421#true} is VALID [2022-02-20 16:02:14,565 INFO L290 TraceCheckUtils]: 93: Hoare triple {22421#true} assume !(4 == ~a15~0 && ((((12 == ~a18~0 && 3 == ~a24~0) && 417 < ~a3~0) || ((4 == ~a24~0 && 8 == ~a18~0) && ~a3~0 <= 115)) || ((4 == ~a24~0 && 9 == ~a18~0) && ~a3~0 <= 115)) && 5 == calculate_output_~input#1); {22421#true} is VALID [2022-02-20 16:02:14,565 INFO L290 TraceCheckUtils]: 94: Hoare triple {22421#true} assume !((0 == ~a24~0 && 6 == ~a15~0 && 3 == calculate_output_~input#1 && (11 == ~a18~0 || 12 == ~a18~0)) && 306 < ~a3~0 && 417 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,565 INFO L290 TraceCheckUtils]: 95: Hoare triple {22421#true} assume !((115 < ~a3~0 && 306 >= ~a3~0) && 0 == ~a24~0 && 6 == ~a15~0 && 1 == calculate_output_~input#1 && (9 == ~a18~0 || 10 == ~a18~0)); {22421#true} is VALID [2022-02-20 16:02:14,565 INFO L290 TraceCheckUtils]: 96: Hoare triple {22421#true} assume !(((2 == ~a24~0 && 5 == ~a15~0 && 2 == calculate_output_~input#1) && ~a3~0 <= 115) && 9 == ~a18~0); {22421#true} is VALID [2022-02-20 16:02:14,566 INFO L290 TraceCheckUtils]: 97: Hoare triple {22421#true} assume !(0 == ~a24~0 && (6 == ~a15~0 && (9 == ~a18~0 || 10 == ~a18~0) && 5 == calculate_output_~input#1) && 115 < ~a3~0 && 306 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,566 INFO L290 TraceCheckUtils]: 98: Hoare triple {22421#true} assume !(4 == ~a15~0 && (4 == ~a24~0 && (9 == ~a18~0 || 10 == ~a18~0) && 4 == calculate_output_~input#1) && 417 < ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,566 INFO L290 TraceCheckUtils]: 99: Hoare triple {22421#true} assume !(5 == ~a15~0 && 417 < ~a3~0 && 1 == ~a24~0 && 6 == calculate_output_~input#1 && 11 == ~a18~0); {22421#true} is VALID [2022-02-20 16:02:14,566 INFO L290 TraceCheckUtils]: 100: Hoare triple {22421#true} assume !(((((417 < ~a3~0 && 3 == ~a24~0 && 12 == ~a18~0) || ((4 == ~a24~0 && 8 == ~a18~0) && ~a3~0 <= 115)) || (~a3~0 <= 115 && 4 == ~a24~0 && 9 == ~a18~0)) && 2 == calculate_output_~input#1) && 5 == ~a15~0); {22421#true} is VALID [2022-02-20 16:02:14,566 INFO L290 TraceCheckUtils]: 101: Hoare triple {22421#true} assume !(5 == ~a15~0 && (((10 == ~a18~0 || 11 == ~a18~0) && 3 == calculate_output_~input#1) && 3 == ~a24~0) && ~a3~0 <= 115); {22421#true} is VALID [2022-02-20 16:02:14,566 INFO L290 TraceCheckUtils]: 102: Hoare triple {22421#true} assume !((((417 < ~a3~0 && 5 == ~a15~0 && 11 == ~a18~0 && 4 == ~a24~0) || (417 < ~a3~0 && 5 == ~a15~0 && 4 == ~a24~0 && 12 == ~a18~0)) || (~a3~0 <= 115 && 6 == ~a15~0 && 8 == ~a18~0 && 0 == ~a24~0)) && 1 == calculate_output_~input#1); {22421#true} is VALID [2022-02-20 16:02:14,567 INFO L290 TraceCheckUtils]: 103: Hoare triple {22421#true} assume !(6 == ~a15~0 && ((~a3~0 <= 115 && 9 == ~a18~0 && 1 == ~a24~0) || (417 < ~a3~0 && 12 == ~a18~0 && 0 == ~a24~0) || (~a3~0 <= 115 && 8 == ~a18~0 && 1 == ~a24~0)) && 2 == calculate_output_~input#1); {22421#true} is VALID [2022-02-20 16:02:14,567 INFO L290 TraceCheckUtils]: 104: Hoare triple {22421#true} assume !((4 == ~a24~0 && ((417 < ~a3~0 && 8 == ~a18~0) || ((306 < ~a3~0 && 417 >= ~a3~0) && 11 == ~a18~0) || ((306 < ~a3~0 && 417 >= ~a3~0) && 12 == ~a18~0)) && 2 == calculate_output_~input#1) && 4 == ~a15~0); {22421#true} is VALID [2022-02-20 16:02:14,567 INFO L290 TraceCheckUtils]: 105: Hoare triple {22421#true} assume !(11 == ~a18~0 && (1 == ~a24~0 && 3 == calculate_output_~input#1 && 6 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,567 INFO L290 TraceCheckUtils]: 106: Hoare triple {22421#true} assume !((306 < ~a3~0 && 417 >= ~a3~0) && 5 == ~a15~0 && ((9 == ~a18~0 || 10 == ~a18~0) && 5 == calculate_output_~input#1) && 1 == ~a24~0); {22421#true} is VALID [2022-02-20 16:02:14,567 INFO L290 TraceCheckUtils]: 107: Hoare triple {22421#true} assume !(((((8 == ~a18~0 && 417 < ~a3~0) || ((306 < ~a3~0 && 417 >= ~a3~0) && 11 == ~a18~0) || (12 == ~a18~0 && 306 < ~a3~0 && 417 >= ~a3~0)) && 3 == calculate_output_~input#1) && 3 == ~a24~0) && 4 == ~a15~0); {22421#true} is VALID [2022-02-20 16:02:14,567 INFO L290 TraceCheckUtils]: 108: Hoare triple {22421#true} assume !((306 < ~a3~0 && 417 >= ~a3~0) && (((11 == ~a18~0 || 12 == ~a18~0) && 3 == calculate_output_~input#1) && 0 == ~a24~0) && 5 == ~a15~0); {22421#true} is VALID [2022-02-20 16:02:14,568 INFO L290 TraceCheckUtils]: 109: Hoare triple {22421#true} assume !((~a3~0 <= 115 && (2 == calculate_output_~input#1 && 12 == ~a18~0) && 2 == ~a24~0) && 6 == ~a15~0); {22421#true} is VALID [2022-02-20 16:02:14,568 INFO L290 TraceCheckUtils]: 110: Hoare triple {22421#true} assume !((115 < ~a3~0 && 306 >= ~a3~0) && (6 == ~a15~0 && 1 == calculate_output_~input#1 && 0 == ~a24~0) && 11 == ~a18~0); {22421#true} is VALID [2022-02-20 16:02:14,568 INFO L290 TraceCheckUtils]: 111: Hoare triple {22421#true} assume !(3 == ~a24~0 && 4 == ~a15~0 && (4 == calculate_output_~input#1 && (11 == ~a18~0 || 12 == ~a18~0)) && 115 < ~a3~0 && 306 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,568 INFO L290 TraceCheckUtils]: 112: Hoare triple {22421#true} assume !(((((9 == ~a18~0 || 10 == ~a18~0) && 5 == calculate_output_~input#1) && 417 < ~a3~0) && 5 == ~a15~0) && 1 == ~a24~0); {22421#true} is VALID [2022-02-20 16:02:14,568 INFO L290 TraceCheckUtils]: 113: Hoare triple {22421#true} assume !((6 == ~a15~0 && (6 == calculate_output_~input#1 && ((10 == ~a18~0 || 11 == ~a18~0) || 12 == ~a18~0)) && ~a3~0 <= 115) && 1 == ~a24~0); {22421#true} is VALID [2022-02-20 16:02:14,568 INFO L290 TraceCheckUtils]: 114: Hoare triple {22421#true} assume !((3 == ~a24~0 && (((9 == ~a18~0 || 10 == ~a18~0) || 11 == ~a18~0) && 4 == calculate_output_~input#1) && 417 < ~a3~0) && 4 == ~a15~0); {22421#true} is VALID [2022-02-20 16:02:14,569 INFO L290 TraceCheckUtils]: 115: Hoare triple {22421#true} assume !(((1 == ~a24~0 && (11 == ~a18~0 || 12 == ~a18~0) && 4 == calculate_output_~input#1) && 6 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {22421#true} is VALID [2022-02-20 16:02:14,569 INFO L290 TraceCheckUtils]: 116: Hoare triple {22421#true} assume !(5 == ~a15~0 && (2 == ~a24~0 && 2 == calculate_output_~input#1 && 12 == ~a18~0) && ~a3~0 <= 115); {22421#true} is VALID [2022-02-20 16:02:14,569 INFO L290 TraceCheckUtils]: 117: Hoare triple {22421#true} assume !(((306 < ~a3~0 && 417 >= ~a3~0) && ((9 == ~a18~0 || 10 == ~a18~0) && 4 == calculate_output_~input#1) && 2 == ~a24~0) && 5 == ~a15~0); {22421#true} is VALID [2022-02-20 16:02:14,570 INFO L290 TraceCheckUtils]: 118: Hoare triple {22421#true} assume 4 == ~a15~0 && ((((12 == ~a18~0 && 3 == ~a24~0) && 417 < ~a3~0) || (~a3~0 <= 115 && 4 == ~a24~0 && 8 == ~a18~0)) || ((4 == ~a24~0 && 9 == ~a18~0) && ~a3~0 <= 115)) && 2 == calculate_output_~input#1;~a3~0 := -3 + ((if ~a3~0 < 0 && 0 != ~a3~0 % 300057 then ~a3~0 % 300057 - 300057 else ~a3~0 % 300057) - 299941);~a24~0 := 0;~a18~0 := 10;~a15~0 := 5;calculate_output_#res#1 := 25; {22423#(<= ~a18~0 10)} is VALID [2022-02-20 16:02:14,570 INFO L290 TraceCheckUtils]: 119: Hoare triple {22423#(<= ~a18~0 10)} main_#t~ret11#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~output~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1; {22423#(<= ~a18~0 10)} is VALID [2022-02-20 16:02:14,570 INFO L290 TraceCheckUtils]: 120: Hoare triple {22423#(<= ~a18~0 10)} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~input~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {22423#(<= ~a18~0 10)} is VALID [2022-02-20 16:02:14,571 INFO L290 TraceCheckUtils]: 121: Hoare triple {22423#(<= ~a18~0 10)} 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~ret8#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {22423#(<= ~a18~0 10)} is VALID [2022-02-20 16:02:14,571 INFO L290 TraceCheckUtils]: 122: Hoare triple {22423#(<= ~a18~0 10)} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {22423#(<= ~a18~0 10)} is VALID [2022-02-20 16:02:14,571 INFO L290 TraceCheckUtils]: 123: Hoare triple {22423#(<= ~a18~0 10)} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {22423#(<= ~a18~0 10)} is VALID [2022-02-20 16:02:14,572 INFO L290 TraceCheckUtils]: 124: Hoare triple {22423#(<= ~a18~0 10)} assume ((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0; {22422#false} is VALID [2022-02-20 16:02:14,572 INFO L290 TraceCheckUtils]: 125: Hoare triple {22422#false} assume !false; {22422#false} is VALID [2022-02-20 16:02:14,572 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:02:14,573 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:02:14,573 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404127285] [2022-02-20 16:02:14,573 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404127285] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:02:14,573 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:02:14,573 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:02:14,573 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501466883] [2022-02-20 16:02:14,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:02:14,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2022-02-20 16:02:14,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:02:14,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:02:14,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:02:14,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:02:14,645 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:02:14,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:02:14,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:02:14,645 INFO L87 Difference]: Start difference. First operand 3454 states and 5321 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:02:20,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:02:20,506 INFO L93 Difference]: Finished difference Result 8286 states and 13162 transitions. [2022-02-20 16:02:20,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:02:20,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2022-02-20 16:02:20,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:02:20,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:02:20,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3949 transitions. [2022-02-20 16:02:20,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:02:20,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3949 transitions. [2022-02-20 16:02:20,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 3949 transitions. [2022-02-20 16:02:23,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3949 edges. 3949 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:02:24,003 INFO L225 Difference]: With dead ends: 8286 [2022-02-20 16:02:24,003 INFO L226 Difference]: Without dead ends: 4834 [2022-02-20 16:02:24,006 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 16:02:24,006 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 715 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1994 mSolverCounterSat, 983 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 2977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 983 IncrementalHoareTripleChecker+Valid, 1994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-20 16:02:24,007 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [715 Valid, 160 Invalid, 2977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [983 Valid, 1994 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-02-20 16:02:24,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4834 states. [2022-02-20 16:02:24,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4834 to 4834. [2022-02-20 16:02:24,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:02:24,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4834 states. Second operand has 4834 states, 4833 states have (on average 1.5739706186633562) internal successors, (7607), 4833 states have internal predecessors, (7607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:02:24,091 INFO L74 IsIncluded]: Start isIncluded. First operand 4834 states. Second operand has 4834 states, 4833 states have (on average 1.5739706186633562) internal successors, (7607), 4833 states have internal predecessors, (7607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:02:24,097 INFO L87 Difference]: Start difference. First operand 4834 states. Second operand has 4834 states, 4833 states have (on average 1.5739706186633562) internal successors, (7607), 4833 states have internal predecessors, (7607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:02:24,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:02:24,745 INFO L93 Difference]: Finished difference Result 4834 states and 7607 transitions. [2022-02-20 16:02:24,745 INFO L276 IsEmpty]: Start isEmpty. Operand 4834 states and 7607 transitions. [2022-02-20 16:02:24,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:02:24,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:02:24,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 4834 states, 4833 states have (on average 1.5739706186633562) internal successors, (7607), 4833 states have internal predecessors, (7607), 0 states have call successors, (0), 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 4834 states. [2022-02-20 16:02:24,761 INFO L87 Difference]: Start difference. First operand has 4834 states, 4833 states have (on average 1.5739706186633562) internal successors, (7607), 4833 states have internal predecessors, (7607), 0 states have call successors, (0), 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 4834 states. [2022-02-20 16:02:25,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:02:25,411 INFO L93 Difference]: Finished difference Result 4834 states and 7607 transitions. [2022-02-20 16:02:25,411 INFO L276 IsEmpty]: Start isEmpty. Operand 4834 states and 7607 transitions. [2022-02-20 16:02:25,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:02:25,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:02:25,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:02:25,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:02:25,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4834 states, 4833 states have (on average 1.5739706186633562) internal successors, (7607), 4833 states have internal predecessors, (7607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:02:26,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4834 states to 4834 states and 7607 transitions. [2022-02-20 16:02:26,139 INFO L78 Accepts]: Start accepts. Automaton has 4834 states and 7607 transitions. Word has length 126 [2022-02-20 16:02:26,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:02:26,139 INFO L470 AbstractCegarLoop]: Abstraction has 4834 states and 7607 transitions. [2022-02-20 16:02:26,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:02:26,140 INFO L276 IsEmpty]: Start isEmpty. Operand 4834 states and 7607 transitions. [2022-02-20 16:02:26,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-02-20 16:02:26,141 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:02:26,141 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:02:26,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:02:26,141 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:02:26,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:02:26,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1580356840, now seen corresponding path program 1 times [2022-02-20 16:02:26,142 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:02:26,142 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461372288] [2022-02-20 16:02:26,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:02:26,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:02:26,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:02:26,348 INFO L290 TraceCheckUtils]: 0: Hoare triple {45290#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);~inputD~0 := 4;~inputA~0 := 1;~inputC~0 := 3;~inputE~0 := 5;~inputB~0 := 2;~inputF~0 := 6;~a18~0 := 9;~a24~0 := 3;~a3~0 := 99;~a15~0 := 4; {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~ret11#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1; {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~input~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,350 INFO L290 TraceCheckUtils]: 3: Hoare triple {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} 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~ret8#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,350 INFO L290 TraceCheckUtils]: 4: Hoare triple {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,355 INFO L290 TraceCheckUtils]: 15: Hoare triple {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,356 INFO L290 TraceCheckUtils]: 17: Hoare triple {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,356 INFO L290 TraceCheckUtils]: 18: Hoare triple {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,363 INFO L290 TraceCheckUtils]: 21: Hoare triple {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,364 INFO L290 TraceCheckUtils]: 22: Hoare triple {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,364 INFO L290 TraceCheckUtils]: 23: Hoare triple {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,365 INFO L290 TraceCheckUtils]: 24: Hoare triple {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,365 INFO L290 TraceCheckUtils]: 25: Hoare triple {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,366 INFO L290 TraceCheckUtils]: 26: Hoare triple {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,366 INFO L290 TraceCheckUtils]: 27: Hoare triple {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,367 INFO L290 TraceCheckUtils]: 28: Hoare triple {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,371 INFO L290 TraceCheckUtils]: 29: Hoare triple {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,372 INFO L290 TraceCheckUtils]: 30: Hoare triple {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,373 INFO L290 TraceCheckUtils]: 31: Hoare triple {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,373 INFO L290 TraceCheckUtils]: 32: Hoare triple {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,374 INFO L290 TraceCheckUtils]: 33: Hoare triple {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,387 INFO L290 TraceCheckUtils]: 34: Hoare triple {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,388 INFO L290 TraceCheckUtils]: 35: Hoare triple {45292#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((3 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,389 INFO L290 TraceCheckUtils]: 36: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,389 INFO L290 TraceCheckUtils]: 37: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,389 INFO L290 TraceCheckUtils]: 38: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,390 INFO L290 TraceCheckUtils]: 39: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,390 INFO L290 TraceCheckUtils]: 40: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,391 INFO L290 TraceCheckUtils]: 41: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,391 INFO L290 TraceCheckUtils]: 42: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,392 INFO L290 TraceCheckUtils]: 43: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,392 INFO L290 TraceCheckUtils]: 44: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,393 INFO L290 TraceCheckUtils]: 45: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,393 INFO L290 TraceCheckUtils]: 46: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,393 INFO L290 TraceCheckUtils]: 47: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,394 INFO L290 TraceCheckUtils]: 48: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,394 INFO L290 TraceCheckUtils]: 49: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,395 INFO L290 TraceCheckUtils]: 50: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,395 INFO L290 TraceCheckUtils]: 51: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,396 INFO L290 TraceCheckUtils]: 52: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,396 INFO L290 TraceCheckUtils]: 53: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,397 INFO L290 TraceCheckUtils]: 54: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,397 INFO L290 TraceCheckUtils]: 55: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,397 INFO L290 TraceCheckUtils]: 56: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,398 INFO L290 TraceCheckUtils]: 57: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,398 INFO L290 TraceCheckUtils]: 58: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,399 INFO L290 TraceCheckUtils]: 59: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,399 INFO L290 TraceCheckUtils]: 60: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,400 INFO L290 TraceCheckUtils]: 61: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,400 INFO L290 TraceCheckUtils]: 62: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,401 INFO L290 TraceCheckUtils]: 63: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,401 INFO L290 TraceCheckUtils]: 64: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,402 INFO L290 TraceCheckUtils]: 65: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !((5 == calculate_output_~input#1 && ((~a3~0 <= 115 && 9 == ~a18~0 && 3 == ~a24~0) || (417 < ~a3~0 && 12 == ~a18~0 && 2 == ~a24~0) || (~a3~0 <= 115 && 3 == ~a24~0 && 8 == ~a18~0))) && 6 == ~a15~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,402 INFO L290 TraceCheckUtils]: 66: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(5 == ~a15~0 && ((6 == calculate_output_~input#1 && (8 == ~a18~0 || 9 == ~a18~0)) && 3 == ~a24~0) && 417 < ~a3~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,403 INFO L290 TraceCheckUtils]: 67: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !((4 == ~a15~0 && 4 == ~a24~0 && (11 == ~a18~0 || 12 == ~a18~0) && 5 == calculate_output_~input#1) && 115 < ~a3~0 && 306 >= ~a3~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,403 INFO L290 TraceCheckUtils]: 68: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !((4 == ~a24~0 && (3 == calculate_output_~input#1 && (9 == ~a18~0 || 10 == ~a18~0)) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,404 INFO L290 TraceCheckUtils]: 69: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(~a3~0 <= 115 && ((5 == calculate_output_~input#1 && (9 == ~a18~0 || 10 == ~a18~0)) && 5 == ~a15~0) && 1 == ~a24~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,404 INFO L290 TraceCheckUtils]: 70: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !((10 == ~a18~0 && (417 < ~a3~0 && 3 == calculate_output_~input#1) && 5 == ~a15~0) && 3 == ~a24~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,405 INFO L290 TraceCheckUtils]: 71: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !((((((8 == ~a18~0 || 9 == ~a18~0) || 10 == ~a18~0) && 2 == calculate_output_~input#1) && 4 == ~a15~0) && 4 == ~a24~0) && 306 < ~a3~0 && 417 >= ~a3~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,405 INFO L290 TraceCheckUtils]: 72: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((((11 == ~a18~0 || 12 == ~a18~0) && 5 == calculate_output_~input#1) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0) && 3 == ~a24~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,406 INFO L290 TraceCheckUtils]: 73: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(12 == ~a18~0 && ((6 == calculate_output_~input#1 && ~a3~0 <= 115) && 2 == ~a24~0) && 5 == ~a15~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,406 INFO L290 TraceCheckUtils]: 74: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !((417 < ~a3~0 && (((10 == ~a18~0 || 11 == ~a18~0) || 12 == ~a18~0) && 6 == calculate_output_~input#1) && 0 == ~a24~0) && 5 == ~a15~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,406 INFO L290 TraceCheckUtils]: 75: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(2 == ~a24~0 && (2 == calculate_output_~input#1 && ((12 == ~a18~0 && 306 < ~a3~0 && 417 >= ~a3~0) || (8 == ~a18~0 && 417 < ~a3~0))) && 6 == ~a15~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,407 INFO L290 TraceCheckUtils]: 76: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(6 == ~a15~0 && ((((8 == ~a18~0 || 9 == ~a18~0) || 10 == ~a18~0) && 3 == calculate_output_~input#1) && 115 < ~a3~0 && 306 >= ~a3~0) && 1 == ~a24~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,407 INFO L290 TraceCheckUtils]: 77: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !((0 == ~a24~0 && 6 == ~a15~0 && 2 == calculate_output_~input#1 && (9 == ~a18~0 || 10 == ~a18~0)) && 115 < ~a3~0 && 306 >= ~a3~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,408 INFO L290 TraceCheckUtils]: 78: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !((306 < ~a3~0 && 417 >= ~a3~0) && (5 == ~a15~0 && 2 == calculate_output_~input#1 && 12 == ~a18~0) && 3 == ~a24~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,408 INFO L290 TraceCheckUtils]: 79: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(5 == ~a15~0 && 2 == ~a24~0 && (306 < ~a3~0 && 417 >= ~a3~0) && (9 == ~a18~0 || 10 == ~a18~0) && 5 == calculate_output_~input#1); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,408 INFO L290 TraceCheckUtils]: 80: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(1 == ~a24~0 && (4 == calculate_output_~input#1 && (((11 == ~a18~0 && 115 < ~a3~0 && 306 >= ~a3~0) || (12 == ~a18~0 && 115 < ~a3~0 && 306 >= ~a3~0)) || (8 == ~a18~0 && 306 < ~a3~0 && 417 >= ~a3~0))) && 5 == ~a15~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,409 INFO L290 TraceCheckUtils]: 81: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !((1 == ~a24~0 && (~a3~0 <= 115 && 6 == calculate_output_~input#1) && 5 == ~a15~0) && 11 == ~a18~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,409 INFO L290 TraceCheckUtils]: 82: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(10 == ~a18~0 && (306 < ~a3~0 && 417 >= ~a3~0) && 6 == ~a15~0 && 0 == ~a24~0 && 1 == calculate_output_~input#1); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,410 INFO L290 TraceCheckUtils]: 83: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(3 == ~a24~0 && 6 == ~a15~0 && (4 == calculate_output_~input#1 && (10 == ~a18~0 || 11 == ~a18~0)) && 417 < ~a3~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,410 INFO L290 TraceCheckUtils]: 84: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((((((306 < ~a3~0 && 417 >= ~a3~0) && 12 == ~a18~0) || (8 == ~a18~0 && 417 < ~a3~0)) || (417 < ~a3~0 && 9 == ~a18~0)) && 2 == calculate_output_~input#1) && 3 == ~a24~0) && 6 == ~a15~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,410 INFO L290 TraceCheckUtils]: 85: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(4 == ~a24~0 && 4 == ~a15~0 && (306 < ~a3~0 && 417 >= ~a3~0) && (10 == ~a18~0 || 8 == ~a18~0 || 9 == ~a18~0) && 1 == calculate_output_~input#1); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,411 INFO L290 TraceCheckUtils]: 86: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(4 == ~a15~0 && ((306 < ~a3~0 && 417 >= ~a3~0) && 1 == calculate_output_~input#1 && (10 == ~a18~0 || 8 == ~a18~0 || 9 == ~a18~0)) && 3 == ~a24~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,411 INFO L290 TraceCheckUtils]: 87: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(2 == ~a24~0 && 6 == ~a15~0 && 417 < ~a3~0 && ((9 == ~a18~0 || 10 == ~a18~0) || 11 == ~a18~0) && 2 == calculate_output_~input#1); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,412 INFO L290 TraceCheckUtils]: 88: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !((((6 == calculate_output_~input#1 && ((9 == ~a18~0 || 10 == ~a18~0) || 11 == ~a18~0)) && 2 == ~a24~0) && 6 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,412 INFO L290 TraceCheckUtils]: 89: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !((6 == ~a15~0 && 0 == ~a24~0 && (11 == ~a18~0 || 12 == ~a18~0) && 1 == calculate_output_~input#1) && 306 < ~a3~0 && 417 >= ~a3~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,413 INFO L290 TraceCheckUtils]: 90: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(5 == ~a15~0 && 12 == ~a18~0 && (~a3~0 <= 115 && 1 == calculate_output_~input#1) && 2 == ~a24~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,413 INFO L290 TraceCheckUtils]: 91: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !((3 == ~a24~0 && 4 == calculate_output_~input#1 && ((9 == ~a18~0 && 417 < ~a3~0) || ((306 < ~a3~0 && 417 >= ~a3~0) && 12 == ~a18~0) || (417 < ~a3~0 && 8 == ~a18~0))) && 6 == ~a15~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,414 INFO L290 TraceCheckUtils]: 92: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 1 == calculate_output_~input#1 && 8 == ~a18~0) && ~a3~0 <= 115) && 5 == ~a15~0); {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 16:02:26,415 INFO L290 TraceCheckUtils]: 93: Hoare triple {45293#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume 4 == ~a15~0 && ((((12 == ~a18~0 && 3 == ~a24~0) && 417 < ~a3~0) || ((4 == ~a24~0 && 8 == ~a18~0) && ~a3~0 <= 115)) || ((4 == ~a24~0 && 9 == ~a18~0) && ~a3~0 <= 115)) && 5 == calculate_output_~input#1;~a3~0 := (if -18815 + (if 9 * ~a3~0 < 0 && 0 != 9 * ~a3~0 % 10 then 1 + 9 * ~a3~0 / 10 else 9 * ~a3~0 / 10) < 0 && 0 != (-18815 + (if 9 * ~a3~0 < 0 && 0 != 9 * ~a3~0 % 10 then 1 + 9 * ~a3~0 / 10 else 9 * ~a3~0 / 10)) % 5 then 1 + (-18815 + (if 9 * ~a3~0 < 0 && 0 != 9 * ~a3~0 % 10 then 1 + 9 * ~a3~0 / 10 else 9 * ~a3~0 / 10)) / 5 else (-18815 + (if 9 * ~a3~0 < 0 && 0 != 9 * ~a3~0 % 10 then 1 + 9 * ~a3~0 / 10 else 9 * ~a3~0 / 10)) / 5) - 203034;~a24~0 := 0;~a18~0 := 8;calculate_output_#res#1 := -1; {45291#false} is VALID [2022-02-20 16:02:26,415 INFO L290 TraceCheckUtils]: 94: Hoare triple {45291#false} main_#t~ret11#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~output~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1; {45291#false} is VALID [2022-02-20 16:02:26,415 INFO L290 TraceCheckUtils]: 95: Hoare triple {45291#false} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~input~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {45291#false} is VALID [2022-02-20 16:02:26,415 INFO L290 TraceCheckUtils]: 96: Hoare triple {45291#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~ret8#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {45291#false} is VALID [2022-02-20 16:02:26,415 INFO L290 TraceCheckUtils]: 97: Hoare triple {45291#false} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {45291#false} is VALID [2022-02-20 16:02:26,416 INFO L290 TraceCheckUtils]: 98: Hoare triple {45291#false} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,416 INFO L290 TraceCheckUtils]: 99: Hoare triple {45291#false} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,416 INFO L290 TraceCheckUtils]: 100: Hoare triple {45291#false} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {45291#false} is VALID [2022-02-20 16:02:26,416 INFO L290 TraceCheckUtils]: 101: Hoare triple {45291#false} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,416 INFO L290 TraceCheckUtils]: 102: Hoare triple {45291#false} assume !(((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {45291#false} is VALID [2022-02-20 16:02:26,416 INFO L290 TraceCheckUtils]: 103: Hoare triple {45291#false} assume !(((2 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,416 INFO L290 TraceCheckUtils]: 104: Hoare triple {45291#false} assume !(((2 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {45291#false} is VALID [2022-02-20 16:02:26,417 INFO L290 TraceCheckUtils]: 105: Hoare triple {45291#false} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,417 INFO L290 TraceCheckUtils]: 106: Hoare triple {45291#false} assume !(((1 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,417 INFO L290 TraceCheckUtils]: 107: Hoare triple {45291#false} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,417 INFO L290 TraceCheckUtils]: 108: Hoare triple {45291#false} assume !(((0 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,417 INFO L290 TraceCheckUtils]: 109: Hoare triple {45291#false} assume !(((0 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,417 INFO L290 TraceCheckUtils]: 110: Hoare triple {45291#false} assume !(((0 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {45291#false} is VALID [2022-02-20 16:02:26,417 INFO L290 TraceCheckUtils]: 111: Hoare triple {45291#false} assume !(((1 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,417 INFO L290 TraceCheckUtils]: 112: Hoare triple {45291#false} assume !(((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,417 INFO L290 TraceCheckUtils]: 113: Hoare triple {45291#false} assume !(((2 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,417 INFO L290 TraceCheckUtils]: 114: Hoare triple {45291#false} assume !(((1 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,417 INFO L290 TraceCheckUtils]: 115: Hoare triple {45291#false} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,417 INFO L290 TraceCheckUtils]: 116: Hoare triple {45291#false} assume !(((0 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,417 INFO L290 TraceCheckUtils]: 117: Hoare triple {45291#false} assume !(((0 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {45291#false} is VALID [2022-02-20 16:02:26,418 INFO L290 TraceCheckUtils]: 118: Hoare triple {45291#false} assume !(((1 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,418 INFO L290 TraceCheckUtils]: 119: Hoare triple {45291#false} assume !(((1 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,418 INFO L290 TraceCheckUtils]: 120: Hoare triple {45291#false} assume !(((2 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,418 INFO L290 TraceCheckUtils]: 121: Hoare triple {45291#false} assume !(((1 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,418 INFO L290 TraceCheckUtils]: 122: Hoare triple {45291#false} assume !(((0 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,418 INFO L290 TraceCheckUtils]: 123: Hoare triple {45291#false} assume !(((2 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,418 INFO L290 TraceCheckUtils]: 124: Hoare triple {45291#false} assume !(((2 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,418 INFO L290 TraceCheckUtils]: 125: Hoare triple {45291#false} assume !(((2 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,418 INFO L290 TraceCheckUtils]: 126: Hoare triple {45291#false} assume !(((0 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,418 INFO L290 TraceCheckUtils]: 127: Hoare triple {45291#false} assume !(((2 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,418 INFO L290 TraceCheckUtils]: 128: Hoare triple {45291#false} assume !(((3 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {45291#false} is VALID [2022-02-20 16:02:26,418 INFO L290 TraceCheckUtils]: 129: Hoare triple {45291#false} assume !(((0 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,418 INFO L290 TraceCheckUtils]: 130: Hoare triple {45291#false} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,419 INFO L290 TraceCheckUtils]: 131: Hoare triple {45291#false} assume !(((2 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,419 INFO L290 TraceCheckUtils]: 132: Hoare triple {45291#false} assume !(((1 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {45291#false} is VALID [2022-02-20 16:02:26,419 INFO L290 TraceCheckUtils]: 133: Hoare triple {45291#false} assume !(((0 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,419 INFO L290 TraceCheckUtils]: 134: Hoare triple {45291#false} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,419 INFO L290 TraceCheckUtils]: 135: Hoare triple {45291#false} assume !(((2 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {45291#false} is VALID [2022-02-20 16:02:26,419 INFO L290 TraceCheckUtils]: 136: Hoare triple {45291#false} assume !(((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,419 INFO L290 TraceCheckUtils]: 137: Hoare triple {45291#false} assume !(((0 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,419 INFO L290 TraceCheckUtils]: 138: Hoare triple {45291#false} assume !(((0 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,419 INFO L290 TraceCheckUtils]: 139: Hoare triple {45291#false} assume !(((2 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,419 INFO L290 TraceCheckUtils]: 140: Hoare triple {45291#false} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {45291#false} is VALID [2022-02-20 16:02:26,419 INFO L290 TraceCheckUtils]: 141: Hoare triple {45291#false} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,419 INFO L290 TraceCheckUtils]: 142: Hoare triple {45291#false} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,420 INFO L290 TraceCheckUtils]: 143: Hoare triple {45291#false} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,420 INFO L290 TraceCheckUtils]: 144: Hoare triple {45291#false} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {45291#false} is VALID [2022-02-20 16:02:26,420 INFO L290 TraceCheckUtils]: 145: Hoare triple {45291#false} assume !(((2 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,420 INFO L290 TraceCheckUtils]: 146: Hoare triple {45291#false} assume !(((1 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {45291#false} is VALID [2022-02-20 16:02:26,420 INFO L290 TraceCheckUtils]: 147: Hoare triple {45291#false} assume !(((1 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,420 INFO L290 TraceCheckUtils]: 148: Hoare triple {45291#false} assume !(((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,420 INFO L290 TraceCheckUtils]: 149: Hoare triple {45291#false} assume !(((1 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {45291#false} is VALID [2022-02-20 16:02:26,420 INFO L290 TraceCheckUtils]: 150: Hoare triple {45291#false} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,420 INFO L290 TraceCheckUtils]: 151: Hoare triple {45291#false} assume !(((2 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,420 INFO L290 TraceCheckUtils]: 152: Hoare triple {45291#false} assume !(((0 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {45291#false} is VALID [2022-02-20 16:02:26,420 INFO L290 TraceCheckUtils]: 153: Hoare triple {45291#false} assume !(((1 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,420 INFO L290 TraceCheckUtils]: 154: Hoare triple {45291#false} assume !(((2 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,420 INFO L290 TraceCheckUtils]: 155: Hoare triple {45291#false} assume !(((1 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,421 INFO L290 TraceCheckUtils]: 156: Hoare triple {45291#false} assume !(((2 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {45291#false} is VALID [2022-02-20 16:02:26,421 INFO L290 TraceCheckUtils]: 157: Hoare triple {45291#false} assume !(((2 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {45291#false} is VALID [2022-02-20 16:02:26,421 INFO L290 TraceCheckUtils]: 158: Hoare triple {45291#false} assume !((5 == calculate_output_~input#1 && ((~a3~0 <= 115 && 9 == ~a18~0 && 3 == ~a24~0) || (417 < ~a3~0 && 12 == ~a18~0 && 2 == ~a24~0) || (~a3~0 <= 115 && 3 == ~a24~0 && 8 == ~a18~0))) && 6 == ~a15~0); {45291#false} is VALID [2022-02-20 16:02:26,421 INFO L290 TraceCheckUtils]: 159: Hoare triple {45291#false} assume !(5 == ~a15~0 && ((6 == calculate_output_~input#1 && (8 == ~a18~0 || 9 == ~a18~0)) && 3 == ~a24~0) && 417 < ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,421 INFO L290 TraceCheckUtils]: 160: Hoare triple {45291#false} assume !((4 == ~a15~0 && 4 == ~a24~0 && (11 == ~a18~0 || 12 == ~a18~0) && 5 == calculate_output_~input#1) && 115 < ~a3~0 && 306 >= ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,421 INFO L290 TraceCheckUtils]: 161: Hoare triple {45291#false} assume !((4 == ~a24~0 && (3 == calculate_output_~input#1 && (9 == ~a18~0 || 10 == ~a18~0)) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,421 INFO L290 TraceCheckUtils]: 162: Hoare triple {45291#false} assume !(~a3~0 <= 115 && ((5 == calculate_output_~input#1 && (9 == ~a18~0 || 10 == ~a18~0)) && 5 == ~a15~0) && 1 == ~a24~0); {45291#false} is VALID [2022-02-20 16:02:26,421 INFO L290 TraceCheckUtils]: 163: Hoare triple {45291#false} assume !((10 == ~a18~0 && (417 < ~a3~0 && 3 == calculate_output_~input#1) && 5 == ~a15~0) && 3 == ~a24~0); {45291#false} is VALID [2022-02-20 16:02:26,421 INFO L290 TraceCheckUtils]: 164: Hoare triple {45291#false} assume !((((((8 == ~a18~0 || 9 == ~a18~0) || 10 == ~a18~0) && 2 == calculate_output_~input#1) && 4 == ~a15~0) && 4 == ~a24~0) && 306 < ~a3~0 && 417 >= ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,421 INFO L290 TraceCheckUtils]: 165: Hoare triple {45291#false} assume !(((((11 == ~a18~0 || 12 == ~a18~0) && 5 == calculate_output_~input#1) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0) && 3 == ~a24~0); {45291#false} is VALID [2022-02-20 16:02:26,421 INFO L290 TraceCheckUtils]: 166: Hoare triple {45291#false} assume !(12 == ~a18~0 && ((6 == calculate_output_~input#1 && ~a3~0 <= 115) && 2 == ~a24~0) && 5 == ~a15~0); {45291#false} is VALID [2022-02-20 16:02:26,421 INFO L290 TraceCheckUtils]: 167: Hoare triple {45291#false} assume !((417 < ~a3~0 && (((10 == ~a18~0 || 11 == ~a18~0) || 12 == ~a18~0) && 6 == calculate_output_~input#1) && 0 == ~a24~0) && 5 == ~a15~0); {45291#false} is VALID [2022-02-20 16:02:26,421 INFO L290 TraceCheckUtils]: 168: Hoare triple {45291#false} assume !(2 == ~a24~0 && (2 == calculate_output_~input#1 && ((12 == ~a18~0 && 306 < ~a3~0 && 417 >= ~a3~0) || (8 == ~a18~0 && 417 < ~a3~0))) && 6 == ~a15~0); {45291#false} is VALID [2022-02-20 16:02:26,422 INFO L290 TraceCheckUtils]: 169: Hoare triple {45291#false} assume !(6 == ~a15~0 && ((((8 == ~a18~0 || 9 == ~a18~0) || 10 == ~a18~0) && 3 == calculate_output_~input#1) && 115 < ~a3~0 && 306 >= ~a3~0) && 1 == ~a24~0); {45291#false} is VALID [2022-02-20 16:02:26,422 INFO L290 TraceCheckUtils]: 170: Hoare triple {45291#false} assume !((0 == ~a24~0 && 6 == ~a15~0 && 2 == calculate_output_~input#1 && (9 == ~a18~0 || 10 == ~a18~0)) && 115 < ~a3~0 && 306 >= ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,422 INFO L290 TraceCheckUtils]: 171: Hoare triple {45291#false} assume !((306 < ~a3~0 && 417 >= ~a3~0) && (5 == ~a15~0 && 2 == calculate_output_~input#1 && 12 == ~a18~0) && 3 == ~a24~0); {45291#false} is VALID [2022-02-20 16:02:26,422 INFO L290 TraceCheckUtils]: 172: Hoare triple {45291#false} assume !(5 == ~a15~0 && 2 == ~a24~0 && (306 < ~a3~0 && 417 >= ~a3~0) && (9 == ~a18~0 || 10 == ~a18~0) && 5 == calculate_output_~input#1); {45291#false} is VALID [2022-02-20 16:02:26,422 INFO L290 TraceCheckUtils]: 173: Hoare triple {45291#false} assume !(1 == ~a24~0 && (4 == calculate_output_~input#1 && (((11 == ~a18~0 && 115 < ~a3~0 && 306 >= ~a3~0) || (12 == ~a18~0 && 115 < ~a3~0 && 306 >= ~a3~0)) || (8 == ~a18~0 && 306 < ~a3~0 && 417 >= ~a3~0))) && 5 == ~a15~0); {45291#false} is VALID [2022-02-20 16:02:26,422 INFO L290 TraceCheckUtils]: 174: Hoare triple {45291#false} assume !((1 == ~a24~0 && (~a3~0 <= 115 && 6 == calculate_output_~input#1) && 5 == ~a15~0) && 11 == ~a18~0); {45291#false} is VALID [2022-02-20 16:02:26,422 INFO L290 TraceCheckUtils]: 175: Hoare triple {45291#false} assume !(10 == ~a18~0 && (306 < ~a3~0 && 417 >= ~a3~0) && 6 == ~a15~0 && 0 == ~a24~0 && 1 == calculate_output_~input#1); {45291#false} is VALID [2022-02-20 16:02:26,422 INFO L290 TraceCheckUtils]: 176: Hoare triple {45291#false} assume !(3 == ~a24~0 && 6 == ~a15~0 && (4 == calculate_output_~input#1 && (10 == ~a18~0 || 11 == ~a18~0)) && 417 < ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,422 INFO L290 TraceCheckUtils]: 177: Hoare triple {45291#false} assume ((((((306 < ~a3~0 && 417 >= ~a3~0) && 12 == ~a18~0) || (8 == ~a18~0 && 417 < ~a3~0)) || (417 < ~a3~0 && 9 == ~a18~0)) && 2 == calculate_output_~input#1) && 3 == ~a24~0) && 6 == ~a15~0;~a3~0 := 288 + (if (if ~a3~0 - 473859 < 0 && 0 != (~a3~0 - 473859) % 55 then (~a3~0 - 473859) % 55 - 55 else (~a3~0 - 473859) % 55) - -361 < 0 && 0 != ((if ~a3~0 - 473859 < 0 && 0 != (~a3~0 - 473859) % 55 then (~a3~0 - 473859) % 55 - 55 else (~a3~0 - 473859) % 55) - -361) % 5 then 1 + ((if ~a3~0 - 473859 < 0 && 0 != (~a3~0 - 473859) % 55 then (~a3~0 - 473859) % 55 - 55 else (~a3~0 - 473859) % 55) - -361) / 5 else ((if ~a3~0 - 473859 < 0 && 0 != (~a3~0 - 473859) % 55 then (~a3~0 - 473859) % 55 - 55 else (~a3~0 - 473859) % 55) - -361) / 5);~a24~0 := 2;~a18~0 := 11;~a15~0 := 4;calculate_output_#res#1 := -1; {45291#false} is VALID [2022-02-20 16:02:26,422 INFO L290 TraceCheckUtils]: 178: Hoare triple {45291#false} main_#t~ret11#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~output~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1; {45291#false} is VALID [2022-02-20 16:02:26,422 INFO L290 TraceCheckUtils]: 179: Hoare triple {45291#false} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~input~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {45291#false} is VALID [2022-02-20 16:02:26,422 INFO L290 TraceCheckUtils]: 180: Hoare triple {45291#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~ret8#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {45291#false} is VALID [2022-02-20 16:02:26,423 INFO L290 TraceCheckUtils]: 181: Hoare triple {45291#false} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {45291#false} is VALID [2022-02-20 16:02:26,423 INFO L290 TraceCheckUtils]: 182: Hoare triple {45291#false} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {45291#false} is VALID [2022-02-20 16:02:26,423 INFO L290 TraceCheckUtils]: 183: Hoare triple {45291#false} assume ((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0; {45291#false} is VALID [2022-02-20 16:02:26,423 INFO L290 TraceCheckUtils]: 184: Hoare triple {45291#false} assume !false; {45291#false} is VALID [2022-02-20 16:02:26,424 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 16:02:26,424 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:02:26,424 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461372288] [2022-02-20 16:02:26,424 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461372288] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:02:26,424 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:02:26,424 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:02:26,424 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173185961] [2022-02-20 16:02:26,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:02:26,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 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 185 [2022-02-20 16:02:26,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:02:26,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 45.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:02:26,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:02:26,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:02:26,547 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:02:26,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:02:26,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:02:26,548 INFO L87 Difference]: Start difference. First operand 4834 states and 7607 transitions. Second operand has 4 states, 4 states have (on average 45.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:02:40,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:02:40,203 INFO L93 Difference]: Finished difference Result 15186 states and 23945 transitions. [2022-02-20 16:02:40,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:02:40,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 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 185 [2022-02-20 16:02:40,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:02:40,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 45.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:02:40,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5156 transitions. [2022-02-20 16:02:40,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 45.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:02:40,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5156 transitions. [2022-02-20 16:02:40,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 5156 transitions. [2022-02-20 16:02:43,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5156 edges. 5156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:02:46,527 INFO L225 Difference]: With dead ends: 15186 [2022-02-20 16:02:46,527 INFO L226 Difference]: Without dead ends: 10354 [2022-02-20 16:02:46,530 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 16:02:46,531 INFO L933 BasicCegarLoop]: 630 mSDtfsCounter, 1922 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4378 mSolverCounterSat, 629 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1922 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 5007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 629 IncrementalHoareTripleChecker+Valid, 4378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-02-20 16:02:46,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1922 Valid, 647 Invalid, 5007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [629 Valid, 4378 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-02-20 16:02:46,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10354 states. [2022-02-20 16:02:46,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10354 to 8974. [2022-02-20 16:02:46,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:02:46,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10354 states. Second operand has 8974 states, 8973 states have (on average 1.3633121586983172) internal successors, (12233), 8973 states have internal predecessors, (12233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:02:46,694 INFO L74 IsIncluded]: Start isIncluded. First operand 10354 states. Second operand has 8974 states, 8973 states have (on average 1.3633121586983172) internal successors, (12233), 8973 states have internal predecessors, (12233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:02:46,704 INFO L87 Difference]: Start difference. First operand 10354 states. Second operand has 8974 states, 8973 states have (on average 1.3633121586983172) internal successors, (12233), 8973 states have internal predecessors, (12233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:02:49,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:02:49,466 INFO L93 Difference]: Finished difference Result 10354 states and 13631 transitions. [2022-02-20 16:02:49,466 INFO L276 IsEmpty]: Start isEmpty. Operand 10354 states and 13631 transitions. [2022-02-20 16:02:49,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:02:49,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:02:49,483 INFO L74 IsIncluded]: Start isIncluded. First operand has 8974 states, 8973 states have (on average 1.3633121586983172) internal successors, (12233), 8973 states have internal predecessors, (12233), 0 states have call successors, (0), 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 10354 states. [2022-02-20 16:02:49,491 INFO L87 Difference]: Start difference. First operand has 8974 states, 8973 states have (on average 1.3633121586983172) internal successors, (12233), 8973 states have internal predecessors, (12233), 0 states have call successors, (0), 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 10354 states. [2022-02-20 16:02:52,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:02:52,401 INFO L93 Difference]: Finished difference Result 10354 states and 13631 transitions. [2022-02-20 16:02:52,401 INFO L276 IsEmpty]: Start isEmpty. Operand 10354 states and 13631 transitions. [2022-02-20 16:02:52,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:02:52,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:02:52,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:02:52,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:02:52,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8974 states, 8973 states have (on average 1.3633121586983172) internal successors, (12233), 8973 states have internal predecessors, (12233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)