./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label50.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/Problem02_label50.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 55cfdf74604724371a452c38b03dd4e25c32928e3cf25773bd571d9975e54b78 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:47:42,453 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:47:42,455 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:47:42,491 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:47:42,492 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:47:42,495 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:47:42,496 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:47:42,498 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:47:42,499 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:47:42,503 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:47:42,504 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:47:42,505 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:47:42,505 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:47:42,507 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:47:42,508 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:47:42,511 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:47:42,512 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:47:42,512 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:47:42,514 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:47:42,519 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:47:42,520 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:47:42,521 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:47:42,522 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:47:42,523 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:47:42,529 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:47:42,529 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:47:42,529 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:47:42,531 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:47:42,531 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:47:42,532 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:47:42,532 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:47:42,533 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:47:42,534 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:47:42,535 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:47:42,536 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:47:42,536 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:47:42,536 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:47:42,537 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:47:42,537 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:47:42,537 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:47:42,538 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:47:42,540 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 14:47:42,569 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:47:42,570 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:47:42,570 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:47:42,570 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:47:42,571 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:47:42,572 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:47:42,572 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:47:42,572 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:47:42,573 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:47:42,573 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:47:42,574 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:47:42,574 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:47:42,574 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:47:42,574 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:47:42,575 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:47:42,575 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:47:42,575 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:47:42,575 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:47:42,575 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:47:42,576 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:47:42,576 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:47:42,576 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:47:42,576 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:47:42,577 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:47:42,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:47:42,577 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:47:42,577 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:47:42,578 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:47:42,578 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:47:42,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:47:42,578 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:47:42,579 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:47:42,583 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:47:42,583 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 -> 55cfdf74604724371a452c38b03dd4e25c32928e3cf25773bd571d9975e54b78 [2022-02-20 14:47:42,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:47:42,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:47:42,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:47:42,835 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:47:42,835 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:47:42,836 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label50.c [2022-02-20 14:47:42,894 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d7ee1fd7/a05aedb9194b479db89146419d41249a/FLAG3fd97382b [2022-02-20 14:47:43,279 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:47:43,280 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label50.c [2022-02-20 14:47:43,287 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d7ee1fd7/a05aedb9194b479db89146419d41249a/FLAG3fd97382b [2022-02-20 14:47:43,671 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d7ee1fd7/a05aedb9194b479db89146419d41249a [2022-02-20 14:47:43,673 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:47:43,674 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:47:43,676 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:47:43,676 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:47:43,681 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:47:43,682 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:47:43" (1/1) ... [2022-02-20 14:47:43,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e79230e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:47:43, skipping insertion in model container [2022-02-20 14:47:43,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:47:43" (1/1) ... [2022-02-20 14:47:43,688 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:47:43,728 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:47:43,980 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/Problem02_label50.c[14631,14644] [2022-02-20 14:47:44,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:47:44,022 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:47:44,076 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/Problem02_label50.c[14631,14644] [2022-02-20 14:47:44,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:47:44,149 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:47:44,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:47:44 WrapperNode [2022-02-20 14:47:44,150 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:47:44,151 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:47:44,151 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:47:44,151 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:47:44,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:47:44" (1/1) ... [2022-02-20 14:47:44,181 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:47:44" (1/1) ... [2022-02-20 14:47:44,224 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2022-02-20 14:47:44,225 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:47:44,226 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:47:44,226 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:47:44,226 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:47:44,232 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:47:44" (1/1) ... [2022-02-20 14:47:44,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:47:44" (1/1) ... [2022-02-20 14:47:44,235 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:47:44" (1/1) ... [2022-02-20 14:47:44,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:47:44" (1/1) ... [2022-02-20 14:47:44,251 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:47:44" (1/1) ... [2022-02-20 14:47:44,258 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:47:44" (1/1) ... [2022-02-20 14:47:44,261 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:47:44" (1/1) ... [2022-02-20 14:47:44,265 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:47:44,266 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:47:44,266 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:47:44,267 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:47:44,281 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:47:44" (1/1) ... [2022-02-20 14:47:44,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:47:44,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:47:44,309 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 14:47:44,311 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 14:47:44,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:47:44,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:47:44,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:47:44,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:47:44,431 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:47:44,432 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:47:45,225 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:47:45,242 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:47:45,242 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 14:47:45,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:47:45 BoogieIcfgContainer [2022-02-20 14:47:45,243 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:47:45,244 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:47:45,244 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:47:45,247 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:47:45,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:47:43" (1/3) ... [2022-02-20 14:47:45,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3855de0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:47:45, skipping insertion in model container [2022-02-20 14:47:45,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:47:44" (2/3) ... [2022-02-20 14:47:45,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3855de0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:47:45, skipping insertion in model container [2022-02-20 14:47:45,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:47:45" (3/3) ... [2022-02-20 14:47:45,249 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem02_label50.c [2022-02-20 14:47:45,253 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:47:45,253 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:47:45,282 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:47:45,287 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 14:47:45,287 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:47:45,303 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:45,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-02-20 14:47:45,309 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:47:45,310 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:47:45,310 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:47:45,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:47:45,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1127028437, now seen corresponding path program 1 times [2022-02-20 14:47:45,320 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:47:45,321 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038143675] [2022-02-20 14:47:45,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:47:45,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:47:45,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:47:45,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {230#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);~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#(= ~a25~0 ~a11~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1; {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,671 INFO L290 TraceCheckUtils]: 3: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !((((1 != 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_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,671 INFO L290 TraceCheckUtils]: 4: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input#1) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input#1) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input#1 && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,673 INFO L290 TraceCheckUtils]: 8: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(((8 == ~a17~0 && ((1 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input#1 && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input#1 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(1 == ~a19~0 && (((1 == calculate_output_~input#1 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input#1 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input#1) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input#1) && !(1 == ~a11~0)) && 8 == ~a17~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input#1); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,681 INFO L290 TraceCheckUtils]: 17: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input#1 && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,682 INFO L290 TraceCheckUtils]: 18: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,682 INFO L290 TraceCheckUtils]: 19: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input#1) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,683 INFO L290 TraceCheckUtils]: 20: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input#1); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input#1 && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,684 INFO L290 TraceCheckUtils]: 22: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input#1 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,684 INFO L290 TraceCheckUtils]: 23: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input#1 && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,685 INFO L290 TraceCheckUtils]: 24: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,685 INFO L290 TraceCheckUtils]: 25: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input#1) && 9 == ~a17~0) && 9 == ~a28~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,686 INFO L290 TraceCheckUtils]: 26: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input#1) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,686 INFO L290 TraceCheckUtils]: 27: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input#1) && !(1 == ~a19~0)) && 1 == ~a21~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,687 INFO L290 TraceCheckUtils]: 28: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input#1 && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,687 INFO L290 TraceCheckUtils]: 29: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input#1 && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,687 INFO L290 TraceCheckUtils]: 30: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input#1) && !(1 == ~a11~0)); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,688 INFO L290 TraceCheckUtils]: 31: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input#1 && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,688 INFO L290 TraceCheckUtils]: 32: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input#1 && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,689 INFO L290 TraceCheckUtils]: 33: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input#1) && 1 == ~a11~0) && 9 == ~a17~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,689 INFO L290 TraceCheckUtils]: 34: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,690 INFO L290 TraceCheckUtils]: 35: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(1 == ~a19~0 && ((((4 == calculate_output_~input#1 && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,690 INFO L290 TraceCheckUtils]: 36: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(8 == ~a17~0 && ((((1 == calculate_output_~input#1 && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,690 INFO L290 TraceCheckUtils]: 37: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !((((((4 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,691 INFO L290 TraceCheckUtils]: 38: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input#1) && 1 == ~a19~0) && 1 == ~a21~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,691 INFO L290 TraceCheckUtils]: 39: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input#1) && 1 == ~a21~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,692 INFO L290 TraceCheckUtils]: 40: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !((((1 == ~a21~0 && 1 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,692 INFO L290 TraceCheckUtils]: 41: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input#1) && !(1 == ~a11~0)) && 8 == ~a17~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,692 INFO L290 TraceCheckUtils]: 42: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input#1) && 8 == ~a17~0) && 1 == ~a21~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,693 INFO L290 TraceCheckUtils]: 43: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input#1) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,693 INFO L290 TraceCheckUtils]: 44: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !((8 == ~a17~0 && (((6 == calculate_output_~input#1 && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,694 INFO L290 TraceCheckUtils]: 45: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input#1 && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,694 INFO L290 TraceCheckUtils]: 46: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !((((((1 == calculate_output_~input#1 && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,695 INFO L290 TraceCheckUtils]: 47: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input#1) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,695 INFO L290 TraceCheckUtils]: 48: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input#1) && 1 == ~a21~0) && !(1 == ~a19~0)); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,695 INFO L290 TraceCheckUtils]: 49: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input#1) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,696 INFO L290 TraceCheckUtils]: 50: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !((9 == ~a17~0 && (((1 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,696 INFO L290 TraceCheckUtils]: 51: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input#1) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,697 INFO L290 TraceCheckUtils]: 52: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(9 == ~a17~0 && 1 == ~a21~0 && 1 == ~a11~0 && (3 == calculate_output_~input#1 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a19~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,697 INFO L290 TraceCheckUtils]: 53: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input#1 && !(1 == ~a11~0)); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,698 INFO L290 TraceCheckUtils]: 54: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input#1 && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,698 INFO L290 TraceCheckUtils]: 55: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !((((8 == ~a17~0 && (6 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a21~0) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a19~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,698 INFO L290 TraceCheckUtils]: 56: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !((!(1 == ~a11~0) && (!(1 == ~a19~0) && ((!(1 == ~a25~0) && 11 == ~a28~0) || (10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) && 5 == calculate_output_~input#1) && 8 == ~a17~0) && 1 == ~a21~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,699 INFO L290 TraceCheckUtils]: 57: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input#1) && 1 == ~a19~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,699 INFO L290 TraceCheckUtils]: 58: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input#1) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,700 INFO L290 TraceCheckUtils]: 59: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(1 == ~a11~0 && (9 == ~a17~0 && 9 == ~a28~0 && 1 == ~a19~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input#1) && 1 == ~a21~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,700 INFO L290 TraceCheckUtils]: 60: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !((((((3 == calculate_output_~input#1 && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,701 INFO L290 TraceCheckUtils]: 61: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(1 == ~a19~0 && 1 == ~a21~0 && ((5 == calculate_output_~input#1 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a11~0) && 9 == ~a17~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,701 INFO L290 TraceCheckUtils]: 62: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !((1 == ~a19~0 && ((!(1 == ~a11~0) && (1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input#1) && 10 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,701 INFO L290 TraceCheckUtils]: 63: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input#1 && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,702 INFO L290 TraceCheckUtils]: 64: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(((!(1 == ~a19~0) && (4 == calculate_output_~input#1 && (((!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,702 INFO L290 TraceCheckUtils]: 65: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input#1) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,703 INFO L290 TraceCheckUtils]: 66: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !((((1 == ~a21~0 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (9 == ~a28~0 && 1 == ~a25~0)) && 6 == calculate_output_~input#1) && !(1 == ~a11~0)) && !(1 == ~a19~0)) && 8 == ~a17~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,703 INFO L290 TraceCheckUtils]: 67: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input#1) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,703 INFO L290 TraceCheckUtils]: 68: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(8 == ~a17~0 && (1 == ~a21~0 && (5 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (9 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a19~0) && !(1 == ~a11~0)); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,704 INFO L290 TraceCheckUtils]: 69: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input#1 && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,704 INFO L290 TraceCheckUtils]: 70: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input#1) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,705 INFO L290 TraceCheckUtils]: 71: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input#1) && 1 == ~a21~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,705 INFO L290 TraceCheckUtils]: 72: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 6 == calculate_output_~input#1 && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a19~0)); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,705 INFO L290 TraceCheckUtils]: 73: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input#1) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,706 INFO L290 TraceCheckUtils]: 74: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !((8 == ~a17~0 && ((4 == calculate_output_~input#1 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,706 INFO L290 TraceCheckUtils]: 75: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input#1) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,707 INFO L290 TraceCheckUtils]: 76: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input#1) && !(1 == ~a25~0)) && 8 == ~a28~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,707 INFO L290 TraceCheckUtils]: 77: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input#1) && 11 == ~a28~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,708 INFO L290 TraceCheckUtils]: 78: Hoare triple {232#(= ~a25~0 ~a11~0)} assume !(1 == ~a19~0 && 8 == ~a17~0 && ((((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input#1) && !(1 == ~a11~0)) && 1 == ~a21~0); {232#(= ~a25~0 ~a11~0)} is VALID [2022-02-20 14:47:45,708 INFO L290 TraceCheckUtils]: 79: Hoare triple {232#(= ~a25~0 ~a11~0)} assume ((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0; {231#false} is VALID [2022-02-20 14:47:45,708 INFO L290 TraceCheckUtils]: 80: Hoare triple {231#false} assume !false; {231#false} is VALID [2022-02-20 14:47:45,710 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 14:47:45,710 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:47:45,710 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038143675] [2022-02-20 14:47:45,711 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038143675] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:47:45,711 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:47:45,711 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:47:45,712 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508976146] [2022-02-20 14:47:45,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:47:45,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2022-02-20 14:47:45,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:47:45,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:45,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:47:45,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:47:45,789 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:47:45,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:47:45,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:47:45,808 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 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 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:46,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:47:46,840 INFO L93 Difference]: Finished difference Result 617 states and 1059 transitions. [2022-02-20 14:47:46,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:47:46,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2022-02-20 14:47:46,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:47:46,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:46,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1059 transitions. [2022-02-20 14:47:46,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:46,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1059 transitions. [2022-02-20 14:47:46,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1059 transitions. [2022-02-20 14:47:47,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1059 edges. 1059 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:47:47,573 INFO L225 Difference]: With dead ends: 617 [2022-02-20 14:47:47,574 INFO L226 Difference]: Without dead ends: 316 [2022-02-20 14:47:47,578 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 14:47:47,580 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 120 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 14:47:47,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 102 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 14:47:47,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-02-20 14:47:47,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 309. [2022-02-20 14:47:47,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:47:47,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 316 states. Second operand has 309 states, 308 states have (on average 1.4610389610389611) internal successors, (450), 308 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:47,620 INFO L74 IsIncluded]: Start isIncluded. First operand 316 states. Second operand has 309 states, 308 states have (on average 1.4610389610389611) internal successors, (450), 308 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:47,621 INFO L87 Difference]: Start difference. First operand 316 states. Second operand has 309 states, 308 states have (on average 1.4610389610389611) internal successors, (450), 308 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:47,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:47:47,633 INFO L93 Difference]: Finished difference Result 316 states and 464 transitions. [2022-02-20 14:47:47,634 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 464 transitions. [2022-02-20 14:47:47,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:47:47,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:47:47,636 INFO L74 IsIncluded]: Start isIncluded. First operand has 309 states, 308 states have (on average 1.4610389610389611) internal successors, (450), 308 states have internal predecessors, (450), 0 states have call successors, (0), 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 316 states. [2022-02-20 14:47:47,637 INFO L87 Difference]: Start difference. First operand has 309 states, 308 states have (on average 1.4610389610389611) internal successors, (450), 308 states have internal predecessors, (450), 0 states have call successors, (0), 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 316 states. [2022-02-20 14:47:47,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:47:47,646 INFO L93 Difference]: Finished difference Result 316 states and 464 transitions. [2022-02-20 14:47:47,647 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 464 transitions. [2022-02-20 14:47:47,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:47:47,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:47:47,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:47:47,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:47:47,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 1.4610389610389611) internal successors, (450), 308 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:47,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 450 transitions. [2022-02-20 14:47:47,659 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 450 transitions. Word has length 81 [2022-02-20 14:47:47,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:47:47,660 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 450 transitions. [2022-02-20 14:47:47,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:47,660 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 450 transitions. [2022-02-20 14:47:47,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-02-20 14:47:47,662 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:47:47,662 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 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] [2022-02-20 14:47:47,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:47:47,663 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:47:47,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:47:47,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1717775062, now seen corresponding path program 1 times [2022-02-20 14:47:47,664 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:47:47,664 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515787537] [2022-02-20 14:47:47,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:47:47,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:47:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:47:47,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {1806#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);~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; {1808#(<= ~a28~0 7)} is VALID [2022-02-20 14:47:47,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {1808#(<= ~a28~0 7)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1; {1808#(<= ~a28~0 7)} is VALID [2022-02-20 14:47:47,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {1808#(<= ~a28~0 7)} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1808#(<= ~a28~0 7)} is VALID [2022-02-20 14:47:47,717 INFO L290 TraceCheckUtils]: 3: Hoare triple {1808#(<= ~a28~0 7)} assume !((((1 != 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_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {1808#(<= ~a28~0 7)} is VALID [2022-02-20 14:47:47,717 INFO L290 TraceCheckUtils]: 4: Hoare triple {1808#(<= ~a28~0 7)} assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); {1808#(<= ~a28~0 7)} is VALID [2022-02-20 14:47:47,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {1808#(<= ~a28~0 7)} assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input#1) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); {1808#(<= ~a28~0 7)} is VALID [2022-02-20 14:47:47,718 INFO L290 TraceCheckUtils]: 6: Hoare triple {1808#(<= ~a28~0 7)} assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input#1) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); {1808#(<= ~a28~0 7)} is VALID [2022-02-20 14:47:47,718 INFO L290 TraceCheckUtils]: 7: Hoare triple {1808#(<= ~a28~0 7)} assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input#1 && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); {1808#(<= ~a28~0 7)} is VALID [2022-02-20 14:47:47,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {1808#(<= ~a28~0 7)} assume ((8 == ~a17~0 && ((1 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0;~a25~0 := 0;calculate_output_#res#1 := -1; {1807#false} is VALID [2022-02-20 14:47:47,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {1807#false} main_#t~ret7#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main_#t~ret7#1 && main_#t~ret7#1 <= 2147483647;main_~output~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1; {1807#false} is VALID [2022-02-20 14:47:47,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {1807#false} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1807#false} is VALID [2022-02-20 14:47:47,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {1807#false} assume !((((1 != 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_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {1807#false} is VALID [2022-02-20 14:47:47,720 INFO L290 TraceCheckUtils]: 12: Hoare triple {1807#false} assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); {1807#false} is VALID [2022-02-20 14:47:47,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {1807#false} assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input#1) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); {1807#false} is VALID [2022-02-20 14:47:47,720 INFO L290 TraceCheckUtils]: 14: Hoare triple {1807#false} assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input#1) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); {1807#false} is VALID [2022-02-20 14:47:47,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {1807#false} assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input#1 && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); {1807#false} is VALID [2022-02-20 14:47:47,721 INFO L290 TraceCheckUtils]: 16: Hoare triple {1807#false} assume !(((8 == ~a17~0 && ((1 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); {1807#false} is VALID [2022-02-20 14:47:47,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {1807#false} assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input#1 && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); {1807#false} is VALID [2022-02-20 14:47:47,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {1807#false} assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input#1 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); {1807#false} is VALID [2022-02-20 14:47:47,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {1807#false} assume !(1 == ~a19~0 && (((1 == calculate_output_~input#1 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); {1807#false} is VALID [2022-02-20 14:47:47,721 INFO L290 TraceCheckUtils]: 20: Hoare triple {1807#false} assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); {1807#false} is VALID [2022-02-20 14:47:47,722 INFO L290 TraceCheckUtils]: 21: Hoare triple {1807#false} assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input#1 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); {1807#false} is VALID [2022-02-20 14:47:47,722 INFO L290 TraceCheckUtils]: 22: Hoare triple {1807#false} assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input#1) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); {1807#false} is VALID [2022-02-20 14:47:47,722 INFO L290 TraceCheckUtils]: 23: Hoare triple {1807#false} assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input#1) && !(1 == ~a11~0)) && 8 == ~a17~0); {1807#false} is VALID [2022-02-20 14:47:47,722 INFO L290 TraceCheckUtils]: 24: Hoare triple {1807#false} assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input#1); {1807#false} is VALID [2022-02-20 14:47:47,722 INFO L290 TraceCheckUtils]: 25: Hoare triple {1807#false} assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input#1 && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); {1807#false} is VALID [2022-02-20 14:47:47,723 INFO L290 TraceCheckUtils]: 26: Hoare triple {1807#false} assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); {1807#false} is VALID [2022-02-20 14:47:47,723 INFO L290 TraceCheckUtils]: 27: Hoare triple {1807#false} assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input#1) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); {1807#false} is VALID [2022-02-20 14:47:47,723 INFO L290 TraceCheckUtils]: 28: Hoare triple {1807#false} assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input#1); {1807#false} is VALID [2022-02-20 14:47:47,723 INFO L290 TraceCheckUtils]: 29: Hoare triple {1807#false} assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input#1 && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); {1807#false} is VALID [2022-02-20 14:47:47,723 INFO L290 TraceCheckUtils]: 30: Hoare triple {1807#false} assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input#1 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); {1807#false} is VALID [2022-02-20 14:47:47,724 INFO L290 TraceCheckUtils]: 31: Hoare triple {1807#false} assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input#1 && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); {1807#false} is VALID [2022-02-20 14:47:47,724 INFO L290 TraceCheckUtils]: 32: Hoare triple {1807#false} assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); {1807#false} is VALID [2022-02-20 14:47:47,724 INFO L290 TraceCheckUtils]: 33: Hoare triple {1807#false} assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input#1) && 9 == ~a17~0) && 9 == ~a28~0); {1807#false} is VALID [2022-02-20 14:47:47,724 INFO L290 TraceCheckUtils]: 34: Hoare triple {1807#false} assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input#1) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); {1807#false} is VALID [2022-02-20 14:47:47,725 INFO L290 TraceCheckUtils]: 35: Hoare triple {1807#false} assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input#1) && !(1 == ~a19~0)) && 1 == ~a21~0); {1807#false} is VALID [2022-02-20 14:47:47,725 INFO L290 TraceCheckUtils]: 36: Hoare triple {1807#false} assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input#1 && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); {1807#false} is VALID [2022-02-20 14:47:47,725 INFO L290 TraceCheckUtils]: 37: Hoare triple {1807#false} assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input#1 && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); {1807#false} is VALID [2022-02-20 14:47:47,725 INFO L290 TraceCheckUtils]: 38: Hoare triple {1807#false} assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input#1) && !(1 == ~a11~0)); {1807#false} is VALID [2022-02-20 14:47:47,725 INFO L290 TraceCheckUtils]: 39: Hoare triple {1807#false} assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input#1 && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); {1807#false} is VALID [2022-02-20 14:47:47,726 INFO L290 TraceCheckUtils]: 40: Hoare triple {1807#false} assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input#1 && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); {1807#false} is VALID [2022-02-20 14:47:47,726 INFO L290 TraceCheckUtils]: 41: Hoare triple {1807#false} assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input#1) && 1 == ~a11~0) && 9 == ~a17~0); {1807#false} is VALID [2022-02-20 14:47:47,726 INFO L290 TraceCheckUtils]: 42: Hoare triple {1807#false} assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); {1807#false} is VALID [2022-02-20 14:47:47,726 INFO L290 TraceCheckUtils]: 43: Hoare triple {1807#false} assume !(1 == ~a19~0 && ((((4 == calculate_output_~input#1 && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); {1807#false} is VALID [2022-02-20 14:47:47,726 INFO L290 TraceCheckUtils]: 44: Hoare triple {1807#false} assume !(8 == ~a17~0 && ((((1 == calculate_output_~input#1 && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); {1807#false} is VALID [2022-02-20 14:47:47,727 INFO L290 TraceCheckUtils]: 45: Hoare triple {1807#false} assume !((((((4 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); {1807#false} is VALID [2022-02-20 14:47:47,727 INFO L290 TraceCheckUtils]: 46: Hoare triple {1807#false} assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input#1) && 1 == ~a19~0) && 1 == ~a21~0); {1807#false} is VALID [2022-02-20 14:47:47,727 INFO L290 TraceCheckUtils]: 47: Hoare triple {1807#false} assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input#1) && 1 == ~a21~0); {1807#false} is VALID [2022-02-20 14:47:47,727 INFO L290 TraceCheckUtils]: 48: Hoare triple {1807#false} assume !((((1 == ~a21~0 && 1 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); {1807#false} is VALID [2022-02-20 14:47:47,728 INFO L290 TraceCheckUtils]: 49: Hoare triple {1807#false} assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input#1) && !(1 == ~a11~0)) && 8 == ~a17~0); {1807#false} is VALID [2022-02-20 14:47:47,728 INFO L290 TraceCheckUtils]: 50: Hoare triple {1807#false} assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input#1) && 8 == ~a17~0) && 1 == ~a21~0); {1807#false} is VALID [2022-02-20 14:47:47,728 INFO L290 TraceCheckUtils]: 51: Hoare triple {1807#false} assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input#1) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); {1807#false} is VALID [2022-02-20 14:47:47,728 INFO L290 TraceCheckUtils]: 52: Hoare triple {1807#false} assume !((8 == ~a17~0 && (((6 == calculate_output_~input#1 && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); {1807#false} is VALID [2022-02-20 14:47:47,728 INFO L290 TraceCheckUtils]: 53: Hoare triple {1807#false} assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input#1 && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); {1807#false} is VALID [2022-02-20 14:47:47,729 INFO L290 TraceCheckUtils]: 54: Hoare triple {1807#false} assume !((((((1 == calculate_output_~input#1 && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); {1807#false} is VALID [2022-02-20 14:47:47,729 INFO L290 TraceCheckUtils]: 55: Hoare triple {1807#false} assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input#1) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); {1807#false} is VALID [2022-02-20 14:47:47,729 INFO L290 TraceCheckUtils]: 56: Hoare triple {1807#false} assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input#1) && 1 == ~a21~0) && !(1 == ~a19~0)); {1807#false} is VALID [2022-02-20 14:47:47,729 INFO L290 TraceCheckUtils]: 57: Hoare triple {1807#false} assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input#1) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); {1807#false} is VALID [2022-02-20 14:47:47,729 INFO L290 TraceCheckUtils]: 58: Hoare triple {1807#false} assume !((9 == ~a17~0 && (((1 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0); {1807#false} is VALID [2022-02-20 14:47:47,730 INFO L290 TraceCheckUtils]: 59: Hoare triple {1807#false} assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input#1) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); {1807#false} is VALID [2022-02-20 14:47:47,730 INFO L290 TraceCheckUtils]: 60: Hoare triple {1807#false} assume !(9 == ~a17~0 && 1 == ~a21~0 && 1 == ~a11~0 && (3 == calculate_output_~input#1 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a19~0); {1807#false} is VALID [2022-02-20 14:47:47,730 INFO L290 TraceCheckUtils]: 61: Hoare triple {1807#false} assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input#1 && !(1 == ~a11~0)); {1807#false} is VALID [2022-02-20 14:47:47,730 INFO L290 TraceCheckUtils]: 62: Hoare triple {1807#false} assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input#1 && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); {1807#false} is VALID [2022-02-20 14:47:47,730 INFO L290 TraceCheckUtils]: 63: Hoare triple {1807#false} assume !((((8 == ~a17~0 && (6 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a21~0) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a19~0); {1807#false} is VALID [2022-02-20 14:47:47,731 INFO L290 TraceCheckUtils]: 64: Hoare triple {1807#false} assume !((!(1 == ~a11~0) && (!(1 == ~a19~0) && ((!(1 == ~a25~0) && 11 == ~a28~0) || (10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) && 5 == calculate_output_~input#1) && 8 == ~a17~0) && 1 == ~a21~0); {1807#false} is VALID [2022-02-20 14:47:47,731 INFO L290 TraceCheckUtils]: 65: Hoare triple {1807#false} assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input#1) && 1 == ~a19~0); {1807#false} is VALID [2022-02-20 14:47:47,731 INFO L290 TraceCheckUtils]: 66: Hoare triple {1807#false} assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input#1) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); {1807#false} is VALID [2022-02-20 14:47:47,731 INFO L290 TraceCheckUtils]: 67: Hoare triple {1807#false} assume !(1 == ~a11~0 && (9 == ~a17~0 && 9 == ~a28~0 && 1 == ~a19~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input#1) && 1 == ~a21~0); {1807#false} is VALID [2022-02-20 14:47:47,732 INFO L290 TraceCheckUtils]: 68: Hoare triple {1807#false} assume !((((((3 == calculate_output_~input#1 && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); {1807#false} is VALID [2022-02-20 14:47:47,732 INFO L290 TraceCheckUtils]: 69: Hoare triple {1807#false} assume !(1 == ~a19~0 && 1 == ~a21~0 && ((5 == calculate_output_~input#1 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a11~0) && 9 == ~a17~0); {1807#false} is VALID [2022-02-20 14:47:47,732 INFO L290 TraceCheckUtils]: 70: Hoare triple {1807#false} assume !((1 == ~a19~0 && ((!(1 == ~a11~0) && (1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input#1) && 10 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0); {1807#false} is VALID [2022-02-20 14:47:47,732 INFO L290 TraceCheckUtils]: 71: Hoare triple {1807#false} assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input#1 && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); {1807#false} is VALID [2022-02-20 14:47:47,732 INFO L290 TraceCheckUtils]: 72: Hoare triple {1807#false} assume !(((!(1 == ~a19~0) && (4 == calculate_output_~input#1 && (((!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); {1807#false} is VALID [2022-02-20 14:47:47,733 INFO L290 TraceCheckUtils]: 73: Hoare triple {1807#false} assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input#1) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); {1807#false} is VALID [2022-02-20 14:47:47,733 INFO L290 TraceCheckUtils]: 74: Hoare triple {1807#false} assume !((((1 == ~a21~0 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (9 == ~a28~0 && 1 == ~a25~0)) && 6 == calculate_output_~input#1) && !(1 == ~a11~0)) && !(1 == ~a19~0)) && 8 == ~a17~0); {1807#false} is VALID [2022-02-20 14:47:47,733 INFO L290 TraceCheckUtils]: 75: Hoare triple {1807#false} assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input#1) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); {1807#false} is VALID [2022-02-20 14:47:47,733 INFO L290 TraceCheckUtils]: 76: Hoare triple {1807#false} assume !(8 == ~a17~0 && (1 == ~a21~0 && (5 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (9 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a19~0) && !(1 == ~a11~0)); {1807#false} is VALID [2022-02-20 14:47:47,733 INFO L290 TraceCheckUtils]: 77: Hoare triple {1807#false} assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input#1 && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); {1807#false} is VALID [2022-02-20 14:47:47,734 INFO L290 TraceCheckUtils]: 78: Hoare triple {1807#false} assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input#1) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); {1807#false} is VALID [2022-02-20 14:47:47,734 INFO L290 TraceCheckUtils]: 79: Hoare triple {1807#false} assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input#1) && 1 == ~a21~0); {1807#false} is VALID [2022-02-20 14:47:47,734 INFO L290 TraceCheckUtils]: 80: Hoare triple {1807#false} assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 6 == calculate_output_~input#1 && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a19~0)); {1807#false} is VALID [2022-02-20 14:47:47,734 INFO L290 TraceCheckUtils]: 81: Hoare triple {1807#false} assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input#1) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); {1807#false} is VALID [2022-02-20 14:47:47,734 INFO L290 TraceCheckUtils]: 82: Hoare triple {1807#false} assume !((8 == ~a17~0 && ((4 == calculate_output_~input#1 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)); {1807#false} is VALID [2022-02-20 14:47:47,735 INFO L290 TraceCheckUtils]: 83: Hoare triple {1807#false} assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input#1) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); {1807#false} is VALID [2022-02-20 14:47:47,735 INFO L290 TraceCheckUtils]: 84: Hoare triple {1807#false} assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input#1) && !(1 == ~a25~0)) && 8 == ~a28~0); {1807#false} is VALID [2022-02-20 14:47:47,735 INFO L290 TraceCheckUtils]: 85: Hoare triple {1807#false} assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input#1) && 11 == ~a28~0); {1807#false} is VALID [2022-02-20 14:47:47,735 INFO L290 TraceCheckUtils]: 86: Hoare triple {1807#false} assume !(1 == ~a19~0 && 8 == ~a17~0 && ((((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input#1) && !(1 == ~a11~0)) && 1 == ~a21~0); {1807#false} is VALID [2022-02-20 14:47:47,736 INFO L290 TraceCheckUtils]: 87: Hoare triple {1807#false} assume ((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0; {1807#false} is VALID [2022-02-20 14:47:47,736 INFO L290 TraceCheckUtils]: 88: Hoare triple {1807#false} assume !false; {1807#false} is VALID [2022-02-20 14:47:47,736 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:47:47,737 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:47:47,737 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515787537] [2022-02-20 14:47:47,737 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515787537] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:47:47,737 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:47:47,738 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:47:47,738 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677600279] [2022-02-20 14:47:47,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:47:47,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2022-02-20 14:47:47,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:47:47,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:47,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:47:47,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:47:47,799 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:47:47,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:47:47,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:47:47,800 INFO L87 Difference]: Start difference. First operand 309 states and 450 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:48,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:47:48,418 INFO L93 Difference]: Finished difference Result 900 states and 1316 transitions. [2022-02-20 14:47:48,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:47:48,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2022-02-20 14:47:48,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:47:48,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:48,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 720 transitions. [2022-02-20 14:47:48,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:48,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 720 transitions. [2022-02-20 14:47:48,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 720 transitions. [2022-02-20 14:47:48,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 720 edges. 720 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:47:48,913 INFO L225 Difference]: With dead ends: 900 [2022-02-20 14:47:48,913 INFO L226 Difference]: Without dead ends: 593 [2022-02-20 14:47:48,915 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 14:47:48,916 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 141 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 14:47:48,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 117 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 14:47:48,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2022-02-20 14:47:48,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 591. [2022-02-20 14:47:48,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:47:48,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 593 states. Second operand has 591 states, 590 states have (on average 1.2932203389830508) internal successors, (763), 590 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:48,935 INFO L74 IsIncluded]: Start isIncluded. First operand 593 states. Second operand has 591 states, 590 states have (on average 1.2932203389830508) internal successors, (763), 590 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:48,936 INFO L87 Difference]: Start difference. First operand 593 states. Second operand has 591 states, 590 states have (on average 1.2932203389830508) internal successors, (763), 590 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:48,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:47:48,956 INFO L93 Difference]: Finished difference Result 593 states and 767 transitions. [2022-02-20 14:47:48,956 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 767 transitions. [2022-02-20 14:47:48,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:47:48,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:47:48,959 INFO L74 IsIncluded]: Start isIncluded. First operand has 591 states, 590 states have (on average 1.2932203389830508) internal successors, (763), 590 states have internal predecessors, (763), 0 states have call successors, (0), 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 593 states. [2022-02-20 14:47:48,960 INFO L87 Difference]: Start difference. First operand has 591 states, 590 states have (on average 1.2932203389830508) internal successors, (763), 590 states have internal predecessors, (763), 0 states have call successors, (0), 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 593 states. [2022-02-20 14:47:48,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:47:48,975 INFO L93 Difference]: Finished difference Result 593 states and 767 transitions. [2022-02-20 14:47:48,976 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 767 transitions. [2022-02-20 14:47:48,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:47:48,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:47:48,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:47:48,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:47:48,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 590 states have (on average 1.2932203389830508) internal successors, (763), 590 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:48,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 763 transitions. [2022-02-20 14:47:48,992 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 763 transitions. Word has length 89 [2022-02-20 14:47:48,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:47:48,993 INFO L470 AbstractCegarLoop]: Abstraction has 591 states and 763 transitions. [2022-02-20 14:47:48,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:48,993 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 763 transitions. [2022-02-20 14:47:48,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-02-20 14:47:48,994 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:47:48,994 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2022-02-20 14:47:48,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 14:47:48,995 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:47:48,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:47:48,995 INFO L85 PathProgramCache]: Analyzing trace with hash -2067825974, now seen corresponding path program 1 times [2022-02-20 14:47:48,995 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:47:48,996 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232809199] [2022-02-20 14:47:48,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:47:48,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:47:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:47:49,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {4508#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);~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; {4508#true} is VALID [2022-02-20 14:47:49,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {4508#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1; {4508#true} is VALID [2022-02-20 14:47:49,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {4508#true} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {4508#true} is VALID [2022-02-20 14:47:49,061 INFO L290 TraceCheckUtils]: 3: Hoare triple {4508#true} assume !((((1 != 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_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {4508#true} is VALID [2022-02-20 14:47:49,061 INFO L290 TraceCheckUtils]: 4: Hoare triple {4508#true} assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); {4508#true} is VALID [2022-02-20 14:47:49,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {4508#true} assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input#1) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); {4508#true} is VALID [2022-02-20 14:47:49,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {4508#true} assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input#1) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); {4508#true} is VALID [2022-02-20 14:47:49,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {4508#true} assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input#1 && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); {4508#true} is VALID [2022-02-20 14:47:49,062 INFO L290 TraceCheckUtils]: 8: Hoare triple {4508#true} assume !(((8 == ~a17~0 && ((1 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); {4508#true} is VALID [2022-02-20 14:47:49,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {4508#true} assume 1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input#1 && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0;~a28~0 := 11;~a25~0 := 1;calculate_output_#res#1 := 26; {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,063 INFO L290 TraceCheckUtils]: 10: Hoare triple {4510#(= ~a25~0 1)} main_#t~ret7#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main_#t~ret7#1 && main_#t~ret7#1 <= 2147483647;main_~output~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1; {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {4510#(= ~a25~0 1)} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {4510#(= ~a25~0 1)} assume !((((1 != 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_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {4510#(= ~a25~0 1)} assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {4510#(= ~a25~0 1)} assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input#1) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {4510#(= ~a25~0 1)} assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input#1) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {4510#(= ~a25~0 1)} assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input#1 && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {4510#(= ~a25~0 1)} assume !(((8 == ~a17~0 && ((1 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,067 INFO L290 TraceCheckUtils]: 18: Hoare triple {4510#(= ~a25~0 1)} assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input#1 && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,067 INFO L290 TraceCheckUtils]: 19: Hoare triple {4510#(= ~a25~0 1)} assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input#1 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,067 INFO L290 TraceCheckUtils]: 20: Hoare triple {4510#(= ~a25~0 1)} assume !(1 == ~a19~0 && (((1 == calculate_output_~input#1 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,068 INFO L290 TraceCheckUtils]: 21: Hoare triple {4510#(= ~a25~0 1)} assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,068 INFO L290 TraceCheckUtils]: 22: Hoare triple {4510#(= ~a25~0 1)} assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input#1 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,069 INFO L290 TraceCheckUtils]: 23: Hoare triple {4510#(= ~a25~0 1)} assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input#1) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,069 INFO L290 TraceCheckUtils]: 24: Hoare triple {4510#(= ~a25~0 1)} assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input#1) && !(1 == ~a11~0)) && 8 == ~a17~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,070 INFO L290 TraceCheckUtils]: 25: Hoare triple {4510#(= ~a25~0 1)} assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input#1); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,070 INFO L290 TraceCheckUtils]: 26: Hoare triple {4510#(= ~a25~0 1)} assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input#1 && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,071 INFO L290 TraceCheckUtils]: 27: Hoare triple {4510#(= ~a25~0 1)} assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,071 INFO L290 TraceCheckUtils]: 28: Hoare triple {4510#(= ~a25~0 1)} assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input#1) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,071 INFO L290 TraceCheckUtils]: 29: Hoare triple {4510#(= ~a25~0 1)} assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input#1); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,072 INFO L290 TraceCheckUtils]: 30: Hoare triple {4510#(= ~a25~0 1)} assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input#1 && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,072 INFO L290 TraceCheckUtils]: 31: Hoare triple {4510#(= ~a25~0 1)} assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input#1 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,073 INFO L290 TraceCheckUtils]: 32: Hoare triple {4510#(= ~a25~0 1)} assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input#1 && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,073 INFO L290 TraceCheckUtils]: 33: Hoare triple {4510#(= ~a25~0 1)} assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,073 INFO L290 TraceCheckUtils]: 34: Hoare triple {4510#(= ~a25~0 1)} assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input#1) && 9 == ~a17~0) && 9 == ~a28~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,074 INFO L290 TraceCheckUtils]: 35: Hoare triple {4510#(= ~a25~0 1)} assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input#1) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,074 INFO L290 TraceCheckUtils]: 36: Hoare triple {4510#(= ~a25~0 1)} assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input#1) && !(1 == ~a19~0)) && 1 == ~a21~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,075 INFO L290 TraceCheckUtils]: 37: Hoare triple {4510#(= ~a25~0 1)} assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input#1 && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,075 INFO L290 TraceCheckUtils]: 38: Hoare triple {4510#(= ~a25~0 1)} assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input#1 && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,075 INFO L290 TraceCheckUtils]: 39: Hoare triple {4510#(= ~a25~0 1)} assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input#1) && !(1 == ~a11~0)); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,076 INFO L290 TraceCheckUtils]: 40: Hoare triple {4510#(= ~a25~0 1)} assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input#1 && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,076 INFO L290 TraceCheckUtils]: 41: Hoare triple {4510#(= ~a25~0 1)} assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input#1 && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,077 INFO L290 TraceCheckUtils]: 42: Hoare triple {4510#(= ~a25~0 1)} assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input#1) && 1 == ~a11~0) && 9 == ~a17~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,077 INFO L290 TraceCheckUtils]: 43: Hoare triple {4510#(= ~a25~0 1)} assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,077 INFO L290 TraceCheckUtils]: 44: Hoare triple {4510#(= ~a25~0 1)} assume !(1 == ~a19~0 && ((((4 == calculate_output_~input#1 && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,078 INFO L290 TraceCheckUtils]: 45: Hoare triple {4510#(= ~a25~0 1)} assume !(8 == ~a17~0 && ((((1 == calculate_output_~input#1 && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,078 INFO L290 TraceCheckUtils]: 46: Hoare triple {4510#(= ~a25~0 1)} assume !((((((4 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,079 INFO L290 TraceCheckUtils]: 47: Hoare triple {4510#(= ~a25~0 1)} assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input#1) && 1 == ~a19~0) && 1 == ~a21~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,079 INFO L290 TraceCheckUtils]: 48: Hoare triple {4510#(= ~a25~0 1)} assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input#1) && 1 == ~a21~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,079 INFO L290 TraceCheckUtils]: 49: Hoare triple {4510#(= ~a25~0 1)} assume !((((1 == ~a21~0 && 1 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,080 INFO L290 TraceCheckUtils]: 50: Hoare triple {4510#(= ~a25~0 1)} assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input#1) && !(1 == ~a11~0)) && 8 == ~a17~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,080 INFO L290 TraceCheckUtils]: 51: Hoare triple {4510#(= ~a25~0 1)} assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input#1) && 8 == ~a17~0) && 1 == ~a21~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,080 INFO L290 TraceCheckUtils]: 52: Hoare triple {4510#(= ~a25~0 1)} assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input#1) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,081 INFO L290 TraceCheckUtils]: 53: Hoare triple {4510#(= ~a25~0 1)} assume !((8 == ~a17~0 && (((6 == calculate_output_~input#1 && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,081 INFO L290 TraceCheckUtils]: 54: Hoare triple {4510#(= ~a25~0 1)} assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input#1 && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,082 INFO L290 TraceCheckUtils]: 55: Hoare triple {4510#(= ~a25~0 1)} assume !((((((1 == calculate_output_~input#1 && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,082 INFO L290 TraceCheckUtils]: 56: Hoare triple {4510#(= ~a25~0 1)} assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input#1) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,082 INFO L290 TraceCheckUtils]: 57: Hoare triple {4510#(= ~a25~0 1)} assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input#1) && 1 == ~a21~0) && !(1 == ~a19~0)); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,083 INFO L290 TraceCheckUtils]: 58: Hoare triple {4510#(= ~a25~0 1)} assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input#1) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,083 INFO L290 TraceCheckUtils]: 59: Hoare triple {4510#(= ~a25~0 1)} assume !((9 == ~a17~0 && (((1 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,084 INFO L290 TraceCheckUtils]: 60: Hoare triple {4510#(= ~a25~0 1)} assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input#1) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,084 INFO L290 TraceCheckUtils]: 61: Hoare triple {4510#(= ~a25~0 1)} assume !(9 == ~a17~0 && 1 == ~a21~0 && 1 == ~a11~0 && (3 == calculate_output_~input#1 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a19~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,084 INFO L290 TraceCheckUtils]: 62: Hoare triple {4510#(= ~a25~0 1)} assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input#1 && !(1 == ~a11~0)); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,085 INFO L290 TraceCheckUtils]: 63: Hoare triple {4510#(= ~a25~0 1)} assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input#1 && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,085 INFO L290 TraceCheckUtils]: 64: Hoare triple {4510#(= ~a25~0 1)} assume !((((8 == ~a17~0 && (6 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a21~0) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a19~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,085 INFO L290 TraceCheckUtils]: 65: Hoare triple {4510#(= ~a25~0 1)} assume !((!(1 == ~a11~0) && (!(1 == ~a19~0) && ((!(1 == ~a25~0) && 11 == ~a28~0) || (10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) && 5 == calculate_output_~input#1) && 8 == ~a17~0) && 1 == ~a21~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,086 INFO L290 TraceCheckUtils]: 66: Hoare triple {4510#(= ~a25~0 1)} assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input#1) && 1 == ~a19~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,086 INFO L290 TraceCheckUtils]: 67: Hoare triple {4510#(= ~a25~0 1)} assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input#1) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,087 INFO L290 TraceCheckUtils]: 68: Hoare triple {4510#(= ~a25~0 1)} assume !(1 == ~a11~0 && (9 == ~a17~0 && 9 == ~a28~0 && 1 == ~a19~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input#1) && 1 == ~a21~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,087 INFO L290 TraceCheckUtils]: 69: Hoare triple {4510#(= ~a25~0 1)} assume !((((((3 == calculate_output_~input#1 && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,087 INFO L290 TraceCheckUtils]: 70: Hoare triple {4510#(= ~a25~0 1)} assume !(1 == ~a19~0 && 1 == ~a21~0 && ((5 == calculate_output_~input#1 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a11~0) && 9 == ~a17~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,088 INFO L290 TraceCheckUtils]: 71: Hoare triple {4510#(= ~a25~0 1)} assume !((1 == ~a19~0 && ((!(1 == ~a11~0) && (1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input#1) && 10 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,088 INFO L290 TraceCheckUtils]: 72: Hoare triple {4510#(= ~a25~0 1)} assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input#1 && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,089 INFO L290 TraceCheckUtils]: 73: Hoare triple {4510#(= ~a25~0 1)} assume !(((!(1 == ~a19~0) && (4 == calculate_output_~input#1 && (((!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,089 INFO L290 TraceCheckUtils]: 74: Hoare triple {4510#(= ~a25~0 1)} assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input#1) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,089 INFO L290 TraceCheckUtils]: 75: Hoare triple {4510#(= ~a25~0 1)} assume !((((1 == ~a21~0 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (9 == ~a28~0 && 1 == ~a25~0)) && 6 == calculate_output_~input#1) && !(1 == ~a11~0)) && !(1 == ~a19~0)) && 8 == ~a17~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,090 INFO L290 TraceCheckUtils]: 76: Hoare triple {4510#(= ~a25~0 1)} assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input#1) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,090 INFO L290 TraceCheckUtils]: 77: Hoare triple {4510#(= ~a25~0 1)} assume !(8 == ~a17~0 && (1 == ~a21~0 && (5 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (9 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a19~0) && !(1 == ~a11~0)); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,091 INFO L290 TraceCheckUtils]: 78: Hoare triple {4510#(= ~a25~0 1)} assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input#1 && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,091 INFO L290 TraceCheckUtils]: 79: Hoare triple {4510#(= ~a25~0 1)} assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input#1) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,091 INFO L290 TraceCheckUtils]: 80: Hoare triple {4510#(= ~a25~0 1)} assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input#1) && 1 == ~a21~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,092 INFO L290 TraceCheckUtils]: 81: Hoare triple {4510#(= ~a25~0 1)} assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 6 == calculate_output_~input#1 && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a19~0)); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,092 INFO L290 TraceCheckUtils]: 82: Hoare triple {4510#(= ~a25~0 1)} assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input#1) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,093 INFO L290 TraceCheckUtils]: 83: Hoare triple {4510#(= ~a25~0 1)} assume !((8 == ~a17~0 && ((4 == calculate_output_~input#1 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,093 INFO L290 TraceCheckUtils]: 84: Hoare triple {4510#(= ~a25~0 1)} assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input#1) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,093 INFO L290 TraceCheckUtils]: 85: Hoare triple {4510#(= ~a25~0 1)} assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input#1) && !(1 == ~a25~0)) && 8 == ~a28~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,094 INFO L290 TraceCheckUtils]: 86: Hoare triple {4510#(= ~a25~0 1)} assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input#1) && 11 == ~a28~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,094 INFO L290 TraceCheckUtils]: 87: Hoare triple {4510#(= ~a25~0 1)} assume !(1 == ~a19~0 && 8 == ~a17~0 && ((((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input#1) && !(1 == ~a11~0)) && 1 == ~a21~0); {4510#(= ~a25~0 1)} is VALID [2022-02-20 14:47:49,095 INFO L290 TraceCheckUtils]: 88: Hoare triple {4510#(= ~a25~0 1)} assume ((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0; {4509#false} is VALID [2022-02-20 14:47:49,095 INFO L290 TraceCheckUtils]: 89: Hoare triple {4509#false} assume !false; {4509#false} is VALID [2022-02-20 14:47:49,096 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:47:49,096 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:47:49,096 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232809199] [2022-02-20 14:47:49,096 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232809199] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:47:49,097 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:47:49,097 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:47:49,097 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881971269] [2022-02-20 14:47:49,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:47:49,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2022-02-20 14:47:49,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:47:49,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:49,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:47:49,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:47:49,154 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:47:49,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:47:49,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:47:49,155 INFO L87 Difference]: Start difference. First operand 591 states and 763 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:49,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:47:49,873 INFO L93 Difference]: Finished difference Result 1750 states and 2263 transitions. [2022-02-20 14:47:49,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:47:49,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2022-02-20 14:47:49,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:47:49,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:49,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 730 transitions. [2022-02-20 14:47:49,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:49,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 730 transitions. [2022-02-20 14:47:49,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 730 transitions. [2022-02-20 14:47:50,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 730 edges. 730 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:47:50,369 INFO L225 Difference]: With dead ends: 1750 [2022-02-20 14:47:50,369 INFO L226 Difference]: Without dead ends: 1161 [2022-02-20 14:47:50,370 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 14:47:50,371 INFO L933 BasicCegarLoop]: 271 mSDtfsCounter, 89 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 14:47:50,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 297 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 14:47:50,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2022-02-20 14:47:50,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1014. [2022-02-20 14:47:50,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:47:50,389 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1161 states. Second operand has 1014 states, 1013 states have (on average 1.2645607107601184) internal successors, (1281), 1013 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:50,391 INFO L74 IsIncluded]: Start isIncluded. First operand 1161 states. Second operand has 1014 states, 1013 states have (on average 1.2645607107601184) internal successors, (1281), 1013 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:50,392 INFO L87 Difference]: Start difference. First operand 1161 states. Second operand has 1014 states, 1013 states have (on average 1.2645607107601184) internal successors, (1281), 1013 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:50,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:47:50,448 INFO L93 Difference]: Finished difference Result 1161 states and 1443 transitions. [2022-02-20 14:47:50,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1443 transitions. [2022-02-20 14:47:50,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:47:50,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:47:50,453 INFO L74 IsIncluded]: Start isIncluded. First operand has 1014 states, 1013 states have (on average 1.2645607107601184) internal successors, (1281), 1013 states have internal predecessors, (1281), 0 states have call successors, (0), 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 1161 states. [2022-02-20 14:47:50,455 INFO L87 Difference]: Start difference. First operand has 1014 states, 1013 states have (on average 1.2645607107601184) internal successors, (1281), 1013 states have internal predecessors, (1281), 0 states have call successors, (0), 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 1161 states. [2022-02-20 14:47:50,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:47:50,504 INFO L93 Difference]: Finished difference Result 1161 states and 1443 transitions. [2022-02-20 14:47:50,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1443 transitions. [2022-02-20 14:47:50,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:47:50,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:47:50,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:47:50,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:47:50,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 1013 states have (on average 1.2645607107601184) internal successors, (1281), 1013 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:50,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1281 transitions. [2022-02-20 14:47:50,542 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1281 transitions. Word has length 90 [2022-02-20 14:47:50,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:47:50,543 INFO L470 AbstractCegarLoop]: Abstraction has 1014 states and 1281 transitions. [2022-02-20 14:47:50,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:50,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1281 transitions. [2022-02-20 14:47:50,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 14:47:50,545 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:47:50,545 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2022-02-20 14:47:50,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 14:47:50,545 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:47:50,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:47:50,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1615869743, now seen corresponding path program 1 times [2022-02-20 14:47:50,546 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:47:50,547 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379247819] [2022-02-20 14:47:50,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:47:50,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:47:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:47:50,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {9637#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);~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; {9639#(= ~a19~0 1)} is VALID [2022-02-20 14:47:50,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {9639#(= ~a19~0 1)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1; {9639#(= ~a19~0 1)} is VALID [2022-02-20 14:47:50,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {9639#(= ~a19~0 1)} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {9639#(= ~a19~0 1)} is VALID [2022-02-20 14:47:50,585 INFO L290 TraceCheckUtils]: 3: Hoare triple {9639#(= ~a19~0 1)} assume !((((1 != 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_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {9639#(= ~a19~0 1)} is VALID [2022-02-20 14:47:50,585 INFO L290 TraceCheckUtils]: 4: Hoare triple {9639#(= ~a19~0 1)} assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); {9639#(= ~a19~0 1)} is VALID [2022-02-20 14:47:50,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {9639#(= ~a19~0 1)} assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input#1) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); {9639#(= ~a19~0 1)} is VALID [2022-02-20 14:47:50,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {9639#(= ~a19~0 1)} assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input#1) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); {9639#(= ~a19~0 1)} is VALID [2022-02-20 14:47:50,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {9639#(= ~a19~0 1)} assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input#1 && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); {9639#(= ~a19~0 1)} is VALID [2022-02-20 14:47:50,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {9639#(= ~a19~0 1)} assume !(((8 == ~a17~0 && ((1 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); {9639#(= ~a19~0 1)} is VALID [2022-02-20 14:47:50,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {9639#(= ~a19~0 1)} assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input#1 && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); {9639#(= ~a19~0 1)} is VALID [2022-02-20 14:47:50,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {9639#(= ~a19~0 1)} assume (((!(1 == ~a19~0) && 1 == calculate_output_~input#1 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0);~a28~0 := 7;~a11~0 := 1;~a25~0 := 0;calculate_output_#res#1 := -1; {9638#false} is VALID [2022-02-20 14:47:50,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {9638#false} main_#t~ret7#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main_#t~ret7#1 && main_#t~ret7#1 <= 2147483647;main_~output~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1; {9638#false} is VALID [2022-02-20 14:47:50,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {9638#false} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {9638#false} is VALID [2022-02-20 14:47:50,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {9638#false} assume !((((1 != 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_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {9638#false} is VALID [2022-02-20 14:47:50,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {9638#false} assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); {9638#false} is VALID [2022-02-20 14:47:50,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {9638#false} assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input#1) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); {9638#false} is VALID [2022-02-20 14:47:50,588 INFO L290 TraceCheckUtils]: 16: Hoare triple {9638#false} assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input#1) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); {9638#false} is VALID [2022-02-20 14:47:50,588 INFO L290 TraceCheckUtils]: 17: Hoare triple {9638#false} assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input#1 && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); {9638#false} is VALID [2022-02-20 14:47:50,588 INFO L290 TraceCheckUtils]: 18: Hoare triple {9638#false} assume !(((8 == ~a17~0 && ((1 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); {9638#false} is VALID [2022-02-20 14:47:50,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {9638#false} assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input#1 && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); {9638#false} is VALID [2022-02-20 14:47:50,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {9638#false} assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input#1 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); {9638#false} is VALID [2022-02-20 14:47:50,589 INFO L290 TraceCheckUtils]: 21: Hoare triple {9638#false} assume !(1 == ~a19~0 && (((1 == calculate_output_~input#1 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); {9638#false} is VALID [2022-02-20 14:47:50,589 INFO L290 TraceCheckUtils]: 22: Hoare triple {9638#false} assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); {9638#false} is VALID [2022-02-20 14:47:50,589 INFO L290 TraceCheckUtils]: 23: Hoare triple {9638#false} assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input#1 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); {9638#false} is VALID [2022-02-20 14:47:50,589 INFO L290 TraceCheckUtils]: 24: Hoare triple {9638#false} assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input#1) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); {9638#false} is VALID [2022-02-20 14:47:50,589 INFO L290 TraceCheckUtils]: 25: Hoare triple {9638#false} assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input#1) && !(1 == ~a11~0)) && 8 == ~a17~0); {9638#false} is VALID [2022-02-20 14:47:50,589 INFO L290 TraceCheckUtils]: 26: Hoare triple {9638#false} assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input#1); {9638#false} is VALID [2022-02-20 14:47:50,589 INFO L290 TraceCheckUtils]: 27: Hoare triple {9638#false} assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input#1 && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); {9638#false} is VALID [2022-02-20 14:47:50,590 INFO L290 TraceCheckUtils]: 28: Hoare triple {9638#false} assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); {9638#false} is VALID [2022-02-20 14:47:50,590 INFO L290 TraceCheckUtils]: 29: Hoare triple {9638#false} assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input#1) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); {9638#false} is VALID [2022-02-20 14:47:50,590 INFO L290 TraceCheckUtils]: 30: Hoare triple {9638#false} assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input#1); {9638#false} is VALID [2022-02-20 14:47:50,590 INFO L290 TraceCheckUtils]: 31: Hoare triple {9638#false} assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input#1 && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); {9638#false} is VALID [2022-02-20 14:47:50,590 INFO L290 TraceCheckUtils]: 32: Hoare triple {9638#false} assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input#1 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); {9638#false} is VALID [2022-02-20 14:47:50,590 INFO L290 TraceCheckUtils]: 33: Hoare triple {9638#false} assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input#1 && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); {9638#false} is VALID [2022-02-20 14:47:50,590 INFO L290 TraceCheckUtils]: 34: Hoare triple {9638#false} assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); {9638#false} is VALID [2022-02-20 14:47:50,591 INFO L290 TraceCheckUtils]: 35: Hoare triple {9638#false} assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input#1) && 9 == ~a17~0) && 9 == ~a28~0); {9638#false} is VALID [2022-02-20 14:47:50,591 INFO L290 TraceCheckUtils]: 36: Hoare triple {9638#false} assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input#1) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); {9638#false} is VALID [2022-02-20 14:47:50,591 INFO L290 TraceCheckUtils]: 37: Hoare triple {9638#false} assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input#1) && !(1 == ~a19~0)) && 1 == ~a21~0); {9638#false} is VALID [2022-02-20 14:47:50,591 INFO L290 TraceCheckUtils]: 38: Hoare triple {9638#false} assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input#1 && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); {9638#false} is VALID [2022-02-20 14:47:50,591 INFO L290 TraceCheckUtils]: 39: Hoare triple {9638#false} assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input#1 && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); {9638#false} is VALID [2022-02-20 14:47:50,591 INFO L290 TraceCheckUtils]: 40: Hoare triple {9638#false} assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input#1) && !(1 == ~a11~0)); {9638#false} is VALID [2022-02-20 14:47:50,591 INFO L290 TraceCheckUtils]: 41: Hoare triple {9638#false} assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input#1 && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); {9638#false} is VALID [2022-02-20 14:47:50,592 INFO L290 TraceCheckUtils]: 42: Hoare triple {9638#false} assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input#1 && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); {9638#false} is VALID [2022-02-20 14:47:50,592 INFO L290 TraceCheckUtils]: 43: Hoare triple {9638#false} assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input#1) && 1 == ~a11~0) && 9 == ~a17~0); {9638#false} is VALID [2022-02-20 14:47:50,592 INFO L290 TraceCheckUtils]: 44: Hoare triple {9638#false} assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); {9638#false} is VALID [2022-02-20 14:47:50,592 INFO L290 TraceCheckUtils]: 45: Hoare triple {9638#false} assume !(1 == ~a19~0 && ((((4 == calculate_output_~input#1 && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); {9638#false} is VALID [2022-02-20 14:47:50,592 INFO L290 TraceCheckUtils]: 46: Hoare triple {9638#false} assume !(8 == ~a17~0 && ((((1 == calculate_output_~input#1 && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); {9638#false} is VALID [2022-02-20 14:47:50,592 INFO L290 TraceCheckUtils]: 47: Hoare triple {9638#false} assume !((((((4 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); {9638#false} is VALID [2022-02-20 14:47:50,593 INFO L290 TraceCheckUtils]: 48: Hoare triple {9638#false} assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input#1) && 1 == ~a19~0) && 1 == ~a21~0); {9638#false} is VALID [2022-02-20 14:47:50,593 INFO L290 TraceCheckUtils]: 49: Hoare triple {9638#false} assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input#1) && 1 == ~a21~0); {9638#false} is VALID [2022-02-20 14:47:50,593 INFO L290 TraceCheckUtils]: 50: Hoare triple {9638#false} assume !((((1 == ~a21~0 && 1 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); {9638#false} is VALID [2022-02-20 14:47:50,593 INFO L290 TraceCheckUtils]: 51: Hoare triple {9638#false} assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input#1) && !(1 == ~a11~0)) && 8 == ~a17~0); {9638#false} is VALID [2022-02-20 14:47:50,593 INFO L290 TraceCheckUtils]: 52: Hoare triple {9638#false} assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input#1) && 8 == ~a17~0) && 1 == ~a21~0); {9638#false} is VALID [2022-02-20 14:47:50,593 INFO L290 TraceCheckUtils]: 53: Hoare triple {9638#false} assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input#1) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); {9638#false} is VALID [2022-02-20 14:47:50,593 INFO L290 TraceCheckUtils]: 54: Hoare triple {9638#false} assume !((8 == ~a17~0 && (((6 == calculate_output_~input#1 && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); {9638#false} is VALID [2022-02-20 14:47:50,594 INFO L290 TraceCheckUtils]: 55: Hoare triple {9638#false} assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input#1 && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); {9638#false} is VALID [2022-02-20 14:47:50,594 INFO L290 TraceCheckUtils]: 56: Hoare triple {9638#false} assume !((((((1 == calculate_output_~input#1 && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); {9638#false} is VALID [2022-02-20 14:47:50,594 INFO L290 TraceCheckUtils]: 57: Hoare triple {9638#false} assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input#1) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); {9638#false} is VALID [2022-02-20 14:47:50,594 INFO L290 TraceCheckUtils]: 58: Hoare triple {9638#false} assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input#1) && 1 == ~a21~0) && !(1 == ~a19~0)); {9638#false} is VALID [2022-02-20 14:47:50,594 INFO L290 TraceCheckUtils]: 59: Hoare triple {9638#false} assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input#1) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); {9638#false} is VALID [2022-02-20 14:47:50,594 INFO L290 TraceCheckUtils]: 60: Hoare triple {9638#false} assume !((9 == ~a17~0 && (((1 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0); {9638#false} is VALID [2022-02-20 14:47:50,594 INFO L290 TraceCheckUtils]: 61: Hoare triple {9638#false} assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input#1) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); {9638#false} is VALID [2022-02-20 14:47:50,595 INFO L290 TraceCheckUtils]: 62: Hoare triple {9638#false} assume !(9 == ~a17~0 && 1 == ~a21~0 && 1 == ~a11~0 && (3 == calculate_output_~input#1 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a19~0); {9638#false} is VALID [2022-02-20 14:47:50,595 INFO L290 TraceCheckUtils]: 63: Hoare triple {9638#false} assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input#1 && !(1 == ~a11~0)); {9638#false} is VALID [2022-02-20 14:47:50,595 INFO L290 TraceCheckUtils]: 64: Hoare triple {9638#false} assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input#1 && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); {9638#false} is VALID [2022-02-20 14:47:50,595 INFO L290 TraceCheckUtils]: 65: Hoare triple {9638#false} assume !((((8 == ~a17~0 && (6 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a21~0) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a19~0); {9638#false} is VALID [2022-02-20 14:47:50,595 INFO L290 TraceCheckUtils]: 66: Hoare triple {9638#false} assume !((!(1 == ~a11~0) && (!(1 == ~a19~0) && ((!(1 == ~a25~0) && 11 == ~a28~0) || (10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) && 5 == calculate_output_~input#1) && 8 == ~a17~0) && 1 == ~a21~0); {9638#false} is VALID [2022-02-20 14:47:50,595 INFO L290 TraceCheckUtils]: 67: Hoare triple {9638#false} assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input#1) && 1 == ~a19~0); {9638#false} is VALID [2022-02-20 14:47:50,595 INFO L290 TraceCheckUtils]: 68: Hoare triple {9638#false} assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input#1) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); {9638#false} is VALID [2022-02-20 14:47:50,596 INFO L290 TraceCheckUtils]: 69: Hoare triple {9638#false} assume !(1 == ~a11~0 && (9 == ~a17~0 && 9 == ~a28~0 && 1 == ~a19~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input#1) && 1 == ~a21~0); {9638#false} is VALID [2022-02-20 14:47:50,596 INFO L290 TraceCheckUtils]: 70: Hoare triple {9638#false} assume !((((((3 == calculate_output_~input#1 && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); {9638#false} is VALID [2022-02-20 14:47:50,596 INFO L290 TraceCheckUtils]: 71: Hoare triple {9638#false} assume !(1 == ~a19~0 && 1 == ~a21~0 && ((5 == calculate_output_~input#1 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a11~0) && 9 == ~a17~0); {9638#false} is VALID [2022-02-20 14:47:50,596 INFO L290 TraceCheckUtils]: 72: Hoare triple {9638#false} assume !((1 == ~a19~0 && ((!(1 == ~a11~0) && (1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input#1) && 10 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0); {9638#false} is VALID [2022-02-20 14:47:50,596 INFO L290 TraceCheckUtils]: 73: Hoare triple {9638#false} assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input#1 && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); {9638#false} is VALID [2022-02-20 14:47:50,596 INFO L290 TraceCheckUtils]: 74: Hoare triple {9638#false} assume !(((!(1 == ~a19~0) && (4 == calculate_output_~input#1 && (((!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); {9638#false} is VALID [2022-02-20 14:47:50,596 INFO L290 TraceCheckUtils]: 75: Hoare triple {9638#false} assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input#1) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); {9638#false} is VALID [2022-02-20 14:47:50,597 INFO L290 TraceCheckUtils]: 76: Hoare triple {9638#false} assume !((((1 == ~a21~0 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (9 == ~a28~0 && 1 == ~a25~0)) && 6 == calculate_output_~input#1) && !(1 == ~a11~0)) && !(1 == ~a19~0)) && 8 == ~a17~0); {9638#false} is VALID [2022-02-20 14:47:50,597 INFO L290 TraceCheckUtils]: 77: Hoare triple {9638#false} assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input#1) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); {9638#false} is VALID [2022-02-20 14:47:50,597 INFO L290 TraceCheckUtils]: 78: Hoare triple {9638#false} assume !(8 == ~a17~0 && (1 == ~a21~0 && (5 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (9 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a19~0) && !(1 == ~a11~0)); {9638#false} is VALID [2022-02-20 14:47:50,597 INFO L290 TraceCheckUtils]: 79: Hoare triple {9638#false} assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input#1 && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); {9638#false} is VALID [2022-02-20 14:47:50,597 INFO L290 TraceCheckUtils]: 80: Hoare triple {9638#false} assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input#1) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); {9638#false} is VALID [2022-02-20 14:47:50,597 INFO L290 TraceCheckUtils]: 81: Hoare triple {9638#false} assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input#1) && 1 == ~a21~0); {9638#false} is VALID [2022-02-20 14:47:50,597 INFO L290 TraceCheckUtils]: 82: Hoare triple {9638#false} assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 6 == calculate_output_~input#1 && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a19~0)); {9638#false} is VALID [2022-02-20 14:47:50,598 INFO L290 TraceCheckUtils]: 83: Hoare triple {9638#false} assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input#1) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); {9638#false} is VALID [2022-02-20 14:47:50,598 INFO L290 TraceCheckUtils]: 84: Hoare triple {9638#false} assume !((8 == ~a17~0 && ((4 == calculate_output_~input#1 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)); {9638#false} is VALID [2022-02-20 14:47:50,598 INFO L290 TraceCheckUtils]: 85: Hoare triple {9638#false} assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input#1) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); {9638#false} is VALID [2022-02-20 14:47:50,598 INFO L290 TraceCheckUtils]: 86: Hoare triple {9638#false} assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input#1) && !(1 == ~a25~0)) && 8 == ~a28~0); {9638#false} is VALID [2022-02-20 14:47:50,598 INFO L290 TraceCheckUtils]: 87: Hoare triple {9638#false} assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input#1) && 11 == ~a28~0); {9638#false} is VALID [2022-02-20 14:47:50,598 INFO L290 TraceCheckUtils]: 88: Hoare triple {9638#false} assume !(1 == ~a19~0 && 8 == ~a17~0 && ((((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input#1) && !(1 == ~a11~0)) && 1 == ~a21~0); {9638#false} is VALID [2022-02-20 14:47:50,598 INFO L290 TraceCheckUtils]: 89: Hoare triple {9638#false} assume ((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0; {9638#false} is VALID [2022-02-20 14:47:50,599 INFO L290 TraceCheckUtils]: 90: Hoare triple {9638#false} assume !false; {9638#false} is VALID [2022-02-20 14:47:50,599 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:47:50,599 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:47:50,599 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379247819] [2022-02-20 14:47:50,600 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379247819] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:47:50,600 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:47:50,600 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:47:50,600 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080627086] [2022-02-20 14:47:50,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:47:50,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2022-02-20 14:47:50,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:47:50,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:50,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:47:50,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:47:50,655 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:47:50,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:47:50,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:47:50,657 INFO L87 Difference]: Start difference. First operand 1014 states and 1281 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:51,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:47:51,441 INFO L93 Difference]: Finished difference Result 2870 states and 3645 transitions. [2022-02-20 14:47:51,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:47:51,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2022-02-20 14:47:51,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:47:51,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:51,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2022-02-20 14:47:51,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:51,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2022-02-20 14:47:51,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 718 transitions. [2022-02-20 14:47:51,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 718 edges. 718 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:47:52,000 INFO L225 Difference]: With dead ends: 2870 [2022-02-20 14:47:52,000 INFO L226 Difference]: Without dead ends: 1858 [2022-02-20 14:47:52,002 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 14:47:52,003 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 188 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:47:52,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 81 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:47:52,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2022-02-20 14:47:52,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1858. [2022-02-20 14:47:52,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:47:52,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1858 states. Second operand has 1858 states, 1857 states have (on average 1.2245557350565428) internal successors, (2274), 1857 states have internal predecessors, (2274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:52,040 INFO L74 IsIncluded]: Start isIncluded. First operand 1858 states. Second operand has 1858 states, 1857 states have (on average 1.2245557350565428) internal successors, (2274), 1857 states have internal predecessors, (2274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:52,043 INFO L87 Difference]: Start difference. First operand 1858 states. Second operand has 1858 states, 1857 states have (on average 1.2245557350565428) internal successors, (2274), 1857 states have internal predecessors, (2274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:52,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:47:52,156 INFO L93 Difference]: Finished difference Result 1858 states and 2274 transitions. [2022-02-20 14:47:52,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2274 transitions. [2022-02-20 14:47:52,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:47:52,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:47:52,162 INFO L74 IsIncluded]: Start isIncluded. First operand has 1858 states, 1857 states have (on average 1.2245557350565428) internal successors, (2274), 1857 states have internal predecessors, (2274), 0 states have call successors, (0), 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 1858 states. [2022-02-20 14:47:52,164 INFO L87 Difference]: Start difference. First operand has 1858 states, 1857 states have (on average 1.2245557350565428) internal successors, (2274), 1857 states have internal predecessors, (2274), 0 states have call successors, (0), 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 1858 states. [2022-02-20 14:47:52,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:47:52,265 INFO L93 Difference]: Finished difference Result 1858 states and 2274 transitions. [2022-02-20 14:47:52,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2274 transitions. [2022-02-20 14:47:52,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:47:52,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:47:52,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:47:52,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:47:52,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1857 states have (on average 1.2245557350565428) internal successors, (2274), 1857 states have internal predecessors, (2274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:52,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2274 transitions. [2022-02-20 14:47:52,371 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2274 transitions. Word has length 91 [2022-02-20 14:47:52,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:47:52,371 INFO L470 AbstractCegarLoop]: Abstraction has 1858 states and 2274 transitions. [2022-02-20 14:47:52,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:52,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2274 transitions. [2022-02-20 14:47:52,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-02-20 14:47:52,373 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:47:52,373 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:47:52,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 14:47:52,374 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:47:52,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:47:52,375 INFO L85 PathProgramCache]: Analyzing trace with hash -66969303, now seen corresponding path program 1 times [2022-02-20 14:47:52,375 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:47:52,375 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483000573] [2022-02-20 14:47:52,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:47:52,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:47:52,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:47:52,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {18152#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);~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; {18152#true} is VALID [2022-02-20 14:47:52,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {18152#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1; {18152#true} is VALID [2022-02-20 14:47:52,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {18152#true} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {18152#true} is VALID [2022-02-20 14:47:52,471 INFO L290 TraceCheckUtils]: 3: Hoare triple {18152#true} assume !((((1 != 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_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {18152#true} is VALID [2022-02-20 14:47:52,471 INFO L290 TraceCheckUtils]: 4: Hoare triple {18152#true} assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); {18152#true} is VALID [2022-02-20 14:47:52,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {18152#true} assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input#1) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); {18152#true} is VALID [2022-02-20 14:47:52,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {18152#true} assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input#1) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); {18152#true} is VALID [2022-02-20 14:47:52,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {18152#true} assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input#1 && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); {18152#true} is VALID [2022-02-20 14:47:52,471 INFO L290 TraceCheckUtils]: 8: Hoare triple {18152#true} assume !(((8 == ~a17~0 && ((1 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); {18152#true} is VALID [2022-02-20 14:47:52,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {18152#true} assume 1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input#1 && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0;~a28~0 := 11;~a25~0 := 1;calculate_output_#res#1 := 26; {18152#true} is VALID [2022-02-20 14:47:52,471 INFO L290 TraceCheckUtils]: 10: Hoare triple {18152#true} main_#t~ret7#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main_#t~ret7#1 && main_#t~ret7#1 <= 2147483647;main_~output~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1; {18152#true} is VALID [2022-02-20 14:47:52,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {18152#true} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {18152#true} is VALID [2022-02-20 14:47:52,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {18152#true} assume !((((1 != 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_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {18152#true} is VALID [2022-02-20 14:47:52,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {18152#true} assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); {18152#true} is VALID [2022-02-20 14:47:52,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {18152#true} assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input#1) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); {18152#true} is VALID [2022-02-20 14:47:52,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {18152#true} assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input#1) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); {18152#true} is VALID [2022-02-20 14:47:52,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {18152#true} assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input#1 && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); {18152#true} is VALID [2022-02-20 14:47:52,472 INFO L290 TraceCheckUtils]: 17: Hoare triple {18152#true} assume !(((8 == ~a17~0 && ((1 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); {18152#true} is VALID [2022-02-20 14:47:52,472 INFO L290 TraceCheckUtils]: 18: Hoare triple {18152#true} assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input#1 && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); {18152#true} is VALID [2022-02-20 14:47:52,472 INFO L290 TraceCheckUtils]: 19: Hoare triple {18152#true} assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input#1 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); {18152#true} is VALID [2022-02-20 14:47:52,472 INFO L290 TraceCheckUtils]: 20: Hoare triple {18152#true} assume !(1 == ~a19~0 && (((1 == calculate_output_~input#1 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); {18152#true} is VALID [2022-02-20 14:47:52,472 INFO L290 TraceCheckUtils]: 21: Hoare triple {18152#true} assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); {18152#true} is VALID [2022-02-20 14:47:52,472 INFO L290 TraceCheckUtils]: 22: Hoare triple {18152#true} assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input#1 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); {18152#true} is VALID [2022-02-20 14:47:52,472 INFO L290 TraceCheckUtils]: 23: Hoare triple {18152#true} assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input#1) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); {18152#true} is VALID [2022-02-20 14:47:52,473 INFO L290 TraceCheckUtils]: 24: Hoare triple {18152#true} assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input#1) && !(1 == ~a11~0)) && 8 == ~a17~0); {18152#true} is VALID [2022-02-20 14:47:52,473 INFO L290 TraceCheckUtils]: 25: Hoare triple {18152#true} assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input#1); {18152#true} is VALID [2022-02-20 14:47:52,473 INFO L290 TraceCheckUtils]: 26: Hoare triple {18152#true} assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input#1 && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); {18152#true} is VALID [2022-02-20 14:47:52,474 INFO L290 TraceCheckUtils]: 27: Hoare triple {18152#true} assume (!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0;~a17~0 := 7;~a25~0 := 0;~a11~0 := 1;~a28~0 := 10;~a19~0 := 0;calculate_output_#res#1 := -1; {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,474 INFO L290 TraceCheckUtils]: 28: Hoare triple {18154#(<= 10 ~a28~0)} main_#t~ret7#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main_#t~ret7#1 && main_#t~ret7#1 <= 2147483647;main_~output~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1; {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,475 INFO L290 TraceCheckUtils]: 29: Hoare triple {18154#(<= 10 ~a28~0)} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,475 INFO L290 TraceCheckUtils]: 30: Hoare triple {18154#(<= 10 ~a28~0)} assume !((((1 != 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_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,475 INFO L290 TraceCheckUtils]: 31: Hoare triple {18154#(<= 10 ~a28~0)} assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,476 INFO L290 TraceCheckUtils]: 32: Hoare triple {18154#(<= 10 ~a28~0)} assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input#1) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,476 INFO L290 TraceCheckUtils]: 33: Hoare triple {18154#(<= 10 ~a28~0)} assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input#1) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,476 INFO L290 TraceCheckUtils]: 34: Hoare triple {18154#(<= 10 ~a28~0)} assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input#1 && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,477 INFO L290 TraceCheckUtils]: 35: Hoare triple {18154#(<= 10 ~a28~0)} assume !(((8 == ~a17~0 && ((1 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,477 INFO L290 TraceCheckUtils]: 36: Hoare triple {18154#(<= 10 ~a28~0)} assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input#1 && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,477 INFO L290 TraceCheckUtils]: 37: Hoare triple {18154#(<= 10 ~a28~0)} assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input#1 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,478 INFO L290 TraceCheckUtils]: 38: Hoare triple {18154#(<= 10 ~a28~0)} assume !(1 == ~a19~0 && (((1 == calculate_output_~input#1 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,478 INFO L290 TraceCheckUtils]: 39: Hoare triple {18154#(<= 10 ~a28~0)} assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,478 INFO L290 TraceCheckUtils]: 40: Hoare triple {18154#(<= 10 ~a28~0)} assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input#1 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,479 INFO L290 TraceCheckUtils]: 41: Hoare triple {18154#(<= 10 ~a28~0)} assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input#1) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,479 INFO L290 TraceCheckUtils]: 42: Hoare triple {18154#(<= 10 ~a28~0)} assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input#1) && !(1 == ~a11~0)) && 8 == ~a17~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,479 INFO L290 TraceCheckUtils]: 43: Hoare triple {18154#(<= 10 ~a28~0)} assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input#1); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,480 INFO L290 TraceCheckUtils]: 44: Hoare triple {18154#(<= 10 ~a28~0)} assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input#1 && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,480 INFO L290 TraceCheckUtils]: 45: Hoare triple {18154#(<= 10 ~a28~0)} assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,480 INFO L290 TraceCheckUtils]: 46: Hoare triple {18154#(<= 10 ~a28~0)} assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input#1) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,480 INFO L290 TraceCheckUtils]: 47: Hoare triple {18154#(<= 10 ~a28~0)} assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input#1); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,481 INFO L290 TraceCheckUtils]: 48: Hoare triple {18154#(<= 10 ~a28~0)} assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input#1 && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,481 INFO L290 TraceCheckUtils]: 49: Hoare triple {18154#(<= 10 ~a28~0)} assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input#1 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,481 INFO L290 TraceCheckUtils]: 50: Hoare triple {18154#(<= 10 ~a28~0)} assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input#1 && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,482 INFO L290 TraceCheckUtils]: 51: Hoare triple {18154#(<= 10 ~a28~0)} assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,482 INFO L290 TraceCheckUtils]: 52: Hoare triple {18154#(<= 10 ~a28~0)} assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input#1) && 9 == ~a17~0) && 9 == ~a28~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,482 INFO L290 TraceCheckUtils]: 53: Hoare triple {18154#(<= 10 ~a28~0)} assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input#1) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,483 INFO L290 TraceCheckUtils]: 54: Hoare triple {18154#(<= 10 ~a28~0)} assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input#1) && !(1 == ~a19~0)) && 1 == ~a21~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,483 INFO L290 TraceCheckUtils]: 55: Hoare triple {18154#(<= 10 ~a28~0)} assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input#1 && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,483 INFO L290 TraceCheckUtils]: 56: Hoare triple {18154#(<= 10 ~a28~0)} assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input#1 && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,484 INFO L290 TraceCheckUtils]: 57: Hoare triple {18154#(<= 10 ~a28~0)} assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input#1) && !(1 == ~a11~0)); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,484 INFO L290 TraceCheckUtils]: 58: Hoare triple {18154#(<= 10 ~a28~0)} assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input#1 && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,484 INFO L290 TraceCheckUtils]: 59: Hoare triple {18154#(<= 10 ~a28~0)} assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input#1 && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,484 INFO L290 TraceCheckUtils]: 60: Hoare triple {18154#(<= 10 ~a28~0)} assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input#1) && 1 == ~a11~0) && 9 == ~a17~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,485 INFO L290 TraceCheckUtils]: 61: Hoare triple {18154#(<= 10 ~a28~0)} assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,485 INFO L290 TraceCheckUtils]: 62: Hoare triple {18154#(<= 10 ~a28~0)} assume !(1 == ~a19~0 && ((((4 == calculate_output_~input#1 && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,485 INFO L290 TraceCheckUtils]: 63: Hoare triple {18154#(<= 10 ~a28~0)} assume !(8 == ~a17~0 && ((((1 == calculate_output_~input#1 && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,486 INFO L290 TraceCheckUtils]: 64: Hoare triple {18154#(<= 10 ~a28~0)} assume !((((((4 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,486 INFO L290 TraceCheckUtils]: 65: Hoare triple {18154#(<= 10 ~a28~0)} assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input#1) && 1 == ~a19~0) && 1 == ~a21~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,486 INFO L290 TraceCheckUtils]: 66: Hoare triple {18154#(<= 10 ~a28~0)} assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input#1) && 1 == ~a21~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,487 INFO L290 TraceCheckUtils]: 67: Hoare triple {18154#(<= 10 ~a28~0)} assume !((((1 == ~a21~0 && 1 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,487 INFO L290 TraceCheckUtils]: 68: Hoare triple {18154#(<= 10 ~a28~0)} assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input#1) && !(1 == ~a11~0)) && 8 == ~a17~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,487 INFO L290 TraceCheckUtils]: 69: Hoare triple {18154#(<= 10 ~a28~0)} assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input#1) && 8 == ~a17~0) && 1 == ~a21~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,488 INFO L290 TraceCheckUtils]: 70: Hoare triple {18154#(<= 10 ~a28~0)} assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input#1) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,488 INFO L290 TraceCheckUtils]: 71: Hoare triple {18154#(<= 10 ~a28~0)} assume !((8 == ~a17~0 && (((6 == calculate_output_~input#1 && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,488 INFO L290 TraceCheckUtils]: 72: Hoare triple {18154#(<= 10 ~a28~0)} assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input#1 && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,488 INFO L290 TraceCheckUtils]: 73: Hoare triple {18154#(<= 10 ~a28~0)} assume !((((((1 == calculate_output_~input#1 && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,489 INFO L290 TraceCheckUtils]: 74: Hoare triple {18154#(<= 10 ~a28~0)} assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input#1) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,489 INFO L290 TraceCheckUtils]: 75: Hoare triple {18154#(<= 10 ~a28~0)} assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input#1) && 1 == ~a21~0) && !(1 == ~a19~0)); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,489 INFO L290 TraceCheckUtils]: 76: Hoare triple {18154#(<= 10 ~a28~0)} assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input#1) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,489 INFO L290 TraceCheckUtils]: 77: Hoare triple {18154#(<= 10 ~a28~0)} assume !((9 == ~a17~0 && (((1 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,490 INFO L290 TraceCheckUtils]: 78: Hoare triple {18154#(<= 10 ~a28~0)} assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input#1) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,490 INFO L290 TraceCheckUtils]: 79: Hoare triple {18154#(<= 10 ~a28~0)} assume !(9 == ~a17~0 && 1 == ~a21~0 && 1 == ~a11~0 && (3 == calculate_output_~input#1 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a19~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,490 INFO L290 TraceCheckUtils]: 80: Hoare triple {18154#(<= 10 ~a28~0)} assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input#1 && !(1 == ~a11~0)); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,491 INFO L290 TraceCheckUtils]: 81: Hoare triple {18154#(<= 10 ~a28~0)} assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input#1 && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,491 INFO L290 TraceCheckUtils]: 82: Hoare triple {18154#(<= 10 ~a28~0)} assume !((((8 == ~a17~0 && (6 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a21~0) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a19~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,491 INFO L290 TraceCheckUtils]: 83: Hoare triple {18154#(<= 10 ~a28~0)} assume !((!(1 == ~a11~0) && (!(1 == ~a19~0) && ((!(1 == ~a25~0) && 11 == ~a28~0) || (10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) && 5 == calculate_output_~input#1) && 8 == ~a17~0) && 1 == ~a21~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,491 INFO L290 TraceCheckUtils]: 84: Hoare triple {18154#(<= 10 ~a28~0)} assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input#1) && 1 == ~a19~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,492 INFO L290 TraceCheckUtils]: 85: Hoare triple {18154#(<= 10 ~a28~0)} assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input#1) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,492 INFO L290 TraceCheckUtils]: 86: Hoare triple {18154#(<= 10 ~a28~0)} assume !(1 == ~a11~0 && (9 == ~a17~0 && 9 == ~a28~0 && 1 == ~a19~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input#1) && 1 == ~a21~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,492 INFO L290 TraceCheckUtils]: 87: Hoare triple {18154#(<= 10 ~a28~0)} assume !((((((3 == calculate_output_~input#1 && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,493 INFO L290 TraceCheckUtils]: 88: Hoare triple {18154#(<= 10 ~a28~0)} assume !(1 == ~a19~0 && 1 == ~a21~0 && ((5 == calculate_output_~input#1 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a11~0) && 9 == ~a17~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,493 INFO L290 TraceCheckUtils]: 89: Hoare triple {18154#(<= 10 ~a28~0)} assume !((1 == ~a19~0 && ((!(1 == ~a11~0) && (1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input#1) && 10 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,493 INFO L290 TraceCheckUtils]: 90: Hoare triple {18154#(<= 10 ~a28~0)} assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input#1 && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,493 INFO L290 TraceCheckUtils]: 91: Hoare triple {18154#(<= 10 ~a28~0)} assume !(((!(1 == ~a19~0) && (4 == calculate_output_~input#1 && (((!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,494 INFO L290 TraceCheckUtils]: 92: Hoare triple {18154#(<= 10 ~a28~0)} assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input#1) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,494 INFO L290 TraceCheckUtils]: 93: Hoare triple {18154#(<= 10 ~a28~0)} assume !((((1 == ~a21~0 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (9 == ~a28~0 && 1 == ~a25~0)) && 6 == calculate_output_~input#1) && !(1 == ~a11~0)) && !(1 == ~a19~0)) && 8 == ~a17~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,494 INFO L290 TraceCheckUtils]: 94: Hoare triple {18154#(<= 10 ~a28~0)} assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input#1) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,495 INFO L290 TraceCheckUtils]: 95: Hoare triple {18154#(<= 10 ~a28~0)} assume !(8 == ~a17~0 && (1 == ~a21~0 && (5 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (9 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a19~0) && !(1 == ~a11~0)); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,495 INFO L290 TraceCheckUtils]: 96: Hoare triple {18154#(<= 10 ~a28~0)} assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input#1 && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,495 INFO L290 TraceCheckUtils]: 97: Hoare triple {18154#(<= 10 ~a28~0)} assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input#1) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,496 INFO L290 TraceCheckUtils]: 98: Hoare triple {18154#(<= 10 ~a28~0)} assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input#1) && 1 == ~a21~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,496 INFO L290 TraceCheckUtils]: 99: Hoare triple {18154#(<= 10 ~a28~0)} assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 6 == calculate_output_~input#1 && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a19~0)); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,496 INFO L290 TraceCheckUtils]: 100: Hoare triple {18154#(<= 10 ~a28~0)} assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input#1) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,496 INFO L290 TraceCheckUtils]: 101: Hoare triple {18154#(<= 10 ~a28~0)} assume !((8 == ~a17~0 && ((4 == calculate_output_~input#1 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,497 INFO L290 TraceCheckUtils]: 102: Hoare triple {18154#(<= 10 ~a28~0)} assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input#1) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,497 INFO L290 TraceCheckUtils]: 103: Hoare triple {18154#(<= 10 ~a28~0)} assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input#1) && !(1 == ~a25~0)) && 8 == ~a28~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,497 INFO L290 TraceCheckUtils]: 104: Hoare triple {18154#(<= 10 ~a28~0)} assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input#1) && 11 == ~a28~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,498 INFO L290 TraceCheckUtils]: 105: Hoare triple {18154#(<= 10 ~a28~0)} assume !(1 == ~a19~0 && 8 == ~a17~0 && ((((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input#1) && !(1 == ~a11~0)) && 1 == ~a21~0); {18154#(<= 10 ~a28~0)} is VALID [2022-02-20 14:47:52,498 INFO L290 TraceCheckUtils]: 106: Hoare triple {18154#(<= 10 ~a28~0)} assume ((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0; {18153#false} is VALID [2022-02-20 14:47:52,498 INFO L290 TraceCheckUtils]: 107: Hoare triple {18153#false} assume !false; {18153#false} is VALID [2022-02-20 14:47:52,498 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 14:47:52,499 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:47:52,499 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483000573] [2022-02-20 14:47:52,499 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483000573] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:47:52,499 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:47:52,499 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:47:52,499 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240251272] [2022-02-20 14:47:52,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:47:52,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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 108 [2022-02-20 14:47:52,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:47:52,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:52,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:47:52,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:47:52,562 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:47:52,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:47:52,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:47:52,562 INFO L87 Difference]: Start difference. First operand 1858 states and 2274 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:53,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:47:53,745 INFO L93 Difference]: Finished difference Result 4555 states and 5653 transitions. [2022-02-20 14:47:53,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:47:53,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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 108 [2022-02-20 14:47:53,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:47:53,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:53,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 715 transitions. [2022-02-20 14:47:53,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:53,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 715 transitions. [2022-02-20 14:47:53,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 715 transitions. [2022-02-20 14:47:54,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 715 edges. 715 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:47:54,408 INFO L225 Difference]: With dead ends: 4555 [2022-02-20 14:47:54,408 INFO L226 Difference]: Without dead ends: 2699 [2022-02-20 14:47:54,410 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 14:47:54,411 INFO L933 BasicCegarLoop]: 228 mSDtfsCounter, 82 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 14:47:54,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 246 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 14:47:54,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states. [2022-02-20 14:47:54,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2699. [2022-02-20 14:47:54,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:47:54,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2699 states. Second operand has 2699 states, 2698 states have (on average 1.1730911786508524) internal successors, (3165), 2698 states have internal predecessors, (3165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:54,457 INFO L74 IsIncluded]: Start isIncluded. First operand 2699 states. Second operand has 2699 states, 2698 states have (on average 1.1730911786508524) internal successors, (3165), 2698 states have internal predecessors, (3165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:54,460 INFO L87 Difference]: Start difference. First operand 2699 states. Second operand has 2699 states, 2698 states have (on average 1.1730911786508524) internal successors, (3165), 2698 states have internal predecessors, (3165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:54,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:47:54,648 INFO L93 Difference]: Finished difference Result 2699 states and 3165 transitions. [2022-02-20 14:47:54,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 3165 transitions. [2022-02-20 14:47:54,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:47:54,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:47:54,654 INFO L74 IsIncluded]: Start isIncluded. First operand has 2699 states, 2698 states have (on average 1.1730911786508524) internal successors, (3165), 2698 states have internal predecessors, (3165), 0 states have call successors, (0), 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 2699 states. [2022-02-20 14:47:54,656 INFO L87 Difference]: Start difference. First operand has 2699 states, 2698 states have (on average 1.1730911786508524) internal successors, (3165), 2698 states have internal predecessors, (3165), 0 states have call successors, (0), 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 2699 states. [2022-02-20 14:47:54,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:47:54,838 INFO L93 Difference]: Finished difference Result 2699 states and 3165 transitions. [2022-02-20 14:47:54,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 3165 transitions. [2022-02-20 14:47:54,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:47:54,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:47:54,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:47:54,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:47:54,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2699 states, 2698 states have (on average 1.1730911786508524) internal successors, (3165), 2698 states have internal predecessors, (3165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:55,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2699 states and 3165 transitions. [2022-02-20 14:47:55,029 INFO L78 Accepts]: Start accepts. Automaton has 2699 states and 3165 transitions. Word has length 108 [2022-02-20 14:47:55,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:47:55,030 INFO L470 AbstractCegarLoop]: Abstraction has 2699 states and 3165 transitions. [2022-02-20 14:47:55,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:55,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 3165 transitions. [2022-02-20 14:47:55,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-20 14:47:55,033 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:47:55,033 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:47:55,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 14:47:55,033 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:47:55,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:47:55,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1685449902, now seen corresponding path program 1 times [2022-02-20 14:47:55,034 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:47:55,034 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485501167] [2022-02-20 14:47:55,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:47:55,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:47:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:47:55,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {30911#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);~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; {30911#true} is VALID [2022-02-20 14:47:55,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {30911#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1; {30911#true} is VALID [2022-02-20 14:47:55,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {30911#true} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {30911#true} is VALID [2022-02-20 14:47:55,102 INFO L290 TraceCheckUtils]: 3: Hoare triple {30911#true} assume !((((1 != 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_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {30911#true} is VALID [2022-02-20 14:47:55,102 INFO L290 TraceCheckUtils]: 4: Hoare triple {30911#true} assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); {30911#true} is VALID [2022-02-20 14:47:55,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {30911#true} assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input#1) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res#1 := 22; {30913#(<= ~a28~0 10)} is VALID [2022-02-20 14:47:55,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {30913#(<= ~a28~0 10)} main_#t~ret7#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main_#t~ret7#1 && main_#t~ret7#1 <= 2147483647;main_~output~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1; {30913#(<= ~a28~0 10)} is VALID [2022-02-20 14:47:55,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {30913#(<= ~a28~0 10)} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {30913#(<= ~a28~0 10)} is VALID [2022-02-20 14:47:55,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {30913#(<= ~a28~0 10)} assume !((((1 != 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_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {30913#(<= ~a28~0 10)} is VALID [2022-02-20 14:47:55,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {30913#(<= ~a28~0 10)} assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); {30913#(<= ~a28~0 10)} is VALID [2022-02-20 14:47:55,105 INFO L290 TraceCheckUtils]: 10: Hoare triple {30913#(<= ~a28~0 10)} assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input#1) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); {30913#(<= ~a28~0 10)} is VALID [2022-02-20 14:47:55,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {30913#(<= ~a28~0 10)} assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input#1) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); {30913#(<= ~a28~0 10)} is VALID [2022-02-20 14:47:55,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {30913#(<= ~a28~0 10)} assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input#1 && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); {30913#(<= ~a28~0 10)} is VALID [2022-02-20 14:47:55,106 INFO L290 TraceCheckUtils]: 13: Hoare triple {30913#(<= ~a28~0 10)} assume !(((8 == ~a17~0 && ((1 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); {30913#(<= ~a28~0 10)} is VALID [2022-02-20 14:47:55,106 INFO L290 TraceCheckUtils]: 14: Hoare triple {30913#(<= ~a28~0 10)} assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input#1 && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); {30913#(<= ~a28~0 10)} is VALID [2022-02-20 14:47:55,106 INFO L290 TraceCheckUtils]: 15: Hoare triple {30913#(<= ~a28~0 10)} assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input#1 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); {30913#(<= ~a28~0 10)} is VALID [2022-02-20 14:47:55,107 INFO L290 TraceCheckUtils]: 16: Hoare triple {30913#(<= ~a28~0 10)} assume !(1 == ~a19~0 && (((1 == calculate_output_~input#1 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); {30913#(<= ~a28~0 10)} is VALID [2022-02-20 14:47:55,107 INFO L290 TraceCheckUtils]: 17: Hoare triple {30913#(<= ~a28~0 10)} assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); {30913#(<= ~a28~0 10)} is VALID [2022-02-20 14:47:55,107 INFO L290 TraceCheckUtils]: 18: Hoare triple {30913#(<= ~a28~0 10)} assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input#1 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); {30913#(<= ~a28~0 10)} is VALID [2022-02-20 14:47:55,107 INFO L290 TraceCheckUtils]: 19: Hoare triple {30913#(<= ~a28~0 10)} assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input#1) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); {30913#(<= ~a28~0 10)} is VALID [2022-02-20 14:47:55,108 INFO L290 TraceCheckUtils]: 20: Hoare triple {30913#(<= ~a28~0 10)} assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input#1) && !(1 == ~a11~0)) && 8 == ~a17~0); {30913#(<= ~a28~0 10)} is VALID [2022-02-20 14:47:55,108 INFO L290 TraceCheckUtils]: 21: Hoare triple {30913#(<= ~a28~0 10)} assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input#1); {30913#(<= ~a28~0 10)} is VALID [2022-02-20 14:47:55,108 INFO L290 TraceCheckUtils]: 22: Hoare triple {30913#(<= ~a28~0 10)} assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input#1 && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); {30913#(<= ~a28~0 10)} is VALID [2022-02-20 14:47:55,110 INFO L290 TraceCheckUtils]: 23: Hoare triple {30913#(<= ~a28~0 10)} assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); {30913#(<= ~a28~0 10)} is VALID [2022-02-20 14:47:55,110 INFO L290 TraceCheckUtils]: 24: Hoare triple {30913#(<= ~a28~0 10)} assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input#1) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); {30913#(<= ~a28~0 10)} is VALID [2022-02-20 14:47:55,111 INFO L290 TraceCheckUtils]: 25: Hoare triple {30913#(<= ~a28~0 10)} assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input#1); {30913#(<= ~a28~0 10)} is VALID [2022-02-20 14:47:55,111 INFO L290 TraceCheckUtils]: 26: Hoare triple {30913#(<= ~a28~0 10)} assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input#1 && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); {30913#(<= ~a28~0 10)} is VALID [2022-02-20 14:47:55,111 INFO L290 TraceCheckUtils]: 27: Hoare triple {30913#(<= ~a28~0 10)} assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input#1 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); {30913#(<= ~a28~0 10)} is VALID [2022-02-20 14:47:55,112 INFO L290 TraceCheckUtils]: 28: Hoare triple {30913#(<= ~a28~0 10)} assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input#1 && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); {30913#(<= ~a28~0 10)} is VALID [2022-02-20 14:47:55,112 INFO L290 TraceCheckUtils]: 29: Hoare triple {30913#(<= ~a28~0 10)} assume !(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0;~a28~0 := 7;~a19~0 := 0;~a11~0 := 1;calculate_output_#res#1 := -1; {30912#false} is VALID [2022-02-20 14:47:55,112 INFO L290 TraceCheckUtils]: 30: Hoare triple {30912#false} main_#t~ret7#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main_#t~ret7#1 && main_#t~ret7#1 <= 2147483647;main_~output~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1; {30912#false} is VALID [2022-02-20 14:47:55,112 INFO L290 TraceCheckUtils]: 31: Hoare triple {30912#false} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {30912#false} is VALID [2022-02-20 14:47:55,112 INFO L290 TraceCheckUtils]: 32: Hoare triple {30912#false} assume !((((1 != 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_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {30912#false} is VALID [2022-02-20 14:47:55,113 INFO L290 TraceCheckUtils]: 33: Hoare triple {30912#false} assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); {30912#false} is VALID [2022-02-20 14:47:55,113 INFO L290 TraceCheckUtils]: 34: Hoare triple {30912#false} assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input#1) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); {30912#false} is VALID [2022-02-20 14:47:55,113 INFO L290 TraceCheckUtils]: 35: Hoare triple {30912#false} assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input#1) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); {30912#false} is VALID [2022-02-20 14:47:55,117 INFO L290 TraceCheckUtils]: 36: Hoare triple {30912#false} assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input#1 && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); {30912#false} is VALID [2022-02-20 14:47:55,117 INFO L290 TraceCheckUtils]: 37: Hoare triple {30912#false} assume !(((8 == ~a17~0 && ((1 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); {30912#false} is VALID [2022-02-20 14:47:55,117 INFO L290 TraceCheckUtils]: 38: Hoare triple {30912#false} assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input#1 && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); {30912#false} is VALID [2022-02-20 14:47:55,118 INFO L290 TraceCheckUtils]: 39: Hoare triple {30912#false} assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input#1 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); {30912#false} is VALID [2022-02-20 14:47:55,118 INFO L290 TraceCheckUtils]: 40: Hoare triple {30912#false} assume !(1 == ~a19~0 && (((1 == calculate_output_~input#1 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); {30912#false} is VALID [2022-02-20 14:47:55,121 INFO L290 TraceCheckUtils]: 41: Hoare triple {30912#false} assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); {30912#false} is VALID [2022-02-20 14:47:55,122 INFO L290 TraceCheckUtils]: 42: Hoare triple {30912#false} assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input#1 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); {30912#false} is VALID [2022-02-20 14:47:55,122 INFO L290 TraceCheckUtils]: 43: Hoare triple {30912#false} assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input#1) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); {30912#false} is VALID [2022-02-20 14:47:55,122 INFO L290 TraceCheckUtils]: 44: Hoare triple {30912#false} assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input#1) && !(1 == ~a11~0)) && 8 == ~a17~0); {30912#false} is VALID [2022-02-20 14:47:55,122 INFO L290 TraceCheckUtils]: 45: Hoare triple {30912#false} assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input#1); {30912#false} is VALID [2022-02-20 14:47:55,122 INFO L290 TraceCheckUtils]: 46: Hoare triple {30912#false} assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input#1 && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); {30912#false} is VALID [2022-02-20 14:47:55,122 INFO L290 TraceCheckUtils]: 47: Hoare triple {30912#false} assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); {30912#false} is VALID [2022-02-20 14:47:55,122 INFO L290 TraceCheckUtils]: 48: Hoare triple {30912#false} assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input#1) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); {30912#false} is VALID [2022-02-20 14:47:55,123 INFO L290 TraceCheckUtils]: 49: Hoare triple {30912#false} assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input#1); {30912#false} is VALID [2022-02-20 14:47:55,123 INFO L290 TraceCheckUtils]: 50: Hoare triple {30912#false} assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input#1 && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); {30912#false} is VALID [2022-02-20 14:47:55,125 INFO L290 TraceCheckUtils]: 51: Hoare triple {30912#false} assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input#1 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); {30912#false} is VALID [2022-02-20 14:47:55,125 INFO L290 TraceCheckUtils]: 52: Hoare triple {30912#false} assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input#1 && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); {30912#false} is VALID [2022-02-20 14:47:55,125 INFO L290 TraceCheckUtils]: 53: Hoare triple {30912#false} assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); {30912#false} is VALID [2022-02-20 14:47:55,125 INFO L290 TraceCheckUtils]: 54: Hoare triple {30912#false} assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input#1) && 9 == ~a17~0) && 9 == ~a28~0); {30912#false} is VALID [2022-02-20 14:47:55,125 INFO L290 TraceCheckUtils]: 55: Hoare triple {30912#false} assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input#1) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); {30912#false} is VALID [2022-02-20 14:47:55,125 INFO L290 TraceCheckUtils]: 56: Hoare triple {30912#false} assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input#1) && !(1 == ~a19~0)) && 1 == ~a21~0); {30912#false} is VALID [2022-02-20 14:47:55,125 INFO L290 TraceCheckUtils]: 57: Hoare triple {30912#false} assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input#1 && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); {30912#false} is VALID [2022-02-20 14:47:55,126 INFO L290 TraceCheckUtils]: 58: Hoare triple {30912#false} assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input#1 && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); {30912#false} is VALID [2022-02-20 14:47:55,126 INFO L290 TraceCheckUtils]: 59: Hoare triple {30912#false} assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input#1) && !(1 == ~a11~0)); {30912#false} is VALID [2022-02-20 14:47:55,126 INFO L290 TraceCheckUtils]: 60: Hoare triple {30912#false} assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input#1 && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); {30912#false} is VALID [2022-02-20 14:47:55,126 INFO L290 TraceCheckUtils]: 61: Hoare triple {30912#false} assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input#1 && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); {30912#false} is VALID [2022-02-20 14:47:55,126 INFO L290 TraceCheckUtils]: 62: Hoare triple {30912#false} assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input#1) && 1 == ~a11~0) && 9 == ~a17~0); {30912#false} is VALID [2022-02-20 14:47:55,126 INFO L290 TraceCheckUtils]: 63: Hoare triple {30912#false} assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); {30912#false} is VALID [2022-02-20 14:47:55,126 INFO L290 TraceCheckUtils]: 64: Hoare triple {30912#false} assume !(1 == ~a19~0 && ((((4 == calculate_output_~input#1 && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); {30912#false} is VALID [2022-02-20 14:47:55,126 INFO L290 TraceCheckUtils]: 65: Hoare triple {30912#false} assume !(8 == ~a17~0 && ((((1 == calculate_output_~input#1 && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); {30912#false} is VALID [2022-02-20 14:47:55,127 INFO L290 TraceCheckUtils]: 66: Hoare triple {30912#false} assume !((((((4 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); {30912#false} is VALID [2022-02-20 14:47:55,127 INFO L290 TraceCheckUtils]: 67: Hoare triple {30912#false} assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input#1) && 1 == ~a19~0) && 1 == ~a21~0); {30912#false} is VALID [2022-02-20 14:47:55,127 INFO L290 TraceCheckUtils]: 68: Hoare triple {30912#false} assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input#1) && 1 == ~a21~0); {30912#false} is VALID [2022-02-20 14:47:55,127 INFO L290 TraceCheckUtils]: 69: Hoare triple {30912#false} assume !((((1 == ~a21~0 && 1 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); {30912#false} is VALID [2022-02-20 14:47:55,128 INFO L290 TraceCheckUtils]: 70: Hoare triple {30912#false} assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input#1) && !(1 == ~a11~0)) && 8 == ~a17~0); {30912#false} is VALID [2022-02-20 14:47:55,128 INFO L290 TraceCheckUtils]: 71: Hoare triple {30912#false} assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input#1) && 8 == ~a17~0) && 1 == ~a21~0); {30912#false} is VALID [2022-02-20 14:47:55,128 INFO L290 TraceCheckUtils]: 72: Hoare triple {30912#false} assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input#1) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); {30912#false} is VALID [2022-02-20 14:47:55,128 INFO L290 TraceCheckUtils]: 73: Hoare triple {30912#false} assume !((8 == ~a17~0 && (((6 == calculate_output_~input#1 && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); {30912#false} is VALID [2022-02-20 14:47:55,129 INFO L290 TraceCheckUtils]: 74: Hoare triple {30912#false} assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input#1 && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); {30912#false} is VALID [2022-02-20 14:47:55,129 INFO L290 TraceCheckUtils]: 75: Hoare triple {30912#false} assume !((((((1 == calculate_output_~input#1 && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); {30912#false} is VALID [2022-02-20 14:47:55,129 INFO L290 TraceCheckUtils]: 76: Hoare triple {30912#false} assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input#1) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); {30912#false} is VALID [2022-02-20 14:47:55,129 INFO L290 TraceCheckUtils]: 77: Hoare triple {30912#false} assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input#1) && 1 == ~a21~0) && !(1 == ~a19~0)); {30912#false} is VALID [2022-02-20 14:47:55,129 INFO L290 TraceCheckUtils]: 78: Hoare triple {30912#false} assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input#1) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); {30912#false} is VALID [2022-02-20 14:47:55,129 INFO L290 TraceCheckUtils]: 79: Hoare triple {30912#false} assume !((9 == ~a17~0 && (((1 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0); {30912#false} is VALID [2022-02-20 14:47:55,129 INFO L290 TraceCheckUtils]: 80: Hoare triple {30912#false} assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input#1) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); {30912#false} is VALID [2022-02-20 14:47:55,129 INFO L290 TraceCheckUtils]: 81: Hoare triple {30912#false} assume !(9 == ~a17~0 && 1 == ~a21~0 && 1 == ~a11~0 && (3 == calculate_output_~input#1 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a19~0); {30912#false} is VALID [2022-02-20 14:47:55,130 INFO L290 TraceCheckUtils]: 82: Hoare triple {30912#false} assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input#1 && !(1 == ~a11~0)); {30912#false} is VALID [2022-02-20 14:47:55,130 INFO L290 TraceCheckUtils]: 83: Hoare triple {30912#false} assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input#1 && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); {30912#false} is VALID [2022-02-20 14:47:55,130 INFO L290 TraceCheckUtils]: 84: Hoare triple {30912#false} assume !((((8 == ~a17~0 && (6 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a21~0) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a19~0); {30912#false} is VALID [2022-02-20 14:47:55,130 INFO L290 TraceCheckUtils]: 85: Hoare triple {30912#false} assume !((!(1 == ~a11~0) && (!(1 == ~a19~0) && ((!(1 == ~a25~0) && 11 == ~a28~0) || (10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) && 5 == calculate_output_~input#1) && 8 == ~a17~0) && 1 == ~a21~0); {30912#false} is VALID [2022-02-20 14:47:55,130 INFO L290 TraceCheckUtils]: 86: Hoare triple {30912#false} assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input#1) && 1 == ~a19~0); {30912#false} is VALID [2022-02-20 14:47:55,130 INFO L290 TraceCheckUtils]: 87: Hoare triple {30912#false} assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input#1) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); {30912#false} is VALID [2022-02-20 14:47:55,130 INFO L290 TraceCheckUtils]: 88: Hoare triple {30912#false} assume !(1 == ~a11~0 && (9 == ~a17~0 && 9 == ~a28~0 && 1 == ~a19~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input#1) && 1 == ~a21~0); {30912#false} is VALID [2022-02-20 14:47:55,130 INFO L290 TraceCheckUtils]: 89: Hoare triple {30912#false} assume !((((((3 == calculate_output_~input#1 && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); {30912#false} is VALID [2022-02-20 14:47:55,131 INFO L290 TraceCheckUtils]: 90: Hoare triple {30912#false} assume !(1 == ~a19~0 && 1 == ~a21~0 && ((5 == calculate_output_~input#1 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a11~0) && 9 == ~a17~0); {30912#false} is VALID [2022-02-20 14:47:55,131 INFO L290 TraceCheckUtils]: 91: Hoare triple {30912#false} assume !((1 == ~a19~0 && ((!(1 == ~a11~0) && (1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input#1) && 10 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0); {30912#false} is VALID [2022-02-20 14:47:55,131 INFO L290 TraceCheckUtils]: 92: Hoare triple {30912#false} assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input#1 && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); {30912#false} is VALID [2022-02-20 14:47:55,131 INFO L290 TraceCheckUtils]: 93: Hoare triple {30912#false} assume !(((!(1 == ~a19~0) && (4 == calculate_output_~input#1 && (((!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); {30912#false} is VALID [2022-02-20 14:47:55,131 INFO L290 TraceCheckUtils]: 94: Hoare triple {30912#false} assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input#1) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); {30912#false} is VALID [2022-02-20 14:47:55,131 INFO L290 TraceCheckUtils]: 95: Hoare triple {30912#false} assume !((((1 == ~a21~0 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (9 == ~a28~0 && 1 == ~a25~0)) && 6 == calculate_output_~input#1) && !(1 == ~a11~0)) && !(1 == ~a19~0)) && 8 == ~a17~0); {30912#false} is VALID [2022-02-20 14:47:55,131 INFO L290 TraceCheckUtils]: 96: Hoare triple {30912#false} assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input#1) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); {30912#false} is VALID [2022-02-20 14:47:55,131 INFO L290 TraceCheckUtils]: 97: Hoare triple {30912#false} assume !(8 == ~a17~0 && (1 == ~a21~0 && (5 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (9 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a19~0) && !(1 == ~a11~0)); {30912#false} is VALID [2022-02-20 14:47:55,132 INFO L290 TraceCheckUtils]: 98: Hoare triple {30912#false} assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input#1 && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); {30912#false} is VALID [2022-02-20 14:47:55,132 INFO L290 TraceCheckUtils]: 99: Hoare triple {30912#false} assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input#1) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); {30912#false} is VALID [2022-02-20 14:47:55,132 INFO L290 TraceCheckUtils]: 100: Hoare triple {30912#false} assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input#1) && 1 == ~a21~0); {30912#false} is VALID [2022-02-20 14:47:55,132 INFO L290 TraceCheckUtils]: 101: Hoare triple {30912#false} assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 6 == calculate_output_~input#1 && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a19~0)); {30912#false} is VALID [2022-02-20 14:47:55,132 INFO L290 TraceCheckUtils]: 102: Hoare triple {30912#false} assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input#1) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); {30912#false} is VALID [2022-02-20 14:47:55,132 INFO L290 TraceCheckUtils]: 103: Hoare triple {30912#false} assume !((8 == ~a17~0 && ((4 == calculate_output_~input#1 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)); {30912#false} is VALID [2022-02-20 14:47:55,132 INFO L290 TraceCheckUtils]: 104: Hoare triple {30912#false} assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input#1) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); {30912#false} is VALID [2022-02-20 14:47:55,133 INFO L290 TraceCheckUtils]: 105: Hoare triple {30912#false} assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input#1) && !(1 == ~a25~0)) && 8 == ~a28~0); {30912#false} is VALID [2022-02-20 14:47:55,133 INFO L290 TraceCheckUtils]: 106: Hoare triple {30912#false} assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input#1) && 11 == ~a28~0); {30912#false} is VALID [2022-02-20 14:47:55,133 INFO L290 TraceCheckUtils]: 107: Hoare triple {30912#false} assume !(1 == ~a19~0 && 8 == ~a17~0 && ((((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input#1) && !(1 == ~a11~0)) && 1 == ~a21~0); {30912#false} is VALID [2022-02-20 14:47:55,133 INFO L290 TraceCheckUtils]: 108: Hoare triple {30912#false} assume ((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0; {30912#false} is VALID [2022-02-20 14:47:55,133 INFO L290 TraceCheckUtils]: 109: Hoare triple {30912#false} assume !false; {30912#false} is VALID [2022-02-20 14:47:55,133 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:47:55,134 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:47:55,134 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485501167] [2022-02-20 14:47:55,134 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485501167] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:47:55,134 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:47:55,134 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:47:55,134 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786721696] [2022-02-20 14:47:55,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:47:55,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2022-02-20 14:47:55,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:47:55,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:55,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:47:55,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:47:55,207 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:47:55,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:47:55,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:47:55,210 INFO L87 Difference]: Start difference. First operand 2699 states and 3165 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:56,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:47:56,902 INFO L93 Difference]: Finished difference Result 5818 states and 6787 transitions. [2022-02-20 14:47:56,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:47:56,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2022-02-20 14:47:56,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:47:56,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:56,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 660 transitions. [2022-02-20 14:47:56,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:56,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 660 transitions. [2022-02-20 14:47:56,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 660 transitions. [2022-02-20 14:47:57,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 660 edges. 660 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:47:57,573 INFO L225 Difference]: With dead ends: 5818 [2022-02-20 14:47:57,573 INFO L226 Difference]: Without dead ends: 2559 [2022-02-20 14:47:57,576 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 14:47:57,578 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 162 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:47:57,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 61 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:47:57,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2559 states. [2022-02-20 14:47:57,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2559 to 2557. [2022-02-20 14:47:57,624 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:47:57,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2559 states. Second operand has 2557 states, 2556 states have (on average 1.1165884194053208) internal successors, (2854), 2556 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:57,628 INFO L74 IsIncluded]: Start isIncluded. First operand 2559 states. Second operand has 2557 states, 2556 states have (on average 1.1165884194053208) internal successors, (2854), 2556 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:57,629 INFO L87 Difference]: Start difference. First operand 2559 states. Second operand has 2557 states, 2556 states have (on average 1.1165884194053208) internal successors, (2854), 2556 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:57,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:47:57,792 INFO L93 Difference]: Finished difference Result 2559 states and 2857 transitions. [2022-02-20 14:47:57,792 INFO L276 IsEmpty]: Start isEmpty. Operand 2559 states and 2857 transitions. [2022-02-20 14:47:57,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:47:57,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:47:57,820 INFO L74 IsIncluded]: Start isIncluded. First operand has 2557 states, 2556 states have (on average 1.1165884194053208) internal successors, (2854), 2556 states have internal predecessors, (2854), 0 states have call successors, (0), 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 2559 states. [2022-02-20 14:47:57,822 INFO L87 Difference]: Start difference. First operand has 2557 states, 2556 states have (on average 1.1165884194053208) internal successors, (2854), 2556 states have internal predecessors, (2854), 0 states have call successors, (0), 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 2559 states. [2022-02-20 14:47:57,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:47:57,979 INFO L93 Difference]: Finished difference Result 2559 states and 2857 transitions. [2022-02-20 14:47:57,979 INFO L276 IsEmpty]: Start isEmpty. Operand 2559 states and 2857 transitions. [2022-02-20 14:47:57,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:47:57,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:47:57,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:47:57,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:47:57,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2557 states, 2556 states have (on average 1.1165884194053208) internal successors, (2854), 2556 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:58,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 2854 transitions. [2022-02-20 14:47:58,149 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 2854 transitions. Word has length 110 [2022-02-20 14:47:58,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:47:58,149 INFO L470 AbstractCegarLoop]: Abstraction has 2557 states and 2854 transitions. [2022-02-20 14:47:58,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:58,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 2854 transitions. [2022-02-20 14:47:58,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-20 14:47:58,151 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:47:58,152 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2022-02-20 14:47:58,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 14:47:58,152 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:47:58,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:47:58,152 INFO L85 PathProgramCache]: Analyzing trace with hash -109920232, now seen corresponding path program 1 times [2022-02-20 14:47:58,153 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:47:58,153 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342091175] [2022-02-20 14:47:58,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:47:58,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:47:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:47:58,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {44527#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);~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; {44529#(<= ~a17~0 8)} is VALID [2022-02-20 14:47:58,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {44529#(<= ~a17~0 8)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1; {44529#(<= ~a17~0 8)} is VALID [2022-02-20 14:47:58,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {44529#(<= ~a17~0 8)} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {44529#(<= ~a17~0 8)} is VALID [2022-02-20 14:47:58,218 INFO L290 TraceCheckUtils]: 3: Hoare triple {44529#(<= ~a17~0 8)} assume !((((1 != 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_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {44529#(<= ~a17~0 8)} is VALID [2022-02-20 14:47:58,218 INFO L290 TraceCheckUtils]: 4: Hoare triple {44529#(<= ~a17~0 8)} assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); {44529#(<= ~a17~0 8)} is VALID [2022-02-20 14:47:58,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {44529#(<= ~a17~0 8)} assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input#1) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); {44529#(<= ~a17~0 8)} is VALID [2022-02-20 14:47:58,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {44529#(<= ~a17~0 8)} assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input#1) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); {44529#(<= ~a17~0 8)} is VALID [2022-02-20 14:47:58,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {44529#(<= ~a17~0 8)} assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input#1 && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); {44529#(<= ~a17~0 8)} is VALID [2022-02-20 14:47:58,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {44529#(<= ~a17~0 8)} assume !(((8 == ~a17~0 && ((1 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); {44529#(<= ~a17~0 8)} is VALID [2022-02-20 14:47:58,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {44529#(<= ~a17~0 8)} assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input#1 && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); {44529#(<= ~a17~0 8)} is VALID [2022-02-20 14:47:58,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {44529#(<= ~a17~0 8)} assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input#1 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); {44529#(<= ~a17~0 8)} is VALID [2022-02-20 14:47:58,220 INFO L290 TraceCheckUtils]: 11: Hoare triple {44529#(<= ~a17~0 8)} assume !(1 == ~a19~0 && (((1 == calculate_output_~input#1 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); {44529#(<= ~a17~0 8)} is VALID [2022-02-20 14:47:58,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {44529#(<= ~a17~0 8)} assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); {44529#(<= ~a17~0 8)} is VALID [2022-02-20 14:47:58,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {44529#(<= ~a17~0 8)} assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input#1 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); {44529#(<= ~a17~0 8)} is VALID [2022-02-20 14:47:58,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {44529#(<= ~a17~0 8)} assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input#1) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); {44529#(<= ~a17~0 8)} is VALID [2022-02-20 14:47:58,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {44529#(<= ~a17~0 8)} assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input#1) && !(1 == ~a11~0)) && 8 == ~a17~0); {44529#(<= ~a17~0 8)} is VALID [2022-02-20 14:47:58,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {44529#(<= ~a17~0 8)} assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input#1); {44529#(<= ~a17~0 8)} is VALID [2022-02-20 14:47:58,222 INFO L290 TraceCheckUtils]: 17: Hoare triple {44529#(<= ~a17~0 8)} assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input#1 && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); {44529#(<= ~a17~0 8)} is VALID [2022-02-20 14:47:58,222 INFO L290 TraceCheckUtils]: 18: Hoare triple {44529#(<= ~a17~0 8)} assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); {44529#(<= ~a17~0 8)} is VALID [2022-02-20 14:47:58,223 INFO L290 TraceCheckUtils]: 19: Hoare triple {44529#(<= ~a17~0 8)} assume (1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input#1) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0;~a17~0 := 8;~a25~0 := 0;~a19~0 := 0;~a28~0 := 11;~a11~0 := 0;calculate_output_#res#1 := 23; {44528#false} is VALID [2022-02-20 14:47:58,223 INFO L290 TraceCheckUtils]: 20: Hoare triple {44528#false} main_#t~ret7#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main_#t~ret7#1 && main_#t~ret7#1 <= 2147483647;main_~output~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1; {44528#false} is VALID [2022-02-20 14:47:58,223 INFO L290 TraceCheckUtils]: 21: Hoare triple {44528#false} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {44528#false} is VALID [2022-02-20 14:47:58,223 INFO L290 TraceCheckUtils]: 22: Hoare triple {44528#false} assume !((((1 != 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_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {44528#false} is VALID [2022-02-20 14:47:58,223 INFO L290 TraceCheckUtils]: 23: Hoare triple {44528#false} assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); {44528#false} is VALID [2022-02-20 14:47:58,223 INFO L290 TraceCheckUtils]: 24: Hoare triple {44528#false} assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input#1) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); {44528#false} is VALID [2022-02-20 14:47:58,223 INFO L290 TraceCheckUtils]: 25: Hoare triple {44528#false} assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input#1) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); {44528#false} is VALID [2022-02-20 14:47:58,224 INFO L290 TraceCheckUtils]: 26: Hoare triple {44528#false} assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input#1 && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); {44528#false} is VALID [2022-02-20 14:47:58,224 INFO L290 TraceCheckUtils]: 27: Hoare triple {44528#false} assume !(((8 == ~a17~0 && ((1 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); {44528#false} is VALID [2022-02-20 14:47:58,224 INFO L290 TraceCheckUtils]: 28: Hoare triple {44528#false} assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input#1 && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); {44528#false} is VALID [2022-02-20 14:47:58,224 INFO L290 TraceCheckUtils]: 29: Hoare triple {44528#false} assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input#1 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); {44528#false} is VALID [2022-02-20 14:47:58,224 INFO L290 TraceCheckUtils]: 30: Hoare triple {44528#false} assume !(1 == ~a19~0 && (((1 == calculate_output_~input#1 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); {44528#false} is VALID [2022-02-20 14:47:58,224 INFO L290 TraceCheckUtils]: 31: Hoare triple {44528#false} assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); {44528#false} is VALID [2022-02-20 14:47:58,224 INFO L290 TraceCheckUtils]: 32: Hoare triple {44528#false} assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input#1 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); {44528#false} is VALID [2022-02-20 14:47:58,224 INFO L290 TraceCheckUtils]: 33: Hoare triple {44528#false} assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input#1) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); {44528#false} is VALID [2022-02-20 14:47:58,225 INFO L290 TraceCheckUtils]: 34: Hoare triple {44528#false} assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input#1) && !(1 == ~a11~0)) && 8 == ~a17~0); {44528#false} is VALID [2022-02-20 14:47:58,225 INFO L290 TraceCheckUtils]: 35: Hoare triple {44528#false} assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input#1); {44528#false} is VALID [2022-02-20 14:47:58,225 INFO L290 TraceCheckUtils]: 36: Hoare triple {44528#false} assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input#1 && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); {44528#false} is VALID [2022-02-20 14:47:58,225 INFO L290 TraceCheckUtils]: 37: Hoare triple {44528#false} assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); {44528#false} is VALID [2022-02-20 14:47:58,225 INFO L290 TraceCheckUtils]: 38: Hoare triple {44528#false} assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input#1) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); {44528#false} is VALID [2022-02-20 14:47:58,225 INFO L290 TraceCheckUtils]: 39: Hoare triple {44528#false} assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input#1); {44528#false} is VALID [2022-02-20 14:47:58,225 INFO L290 TraceCheckUtils]: 40: Hoare triple {44528#false} assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input#1 && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); {44528#false} is VALID [2022-02-20 14:47:58,225 INFO L290 TraceCheckUtils]: 41: Hoare triple {44528#false} assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input#1 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); {44528#false} is VALID [2022-02-20 14:47:58,226 INFO L290 TraceCheckUtils]: 42: Hoare triple {44528#false} assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input#1 && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); {44528#false} is VALID [2022-02-20 14:47:58,226 INFO L290 TraceCheckUtils]: 43: Hoare triple {44528#false} assume !(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0;~a28~0 := 7;~a19~0 := 0;~a11~0 := 1;calculate_output_#res#1 := -1; {44528#false} is VALID [2022-02-20 14:47:58,226 INFO L290 TraceCheckUtils]: 44: Hoare triple {44528#false} main_#t~ret7#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main_#t~ret7#1 && main_#t~ret7#1 <= 2147483647;main_~output~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1; {44528#false} is VALID [2022-02-20 14:47:58,226 INFO L290 TraceCheckUtils]: 45: Hoare triple {44528#false} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {44528#false} is VALID [2022-02-20 14:47:58,226 INFO L290 TraceCheckUtils]: 46: Hoare triple {44528#false} assume !((((1 != 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_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {44528#false} is VALID [2022-02-20 14:47:58,226 INFO L290 TraceCheckUtils]: 47: Hoare triple {44528#false} assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); {44528#false} is VALID [2022-02-20 14:47:58,226 INFO L290 TraceCheckUtils]: 48: Hoare triple {44528#false} assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input#1) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); {44528#false} is VALID [2022-02-20 14:47:58,226 INFO L290 TraceCheckUtils]: 49: Hoare triple {44528#false} assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input#1) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); {44528#false} is VALID [2022-02-20 14:47:58,226 INFO L290 TraceCheckUtils]: 50: Hoare triple {44528#false} assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input#1 && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); {44528#false} is VALID [2022-02-20 14:47:58,227 INFO L290 TraceCheckUtils]: 51: Hoare triple {44528#false} assume !(((8 == ~a17~0 && ((1 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); {44528#false} is VALID [2022-02-20 14:47:58,227 INFO L290 TraceCheckUtils]: 52: Hoare triple {44528#false} assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input#1 && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); {44528#false} is VALID [2022-02-20 14:47:58,227 INFO L290 TraceCheckUtils]: 53: Hoare triple {44528#false} assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input#1 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); {44528#false} is VALID [2022-02-20 14:47:58,228 INFO L290 TraceCheckUtils]: 54: Hoare triple {44528#false} assume !(1 == ~a19~0 && (((1 == calculate_output_~input#1 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); {44528#false} is VALID [2022-02-20 14:47:58,228 INFO L290 TraceCheckUtils]: 55: Hoare triple {44528#false} assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); {44528#false} is VALID [2022-02-20 14:47:58,228 INFO L290 TraceCheckUtils]: 56: Hoare triple {44528#false} assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input#1 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); {44528#false} is VALID [2022-02-20 14:47:58,228 INFO L290 TraceCheckUtils]: 57: Hoare triple {44528#false} assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input#1) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); {44528#false} is VALID [2022-02-20 14:47:58,228 INFO L290 TraceCheckUtils]: 58: Hoare triple {44528#false} assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input#1) && !(1 == ~a11~0)) && 8 == ~a17~0); {44528#false} is VALID [2022-02-20 14:47:58,228 INFO L290 TraceCheckUtils]: 59: Hoare triple {44528#false} assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input#1); {44528#false} is VALID [2022-02-20 14:47:58,228 INFO L290 TraceCheckUtils]: 60: Hoare triple {44528#false} assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input#1 && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); {44528#false} is VALID [2022-02-20 14:47:58,229 INFO L290 TraceCheckUtils]: 61: Hoare triple {44528#false} assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); {44528#false} is VALID [2022-02-20 14:47:58,229 INFO L290 TraceCheckUtils]: 62: Hoare triple {44528#false} assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input#1) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); {44528#false} is VALID [2022-02-20 14:47:58,229 INFO L290 TraceCheckUtils]: 63: Hoare triple {44528#false} assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input#1); {44528#false} is VALID [2022-02-20 14:47:58,229 INFO L290 TraceCheckUtils]: 64: Hoare triple {44528#false} assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input#1 && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); {44528#false} is VALID [2022-02-20 14:47:58,229 INFO L290 TraceCheckUtils]: 65: Hoare triple {44528#false} assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input#1 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); {44528#false} is VALID [2022-02-20 14:47:58,229 INFO L290 TraceCheckUtils]: 66: Hoare triple {44528#false} assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input#1 && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); {44528#false} is VALID [2022-02-20 14:47:58,229 INFO L290 TraceCheckUtils]: 67: Hoare triple {44528#false} assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); {44528#false} is VALID [2022-02-20 14:47:58,229 INFO L290 TraceCheckUtils]: 68: Hoare triple {44528#false} assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input#1) && 9 == ~a17~0) && 9 == ~a28~0); {44528#false} is VALID [2022-02-20 14:47:58,229 INFO L290 TraceCheckUtils]: 69: Hoare triple {44528#false} assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input#1) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); {44528#false} is VALID [2022-02-20 14:47:58,230 INFO L290 TraceCheckUtils]: 70: Hoare triple {44528#false} assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input#1) && !(1 == ~a19~0)) && 1 == ~a21~0); {44528#false} is VALID [2022-02-20 14:47:58,230 INFO L290 TraceCheckUtils]: 71: Hoare triple {44528#false} assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input#1 && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); {44528#false} is VALID [2022-02-20 14:47:58,230 INFO L290 TraceCheckUtils]: 72: Hoare triple {44528#false} assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input#1 && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); {44528#false} is VALID [2022-02-20 14:47:58,230 INFO L290 TraceCheckUtils]: 73: Hoare triple {44528#false} assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input#1) && !(1 == ~a11~0)); {44528#false} is VALID [2022-02-20 14:47:58,230 INFO L290 TraceCheckUtils]: 74: Hoare triple {44528#false} assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input#1 && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); {44528#false} is VALID [2022-02-20 14:47:58,230 INFO L290 TraceCheckUtils]: 75: Hoare triple {44528#false} assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input#1 && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); {44528#false} is VALID [2022-02-20 14:47:58,230 INFO L290 TraceCheckUtils]: 76: Hoare triple {44528#false} assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input#1) && 1 == ~a11~0) && 9 == ~a17~0); {44528#false} is VALID [2022-02-20 14:47:58,230 INFO L290 TraceCheckUtils]: 77: Hoare triple {44528#false} assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); {44528#false} is VALID [2022-02-20 14:47:58,231 INFO L290 TraceCheckUtils]: 78: Hoare triple {44528#false} assume !(1 == ~a19~0 && ((((4 == calculate_output_~input#1 && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); {44528#false} is VALID [2022-02-20 14:47:58,231 INFO L290 TraceCheckUtils]: 79: Hoare triple {44528#false} assume !(8 == ~a17~0 && ((((1 == calculate_output_~input#1 && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); {44528#false} is VALID [2022-02-20 14:47:58,231 INFO L290 TraceCheckUtils]: 80: Hoare triple {44528#false} assume !((((((4 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); {44528#false} is VALID [2022-02-20 14:47:58,231 INFO L290 TraceCheckUtils]: 81: Hoare triple {44528#false} assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input#1) && 1 == ~a19~0) && 1 == ~a21~0); {44528#false} is VALID [2022-02-20 14:47:58,231 INFO L290 TraceCheckUtils]: 82: Hoare triple {44528#false} assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input#1) && 1 == ~a21~0); {44528#false} is VALID [2022-02-20 14:47:58,231 INFO L290 TraceCheckUtils]: 83: Hoare triple {44528#false} assume !((((1 == ~a21~0 && 1 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); {44528#false} is VALID [2022-02-20 14:47:58,231 INFO L290 TraceCheckUtils]: 84: Hoare triple {44528#false} assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input#1) && !(1 == ~a11~0)) && 8 == ~a17~0); {44528#false} is VALID [2022-02-20 14:47:58,231 INFO L290 TraceCheckUtils]: 85: Hoare triple {44528#false} assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input#1) && 8 == ~a17~0) && 1 == ~a21~0); {44528#false} is VALID [2022-02-20 14:47:58,231 INFO L290 TraceCheckUtils]: 86: Hoare triple {44528#false} assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input#1) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); {44528#false} is VALID [2022-02-20 14:47:58,232 INFO L290 TraceCheckUtils]: 87: Hoare triple {44528#false} assume !((8 == ~a17~0 && (((6 == calculate_output_~input#1 && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); {44528#false} is VALID [2022-02-20 14:47:58,232 INFO L290 TraceCheckUtils]: 88: Hoare triple {44528#false} assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input#1 && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); {44528#false} is VALID [2022-02-20 14:47:58,232 INFO L290 TraceCheckUtils]: 89: Hoare triple {44528#false} assume !((((((1 == calculate_output_~input#1 && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); {44528#false} is VALID [2022-02-20 14:47:58,232 INFO L290 TraceCheckUtils]: 90: Hoare triple {44528#false} assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input#1) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); {44528#false} is VALID [2022-02-20 14:47:58,232 INFO L290 TraceCheckUtils]: 91: Hoare triple {44528#false} assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input#1) && 1 == ~a21~0) && !(1 == ~a19~0)); {44528#false} is VALID [2022-02-20 14:47:58,232 INFO L290 TraceCheckUtils]: 92: Hoare triple {44528#false} assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input#1) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); {44528#false} is VALID [2022-02-20 14:47:58,232 INFO L290 TraceCheckUtils]: 93: Hoare triple {44528#false} assume !((9 == ~a17~0 && (((1 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0); {44528#false} is VALID [2022-02-20 14:47:58,232 INFO L290 TraceCheckUtils]: 94: Hoare triple {44528#false} assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input#1) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); {44528#false} is VALID [2022-02-20 14:47:58,232 INFO L290 TraceCheckUtils]: 95: Hoare triple {44528#false} assume !(9 == ~a17~0 && 1 == ~a21~0 && 1 == ~a11~0 && (3 == calculate_output_~input#1 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a19~0); {44528#false} is VALID [2022-02-20 14:47:58,233 INFO L290 TraceCheckUtils]: 96: Hoare triple {44528#false} assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input#1 && !(1 == ~a11~0)); {44528#false} is VALID [2022-02-20 14:47:58,233 INFO L290 TraceCheckUtils]: 97: Hoare triple {44528#false} assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input#1 && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); {44528#false} is VALID [2022-02-20 14:47:58,233 INFO L290 TraceCheckUtils]: 98: Hoare triple {44528#false} assume !((((8 == ~a17~0 && (6 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a21~0) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a19~0); {44528#false} is VALID [2022-02-20 14:47:58,233 INFO L290 TraceCheckUtils]: 99: Hoare triple {44528#false} assume !((!(1 == ~a11~0) && (!(1 == ~a19~0) && ((!(1 == ~a25~0) && 11 == ~a28~0) || (10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) && 5 == calculate_output_~input#1) && 8 == ~a17~0) && 1 == ~a21~0); {44528#false} is VALID [2022-02-20 14:47:58,233 INFO L290 TraceCheckUtils]: 100: Hoare triple {44528#false} assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input#1) && 1 == ~a19~0); {44528#false} is VALID [2022-02-20 14:47:58,233 INFO L290 TraceCheckUtils]: 101: Hoare triple {44528#false} assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input#1) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); {44528#false} is VALID [2022-02-20 14:47:58,233 INFO L290 TraceCheckUtils]: 102: Hoare triple {44528#false} assume !(1 == ~a11~0 && (9 == ~a17~0 && 9 == ~a28~0 && 1 == ~a19~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input#1) && 1 == ~a21~0); {44528#false} is VALID [2022-02-20 14:47:58,233 INFO L290 TraceCheckUtils]: 103: Hoare triple {44528#false} assume !((((((3 == calculate_output_~input#1 && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); {44528#false} is VALID [2022-02-20 14:47:58,234 INFO L290 TraceCheckUtils]: 104: Hoare triple {44528#false} assume !(1 == ~a19~0 && 1 == ~a21~0 && ((5 == calculate_output_~input#1 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a11~0) && 9 == ~a17~0); {44528#false} is VALID [2022-02-20 14:47:58,234 INFO L290 TraceCheckUtils]: 105: Hoare triple {44528#false} assume !((1 == ~a19~0 && ((!(1 == ~a11~0) && (1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input#1) && 10 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0); {44528#false} is VALID [2022-02-20 14:47:58,234 INFO L290 TraceCheckUtils]: 106: Hoare triple {44528#false} assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input#1 && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); {44528#false} is VALID [2022-02-20 14:47:58,234 INFO L290 TraceCheckUtils]: 107: Hoare triple {44528#false} assume !(((!(1 == ~a19~0) && (4 == calculate_output_~input#1 && (((!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); {44528#false} is VALID [2022-02-20 14:47:58,234 INFO L290 TraceCheckUtils]: 108: Hoare triple {44528#false} assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input#1) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); {44528#false} is VALID [2022-02-20 14:47:58,234 INFO L290 TraceCheckUtils]: 109: Hoare triple {44528#false} assume !((((1 == ~a21~0 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (9 == ~a28~0 && 1 == ~a25~0)) && 6 == calculate_output_~input#1) && !(1 == ~a11~0)) && !(1 == ~a19~0)) && 8 == ~a17~0); {44528#false} is VALID [2022-02-20 14:47:58,234 INFO L290 TraceCheckUtils]: 110: Hoare triple {44528#false} assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input#1) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); {44528#false} is VALID [2022-02-20 14:47:58,234 INFO L290 TraceCheckUtils]: 111: Hoare triple {44528#false} assume !(8 == ~a17~0 && (1 == ~a21~0 && (5 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (9 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a19~0) && !(1 == ~a11~0)); {44528#false} is VALID [2022-02-20 14:47:58,234 INFO L290 TraceCheckUtils]: 112: Hoare triple {44528#false} assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input#1 && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); {44528#false} is VALID [2022-02-20 14:47:58,235 INFO L290 TraceCheckUtils]: 113: Hoare triple {44528#false} assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input#1) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); {44528#false} is VALID [2022-02-20 14:47:58,235 INFO L290 TraceCheckUtils]: 114: Hoare triple {44528#false} assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input#1) && 1 == ~a21~0); {44528#false} is VALID [2022-02-20 14:47:58,235 INFO L290 TraceCheckUtils]: 115: Hoare triple {44528#false} assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 6 == calculate_output_~input#1 && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a19~0)); {44528#false} is VALID [2022-02-20 14:47:58,235 INFO L290 TraceCheckUtils]: 116: Hoare triple {44528#false} assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input#1) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); {44528#false} is VALID [2022-02-20 14:47:58,237 INFO L290 TraceCheckUtils]: 117: Hoare triple {44528#false} assume !((8 == ~a17~0 && ((4 == calculate_output_~input#1 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)); {44528#false} is VALID [2022-02-20 14:47:58,237 INFO L290 TraceCheckUtils]: 118: Hoare triple {44528#false} assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input#1) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); {44528#false} is VALID [2022-02-20 14:47:58,237 INFO L290 TraceCheckUtils]: 119: Hoare triple {44528#false} assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input#1) && !(1 == ~a25~0)) && 8 == ~a28~0); {44528#false} is VALID [2022-02-20 14:47:58,237 INFO L290 TraceCheckUtils]: 120: Hoare triple {44528#false} assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input#1) && 11 == ~a28~0); {44528#false} is VALID [2022-02-20 14:47:58,238 INFO L290 TraceCheckUtils]: 121: Hoare triple {44528#false} assume !(1 == ~a19~0 && 8 == ~a17~0 && ((((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input#1) && !(1 == ~a11~0)) && 1 == ~a21~0); {44528#false} is VALID [2022-02-20 14:47:58,238 INFO L290 TraceCheckUtils]: 122: Hoare triple {44528#false} assume ((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0; {44528#false} is VALID [2022-02-20 14:47:58,238 INFO L290 TraceCheckUtils]: 123: Hoare triple {44528#false} assume !false; {44528#false} is VALID [2022-02-20 14:47:58,238 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 14:47:58,238 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:47:58,239 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342091175] [2022-02-20 14:47:58,239 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342091175] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:47:58,239 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:47:58,239 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:47:58,239 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960641521] [2022-02-20 14:47:58,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:47:58,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 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 124 [2022-02-20 14:47:58,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:47:58,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:58,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:47:58,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:47:58,305 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:47:58,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:47:58,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:47:58,305 INFO L87 Difference]: Start difference. First operand 2557 states and 2854 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:59,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:47:59,133 INFO L93 Difference]: Finished difference Result 4534 states and 5065 transitions. [2022-02-20 14:47:59,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:47:59,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 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 124 [2022-02-20 14:47:59,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:47:59,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:59,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2022-02-20 14:47:59,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:59,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2022-02-20 14:47:59,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 438 transitions. [2022-02-20 14:47:59,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 438 edges. 438 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:47:59,534 INFO L225 Difference]: With dead ends: 4534 [2022-02-20 14:47:59,535 INFO L226 Difference]: Without dead ends: 1837 [2022-02-20 14:47:59,537 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 14:47:59,537 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 171 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:47:59,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 19 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:47:59,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states. [2022-02-20 14:47:59,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1837. [2022-02-20 14:47:59,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:47:59,585 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1837 states. Second operand has 1837 states, 1836 states have (on average 1.0648148148148149) internal successors, (1955), 1836 states have internal predecessors, (1955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:59,586 INFO L74 IsIncluded]: Start isIncluded. First operand 1837 states. Second operand has 1837 states, 1836 states have (on average 1.0648148148148149) internal successors, (1955), 1836 states have internal predecessors, (1955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:59,587 INFO L87 Difference]: Start difference. First operand 1837 states. Second operand has 1837 states, 1836 states have (on average 1.0648148148148149) internal successors, (1955), 1836 states have internal predecessors, (1955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:59,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:47:59,674 INFO L93 Difference]: Finished difference Result 1837 states and 1955 transitions. [2022-02-20 14:47:59,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 1955 transitions. [2022-02-20 14:47:59,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:47:59,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:47:59,678 INFO L74 IsIncluded]: Start isIncluded. First operand has 1837 states, 1836 states have (on average 1.0648148148148149) internal successors, (1955), 1836 states have internal predecessors, (1955), 0 states have call successors, (0), 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 1837 states. [2022-02-20 14:47:59,679 INFO L87 Difference]: Start difference. First operand has 1837 states, 1836 states have (on average 1.0648148148148149) internal successors, (1955), 1836 states have internal predecessors, (1955), 0 states have call successors, (0), 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 1837 states. [2022-02-20 14:47:59,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:47:59,771 INFO L93 Difference]: Finished difference Result 1837 states and 1955 transitions. [2022-02-20 14:47:59,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 1955 transitions. [2022-02-20 14:47:59,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:47:59,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:47:59,773 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:47:59,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:47:59,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1837 states, 1836 states have (on average 1.0648148148148149) internal successors, (1955), 1836 states have internal predecessors, (1955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:59,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 1955 transitions. [2022-02-20 14:47:59,867 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 1955 transitions. Word has length 124 [2022-02-20 14:47:59,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:47:59,867 INFO L470 AbstractCegarLoop]: Abstraction has 1837 states and 1955 transitions. [2022-02-20 14:47:59,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:47:59,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 1955 transitions. [2022-02-20 14:47:59,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-02-20 14:47:59,869 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:47:59,870 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:47:59,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 14:47:59,870 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:47:59,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:47:59,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1619560322, now seen corresponding path program 1 times [2022-02-20 14:47:59,871 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:47:59,871 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548455164] [2022-02-20 14:47:59,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:47:59,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:47:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:47:59,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {54667#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);~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; {54667#true} is VALID [2022-02-20 14:47:59,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {54667#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1; {54667#true} is VALID [2022-02-20 14:47:59,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {54667#true} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {54667#true} is VALID [2022-02-20 14:47:59,943 INFO L290 TraceCheckUtils]: 3: Hoare triple {54667#true} assume !((((1 != 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_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {54667#true} is VALID [2022-02-20 14:47:59,943 INFO L290 TraceCheckUtils]: 4: Hoare triple {54667#true} assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); {54667#true} is VALID [2022-02-20 14:47:59,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {54667#true} assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input#1) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); {54667#true} is VALID [2022-02-20 14:47:59,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {54667#true} assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input#1) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); {54667#true} is VALID [2022-02-20 14:47:59,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {54667#true} assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input#1 && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); {54667#true} is VALID [2022-02-20 14:47:59,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {54667#true} assume !(((8 == ~a17~0 && ((1 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); {54667#true} is VALID [2022-02-20 14:47:59,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {54667#true} assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input#1 && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); {54667#true} is VALID [2022-02-20 14:47:59,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {54667#true} assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input#1 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); {54667#true} is VALID [2022-02-20 14:47:59,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {54667#true} assume !(1 == ~a19~0 && (((1 == calculate_output_~input#1 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); {54667#true} is VALID [2022-02-20 14:47:59,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {54667#true} assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); {54667#true} is VALID [2022-02-20 14:47:59,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {54667#true} assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input#1 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); {54667#true} is VALID [2022-02-20 14:47:59,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {54667#true} assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input#1) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); {54667#true} is VALID [2022-02-20 14:47:59,945 INFO L290 TraceCheckUtils]: 15: Hoare triple {54667#true} assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input#1) && !(1 == ~a11~0)) && 8 == ~a17~0); {54667#true} is VALID [2022-02-20 14:47:59,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {54667#true} assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input#1); {54667#true} is VALID [2022-02-20 14:47:59,945 INFO L290 TraceCheckUtils]: 17: Hoare triple {54667#true} assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input#1 && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); {54667#true} is VALID [2022-02-20 14:47:59,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {54667#true} assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); {54667#true} is VALID [2022-02-20 14:47:59,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {54667#true} assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input#1) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); {54667#true} is VALID [2022-02-20 14:47:59,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {54667#true} assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input#1); {54667#true} is VALID [2022-02-20 14:47:59,945 INFO L290 TraceCheckUtils]: 21: Hoare triple {54667#true} assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input#1 && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); {54667#true} is VALID [2022-02-20 14:47:59,946 INFO L290 TraceCheckUtils]: 22: Hoare triple {54667#true} assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input#1 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); {54667#true} is VALID [2022-02-20 14:47:59,946 INFO L290 TraceCheckUtils]: 23: Hoare triple {54667#true} assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input#1 && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); {54667#true} is VALID [2022-02-20 14:47:59,946 INFO L290 TraceCheckUtils]: 24: Hoare triple {54667#true} assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); {54667#true} is VALID [2022-02-20 14:47:59,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {54667#true} assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input#1) && 9 == ~a17~0) && 9 == ~a28~0); {54667#true} is VALID [2022-02-20 14:47:59,946 INFO L290 TraceCheckUtils]: 26: Hoare triple {54667#true} assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input#1) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); {54667#true} is VALID [2022-02-20 14:47:59,946 INFO L290 TraceCheckUtils]: 27: Hoare triple {54667#true} assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input#1) && !(1 == ~a19~0)) && 1 == ~a21~0); {54667#true} is VALID [2022-02-20 14:47:59,946 INFO L290 TraceCheckUtils]: 28: Hoare triple {54667#true} assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input#1 && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); {54667#true} is VALID [2022-02-20 14:47:59,946 INFO L290 TraceCheckUtils]: 29: Hoare triple {54667#true} assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input#1 && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); {54667#true} is VALID [2022-02-20 14:47:59,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {54667#true} assume (1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input#1) && !(1 == ~a11~0);~a25~0 := 1;~a28~0 := 9;calculate_output_#res#1 := 26; {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,947 INFO L290 TraceCheckUtils]: 31: Hoare triple {54669#(not (= ~a11~0 1))} main_#t~ret7#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main_#t~ret7#1 && main_#t~ret7#1 <= 2147483647;main_~output~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1; {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,947 INFO L290 TraceCheckUtils]: 32: Hoare triple {54669#(not (= ~a11~0 1))} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,948 INFO L290 TraceCheckUtils]: 33: Hoare triple {54669#(not (= ~a11~0 1))} assume !((((1 != 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_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,948 INFO L290 TraceCheckUtils]: 34: Hoare triple {54669#(not (= ~a11~0 1))} assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,948 INFO L290 TraceCheckUtils]: 35: Hoare triple {54669#(not (= ~a11~0 1))} assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input#1) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,948 INFO L290 TraceCheckUtils]: 36: Hoare triple {54669#(not (= ~a11~0 1))} assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input#1) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,949 INFO L290 TraceCheckUtils]: 37: Hoare triple {54669#(not (= ~a11~0 1))} assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input#1 && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,949 INFO L290 TraceCheckUtils]: 38: Hoare triple {54669#(not (= ~a11~0 1))} assume !(((8 == ~a17~0 && ((1 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,949 INFO L290 TraceCheckUtils]: 39: Hoare triple {54669#(not (= ~a11~0 1))} assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input#1 && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,949 INFO L290 TraceCheckUtils]: 40: Hoare triple {54669#(not (= ~a11~0 1))} assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input#1 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,950 INFO L290 TraceCheckUtils]: 41: Hoare triple {54669#(not (= ~a11~0 1))} assume !(1 == ~a19~0 && (((1 == calculate_output_~input#1 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,950 INFO L290 TraceCheckUtils]: 42: Hoare triple {54669#(not (= ~a11~0 1))} assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,950 INFO L290 TraceCheckUtils]: 43: Hoare triple {54669#(not (= ~a11~0 1))} assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input#1 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,951 INFO L290 TraceCheckUtils]: 44: Hoare triple {54669#(not (= ~a11~0 1))} assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input#1) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,951 INFO L290 TraceCheckUtils]: 45: Hoare triple {54669#(not (= ~a11~0 1))} assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input#1) && !(1 == ~a11~0)) && 8 == ~a17~0); {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,951 INFO L290 TraceCheckUtils]: 46: Hoare triple {54669#(not (= ~a11~0 1))} assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input#1); {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,951 INFO L290 TraceCheckUtils]: 47: Hoare triple {54669#(not (= ~a11~0 1))} assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input#1 && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,952 INFO L290 TraceCheckUtils]: 48: Hoare triple {54669#(not (= ~a11~0 1))} assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,952 INFO L290 TraceCheckUtils]: 49: Hoare triple {54669#(not (= ~a11~0 1))} assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input#1) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,952 INFO L290 TraceCheckUtils]: 50: Hoare triple {54669#(not (= ~a11~0 1))} assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input#1); {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,962 INFO L290 TraceCheckUtils]: 51: Hoare triple {54669#(not (= ~a11~0 1))} assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input#1 && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,962 INFO L290 TraceCheckUtils]: 52: Hoare triple {54669#(not (= ~a11~0 1))} assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input#1 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,962 INFO L290 TraceCheckUtils]: 53: Hoare triple {54669#(not (= ~a11~0 1))} assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input#1 && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,963 INFO L290 TraceCheckUtils]: 54: Hoare triple {54669#(not (= ~a11~0 1))} assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,963 INFO L290 TraceCheckUtils]: 55: Hoare triple {54669#(not (= ~a11~0 1))} assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input#1) && 9 == ~a17~0) && 9 == ~a28~0); {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,963 INFO L290 TraceCheckUtils]: 56: Hoare triple {54669#(not (= ~a11~0 1))} assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input#1) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,964 INFO L290 TraceCheckUtils]: 57: Hoare triple {54669#(not (= ~a11~0 1))} assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input#1) && !(1 == ~a19~0)) && 1 == ~a21~0); {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,964 INFO L290 TraceCheckUtils]: 58: Hoare triple {54669#(not (= ~a11~0 1))} assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input#1 && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,964 INFO L290 TraceCheckUtils]: 59: Hoare triple {54669#(not (= ~a11~0 1))} assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input#1 && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,964 INFO L290 TraceCheckUtils]: 60: Hoare triple {54669#(not (= ~a11~0 1))} assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input#1) && !(1 == ~a11~0)); {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,965 INFO L290 TraceCheckUtils]: 61: Hoare triple {54669#(not (= ~a11~0 1))} assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input#1 && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,965 INFO L290 TraceCheckUtils]: 62: Hoare triple {54669#(not (= ~a11~0 1))} assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input#1 && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,965 INFO L290 TraceCheckUtils]: 63: Hoare triple {54669#(not (= ~a11~0 1))} assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input#1) && 1 == ~a11~0) && 9 == ~a17~0); {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,966 INFO L290 TraceCheckUtils]: 64: Hoare triple {54669#(not (= ~a11~0 1))} assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,966 INFO L290 TraceCheckUtils]: 65: Hoare triple {54669#(not (= ~a11~0 1))} assume !(1 == ~a19~0 && ((((4 == calculate_output_~input#1 && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,966 INFO L290 TraceCheckUtils]: 66: Hoare triple {54669#(not (= ~a11~0 1))} assume !(8 == ~a17~0 && ((((1 == calculate_output_~input#1 && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,966 INFO L290 TraceCheckUtils]: 67: Hoare triple {54669#(not (= ~a11~0 1))} assume !((((((4 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,967 INFO L290 TraceCheckUtils]: 68: Hoare triple {54669#(not (= ~a11~0 1))} assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input#1) && 1 == ~a19~0) && 1 == ~a21~0); {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,967 INFO L290 TraceCheckUtils]: 69: Hoare triple {54669#(not (= ~a11~0 1))} assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input#1) && 1 == ~a21~0); {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,967 INFO L290 TraceCheckUtils]: 70: Hoare triple {54669#(not (= ~a11~0 1))} assume (((1 == ~a21~0 && 1 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0; {54669#(not (= ~a11~0 1))} is VALID [2022-02-20 14:47:59,968 INFO L290 TraceCheckUtils]: 71: Hoare triple {54669#(not (= ~a11~0 1))} assume 1 == ~a11~0;~a19~0 := 0;~a25~0 := 0;~a28~0 := 9; {54668#false} is VALID [2022-02-20 14:47:59,968 INFO L290 TraceCheckUtils]: 72: Hoare triple {54668#false} calculate_output_#res#1 := 23; {54668#false} is VALID [2022-02-20 14:47:59,968 INFO L290 TraceCheckUtils]: 73: Hoare triple {54668#false} main_#t~ret7#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main_#t~ret7#1 && main_#t~ret7#1 <= 2147483647;main_~output~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1; {54668#false} is VALID [2022-02-20 14:47:59,968 INFO L290 TraceCheckUtils]: 74: Hoare triple {54668#false} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {54668#false} is VALID [2022-02-20 14:47:59,968 INFO L290 TraceCheckUtils]: 75: Hoare triple {54668#false} assume !((((1 != 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_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {54668#false} is VALID [2022-02-20 14:47:59,968 INFO L290 TraceCheckUtils]: 76: Hoare triple {54668#false} assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); {54668#false} is VALID [2022-02-20 14:47:59,968 INFO L290 TraceCheckUtils]: 77: Hoare triple {54668#false} assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input#1) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); {54668#false} is VALID [2022-02-20 14:47:59,968 INFO L290 TraceCheckUtils]: 78: Hoare triple {54668#false} assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input#1) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); {54668#false} is VALID [2022-02-20 14:47:59,972 INFO L290 TraceCheckUtils]: 79: Hoare triple {54668#false} assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input#1 && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); {54668#false} is VALID [2022-02-20 14:47:59,972 INFO L290 TraceCheckUtils]: 80: Hoare triple {54668#false} assume !(((8 == ~a17~0 && ((1 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); {54668#false} is VALID [2022-02-20 14:47:59,973 INFO L290 TraceCheckUtils]: 81: Hoare triple {54668#false} assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input#1 && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); {54668#false} is VALID [2022-02-20 14:47:59,973 INFO L290 TraceCheckUtils]: 82: Hoare triple {54668#false} assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input#1 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); {54668#false} is VALID [2022-02-20 14:47:59,973 INFO L290 TraceCheckUtils]: 83: Hoare triple {54668#false} assume !(1 == ~a19~0 && (((1 == calculate_output_~input#1 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); {54668#false} is VALID [2022-02-20 14:47:59,973 INFO L290 TraceCheckUtils]: 84: Hoare triple {54668#false} assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); {54668#false} is VALID [2022-02-20 14:47:59,973 INFO L290 TraceCheckUtils]: 85: Hoare triple {54668#false} assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input#1 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); {54668#false} is VALID [2022-02-20 14:47:59,973 INFO L290 TraceCheckUtils]: 86: Hoare triple {54668#false} assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input#1) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); {54668#false} is VALID [2022-02-20 14:47:59,973 INFO L290 TraceCheckUtils]: 87: Hoare triple {54668#false} assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input#1) && !(1 == ~a11~0)) && 8 == ~a17~0); {54668#false} is VALID [2022-02-20 14:47:59,973 INFO L290 TraceCheckUtils]: 88: Hoare triple {54668#false} assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input#1); {54668#false} is VALID [2022-02-20 14:47:59,973 INFO L290 TraceCheckUtils]: 89: Hoare triple {54668#false} assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input#1 && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); {54668#false} is VALID [2022-02-20 14:47:59,974 INFO L290 TraceCheckUtils]: 90: Hoare triple {54668#false} assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); {54668#false} is VALID [2022-02-20 14:47:59,974 INFO L290 TraceCheckUtils]: 91: Hoare triple {54668#false} assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input#1) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); {54668#false} is VALID [2022-02-20 14:47:59,974 INFO L290 TraceCheckUtils]: 92: Hoare triple {54668#false} assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input#1); {54668#false} is VALID [2022-02-20 14:47:59,974 INFO L290 TraceCheckUtils]: 93: Hoare triple {54668#false} assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input#1 && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); {54668#false} is VALID [2022-02-20 14:47:59,974 INFO L290 TraceCheckUtils]: 94: Hoare triple {54668#false} assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input#1 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); {54668#false} is VALID [2022-02-20 14:47:59,974 INFO L290 TraceCheckUtils]: 95: Hoare triple {54668#false} assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input#1 && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); {54668#false} is VALID [2022-02-20 14:47:59,974 INFO L290 TraceCheckUtils]: 96: Hoare triple {54668#false} assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); {54668#false} is VALID [2022-02-20 14:47:59,974 INFO L290 TraceCheckUtils]: 97: Hoare triple {54668#false} assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input#1) && 9 == ~a17~0) && 9 == ~a28~0); {54668#false} is VALID [2022-02-20 14:47:59,975 INFO L290 TraceCheckUtils]: 98: Hoare triple {54668#false} assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input#1) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); {54668#false} is VALID [2022-02-20 14:47:59,975 INFO L290 TraceCheckUtils]: 99: Hoare triple {54668#false} assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input#1) && !(1 == ~a19~0)) && 1 == ~a21~0); {54668#false} is VALID [2022-02-20 14:47:59,975 INFO L290 TraceCheckUtils]: 100: Hoare triple {54668#false} assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input#1 && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); {54668#false} is VALID [2022-02-20 14:47:59,975 INFO L290 TraceCheckUtils]: 101: Hoare triple {54668#false} assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input#1 && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); {54668#false} is VALID [2022-02-20 14:47:59,975 INFO L290 TraceCheckUtils]: 102: Hoare triple {54668#false} assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input#1) && !(1 == ~a11~0)); {54668#false} is VALID [2022-02-20 14:47:59,975 INFO L290 TraceCheckUtils]: 103: Hoare triple {54668#false} assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input#1 && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); {54668#false} is VALID [2022-02-20 14:47:59,975 INFO L290 TraceCheckUtils]: 104: Hoare triple {54668#false} assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input#1 && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); {54668#false} is VALID [2022-02-20 14:47:59,975 INFO L290 TraceCheckUtils]: 105: Hoare triple {54668#false} assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input#1) && 1 == ~a11~0) && 9 == ~a17~0); {54668#false} is VALID [2022-02-20 14:47:59,975 INFO L290 TraceCheckUtils]: 106: Hoare triple {54668#false} assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); {54668#false} is VALID [2022-02-20 14:47:59,976 INFO L290 TraceCheckUtils]: 107: Hoare triple {54668#false} assume !(1 == ~a19~0 && ((((4 == calculate_output_~input#1 && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); {54668#false} is VALID [2022-02-20 14:47:59,976 INFO L290 TraceCheckUtils]: 108: Hoare triple {54668#false} assume !(8 == ~a17~0 && ((((1 == calculate_output_~input#1 && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); {54668#false} is VALID [2022-02-20 14:47:59,976 INFO L290 TraceCheckUtils]: 109: Hoare triple {54668#false} assume !((((((4 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); {54668#false} is VALID [2022-02-20 14:47:59,976 INFO L290 TraceCheckUtils]: 110: Hoare triple {54668#false} assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input#1) && 1 == ~a19~0) && 1 == ~a21~0); {54668#false} is VALID [2022-02-20 14:47:59,976 INFO L290 TraceCheckUtils]: 111: Hoare triple {54668#false} assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input#1) && 1 == ~a21~0); {54668#false} is VALID [2022-02-20 14:47:59,976 INFO L290 TraceCheckUtils]: 112: Hoare triple {54668#false} assume !((((1 == ~a21~0 && 1 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); {54668#false} is VALID [2022-02-20 14:47:59,976 INFO L290 TraceCheckUtils]: 113: Hoare triple {54668#false} assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input#1) && !(1 == ~a11~0)) && 8 == ~a17~0); {54668#false} is VALID [2022-02-20 14:47:59,976 INFO L290 TraceCheckUtils]: 114: Hoare triple {54668#false} assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input#1) && 8 == ~a17~0) && 1 == ~a21~0); {54668#false} is VALID [2022-02-20 14:47:59,977 INFO L290 TraceCheckUtils]: 115: Hoare triple {54668#false} assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input#1) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); {54668#false} is VALID [2022-02-20 14:47:59,977 INFO L290 TraceCheckUtils]: 116: Hoare triple {54668#false} assume !((8 == ~a17~0 && (((6 == calculate_output_~input#1 && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); {54668#false} is VALID [2022-02-20 14:47:59,977 INFO L290 TraceCheckUtils]: 117: Hoare triple {54668#false} assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input#1 && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); {54668#false} is VALID [2022-02-20 14:47:59,977 INFO L290 TraceCheckUtils]: 118: Hoare triple {54668#false} assume !((((((1 == calculate_output_~input#1 && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); {54668#false} is VALID [2022-02-20 14:47:59,977 INFO L290 TraceCheckUtils]: 119: Hoare triple {54668#false} assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input#1) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); {54668#false} is VALID [2022-02-20 14:47:59,977 INFO L290 TraceCheckUtils]: 120: Hoare triple {54668#false} assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input#1) && 1 == ~a21~0) && !(1 == ~a19~0)); {54668#false} is VALID [2022-02-20 14:47:59,977 INFO L290 TraceCheckUtils]: 121: Hoare triple {54668#false} assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input#1) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); {54668#false} is VALID [2022-02-20 14:47:59,977 INFO L290 TraceCheckUtils]: 122: Hoare triple {54668#false} assume !((9 == ~a17~0 && (((1 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0); {54668#false} is VALID [2022-02-20 14:47:59,977 INFO L290 TraceCheckUtils]: 123: Hoare triple {54668#false} assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input#1) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); {54668#false} is VALID [2022-02-20 14:47:59,978 INFO L290 TraceCheckUtils]: 124: Hoare triple {54668#false} assume !(9 == ~a17~0 && 1 == ~a21~0 && 1 == ~a11~0 && (3 == calculate_output_~input#1 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a19~0); {54668#false} is VALID [2022-02-20 14:47:59,978 INFO L290 TraceCheckUtils]: 125: Hoare triple {54668#false} assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input#1 && !(1 == ~a11~0)); {54668#false} is VALID [2022-02-20 14:47:59,978 INFO L290 TraceCheckUtils]: 126: Hoare triple {54668#false} assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input#1 && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); {54668#false} is VALID [2022-02-20 14:47:59,978 INFO L290 TraceCheckUtils]: 127: Hoare triple {54668#false} assume !((((8 == ~a17~0 && (6 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a21~0) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a19~0); {54668#false} is VALID [2022-02-20 14:47:59,978 INFO L290 TraceCheckUtils]: 128: Hoare triple {54668#false} assume !((!(1 == ~a11~0) && (!(1 == ~a19~0) && ((!(1 == ~a25~0) && 11 == ~a28~0) || (10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) && 5 == calculate_output_~input#1) && 8 == ~a17~0) && 1 == ~a21~0); {54668#false} is VALID [2022-02-20 14:47:59,978 INFO L290 TraceCheckUtils]: 129: Hoare triple {54668#false} assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input#1) && 1 == ~a19~0); {54668#false} is VALID [2022-02-20 14:47:59,978 INFO L290 TraceCheckUtils]: 130: Hoare triple {54668#false} assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input#1) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); {54668#false} is VALID [2022-02-20 14:47:59,978 INFO L290 TraceCheckUtils]: 131: Hoare triple {54668#false} assume !(1 == ~a11~0 && (9 == ~a17~0 && 9 == ~a28~0 && 1 == ~a19~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input#1) && 1 == ~a21~0); {54668#false} is VALID [2022-02-20 14:47:59,978 INFO L290 TraceCheckUtils]: 132: Hoare triple {54668#false} assume !((((((3 == calculate_output_~input#1 && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); {54668#false} is VALID [2022-02-20 14:47:59,979 INFO L290 TraceCheckUtils]: 133: Hoare triple {54668#false} assume !(1 == ~a19~0 && 1 == ~a21~0 && ((5 == calculate_output_~input#1 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a11~0) && 9 == ~a17~0); {54668#false} is VALID [2022-02-20 14:47:59,979 INFO L290 TraceCheckUtils]: 134: Hoare triple {54668#false} assume !((1 == ~a19~0 && ((!(1 == ~a11~0) && (1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input#1) && 10 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0); {54668#false} is VALID [2022-02-20 14:47:59,979 INFO L290 TraceCheckUtils]: 135: Hoare triple {54668#false} assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input#1 && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); {54668#false} is VALID [2022-02-20 14:47:59,979 INFO L290 TraceCheckUtils]: 136: Hoare triple {54668#false} assume !(((!(1 == ~a19~0) && (4 == calculate_output_~input#1 && (((!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); {54668#false} is VALID [2022-02-20 14:47:59,979 INFO L290 TraceCheckUtils]: 137: Hoare triple {54668#false} assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input#1) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); {54668#false} is VALID [2022-02-20 14:47:59,979 INFO L290 TraceCheckUtils]: 138: Hoare triple {54668#false} assume !((((1 == ~a21~0 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (9 == ~a28~0 && 1 == ~a25~0)) && 6 == calculate_output_~input#1) && !(1 == ~a11~0)) && !(1 == ~a19~0)) && 8 == ~a17~0); {54668#false} is VALID [2022-02-20 14:47:59,979 INFO L290 TraceCheckUtils]: 139: Hoare triple {54668#false} assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input#1) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); {54668#false} is VALID [2022-02-20 14:47:59,979 INFO L290 TraceCheckUtils]: 140: Hoare triple {54668#false} assume !(8 == ~a17~0 && (1 == ~a21~0 && (5 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (9 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a19~0) && !(1 == ~a11~0)); {54668#false} is VALID [2022-02-20 14:47:59,980 INFO L290 TraceCheckUtils]: 141: Hoare triple {54668#false} assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input#1 && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); {54668#false} is VALID [2022-02-20 14:47:59,980 INFO L290 TraceCheckUtils]: 142: Hoare triple {54668#false} assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input#1) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); {54668#false} is VALID [2022-02-20 14:47:59,980 INFO L290 TraceCheckUtils]: 143: Hoare triple {54668#false} assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input#1) && 1 == ~a21~0); {54668#false} is VALID [2022-02-20 14:47:59,980 INFO L290 TraceCheckUtils]: 144: Hoare triple {54668#false} assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 6 == calculate_output_~input#1 && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a19~0)); {54668#false} is VALID [2022-02-20 14:47:59,980 INFO L290 TraceCheckUtils]: 145: Hoare triple {54668#false} assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input#1) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); {54668#false} is VALID [2022-02-20 14:47:59,980 INFO L290 TraceCheckUtils]: 146: Hoare triple {54668#false} assume !((8 == ~a17~0 && ((4 == calculate_output_~input#1 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)); {54668#false} is VALID [2022-02-20 14:47:59,980 INFO L290 TraceCheckUtils]: 147: Hoare triple {54668#false} assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input#1) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); {54668#false} is VALID [2022-02-20 14:47:59,980 INFO L290 TraceCheckUtils]: 148: Hoare triple {54668#false} assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input#1) && !(1 == ~a25~0)) && 8 == ~a28~0); {54668#false} is VALID [2022-02-20 14:47:59,980 INFO L290 TraceCheckUtils]: 149: Hoare triple {54668#false} assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input#1) && 11 == ~a28~0); {54668#false} is VALID [2022-02-20 14:47:59,981 INFO L290 TraceCheckUtils]: 150: Hoare triple {54668#false} assume !(1 == ~a19~0 && 8 == ~a17~0 && ((((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input#1) && !(1 == ~a11~0)) && 1 == ~a21~0); {54668#false} is VALID [2022-02-20 14:47:59,981 INFO L290 TraceCheckUtils]: 151: Hoare triple {54668#false} assume ((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0; {54668#false} is VALID [2022-02-20 14:47:59,981 INFO L290 TraceCheckUtils]: 152: Hoare triple {54668#false} assume !false; {54668#false} is VALID [2022-02-20 14:47:59,981 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:47:59,981 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:47:59,982 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548455164] [2022-02-20 14:47:59,982 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548455164] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:47:59,982 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:47:59,982 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:47:59,982 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435171612] [2022-02-20 14:47:59,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:47:59,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2022-02-20 14:47:59,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:47:59,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:48:00,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:48:00,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:48:00,080 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:48:00,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:48:00,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:48:00,081 INFO L87 Difference]: Start difference. First operand 1837 states and 1955 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:48:00,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:48:00,844 INFO L93 Difference]: Finished difference Result 3531 states and 3768 transitions. [2022-02-20 14:48:00,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:48:00,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2022-02-20 14:48:00,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:48:00,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:48:00,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 547 transitions. [2022-02-20 14:48:00,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:48:00,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 547 transitions. [2022-02-20 14:48:00,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 547 transitions. [2022-02-20 14:48:01,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 547 edges. 547 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:48:01,299 INFO L225 Difference]: With dead ends: 3531 [2022-02-20 14:48:01,299 INFO L226 Difference]: Without dead ends: 2116 [2022-02-20 14:48:01,301 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 14:48:01,301 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 129 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:48:01,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 31 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:48:01,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2116 states. [2022-02-20 14:48:01,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2116 to 1976. [2022-02-20 14:48:01,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:48:01,390 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2116 states. Second operand has 1976 states, 1975 states have (on average 1.0622784810126582) internal successors, (2098), 1975 states have internal predecessors, (2098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:48:01,391 INFO L74 IsIncluded]: Start isIncluded. First operand 2116 states. Second operand has 1976 states, 1975 states have (on average 1.0622784810126582) internal successors, (2098), 1975 states have internal predecessors, (2098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:48:01,392 INFO L87 Difference]: Start difference. First operand 2116 states. Second operand has 1976 states, 1975 states have (on average 1.0622784810126582) internal successors, (2098), 1975 states have internal predecessors, (2098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:48:01,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:48:01,571 INFO L93 Difference]: Finished difference Result 2116 states and 2254 transitions. [2022-02-20 14:48:01,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 2254 transitions. [2022-02-20 14:48:01,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:48:01,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:48:01,575 INFO L74 IsIncluded]: Start isIncluded. First operand has 1976 states, 1975 states have (on average 1.0622784810126582) internal successors, (2098), 1975 states have internal predecessors, (2098), 0 states have call successors, (0), 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 2116 states. [2022-02-20 14:48:01,576 INFO L87 Difference]: Start difference. First operand has 1976 states, 1975 states have (on average 1.0622784810126582) internal successors, (2098), 1975 states have internal predecessors, (2098), 0 states have call successors, (0), 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 2116 states. [2022-02-20 14:48:01,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:48:01,695 INFO L93 Difference]: Finished difference Result 2116 states and 2254 transitions. [2022-02-20 14:48:01,695 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 2254 transitions. [2022-02-20 14:48:01,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:48:01,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:48:01,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:48:01,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:48:01,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1976 states, 1975 states have (on average 1.0622784810126582) internal successors, (2098), 1975 states have internal predecessors, (2098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:48:01,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 2098 transitions. [2022-02-20 14:48:01,805 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 2098 transitions. Word has length 153 [2022-02-20 14:48:01,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:48:01,805 INFO L470 AbstractCegarLoop]: Abstraction has 1976 states and 2098 transitions. [2022-02-20 14:48:01,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:48:01,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 2098 transitions. [2022-02-20 14:48:01,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-02-20 14:48:01,808 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:48:01,808 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:48:01,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 14:48:01,815 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:48:01,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:48:01,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1477057216, now seen corresponding path program 1 times [2022-02-20 14:48:01,816 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:48:01,816 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407183305] [2022-02-20 14:48:01,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:48:01,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:48:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:48:01,930 INFO L290 TraceCheckUtils]: 0: Hoare triple {64489#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);~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; {64489#true} is VALID [2022-02-20 14:48:01,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {64489#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1; {64489#true} is VALID [2022-02-20 14:48:01,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {64489#true} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {64489#true} is VALID [2022-02-20 14:48:01,931 INFO L290 TraceCheckUtils]: 3: Hoare triple {64489#true} assume !((((1 != 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_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {64489#true} is VALID [2022-02-20 14:48:01,931 INFO L290 TraceCheckUtils]: 4: Hoare triple {64489#true} assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); {64489#true} is VALID [2022-02-20 14:48:01,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {64489#true} assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input#1) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); {64489#true} is VALID [2022-02-20 14:48:01,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {64489#true} assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input#1) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); {64489#true} is VALID [2022-02-20 14:48:01,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {64489#true} assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input#1 && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); {64489#true} is VALID [2022-02-20 14:48:01,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {64489#true} assume !(((8 == ~a17~0 && ((1 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); {64489#true} is VALID [2022-02-20 14:48:01,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {64489#true} assume 1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input#1 && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0;~a28~0 := 11;~a25~0 := 1;calculate_output_#res#1 := 26; {64489#true} is VALID [2022-02-20 14:48:01,932 INFO L290 TraceCheckUtils]: 10: Hoare triple {64489#true} main_#t~ret7#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main_#t~ret7#1 && main_#t~ret7#1 <= 2147483647;main_~output~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1; {64489#true} is VALID [2022-02-20 14:48:01,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {64489#true} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {64489#true} is VALID [2022-02-20 14:48:01,932 INFO L290 TraceCheckUtils]: 12: Hoare triple {64489#true} assume !((((1 != 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_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {64489#true} is VALID [2022-02-20 14:48:01,932 INFO L290 TraceCheckUtils]: 13: Hoare triple {64489#true} assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); {64489#true} is VALID [2022-02-20 14:48:01,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {64489#true} assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input#1) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); {64489#true} is VALID [2022-02-20 14:48:01,932 INFO L290 TraceCheckUtils]: 15: Hoare triple {64489#true} assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input#1) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); {64489#true} is VALID [2022-02-20 14:48:01,932 INFO L290 TraceCheckUtils]: 16: Hoare triple {64489#true} assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input#1 && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); {64489#true} is VALID [2022-02-20 14:48:01,933 INFO L290 TraceCheckUtils]: 17: Hoare triple {64489#true} assume !(((8 == ~a17~0 && ((1 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); {64489#true} is VALID [2022-02-20 14:48:01,933 INFO L290 TraceCheckUtils]: 18: Hoare triple {64489#true} assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input#1 && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); {64489#true} is VALID [2022-02-20 14:48:01,933 INFO L290 TraceCheckUtils]: 19: Hoare triple {64489#true} assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input#1 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); {64489#true} is VALID [2022-02-20 14:48:01,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {64489#true} assume !(1 == ~a19~0 && (((1 == calculate_output_~input#1 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); {64489#true} is VALID [2022-02-20 14:48:01,933 INFO L290 TraceCheckUtils]: 21: Hoare triple {64489#true} assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); {64489#true} is VALID [2022-02-20 14:48:01,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {64489#true} assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input#1 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); {64489#true} is VALID [2022-02-20 14:48:01,933 INFO L290 TraceCheckUtils]: 23: Hoare triple {64489#true} assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input#1) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); {64489#true} is VALID [2022-02-20 14:48:01,934 INFO L290 TraceCheckUtils]: 24: Hoare triple {64489#true} assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input#1) && !(1 == ~a11~0)) && 8 == ~a17~0); {64489#true} is VALID [2022-02-20 14:48:01,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {64489#true} assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input#1); {64489#true} is VALID [2022-02-20 14:48:01,934 INFO L290 TraceCheckUtils]: 26: Hoare triple {64489#true} assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input#1 && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); {64489#true} is VALID [2022-02-20 14:48:01,934 INFO L290 TraceCheckUtils]: 27: Hoare triple {64489#true} assume (!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0;~a17~0 := 7;~a25~0 := 0;~a11~0 := 1;~a28~0 := 10;~a19~0 := 0;calculate_output_#res#1 := -1; {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,935 INFO L290 TraceCheckUtils]: 28: Hoare triple {64491#(= ~a11~0 1)} main_#t~ret7#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main_#t~ret7#1 && main_#t~ret7#1 <= 2147483647;main_~output~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1; {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,935 INFO L290 TraceCheckUtils]: 29: Hoare triple {64491#(= ~a11~0 1)} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,935 INFO L290 TraceCheckUtils]: 30: Hoare triple {64491#(= ~a11~0 1)} assume !((((1 != 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_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,936 INFO L290 TraceCheckUtils]: 31: Hoare triple {64491#(= ~a11~0 1)} assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,936 INFO L290 TraceCheckUtils]: 32: Hoare triple {64491#(= ~a11~0 1)} assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input#1) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,936 INFO L290 TraceCheckUtils]: 33: Hoare triple {64491#(= ~a11~0 1)} assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input#1) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,937 INFO L290 TraceCheckUtils]: 34: Hoare triple {64491#(= ~a11~0 1)} assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input#1 && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,937 INFO L290 TraceCheckUtils]: 35: Hoare triple {64491#(= ~a11~0 1)} assume !(((8 == ~a17~0 && ((1 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,937 INFO L290 TraceCheckUtils]: 36: Hoare triple {64491#(= ~a11~0 1)} assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input#1 && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,938 INFO L290 TraceCheckUtils]: 37: Hoare triple {64491#(= ~a11~0 1)} assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input#1 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,938 INFO L290 TraceCheckUtils]: 38: Hoare triple {64491#(= ~a11~0 1)} assume !(1 == ~a19~0 && (((1 == calculate_output_~input#1 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,938 INFO L290 TraceCheckUtils]: 39: Hoare triple {64491#(= ~a11~0 1)} assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,938 INFO L290 TraceCheckUtils]: 40: Hoare triple {64491#(= ~a11~0 1)} assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input#1 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,939 INFO L290 TraceCheckUtils]: 41: Hoare triple {64491#(= ~a11~0 1)} assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input#1) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,939 INFO L290 TraceCheckUtils]: 42: Hoare triple {64491#(= ~a11~0 1)} assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input#1) && !(1 == ~a11~0)) && 8 == ~a17~0); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,939 INFO L290 TraceCheckUtils]: 43: Hoare triple {64491#(= ~a11~0 1)} assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input#1); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,940 INFO L290 TraceCheckUtils]: 44: Hoare triple {64491#(= ~a11~0 1)} assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input#1 && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,940 INFO L290 TraceCheckUtils]: 45: Hoare triple {64491#(= ~a11~0 1)} assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,940 INFO L290 TraceCheckUtils]: 46: Hoare triple {64491#(= ~a11~0 1)} assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input#1) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,941 INFO L290 TraceCheckUtils]: 47: Hoare triple {64491#(= ~a11~0 1)} assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input#1); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,941 INFO L290 TraceCheckUtils]: 48: Hoare triple {64491#(= ~a11~0 1)} assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input#1 && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,941 INFO L290 TraceCheckUtils]: 49: Hoare triple {64491#(= ~a11~0 1)} assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input#1 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,942 INFO L290 TraceCheckUtils]: 50: Hoare triple {64491#(= ~a11~0 1)} assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input#1 && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,942 INFO L290 TraceCheckUtils]: 51: Hoare triple {64491#(= ~a11~0 1)} assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,942 INFO L290 TraceCheckUtils]: 52: Hoare triple {64491#(= ~a11~0 1)} assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input#1) && 9 == ~a17~0) && 9 == ~a28~0); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,943 INFO L290 TraceCheckUtils]: 53: Hoare triple {64491#(= ~a11~0 1)} assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input#1) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,943 INFO L290 TraceCheckUtils]: 54: Hoare triple {64491#(= ~a11~0 1)} assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input#1) && !(1 == ~a19~0)) && 1 == ~a21~0); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,943 INFO L290 TraceCheckUtils]: 55: Hoare triple {64491#(= ~a11~0 1)} assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input#1 && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,943 INFO L290 TraceCheckUtils]: 56: Hoare triple {64491#(= ~a11~0 1)} assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input#1 && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,944 INFO L290 TraceCheckUtils]: 57: Hoare triple {64491#(= ~a11~0 1)} assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input#1) && !(1 == ~a11~0)); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,944 INFO L290 TraceCheckUtils]: 58: Hoare triple {64491#(= ~a11~0 1)} assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input#1 && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,944 INFO L290 TraceCheckUtils]: 59: Hoare triple {64491#(= ~a11~0 1)} assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input#1 && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,945 INFO L290 TraceCheckUtils]: 60: Hoare triple {64491#(= ~a11~0 1)} assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input#1) && 1 == ~a11~0) && 9 == ~a17~0); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,945 INFO L290 TraceCheckUtils]: 61: Hoare triple {64491#(= ~a11~0 1)} assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,945 INFO L290 TraceCheckUtils]: 62: Hoare triple {64491#(= ~a11~0 1)} assume !(1 == ~a19~0 && ((((4 == calculate_output_~input#1 && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,946 INFO L290 TraceCheckUtils]: 63: Hoare triple {64491#(= ~a11~0 1)} assume !(8 == ~a17~0 && ((((1 == calculate_output_~input#1 && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,946 INFO L290 TraceCheckUtils]: 64: Hoare triple {64491#(= ~a11~0 1)} assume !((((((4 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,946 INFO L290 TraceCheckUtils]: 65: Hoare triple {64491#(= ~a11~0 1)} assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input#1) && 1 == ~a19~0) && 1 == ~a21~0); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,947 INFO L290 TraceCheckUtils]: 66: Hoare triple {64491#(= ~a11~0 1)} assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input#1) && 1 == ~a21~0); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,947 INFO L290 TraceCheckUtils]: 67: Hoare triple {64491#(= ~a11~0 1)} assume !((((1 == ~a21~0 && 1 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,947 INFO L290 TraceCheckUtils]: 68: Hoare triple {64491#(= ~a11~0 1)} assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input#1) && !(1 == ~a11~0)) && 8 == ~a17~0); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,948 INFO L290 TraceCheckUtils]: 69: Hoare triple {64491#(= ~a11~0 1)} assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input#1) && 8 == ~a17~0) && 1 == ~a21~0); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,948 INFO L290 TraceCheckUtils]: 70: Hoare triple {64491#(= ~a11~0 1)} assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input#1) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,948 INFO L290 TraceCheckUtils]: 71: Hoare triple {64491#(= ~a11~0 1)} assume !((8 == ~a17~0 && (((6 == calculate_output_~input#1 && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,948 INFO L290 TraceCheckUtils]: 72: Hoare triple {64491#(= ~a11~0 1)} assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input#1 && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,949 INFO L290 TraceCheckUtils]: 73: Hoare triple {64491#(= ~a11~0 1)} assume !((((((1 == calculate_output_~input#1 && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,949 INFO L290 TraceCheckUtils]: 74: Hoare triple {64491#(= ~a11~0 1)} assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input#1) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); {64491#(= ~a11~0 1)} is VALID [2022-02-20 14:48:01,950 INFO L290 TraceCheckUtils]: 75: Hoare triple {64491#(= ~a11~0 1)} assume !(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input#1) && 1 == ~a21~0) && !(1 == ~a19~0); {64490#false} is VALID [2022-02-20 14:48:01,950 INFO L290 TraceCheckUtils]: 76: Hoare triple {64490#false} assume !(1 == ~a25~0);~a28~0 := 7;~a25~0 := 1; {64490#false} is VALID [2022-02-20 14:48:01,950 INFO L290 TraceCheckUtils]: 77: Hoare triple {64490#false} calculate_output_#res#1 := -1; {64490#false} is VALID [2022-02-20 14:48:01,950 INFO L290 TraceCheckUtils]: 78: Hoare triple {64490#false} main_#t~ret7#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main_#t~ret7#1 && main_#t~ret7#1 <= 2147483647;main_~output~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1; {64490#false} is VALID [2022-02-20 14:48:01,950 INFO L290 TraceCheckUtils]: 79: Hoare triple {64490#false} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {64490#false} is VALID [2022-02-20 14:48:01,950 INFO L290 TraceCheckUtils]: 80: Hoare triple {64490#false} assume !((((1 != 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_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {64490#false} is VALID [2022-02-20 14:48:01,951 INFO L290 TraceCheckUtils]: 81: Hoare triple {64490#false} assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); {64490#false} is VALID [2022-02-20 14:48:01,951 INFO L290 TraceCheckUtils]: 82: Hoare triple {64490#false} assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input#1) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); {64490#false} is VALID [2022-02-20 14:48:01,951 INFO L290 TraceCheckUtils]: 83: Hoare triple {64490#false} assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input#1) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); {64490#false} is VALID [2022-02-20 14:48:01,951 INFO L290 TraceCheckUtils]: 84: Hoare triple {64490#false} assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input#1 && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); {64490#false} is VALID [2022-02-20 14:48:01,951 INFO L290 TraceCheckUtils]: 85: Hoare triple {64490#false} assume !(((8 == ~a17~0 && ((1 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); {64490#false} is VALID [2022-02-20 14:48:01,951 INFO L290 TraceCheckUtils]: 86: Hoare triple {64490#false} assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input#1 && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); {64490#false} is VALID [2022-02-20 14:48:01,951 INFO L290 TraceCheckUtils]: 87: Hoare triple {64490#false} assume (((!(1 == ~a19~0) && 1 == calculate_output_~input#1 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0);~a28~0 := 7;~a11~0 := 1;~a25~0 := 0;calculate_output_#res#1 := -1; {64490#false} is VALID [2022-02-20 14:48:01,951 INFO L290 TraceCheckUtils]: 88: Hoare triple {64490#false} main_#t~ret7#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main_#t~ret7#1 && main_#t~ret7#1 <= 2147483647;main_~output~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1; {64490#false} is VALID [2022-02-20 14:48:01,952 INFO L290 TraceCheckUtils]: 89: Hoare triple {64490#false} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {64490#false} is VALID [2022-02-20 14:48:01,952 INFO L290 TraceCheckUtils]: 90: Hoare triple {64490#false} assume !((((1 != 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_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {64490#false} is VALID [2022-02-20 14:48:01,952 INFO L290 TraceCheckUtils]: 91: Hoare triple {64490#false} assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); {64490#false} is VALID [2022-02-20 14:48:01,952 INFO L290 TraceCheckUtils]: 92: Hoare triple {64490#false} assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input#1) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); {64490#false} is VALID [2022-02-20 14:48:01,952 INFO L290 TraceCheckUtils]: 93: Hoare triple {64490#false} assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input#1) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); {64490#false} is VALID [2022-02-20 14:48:01,952 INFO L290 TraceCheckUtils]: 94: Hoare triple {64490#false} assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input#1 && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); {64490#false} is VALID [2022-02-20 14:48:01,952 INFO L290 TraceCheckUtils]: 95: Hoare triple {64490#false} assume !(((8 == ~a17~0 && ((1 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); {64490#false} is VALID [2022-02-20 14:48:01,952 INFO L290 TraceCheckUtils]: 96: Hoare triple {64490#false} assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input#1 && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); {64490#false} is VALID [2022-02-20 14:48:01,952 INFO L290 TraceCheckUtils]: 97: Hoare triple {64490#false} assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input#1 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); {64490#false} is VALID [2022-02-20 14:48:01,953 INFO L290 TraceCheckUtils]: 98: Hoare triple {64490#false} assume !(1 == ~a19~0 && (((1 == calculate_output_~input#1 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); {64490#false} is VALID [2022-02-20 14:48:01,953 INFO L290 TraceCheckUtils]: 99: Hoare triple {64490#false} assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); {64490#false} is VALID [2022-02-20 14:48:01,953 INFO L290 TraceCheckUtils]: 100: Hoare triple {64490#false} assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input#1 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); {64490#false} is VALID [2022-02-20 14:48:01,953 INFO L290 TraceCheckUtils]: 101: Hoare triple {64490#false} assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input#1) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); {64490#false} is VALID [2022-02-20 14:48:01,953 INFO L290 TraceCheckUtils]: 102: Hoare triple {64490#false} assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input#1) && !(1 == ~a11~0)) && 8 == ~a17~0); {64490#false} is VALID [2022-02-20 14:48:01,953 INFO L290 TraceCheckUtils]: 103: Hoare triple {64490#false} assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input#1); {64490#false} is VALID [2022-02-20 14:48:01,953 INFO L290 TraceCheckUtils]: 104: Hoare triple {64490#false} assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input#1 && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); {64490#false} is VALID [2022-02-20 14:48:01,953 INFO L290 TraceCheckUtils]: 105: Hoare triple {64490#false} assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); {64490#false} is VALID [2022-02-20 14:48:01,953 INFO L290 TraceCheckUtils]: 106: Hoare triple {64490#false} assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input#1) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); {64490#false} is VALID [2022-02-20 14:48:01,954 INFO L290 TraceCheckUtils]: 107: Hoare triple {64490#false} assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input#1); {64490#false} is VALID [2022-02-20 14:48:01,954 INFO L290 TraceCheckUtils]: 108: Hoare triple {64490#false} assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input#1 && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); {64490#false} is VALID [2022-02-20 14:48:01,954 INFO L290 TraceCheckUtils]: 109: Hoare triple {64490#false} assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input#1 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); {64490#false} is VALID [2022-02-20 14:48:01,954 INFO L290 TraceCheckUtils]: 110: Hoare triple {64490#false} assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input#1 && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); {64490#false} is VALID [2022-02-20 14:48:01,954 INFO L290 TraceCheckUtils]: 111: Hoare triple {64490#false} assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); {64490#false} is VALID [2022-02-20 14:48:01,966 INFO L290 TraceCheckUtils]: 112: Hoare triple {64490#false} assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input#1) && 9 == ~a17~0) && 9 == ~a28~0); {64490#false} is VALID [2022-02-20 14:48:01,966 INFO L290 TraceCheckUtils]: 113: Hoare triple {64490#false} assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input#1) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); {64490#false} is VALID [2022-02-20 14:48:01,966 INFO L290 TraceCheckUtils]: 114: Hoare triple {64490#false} assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input#1) && !(1 == ~a19~0)) && 1 == ~a21~0); {64490#false} is VALID [2022-02-20 14:48:01,966 INFO L290 TraceCheckUtils]: 115: Hoare triple {64490#false} assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input#1 && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); {64490#false} is VALID [2022-02-20 14:48:01,966 INFO L290 TraceCheckUtils]: 116: Hoare triple {64490#false} assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input#1 && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); {64490#false} is VALID [2022-02-20 14:48:01,966 INFO L290 TraceCheckUtils]: 117: Hoare triple {64490#false} assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input#1) && !(1 == ~a11~0)); {64490#false} is VALID [2022-02-20 14:48:01,966 INFO L290 TraceCheckUtils]: 118: Hoare triple {64490#false} assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input#1 && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); {64490#false} is VALID [2022-02-20 14:48:01,967 INFO L290 TraceCheckUtils]: 119: Hoare triple {64490#false} assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input#1 && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); {64490#false} is VALID [2022-02-20 14:48:01,967 INFO L290 TraceCheckUtils]: 120: Hoare triple {64490#false} assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input#1) && 1 == ~a11~0) && 9 == ~a17~0); {64490#false} is VALID [2022-02-20 14:48:01,967 INFO L290 TraceCheckUtils]: 121: Hoare triple {64490#false} assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input#1 && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); {64490#false} is VALID [2022-02-20 14:48:01,967 INFO L290 TraceCheckUtils]: 122: Hoare triple {64490#false} assume !(1 == ~a19~0 && ((((4 == calculate_output_~input#1 && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); {64490#false} is VALID [2022-02-20 14:48:01,967 INFO L290 TraceCheckUtils]: 123: Hoare triple {64490#false} assume !(8 == ~a17~0 && ((((1 == calculate_output_~input#1 && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); {64490#false} is VALID [2022-02-20 14:48:01,967 INFO L290 TraceCheckUtils]: 124: Hoare triple {64490#false} assume !((((((4 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); {64490#false} is VALID [2022-02-20 14:48:01,967 INFO L290 TraceCheckUtils]: 125: Hoare triple {64490#false} assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input#1) && 1 == ~a19~0) && 1 == ~a21~0); {64490#false} is VALID [2022-02-20 14:48:01,967 INFO L290 TraceCheckUtils]: 126: Hoare triple {64490#false} assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input#1) && 1 == ~a21~0); {64490#false} is VALID [2022-02-20 14:48:01,967 INFO L290 TraceCheckUtils]: 127: Hoare triple {64490#false} assume !((((1 == ~a21~0 && 1 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); {64490#false} is VALID [2022-02-20 14:48:01,968 INFO L290 TraceCheckUtils]: 128: Hoare triple {64490#false} assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input#1) && !(1 == ~a11~0)) && 8 == ~a17~0); {64490#false} is VALID [2022-02-20 14:48:01,968 INFO L290 TraceCheckUtils]: 129: Hoare triple {64490#false} assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input#1) && 8 == ~a17~0) && 1 == ~a21~0); {64490#false} is VALID [2022-02-20 14:48:01,968 INFO L290 TraceCheckUtils]: 130: Hoare triple {64490#false} assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input#1) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); {64490#false} is VALID [2022-02-20 14:48:01,968 INFO L290 TraceCheckUtils]: 131: Hoare triple {64490#false} assume !((8 == ~a17~0 && (((6 == calculate_output_~input#1 && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); {64490#false} is VALID [2022-02-20 14:48:01,968 INFO L290 TraceCheckUtils]: 132: Hoare triple {64490#false} assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input#1 && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); {64490#false} is VALID [2022-02-20 14:48:01,968 INFO L290 TraceCheckUtils]: 133: Hoare triple {64490#false} assume !((((((1 == calculate_output_~input#1 && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); {64490#false} is VALID [2022-02-20 14:48:01,968 INFO L290 TraceCheckUtils]: 134: Hoare triple {64490#false} assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input#1) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); {64490#false} is VALID [2022-02-20 14:48:01,968 INFO L290 TraceCheckUtils]: 135: Hoare triple {64490#false} assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input#1) && 1 == ~a21~0) && !(1 == ~a19~0)); {64490#false} is VALID [2022-02-20 14:48:01,968 INFO L290 TraceCheckUtils]: 136: Hoare triple {64490#false} assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input#1) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); {64490#false} is VALID [2022-02-20 14:48:01,969 INFO L290 TraceCheckUtils]: 137: Hoare triple {64490#false} assume !((9 == ~a17~0 && (((1 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0); {64490#false} is VALID [2022-02-20 14:48:01,969 INFO L290 TraceCheckUtils]: 138: Hoare triple {64490#false} assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input#1) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); {64490#false} is VALID [2022-02-20 14:48:01,969 INFO L290 TraceCheckUtils]: 139: Hoare triple {64490#false} assume !(9 == ~a17~0 && 1 == ~a21~0 && 1 == ~a11~0 && (3 == calculate_output_~input#1 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a19~0); {64490#false} is VALID [2022-02-20 14:48:01,969 INFO L290 TraceCheckUtils]: 140: Hoare triple {64490#false} assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input#1 && !(1 == ~a11~0)); {64490#false} is VALID [2022-02-20 14:48:01,969 INFO L290 TraceCheckUtils]: 141: Hoare triple {64490#false} assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input#1 && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); {64490#false} is VALID [2022-02-20 14:48:01,969 INFO L290 TraceCheckUtils]: 142: Hoare triple {64490#false} assume !((((8 == ~a17~0 && (6 == calculate_output_~input#1 && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a21~0) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a19~0); {64490#false} is VALID [2022-02-20 14:48:01,969 INFO L290 TraceCheckUtils]: 143: Hoare triple {64490#false} assume !((!(1 == ~a11~0) && (!(1 == ~a19~0) && ((!(1 == ~a25~0) && 11 == ~a28~0) || (10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) && 5 == calculate_output_~input#1) && 8 == ~a17~0) && 1 == ~a21~0); {64490#false} is VALID [2022-02-20 14:48:01,969 INFO L290 TraceCheckUtils]: 144: Hoare triple {64490#false} assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input#1) && 1 == ~a19~0); {64490#false} is VALID [2022-02-20 14:48:01,969 INFO L290 TraceCheckUtils]: 145: Hoare triple {64490#false} assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input#1) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); {64490#false} is VALID [2022-02-20 14:48:01,970 INFO L290 TraceCheckUtils]: 146: Hoare triple {64490#false} assume !(1 == ~a11~0 && (9 == ~a17~0 && 9 == ~a28~0 && 1 == ~a19~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input#1) && 1 == ~a21~0); {64490#false} is VALID [2022-02-20 14:48:01,970 INFO L290 TraceCheckUtils]: 147: Hoare triple {64490#false} assume !((((((3 == calculate_output_~input#1 && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); {64490#false} is VALID [2022-02-20 14:48:01,970 INFO L290 TraceCheckUtils]: 148: Hoare triple {64490#false} assume !(1 == ~a19~0 && 1 == ~a21~0 && ((5 == calculate_output_~input#1 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a11~0) && 9 == ~a17~0); {64490#false} is VALID [2022-02-20 14:48:01,970 INFO L290 TraceCheckUtils]: 149: Hoare triple {64490#false} assume !((1 == ~a19~0 && ((!(1 == ~a11~0) && (1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input#1) && 10 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0); {64490#false} is VALID [2022-02-20 14:48:01,970 INFO L290 TraceCheckUtils]: 150: Hoare triple {64490#false} assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input#1 && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); {64490#false} is VALID [2022-02-20 14:48:01,970 INFO L290 TraceCheckUtils]: 151: Hoare triple {64490#false} assume !(((!(1 == ~a19~0) && (4 == calculate_output_~input#1 && (((!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); {64490#false} is VALID [2022-02-20 14:48:01,970 INFO L290 TraceCheckUtils]: 152: Hoare triple {64490#false} assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input#1) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); {64490#false} is VALID [2022-02-20 14:48:01,970 INFO L290 TraceCheckUtils]: 153: Hoare triple {64490#false} assume !((((1 == ~a21~0 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (9 == ~a28~0 && 1 == ~a25~0)) && 6 == calculate_output_~input#1) && !(1 == ~a11~0)) && !(1 == ~a19~0)) && 8 == ~a17~0); {64490#false} is VALID [2022-02-20 14:48:01,971 INFO L290 TraceCheckUtils]: 154: Hoare triple {64490#false} assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input#1) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); {64490#false} is VALID [2022-02-20 14:48:01,971 INFO L290 TraceCheckUtils]: 155: Hoare triple {64490#false} assume !(8 == ~a17~0 && (1 == ~a21~0 && (5 == calculate_output_~input#1 && ((!(1 == ~a25~0) && 8 == ~a28~0) || (9 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a19~0) && !(1 == ~a11~0)); {64490#false} is VALID [2022-02-20 14:48:01,971 INFO L290 TraceCheckUtils]: 156: Hoare triple {64490#false} assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input#1 && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); {64490#false} is VALID [2022-02-20 14:48:01,971 INFO L290 TraceCheckUtils]: 157: Hoare triple {64490#false} assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input#1) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); {64490#false} is VALID [2022-02-20 14:48:01,971 INFO L290 TraceCheckUtils]: 158: Hoare triple {64490#false} assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input#1) && 1 == ~a21~0); {64490#false} is VALID [2022-02-20 14:48:01,971 INFO L290 TraceCheckUtils]: 159: Hoare triple {64490#false} assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 6 == calculate_output_~input#1 && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a19~0)); {64490#false} is VALID [2022-02-20 14:48:01,971 INFO L290 TraceCheckUtils]: 160: Hoare triple {64490#false} assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input#1) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); {64490#false} is VALID [2022-02-20 14:48:01,971 INFO L290 TraceCheckUtils]: 161: Hoare triple {64490#false} assume !((8 == ~a17~0 && ((4 == calculate_output_~input#1 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)); {64490#false} is VALID [2022-02-20 14:48:01,971 INFO L290 TraceCheckUtils]: 162: Hoare triple {64490#false} assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input#1) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); {64490#false} is VALID [2022-02-20 14:48:01,972 INFO L290 TraceCheckUtils]: 163: Hoare triple {64490#false} assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input#1) && !(1 == ~a25~0)) && 8 == ~a28~0); {64490#false} is VALID [2022-02-20 14:48:01,972 INFO L290 TraceCheckUtils]: 164: Hoare triple {64490#false} assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input#1) && 11 == ~a28~0); {64490#false} is VALID [2022-02-20 14:48:01,972 INFO L290 TraceCheckUtils]: 165: Hoare triple {64490#false} assume !(1 == ~a19~0 && 8 == ~a17~0 && ((((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input#1) && !(1 == ~a11~0)) && 1 == ~a21~0); {64490#false} is VALID [2022-02-20 14:48:01,972 INFO L290 TraceCheckUtils]: 166: Hoare triple {64490#false} assume ((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0; {64490#false} is VALID [2022-02-20 14:48:01,972 INFO L290 TraceCheckUtils]: 167: Hoare triple {64490#false} assume !false; {64490#false} is VALID [2022-02-20 14:48:01,972 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-20 14:48:01,973 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:48:01,973 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407183305] [2022-02-20 14:48:01,973 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407183305] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:48:01,973 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:48:01,973 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:48:01,973 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635821414] [2022-02-20 14:48:01,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:48:01,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 168 [2022-02-20 14:48:01,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:48:01,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:48:02,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:48:02,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:48:02,106 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:48:02,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:48:02,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:48:02,106 INFO L87 Difference]: Start difference. First operand 1976 states and 2098 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:48:03,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:48:03,159 INFO L93 Difference]: Finished difference Result 3670 states and 3908 transitions. [2022-02-20 14:48:03,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:48:03,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 168 [2022-02-20 14:48:03,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:48:03,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:48:03,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 544 transitions. [2022-02-20 14:48:03,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:48:03,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 544 transitions. [2022-02-20 14:48:03,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 544 transitions. [2022-02-20 14:48:03,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 544 edges. 544 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:48:03,588 INFO L225 Difference]: With dead ends: 3670 [2022-02-20 14:48:03,588 INFO L226 Difference]: Without dead ends: 1416 [2022-02-20 14:48:03,591 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 14:48:03,592 INFO L933 BasicCegarLoop]: 192 mSDtfsCounter, 95 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:48:03,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 207 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:48:03,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2022-02-20 14:48:03,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1416. [2022-02-20 14:48:03,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:48:03,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1416 states. Second operand has 1416 states, 1415 states have (on average 1.0494699646643109) internal successors, (1485), 1415 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:48:03,633 INFO L74 IsIncluded]: Start isIncluded. First operand 1416 states. Second operand has 1416 states, 1415 states have (on average 1.0494699646643109) internal successors, (1485), 1415 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:48:03,634 INFO L87 Difference]: Start difference. First operand 1416 states. Second operand has 1416 states, 1415 states have (on average 1.0494699646643109) internal successors, (1485), 1415 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:48:03,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:48:03,710 INFO L93 Difference]: Finished difference Result 1416 states and 1485 transitions. [2022-02-20 14:48:03,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 1485 transitions. [2022-02-20 14:48:03,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:48:03,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:48:03,713 INFO L74 IsIncluded]: Start isIncluded. First operand has 1416 states, 1415 states have (on average 1.0494699646643109) internal successors, (1485), 1415 states have internal predecessors, (1485), 0 states have call successors, (0), 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 1416 states. [2022-02-20 14:48:03,714 INFO L87 Difference]: Start difference. First operand has 1416 states, 1415 states have (on average 1.0494699646643109) internal successors, (1485), 1415 states have internal predecessors, (1485), 0 states have call successors, (0), 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 1416 states. [2022-02-20 14:48:03,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:48:03,791 INFO L93 Difference]: Finished difference Result 1416 states and 1485 transitions. [2022-02-20 14:48:03,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 1485 transitions. [2022-02-20 14:48:03,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:48:03,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:48:03,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:48:03,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:48:03,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1416 states, 1415 states have (on average 1.0494699646643109) internal successors, (1485), 1415 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:48:03,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 1485 transitions. [2022-02-20 14:48:03,888 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 1485 transitions. Word has length 168 [2022-02-20 14:48:03,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:48:03,889 INFO L470 AbstractCegarLoop]: Abstraction has 1416 states and 1485 transitions. [2022-02-20 14:48:03,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:48:03,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 1485 transitions. [2022-02-20 14:48:03,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-02-20 14:48:03,891 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:48:03,891 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:48:03,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 14:48:03,891 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:48:03,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:48:03,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1167918892, now seen corresponding path program 1 times [2022-02-20 14:48:03,892 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:48:03,892 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350747582] [2022-02-20 14:48:03,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:48:03,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:48:03,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 14:48:03,938 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 14:48:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 14:48:04,029 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 14:48:04,029 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 14:48:04,030 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 14:48:04,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 14:48:04,033 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:48:04,036 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 14:48:04,188 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 14:48:04,189 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 14:48:04,189 WARN L170 areAnnotationChecker]: L616-2 has no Hoare annotation [2022-02-20 14:48:04,189 WARN L170 areAnnotationChecker]: L616-2 has no Hoare annotation [2022-02-20 14:48:04,189 WARN L170 areAnnotationChecker]: L616-2 has no Hoare annotation [2022-02-20 14:48:04,189 WARN L170 areAnnotationChecker]: L610 has no Hoare annotation [2022-02-20 14:48:04,189 WARN L170 areAnnotationChecker]: L621 has no Hoare annotation [2022-02-20 14:48:04,189 WARN L170 areAnnotationChecker]: L621 has no Hoare annotation [2022-02-20 14:48:04,189 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 14:48:04,190 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 14:48:04,190 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 14:48:04,190 WARN L170 areAnnotationChecker]: L607 has no Hoare annotation [2022-02-20 14:48:04,190 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-02-20 14:48:04,190 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-02-20 14:48:04,190 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 14:48:04,190 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 14:48:04,190 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-02-20 14:48:04,190 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-02-20 14:48:04,191 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 14:48:04,191 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 14:48:04,191 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 14:48:04,191 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 14:48:04,191 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2022-02-20 14:48:04,191 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2022-02-20 14:48:04,191 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 14:48:04,191 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 14:48:04,191 WARN L170 areAnnotationChecker]: L75 has no Hoare annotation [2022-02-20 14:48:04,191 WARN L170 areAnnotationChecker]: L75 has no Hoare annotation [2022-02-20 14:48:04,192 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2022-02-20 14:48:04,192 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2022-02-20 14:48:04,192 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-02-20 14:48:04,192 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-02-20 14:48:04,192 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2022-02-20 14:48:04,192 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2022-02-20 14:48:04,192 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2022-02-20 14:48:04,192 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2022-02-20 14:48:04,192 WARN L170 areAnnotationChecker]: L85-2 has no Hoare annotation [2022-02-20 14:48:04,193 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2022-02-20 14:48:04,193 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2022-02-20 14:48:04,193 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2022-02-20 14:48:04,193 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2022-02-20 14:48:04,193 WARN L170 areAnnotationChecker]: L93-2 has no Hoare annotation [2022-02-20 14:48:04,193 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2022-02-20 14:48:04,193 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2022-02-20 14:48:04,193 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 14:48:04,193 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 14:48:04,193 WARN L170 areAnnotationChecker]: L116 has no Hoare annotation [2022-02-20 14:48:04,194 WARN L170 areAnnotationChecker]: L116 has no Hoare annotation [2022-02-20 14:48:04,194 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-02-20 14:48:04,194 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-02-20 14:48:04,194 WARN L170 areAnnotationChecker]: L129 has no Hoare annotation [2022-02-20 14:48:04,194 WARN L170 areAnnotationChecker]: L129 has no Hoare annotation [2022-02-20 14:48:04,194 WARN L170 areAnnotationChecker]: L133 has no Hoare annotation [2022-02-20 14:48:04,194 WARN L170 areAnnotationChecker]: L133 has no Hoare annotation [2022-02-20 14:48:04,194 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2022-02-20 14:48:04,194 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2022-02-20 14:48:04,195 WARN L170 areAnnotationChecker]: L144 has no Hoare annotation [2022-02-20 14:48:04,195 WARN L170 areAnnotationChecker]: L144 has no Hoare annotation [2022-02-20 14:48:04,195 WARN L170 areAnnotationChecker]: L149 has no Hoare annotation [2022-02-20 14:48:04,195 WARN L170 areAnnotationChecker]: L149 has no Hoare annotation [2022-02-20 14:48:04,195 WARN L170 areAnnotationChecker]: L153 has no Hoare annotation [2022-02-20 14:48:04,195 WARN L170 areAnnotationChecker]: L153 has no Hoare annotation [2022-02-20 14:48:04,195 WARN L170 areAnnotationChecker]: L158 has no Hoare annotation [2022-02-20 14:48:04,195 WARN L170 areAnnotationChecker]: L158 has no Hoare annotation [2022-02-20 14:48:04,195 WARN L170 areAnnotationChecker]: L164 has no Hoare annotation [2022-02-20 14:48:04,196 WARN L170 areAnnotationChecker]: L164 has no Hoare annotation [2022-02-20 14:48:04,196 WARN L170 areAnnotationChecker]: L169 has no Hoare annotation [2022-02-20 14:48:04,196 WARN L170 areAnnotationChecker]: L169 has no Hoare annotation [2022-02-20 14:48:04,196 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2022-02-20 14:48:04,196 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2022-02-20 14:48:04,196 WARN L170 areAnnotationChecker]: L179 has no Hoare annotation [2022-02-20 14:48:04,196 WARN L170 areAnnotationChecker]: L179 has no Hoare annotation [2022-02-20 14:48:04,196 WARN L170 areAnnotationChecker]: L185 has no Hoare annotation [2022-02-20 14:48:04,196 WARN L170 areAnnotationChecker]: L185 has no Hoare annotation [2022-02-20 14:48:04,196 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2022-02-20 14:48:04,197 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2022-02-20 14:48:04,197 WARN L170 areAnnotationChecker]: L195 has no Hoare annotation [2022-02-20 14:48:04,197 WARN L170 areAnnotationChecker]: L195 has no Hoare annotation [2022-02-20 14:48:04,197 WARN L170 areAnnotationChecker]: L197 has no Hoare annotation [2022-02-20 14:48:04,197 WARN L170 areAnnotationChecker]: L197 has no Hoare annotation [2022-02-20 14:48:04,197 WARN L170 areAnnotationChecker]: L199 has no Hoare annotation [2022-02-20 14:48:04,197 WARN L170 areAnnotationChecker]: L199 has no Hoare annotation [2022-02-20 14:48:04,197 WARN L170 areAnnotationChecker]: L201 has no Hoare annotation [2022-02-20 14:48:04,197 WARN L170 areAnnotationChecker]: L201 has no Hoare annotation [2022-02-20 14:48:04,198 WARN L170 areAnnotationChecker]: L204 has no Hoare annotation [2022-02-20 14:48:04,198 WARN L170 areAnnotationChecker]: L204 has no Hoare annotation [2022-02-20 14:48:04,198 WARN L170 areAnnotationChecker]: L208 has no Hoare annotation [2022-02-20 14:48:04,198 WARN L170 areAnnotationChecker]: L208 has no Hoare annotation [2022-02-20 14:48:04,198 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2022-02-20 14:48:04,198 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2022-02-20 14:48:04,198 WARN L170 areAnnotationChecker]: L213 has no Hoare annotation [2022-02-20 14:48:04,198 WARN L170 areAnnotationChecker]: L213 has no Hoare annotation [2022-02-20 14:48:04,198 WARN L170 areAnnotationChecker]: L222 has no Hoare annotation [2022-02-20 14:48:04,198 WARN L170 areAnnotationChecker]: L222 has no Hoare annotation [2022-02-20 14:48:04,199 WARN L170 areAnnotationChecker]: L213-2 has no Hoare annotation [2022-02-20 14:48:04,199 WARN L170 areAnnotationChecker]: L225 has no Hoare annotation [2022-02-20 14:48:04,199 WARN L170 areAnnotationChecker]: L225 has no Hoare annotation [2022-02-20 14:48:04,199 WARN L170 areAnnotationChecker]: L228 has no Hoare annotation [2022-02-20 14:48:04,199 WARN L170 areAnnotationChecker]: L228 has no Hoare annotation [2022-02-20 14:48:04,199 WARN L170 areAnnotationChecker]: L233 has no Hoare annotation [2022-02-20 14:48:04,199 WARN L170 areAnnotationChecker]: L233 has no Hoare annotation [2022-02-20 14:48:04,199 WARN L170 areAnnotationChecker]: L235 has no Hoare annotation [2022-02-20 14:48:04,199 WARN L170 areAnnotationChecker]: L235 has no Hoare annotation [2022-02-20 14:48:04,200 WARN L170 areAnnotationChecker]: L242 has no Hoare annotation [2022-02-20 14:48:04,200 WARN L170 areAnnotationChecker]: L242 has no Hoare annotation [2022-02-20 14:48:04,200 WARN L170 areAnnotationChecker]: L244 has no Hoare annotation [2022-02-20 14:48:04,200 WARN L170 areAnnotationChecker]: L244 has no Hoare annotation [2022-02-20 14:48:04,200 WARN L170 areAnnotationChecker]: L247 has no Hoare annotation [2022-02-20 14:48:04,200 WARN L170 areAnnotationChecker]: L247 has no Hoare annotation [2022-02-20 14:48:04,200 WARN L170 areAnnotationChecker]: L248 has no Hoare annotation [2022-02-20 14:48:04,200 WARN L170 areAnnotationChecker]: L248 has no Hoare annotation [2022-02-20 14:48:04,200 WARN L170 areAnnotationChecker]: L258 has no Hoare annotation [2022-02-20 14:48:04,201 WARN L170 areAnnotationChecker]: L258 has no Hoare annotation [2022-02-20 14:48:04,201 WARN L170 areAnnotationChecker]: L248-2 has no Hoare annotation [2022-02-20 14:48:04,201 WARN L170 areAnnotationChecker]: L263 has no Hoare annotation [2022-02-20 14:48:04,201 WARN L170 areAnnotationChecker]: L263 has no Hoare annotation [2022-02-20 14:48:04,201 WARN L170 areAnnotationChecker]: L269 has no Hoare annotation [2022-02-20 14:48:04,201 WARN L170 areAnnotationChecker]: L269 has no Hoare annotation [2022-02-20 14:48:04,201 WARN L170 areAnnotationChecker]: L271 has no Hoare annotation [2022-02-20 14:48:04,201 WARN L170 areAnnotationChecker]: L271 has no Hoare annotation [2022-02-20 14:48:04,201 WARN L170 areAnnotationChecker]: L272 has no Hoare annotation [2022-02-20 14:48:04,201 WARN L170 areAnnotationChecker]: L272 has no Hoare annotation [2022-02-20 14:48:04,202 WARN L170 areAnnotationChecker]: L286 has no Hoare annotation [2022-02-20 14:48:04,202 WARN L170 areAnnotationChecker]: L286 has no Hoare annotation [2022-02-20 14:48:04,202 WARN L170 areAnnotationChecker]: L272-2 has no Hoare annotation [2022-02-20 14:48:04,202 WARN L170 areAnnotationChecker]: L290 has no Hoare annotation [2022-02-20 14:48:04,202 WARN L170 areAnnotationChecker]: L290 has no Hoare annotation [2022-02-20 14:48:04,202 WARN L170 areAnnotationChecker]: L293 has no Hoare annotation [2022-02-20 14:48:04,202 WARN L170 areAnnotationChecker]: L293 has no Hoare annotation [2022-02-20 14:48:04,202 WARN L170 areAnnotationChecker]: L296 has no Hoare annotation [2022-02-20 14:48:04,202 WARN L170 areAnnotationChecker]: L296 has no Hoare annotation [2022-02-20 14:48:04,203 WARN L170 areAnnotationChecker]: L301 has no Hoare annotation [2022-02-20 14:48:04,203 WARN L170 areAnnotationChecker]: L301 has no Hoare annotation [2022-02-20 14:48:04,203 WARN L170 areAnnotationChecker]: L303 has no Hoare annotation [2022-02-20 14:48:04,203 WARN L170 areAnnotationChecker]: L303 has no Hoare annotation [2022-02-20 14:48:04,203 WARN L170 areAnnotationChecker]: L307 has no Hoare annotation [2022-02-20 14:48:04,203 WARN L170 areAnnotationChecker]: L307 has no Hoare annotation [2022-02-20 14:48:04,203 WARN L170 areAnnotationChecker]: L308 has no Hoare annotation [2022-02-20 14:48:04,203 WARN L170 areAnnotationChecker]: L308 has no Hoare annotation [2022-02-20 14:48:04,203 WARN L170 areAnnotationChecker]: L319 has no Hoare annotation [2022-02-20 14:48:04,203 WARN L170 areAnnotationChecker]: L319 has no Hoare annotation [2022-02-20 14:48:04,204 WARN L170 areAnnotationChecker]: L308-2 has no Hoare annotation [2022-02-20 14:48:04,204 WARN L170 areAnnotationChecker]: L324 has no Hoare annotation [2022-02-20 14:48:04,204 WARN L170 areAnnotationChecker]: L324 has no Hoare annotation [2022-02-20 14:48:04,204 WARN L170 areAnnotationChecker]: L325 has no Hoare annotation [2022-02-20 14:48:04,204 WARN L170 areAnnotationChecker]: L325 has no Hoare annotation [2022-02-20 14:48:04,204 WARN L170 areAnnotationChecker]: L338 has no Hoare annotation [2022-02-20 14:48:04,204 WARN L170 areAnnotationChecker]: L338 has no Hoare annotation [2022-02-20 14:48:04,204 WARN L170 areAnnotationChecker]: L325-2 has no Hoare annotation [2022-02-20 14:48:04,204 WARN L170 areAnnotationChecker]: L341 has no Hoare annotation [2022-02-20 14:48:04,204 WARN L170 areAnnotationChecker]: L341 has no Hoare annotation [2022-02-20 14:48:04,205 WARN L170 areAnnotationChecker]: L342 has no Hoare annotation [2022-02-20 14:48:04,205 WARN L170 areAnnotationChecker]: L342 has no Hoare annotation [2022-02-20 14:48:04,205 WARN L170 areAnnotationChecker]: L347 has no Hoare annotation [2022-02-20 14:48:04,205 WARN L170 areAnnotationChecker]: L347 has no Hoare annotation [2022-02-20 14:48:04,205 WARN L170 areAnnotationChecker]: L342-2 has no Hoare annotation [2022-02-20 14:48:04,205 WARN L170 areAnnotationChecker]: L348 has no Hoare annotation [2022-02-20 14:48:04,205 WARN L170 areAnnotationChecker]: L348 has no Hoare annotation [2022-02-20 14:48:04,205 WARN L170 areAnnotationChecker]: L359 has no Hoare annotation [2022-02-20 14:48:04,205 WARN L170 areAnnotationChecker]: L359 has no Hoare annotation [2022-02-20 14:48:04,205 WARN L170 areAnnotationChecker]: L348-2 has no Hoare annotation [2022-02-20 14:48:04,205 WARN L170 areAnnotationChecker]: L364 has no Hoare annotation [2022-02-20 14:48:04,205 WARN L170 areAnnotationChecker]: L364 has no Hoare annotation [2022-02-20 14:48:04,206 WARN L170 areAnnotationChecker]: L371 has no Hoare annotation [2022-02-20 14:48:04,206 WARN L170 areAnnotationChecker]: L371 has no Hoare annotation [2022-02-20 14:48:04,206 WARN L170 areAnnotationChecker]: L378 has no Hoare annotation [2022-02-20 14:48:04,206 WARN L170 areAnnotationChecker]: L378 has no Hoare annotation [2022-02-20 14:48:04,206 WARN L170 areAnnotationChecker]: L385 has no Hoare annotation [2022-02-20 14:48:04,206 WARN L170 areAnnotationChecker]: L385 has no Hoare annotation [2022-02-20 14:48:04,206 WARN L170 areAnnotationChecker]: L388 has no Hoare annotation [2022-02-20 14:48:04,206 WARN L170 areAnnotationChecker]: L388 has no Hoare annotation [2022-02-20 14:48:04,206 WARN L170 areAnnotationChecker]: L390 has no Hoare annotation [2022-02-20 14:48:04,206 WARN L170 areAnnotationChecker]: L390 has no Hoare annotation [2022-02-20 14:48:04,206 WARN L170 areAnnotationChecker]: L391 has no Hoare annotation [2022-02-20 14:48:04,207 WARN L170 areAnnotationChecker]: L391 has no Hoare annotation [2022-02-20 14:48:04,207 WARN L170 areAnnotationChecker]: L399 has no Hoare annotation [2022-02-20 14:48:04,207 WARN L170 areAnnotationChecker]: L399 has no Hoare annotation [2022-02-20 14:48:04,207 WARN L170 areAnnotationChecker]: L391-2 has no Hoare annotation [2022-02-20 14:48:04,207 WARN L170 areAnnotationChecker]: L404 has no Hoare annotation [2022-02-20 14:48:04,207 WARN L170 areAnnotationChecker]: L404 has no Hoare annotation [2022-02-20 14:48:04,207 WARN L170 areAnnotationChecker]: L408 has no Hoare annotation [2022-02-20 14:48:04,207 WARN L170 areAnnotationChecker]: L408 has no Hoare annotation [2022-02-20 14:48:04,207 WARN L170 areAnnotationChecker]: L412 has no Hoare annotation [2022-02-20 14:48:04,207 WARN L170 areAnnotationChecker]: L412 has no Hoare annotation [2022-02-20 14:48:04,207 WARN L170 areAnnotationChecker]: L414 has no Hoare annotation [2022-02-20 14:48:04,207 WARN L170 areAnnotationChecker]: L414 has no Hoare annotation [2022-02-20 14:48:04,208 WARN L170 areAnnotationChecker]: L417 has no Hoare annotation [2022-02-20 14:48:04,208 WARN L170 areAnnotationChecker]: L417 has no Hoare annotation [2022-02-20 14:48:04,208 WARN L170 areAnnotationChecker]: L419 has no Hoare annotation [2022-02-20 14:48:04,208 WARN L170 areAnnotationChecker]: L419 has no Hoare annotation [2022-02-20 14:48:04,208 WARN L170 areAnnotationChecker]: L424 has no Hoare annotation [2022-02-20 14:48:04,208 WARN L170 areAnnotationChecker]: L424 has no Hoare annotation [2022-02-20 14:48:04,208 WARN L170 areAnnotationChecker]: L425 has no Hoare annotation [2022-02-20 14:48:04,208 WARN L170 areAnnotationChecker]: L425 has no Hoare annotation [2022-02-20 14:48:04,208 WARN L170 areAnnotationChecker]: L424-2 has no Hoare annotation [2022-02-20 14:48:04,208 WARN L170 areAnnotationChecker]: L424-2 has no Hoare annotation [2022-02-20 14:48:04,208 WARN L170 areAnnotationChecker]: L428 has no Hoare annotation [2022-02-20 14:48:04,209 WARN L170 areAnnotationChecker]: L427-1 has no Hoare annotation [2022-02-20 14:48:04,209 WARN L170 areAnnotationChecker]: L427-1 has no Hoare annotation [2022-02-20 14:48:04,209 WARN L170 areAnnotationChecker]: L431 has no Hoare annotation [2022-02-20 14:48:04,209 WARN L170 areAnnotationChecker]: L430-1 has no Hoare annotation [2022-02-20 14:48:04,209 WARN L170 areAnnotationChecker]: L430-1 has no Hoare annotation [2022-02-20 14:48:04,209 WARN L170 areAnnotationChecker]: L434 has no Hoare annotation [2022-02-20 14:48:04,209 WARN L170 areAnnotationChecker]: L433-1 has no Hoare annotation [2022-02-20 14:48:04,209 WARN L170 areAnnotationChecker]: L433-1 has no Hoare annotation [2022-02-20 14:48:04,209 WARN L170 areAnnotationChecker]: L437 has no Hoare annotation [2022-02-20 14:48:04,209 WARN L170 areAnnotationChecker]: L436-1 has no Hoare annotation [2022-02-20 14:48:04,210 WARN L170 areAnnotationChecker]: L436-1 has no Hoare annotation [2022-02-20 14:48:04,210 WARN L170 areAnnotationChecker]: L440 has no Hoare annotation [2022-02-20 14:48:04,210 WARN L170 areAnnotationChecker]: L439-1 has no Hoare annotation [2022-02-20 14:48:04,210 WARN L170 areAnnotationChecker]: L439-1 has no Hoare annotation [2022-02-20 14:48:04,210 WARN L170 areAnnotationChecker]: L443 has no Hoare annotation [2022-02-20 14:48:04,210 WARN L170 areAnnotationChecker]: L442-1 has no Hoare annotation [2022-02-20 14:48:04,210 WARN L170 areAnnotationChecker]: L442-1 has no Hoare annotation [2022-02-20 14:48:04,210 WARN L170 areAnnotationChecker]: L446 has no Hoare annotation [2022-02-20 14:48:04,210 WARN L170 areAnnotationChecker]: L445-1 has no Hoare annotation [2022-02-20 14:48:04,210 WARN L170 areAnnotationChecker]: L445-1 has no Hoare annotation [2022-02-20 14:48:04,211 WARN L170 areAnnotationChecker]: L449 has no Hoare annotation [2022-02-20 14:48:04,211 WARN L170 areAnnotationChecker]: L448-1 has no Hoare annotation [2022-02-20 14:48:04,211 WARN L170 areAnnotationChecker]: L448-1 has no Hoare annotation [2022-02-20 14:48:04,211 WARN L170 areAnnotationChecker]: L452 has no Hoare annotation [2022-02-20 14:48:04,211 WARN L170 areAnnotationChecker]: L451-1 has no Hoare annotation [2022-02-20 14:48:04,211 WARN L170 areAnnotationChecker]: L451-1 has no Hoare annotation [2022-02-20 14:48:04,211 WARN L170 areAnnotationChecker]: L455 has no Hoare annotation [2022-02-20 14:48:04,211 WARN L170 areAnnotationChecker]: L454-1 has no Hoare annotation [2022-02-20 14:48:04,211 WARN L170 areAnnotationChecker]: L454-1 has no Hoare annotation [2022-02-20 14:48:04,212 WARN L170 areAnnotationChecker]: L458 has no Hoare annotation [2022-02-20 14:48:04,212 WARN L170 areAnnotationChecker]: L457-1 has no Hoare annotation [2022-02-20 14:48:04,212 WARN L170 areAnnotationChecker]: L457-1 has no Hoare annotation [2022-02-20 14:48:04,212 WARN L170 areAnnotationChecker]: L461 has no Hoare annotation [2022-02-20 14:48:04,212 WARN L170 areAnnotationChecker]: L460-1 has no Hoare annotation [2022-02-20 14:48:04,212 WARN L170 areAnnotationChecker]: L460-1 has no Hoare annotation [2022-02-20 14:48:04,212 WARN L170 areAnnotationChecker]: L464 has no Hoare annotation [2022-02-20 14:48:04,212 WARN L170 areAnnotationChecker]: L463-1 has no Hoare annotation [2022-02-20 14:48:04,212 WARN L170 areAnnotationChecker]: L463-1 has no Hoare annotation [2022-02-20 14:48:04,212 WARN L170 areAnnotationChecker]: L467 has no Hoare annotation [2022-02-20 14:48:04,213 WARN L170 areAnnotationChecker]: L466-1 has no Hoare annotation [2022-02-20 14:48:04,213 WARN L170 areAnnotationChecker]: L466-1 has no Hoare annotation [2022-02-20 14:48:04,213 WARN L170 areAnnotationChecker]: L470 has no Hoare annotation [2022-02-20 14:48:04,213 WARN L170 areAnnotationChecker]: L469-1 has no Hoare annotation [2022-02-20 14:48:04,213 WARN L170 areAnnotationChecker]: L469-1 has no Hoare annotation [2022-02-20 14:48:04,213 WARN L170 areAnnotationChecker]: L473 has no Hoare annotation [2022-02-20 14:48:04,213 WARN L170 areAnnotationChecker]: L472-1 has no Hoare annotation [2022-02-20 14:48:04,213 WARN L170 areAnnotationChecker]: L472-1 has no Hoare annotation [2022-02-20 14:48:04,213 WARN L170 areAnnotationChecker]: L476 has no Hoare annotation [2022-02-20 14:48:04,213 WARN L170 areAnnotationChecker]: L475-1 has no Hoare annotation [2022-02-20 14:48:04,214 WARN L170 areAnnotationChecker]: L475-1 has no Hoare annotation [2022-02-20 14:48:04,214 WARN L170 areAnnotationChecker]: L479 has no Hoare annotation [2022-02-20 14:48:04,214 WARN L170 areAnnotationChecker]: L478-1 has no Hoare annotation [2022-02-20 14:48:04,214 WARN L170 areAnnotationChecker]: L478-1 has no Hoare annotation [2022-02-20 14:48:04,214 WARN L170 areAnnotationChecker]: L482 has no Hoare annotation [2022-02-20 14:48:04,214 WARN L170 areAnnotationChecker]: L481-1 has no Hoare annotation [2022-02-20 14:48:04,214 WARN L170 areAnnotationChecker]: L481-1 has no Hoare annotation [2022-02-20 14:48:04,214 WARN L170 areAnnotationChecker]: L485 has no Hoare annotation [2022-02-20 14:48:04,214 WARN L170 areAnnotationChecker]: L484-1 has no Hoare annotation [2022-02-20 14:48:04,215 WARN L170 areAnnotationChecker]: L484-1 has no Hoare annotation [2022-02-20 14:48:04,215 WARN L170 areAnnotationChecker]: L488 has no Hoare annotation [2022-02-20 14:48:04,215 WARN L170 areAnnotationChecker]: L487-1 has no Hoare annotation [2022-02-20 14:48:04,215 WARN L170 areAnnotationChecker]: L487-1 has no Hoare annotation [2022-02-20 14:48:04,215 WARN L170 areAnnotationChecker]: L491 has no Hoare annotation [2022-02-20 14:48:04,215 WARN L170 areAnnotationChecker]: L490-1 has no Hoare annotation [2022-02-20 14:48:04,215 WARN L170 areAnnotationChecker]: L490-1 has no Hoare annotation [2022-02-20 14:48:04,215 WARN L170 areAnnotationChecker]: L494 has no Hoare annotation [2022-02-20 14:48:04,215 WARN L170 areAnnotationChecker]: L493-1 has no Hoare annotation [2022-02-20 14:48:04,216 WARN L170 areAnnotationChecker]: L493-1 has no Hoare annotation [2022-02-20 14:48:04,216 WARN L170 areAnnotationChecker]: L497 has no Hoare annotation [2022-02-20 14:48:04,216 WARN L170 areAnnotationChecker]: L496-1 has no Hoare annotation [2022-02-20 14:48:04,216 WARN L170 areAnnotationChecker]: L496-1 has no Hoare annotation [2022-02-20 14:48:04,216 WARN L170 areAnnotationChecker]: L500 has no Hoare annotation [2022-02-20 14:48:04,216 WARN L170 areAnnotationChecker]: L499-1 has no Hoare annotation [2022-02-20 14:48:04,216 WARN L170 areAnnotationChecker]: L499-1 has no Hoare annotation [2022-02-20 14:48:04,216 WARN L170 areAnnotationChecker]: L503 has no Hoare annotation [2022-02-20 14:48:04,216 WARN L170 areAnnotationChecker]: L502-1 has no Hoare annotation [2022-02-20 14:48:04,217 WARN L170 areAnnotationChecker]: L502-1 has no Hoare annotation [2022-02-20 14:48:04,217 WARN L170 areAnnotationChecker]: L506 has no Hoare annotation [2022-02-20 14:48:04,217 WARN L170 areAnnotationChecker]: L505-1 has no Hoare annotation [2022-02-20 14:48:04,217 WARN L170 areAnnotationChecker]: L505-1 has no Hoare annotation [2022-02-20 14:48:04,217 WARN L170 areAnnotationChecker]: L509 has no Hoare annotation [2022-02-20 14:48:04,217 WARN L170 areAnnotationChecker]: L508-1 has no Hoare annotation [2022-02-20 14:48:04,217 WARN L170 areAnnotationChecker]: L508-1 has no Hoare annotation [2022-02-20 14:48:04,217 WARN L170 areAnnotationChecker]: L512 has no Hoare annotation [2022-02-20 14:48:04,217 WARN L170 areAnnotationChecker]: L511-1 has no Hoare annotation [2022-02-20 14:48:04,217 WARN L170 areAnnotationChecker]: L511-1 has no Hoare annotation [2022-02-20 14:48:04,218 WARN L170 areAnnotationChecker]: L515 has no Hoare annotation [2022-02-20 14:48:04,218 WARN L170 areAnnotationChecker]: L514-1 has no Hoare annotation [2022-02-20 14:48:04,218 WARN L170 areAnnotationChecker]: L514-1 has no Hoare annotation [2022-02-20 14:48:04,218 WARN L170 areAnnotationChecker]: L518 has no Hoare annotation [2022-02-20 14:48:04,218 WARN L170 areAnnotationChecker]: L517-1 has no Hoare annotation [2022-02-20 14:48:04,218 WARN L170 areAnnotationChecker]: L517-1 has no Hoare annotation [2022-02-20 14:48:04,218 WARN L170 areAnnotationChecker]: L521 has no Hoare annotation [2022-02-20 14:48:04,218 WARN L170 areAnnotationChecker]: L520-1 has no Hoare annotation [2022-02-20 14:48:04,218 WARN L170 areAnnotationChecker]: L520-1 has no Hoare annotation [2022-02-20 14:48:04,218 WARN L170 areAnnotationChecker]: L524 has no Hoare annotation [2022-02-20 14:48:04,219 WARN L170 areAnnotationChecker]: L523-1 has no Hoare annotation [2022-02-20 14:48:04,219 WARN L170 areAnnotationChecker]: L523-1 has no Hoare annotation [2022-02-20 14:48:04,219 WARN L170 areAnnotationChecker]: L527 has no Hoare annotation [2022-02-20 14:48:04,219 WARN L170 areAnnotationChecker]: L526-1 has no Hoare annotation [2022-02-20 14:48:04,219 WARN L170 areAnnotationChecker]: L526-1 has no Hoare annotation [2022-02-20 14:48:04,219 WARN L170 areAnnotationChecker]: L530 has no Hoare annotation [2022-02-20 14:48:04,219 WARN L170 areAnnotationChecker]: L529-1 has no Hoare annotation [2022-02-20 14:48:04,219 WARN L170 areAnnotationChecker]: L529-1 has no Hoare annotation [2022-02-20 14:48:04,219 WARN L170 areAnnotationChecker]: L533 has no Hoare annotation [2022-02-20 14:48:04,219 WARN L170 areAnnotationChecker]: L532-1 has no Hoare annotation [2022-02-20 14:48:04,220 WARN L170 areAnnotationChecker]: L532-1 has no Hoare annotation [2022-02-20 14:48:04,220 WARN L170 areAnnotationChecker]: L536 has no Hoare annotation [2022-02-20 14:48:04,220 WARN L170 areAnnotationChecker]: L535-1 has no Hoare annotation [2022-02-20 14:48:04,220 WARN L170 areAnnotationChecker]: L535-1 has no Hoare annotation [2022-02-20 14:48:04,220 WARN L170 areAnnotationChecker]: L539 has no Hoare annotation [2022-02-20 14:48:04,220 WARN L170 areAnnotationChecker]: L538-1 has no Hoare annotation [2022-02-20 14:48:04,220 WARN L170 areAnnotationChecker]: L538-1 has no Hoare annotation [2022-02-20 14:48:04,220 WARN L170 areAnnotationChecker]: L542 has no Hoare annotation [2022-02-20 14:48:04,220 WARN L170 areAnnotationChecker]: L541-1 has no Hoare annotation [2022-02-20 14:48:04,221 WARN L170 areAnnotationChecker]: L541-1 has no Hoare annotation [2022-02-20 14:48:04,221 WARN L170 areAnnotationChecker]: L545 has no Hoare annotation [2022-02-20 14:48:04,221 WARN L170 areAnnotationChecker]: L544-1 has no Hoare annotation [2022-02-20 14:48:04,221 WARN L170 areAnnotationChecker]: L544-1 has no Hoare annotation [2022-02-20 14:48:04,221 WARN L170 areAnnotationChecker]: L548 has no Hoare annotation [2022-02-20 14:48:04,221 WARN L170 areAnnotationChecker]: L547-1 has no Hoare annotation [2022-02-20 14:48:04,221 WARN L170 areAnnotationChecker]: L547-1 has no Hoare annotation [2022-02-20 14:48:04,221 WARN L170 areAnnotationChecker]: L551 has no Hoare annotation [2022-02-20 14:48:04,221 WARN L170 areAnnotationChecker]: L550-1 has no Hoare annotation [2022-02-20 14:48:04,221 WARN L170 areAnnotationChecker]: L550-1 has no Hoare annotation [2022-02-20 14:48:04,222 WARN L170 areAnnotationChecker]: L554 has no Hoare annotation [2022-02-20 14:48:04,222 WARN L170 areAnnotationChecker]: L553-1 has no Hoare annotation [2022-02-20 14:48:04,222 WARN L170 areAnnotationChecker]: L553-1 has no Hoare annotation [2022-02-20 14:48:04,222 WARN L170 areAnnotationChecker]: L557 has no Hoare annotation [2022-02-20 14:48:04,222 WARN L170 areAnnotationChecker]: L556-1 has no Hoare annotation [2022-02-20 14:48:04,222 WARN L170 areAnnotationChecker]: L556-1 has no Hoare annotation [2022-02-20 14:48:04,222 WARN L170 areAnnotationChecker]: L560 has no Hoare annotation [2022-02-20 14:48:04,222 WARN L170 areAnnotationChecker]: L559-1 has no Hoare annotation [2022-02-20 14:48:04,222 WARN L170 areAnnotationChecker]: L559-1 has no Hoare annotation [2022-02-20 14:48:04,223 WARN L170 areAnnotationChecker]: L563 has no Hoare annotation [2022-02-20 14:48:04,223 WARN L170 areAnnotationChecker]: L562-1 has no Hoare annotation [2022-02-20 14:48:04,223 WARN L170 areAnnotationChecker]: L562-1 has no Hoare annotation [2022-02-20 14:48:04,223 WARN L170 areAnnotationChecker]: L566 has no Hoare annotation [2022-02-20 14:48:04,223 WARN L170 areAnnotationChecker]: L565-1 has no Hoare annotation [2022-02-20 14:48:04,223 WARN L170 areAnnotationChecker]: L565-1 has no Hoare annotation [2022-02-20 14:48:04,223 WARN L170 areAnnotationChecker]: L569 has no Hoare annotation [2022-02-20 14:48:04,223 WARN L170 areAnnotationChecker]: L568-1 has no Hoare annotation [2022-02-20 14:48:04,223 WARN L170 areAnnotationChecker]: L568-1 has no Hoare annotation [2022-02-20 14:48:04,223 WARN L170 areAnnotationChecker]: L572 has no Hoare annotation [2022-02-20 14:48:04,224 WARN L170 areAnnotationChecker]: L571-1 has no Hoare annotation [2022-02-20 14:48:04,224 WARN L170 areAnnotationChecker]: L571-1 has no Hoare annotation [2022-02-20 14:48:04,224 WARN L170 areAnnotationChecker]: L575 has no Hoare annotation [2022-02-20 14:48:04,224 WARN L170 areAnnotationChecker]: L574-1 has no Hoare annotation [2022-02-20 14:48:04,224 WARN L170 areAnnotationChecker]: L574-1 has no Hoare annotation [2022-02-20 14:48:04,224 WARN L170 areAnnotationChecker]: L578 has no Hoare annotation [2022-02-20 14:48:04,224 WARN L170 areAnnotationChecker]: L577-1 has no Hoare annotation [2022-02-20 14:48:04,224 WARN L170 areAnnotationChecker]: L577-1 has no Hoare annotation [2022-02-20 14:48:04,224 WARN L170 areAnnotationChecker]: L581 has no Hoare annotation [2022-02-20 14:48:04,224 WARN L170 areAnnotationChecker]: L580-1 has no Hoare annotation [2022-02-20 14:48:04,225 WARN L170 areAnnotationChecker]: L580-1 has no Hoare annotation [2022-02-20 14:48:04,225 WARN L170 areAnnotationChecker]: L584 has no Hoare annotation [2022-02-20 14:48:04,225 WARN L170 areAnnotationChecker]: L583-1 has no Hoare annotation [2022-02-20 14:48:04,225 WARN L170 areAnnotationChecker]: L583-1 has no Hoare annotation [2022-02-20 14:48:04,225 WARN L170 areAnnotationChecker]: L587 has no Hoare annotation [2022-02-20 14:48:04,225 WARN L170 areAnnotationChecker]: L586-1 has no Hoare annotation [2022-02-20 14:48:04,225 WARN L170 areAnnotationChecker]: L586-1 has no Hoare annotation [2022-02-20 14:48:04,225 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2022-02-20 14:48:04,225 WARN L170 areAnnotationChecker]: L589-1 has no Hoare annotation [2022-02-20 14:48:04,226 WARN L170 areAnnotationChecker]: L589-1 has no Hoare annotation [2022-02-20 14:48:04,226 WARN L170 areAnnotationChecker]: L593 has no Hoare annotation [2022-02-20 14:48:04,226 WARN L170 areAnnotationChecker]: L592-1 has no Hoare annotation [2022-02-20 14:48:04,226 WARN L170 areAnnotationChecker]: L592-1 has no Hoare annotation [2022-02-20 14:48:04,226 WARN L170 areAnnotationChecker]: L596 has no Hoare annotation [2022-02-20 14:48:04,226 WARN L170 areAnnotationChecker]: L595-1 has no Hoare annotation [2022-02-20 14:48:04,226 WARN L170 areAnnotationChecker]: L595-1 has no Hoare annotation [2022-02-20 14:48:04,226 WARN L170 areAnnotationChecker]: L599 has no Hoare annotation [2022-02-20 14:48:04,226 WARN L170 areAnnotationChecker]: L598-1 has no Hoare annotation [2022-02-20 14:48:04,226 WARN L170 areAnnotationChecker]: L598-1 has no Hoare annotation [2022-02-20 14:48:04,227 WARN L170 areAnnotationChecker]: L602 has no Hoare annotation [2022-02-20 14:48:04,227 WARN L170 areAnnotationChecker]: L601-1 has no Hoare annotation [2022-02-20 14:48:04,227 WARN L170 areAnnotationChecker]: L601-1 has no Hoare annotation [2022-02-20 14:48:04,227 WARN L170 areAnnotationChecker]: L605 has no Hoare annotation [2022-02-20 14:48:04,227 WARN L170 areAnnotationChecker]: L604-1 has no Hoare annotation [2022-02-20 14:48:04,227 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 14:48:04,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 02:48:04 BoogieIcfgContainer [2022-02-20 14:48:04,228 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 14:48:04,229 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 14:48:04,229 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 14:48:04,229 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 14:48:04,230 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:47:45" (3/4) ... [2022-02-20 14:48:04,231 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 14:48:04,344 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 14:48:04,344 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 14:48:04,349 INFO L158 Benchmark]: Toolchain (without parser) took 20671.25ms. Allocated memory was 75.5MB in the beginning and 264.2MB in the end (delta: 188.7MB). Free memory was 49.8MB in the beginning and 99.2MB in the end (delta: -49.4MB). Peak memory consumption was 139.6MB. Max. memory is 16.1GB. [2022-02-20 14:48:04,349 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 75.5MB. Free memory was 51.0MB in the beginning and 51.0MB in the end (delta: 40.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 14:48:04,350 INFO L158 Benchmark]: CACSL2BoogieTranslator took 473.77ms. Allocated memory was 75.5MB in the beginning and 94.4MB in the end (delta: 18.9MB). Free memory was 49.7MB in the beginning and 69.6MB in the end (delta: -20.0MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. [2022-02-20 14:48:04,350 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.48ms. Allocated memory is still 94.4MB. Free memory was 69.6MB in the beginning and 61.4MB in the end (delta: 8.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 14:48:04,350 INFO L158 Benchmark]: Boogie Preprocessor took 40.07ms. Allocated memory is still 94.4MB. Free memory was 61.4MB in the beginning and 56.8MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 14:48:04,350 INFO L158 Benchmark]: RCFGBuilder took 977.11ms. Allocated memory is still 94.4MB. Free memory was 56.8MB in the beginning and 60.2MB in the end (delta: -3.4MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2022-02-20 14:48:04,351 INFO L158 Benchmark]: TraceAbstraction took 18984.27ms. Allocated memory was 94.4MB in the beginning and 264.2MB in the end (delta: 169.9MB). Free memory was 59.7MB in the beginning and 137.0MB in the end (delta: -77.3MB). Peak memory consumption was 92.6MB. Max. memory is 16.1GB. [2022-02-20 14:48:04,351 INFO L158 Benchmark]: Witness Printer took 115.42ms. Allocated memory is still 264.2MB. Free memory was 137.0MB in the beginning and 99.2MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-02-20 14:48:04,353 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 75.5MB. Free memory was 51.0MB in the beginning and 51.0MB in the end (delta: 40.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 473.77ms. Allocated memory was 75.5MB in the beginning and 94.4MB in the end (delta: 18.9MB). Free memory was 49.7MB in the beginning and 69.6MB in the end (delta: -20.0MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.48ms. Allocated memory is still 94.4MB. Free memory was 69.6MB in the beginning and 61.4MB in the end (delta: 8.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.07ms. Allocated memory is still 94.4MB. Free memory was 61.4MB in the beginning and 56.8MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 977.11ms. Allocated memory is still 94.4MB. Free memory was 56.8MB in the beginning and 60.2MB in the end (delta: -3.4MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. * TraceAbstraction took 18984.27ms. Allocated memory was 94.4MB in the beginning and 264.2MB in the end (delta: 169.9MB). Free memory was 59.7MB in the beginning and 137.0MB in the end (delta: -77.3MB). Peak memory consumption was 92.6MB. Max. memory is 16.1GB. * Witness Printer took 115.42ms. Allocated memory is still 264.2MB. Free memory was 137.0MB in the beginning and 99.2MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 425]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int e= 5; [L19] int d= 4; [L20] int f= 6; [L21] int c= 3; [L24] int u = 21; [L25] int v = 22; [L26] int w = 23; [L27] int x = 24; [L28] int y = 25; [L29] int z = 26; [L32] int a25 = 0; [L33] int a11 = 0; [L34] int a28 = 7; [L35] int a19 = 1; [L36] int a21 = 1; [L37] int a17 = 8; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L613] int output = -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL, EXPR calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND TRUE ((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1))) [L245] a28 = 9 [L246] return 23; VAL [\old(input)=4, \result=23, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL, EXPR calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L247] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L258] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L263] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L269] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L290] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L301] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L303] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L307] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L319] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L338] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L341] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L359] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L364] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L385] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L388] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L390] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L399] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND TRUE (((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1)) [L405] a19 = 0 [L406] a28 = 7 [L407] return 25; VAL [\old(input)=3, \result=25, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL, EXPR calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND TRUE ((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1)) [L65] a28 = 7 [L66] a11 = 1 [L67] a25 = 0 [L68] return -1; VAL [\old(input)=1, \result=-1, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L247] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L258] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L263] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L269] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L290] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L301] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L303] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L307] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L319] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L338] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L341] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L359] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L364] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L385] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L388] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L390] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L399] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L408] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L412] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L414] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L417] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L419] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L424] COND TRUE (((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8)) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L425] reach_error() VAL [\old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.8s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1177 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1177 mSDsluCounter, 1161 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 125 mSDsCounter, 580 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3052 IncrementalHoareTripleChecker+Invalid, 3632 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 580 mSolverCounterUnsat, 1036 mSDtfsCounter, 3052 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2699occurred in iteration=5, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 298 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1225 NumberOfCodeBlocks, 1225 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1005 ConstructedInterpolants, 0 QuantifiedInterpolants, 1820 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 394/394 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-02-20 14:48:04,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE