./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label16.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_label16.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 f8ead2a6759acdf787a08f1ff38320ba759d869365709db6ba95cb561ffe0161 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:46:37,951 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:46:37,952 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:46:37,974 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:46:37,976 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:46:37,979 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:46:37,981 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:46:37,985 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:46:37,987 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:46:37,990 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:46:37,991 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:46:37,992 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:46:37,992 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:46:37,994 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:46:37,995 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:46:37,997 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:46:37,998 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:46:37,998 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:46:38,002 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:46:38,007 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:46:38,008 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:46:38,008 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:46:38,010 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:46:38,010 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:46:38,015 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:46:38,016 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:46:38,016 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:46:38,017 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:46:38,017 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:46:38,018 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:46:38,019 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:46:38,019 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:46:38,021 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:46:38,021 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:46:38,022 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:46:38,022 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:46:38,023 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:46:38,023 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:46:38,023 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:46:38,024 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:46:38,024 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:46:38,025 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:46:38,055 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:46:38,055 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:46:38,056 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:46:38,056 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:46:38,056 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:46:38,057 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:46:38,057 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:46:38,057 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:46:38,057 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:46:38,057 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:46:38,058 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:46:38,058 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:46:38,058 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:46:38,058 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:46:38,059 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:46:38,059 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:46:38,059 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:46:38,059 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:46:38,059 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:46:38,059 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:46:38,059 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:46:38,060 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:46:38,060 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:46:38,060 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:46:38,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:46:38,060 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:46:38,060 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:46:38,061 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:46:38,062 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:46:38,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:46:38,062 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:46:38,062 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:46:38,062 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:46:38,062 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 -> f8ead2a6759acdf787a08f1ff38320ba759d869365709db6ba95cb561ffe0161 [2022-02-20 14:46:38,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:46:38,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:46:38,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:46:38,310 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:46:38,310 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:46:38,311 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label16.c [2022-02-20 14:46:38,367 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c9fe8691/05a30d7e3c7b4ebc84e21d0b8bd1bb92/FLAGe4c377532 [2022-02-20 14:46:38,738 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:46:38,739 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label16.c [2022-02-20 14:46:38,748 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c9fe8691/05a30d7e3c7b4ebc84e21d0b8bd1bb92/FLAGe4c377532 [2022-02-20 14:46:39,095 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c9fe8691/05a30d7e3c7b4ebc84e21d0b8bd1bb92 [2022-02-20 14:46:39,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:46:39,100 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:46:39,111 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:46:39,112 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:46:39,114 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:46:39,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:46:39" (1/1) ... [2022-02-20 14:46:39,116 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c615a3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:46:39, skipping insertion in model container [2022-02-20 14:46:39,116 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:46:39" (1/1) ... [2022-02-20 14:46:39,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:46:39,152 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:46:39,375 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_label16.c[15312,15325] [2022-02-20 14:46:39,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:46:39,449 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:46:39,511 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_label16.c[15312,15325] [2022-02-20 14:46:39,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:46:39,547 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:46:39,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:46:39 WrapperNode [2022-02-20 14:46:39,549 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:46:39,550 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:46:39,550 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:46:39,550 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:46:39,555 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:46:39" (1/1) ... [2022-02-20 14:46:39,572 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:46:39" (1/1) ... [2022-02-20 14:46:39,643 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2022-02-20 14:46:39,644 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:46:39,644 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:46:39,644 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:46:39,645 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:46:39,650 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:46:39" (1/1) ... [2022-02-20 14:46:39,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:46:39" (1/1) ... [2022-02-20 14:46:39,654 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:46:39" (1/1) ... [2022-02-20 14:46:39,654 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:46:39" (1/1) ... [2022-02-20 14:46:39,668 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:46:39" (1/1) ... [2022-02-20 14:46:39,687 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:46:39" (1/1) ... [2022-02-20 14:46:39,690 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:46:39" (1/1) ... [2022-02-20 14:46:39,695 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:46:39,695 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:46:39,695 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:46:39,696 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:46:39,696 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:46:39" (1/1) ... [2022-02-20 14:46:39,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:46:39,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:46:39,817 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:46:39,835 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:46:39,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:46:39,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:46:39,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:46:39,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:46:39,900 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:46:39,901 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:46:40,713 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:46:40,722 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:46:40,723 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 14:46:40,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:46:40 BoogieIcfgContainer [2022-02-20 14:46:40,726 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:46:40,727 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:46:40,727 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:46:40,729 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:46:40,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:46:39" (1/3) ... [2022-02-20 14:46:40,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10c3b2b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:46:40, skipping insertion in model container [2022-02-20 14:46:40,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:46:39" (2/3) ... [2022-02-20 14:46:40,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10c3b2b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:46:40, skipping insertion in model container [2022-02-20 14:46:40,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:46:40" (3/3) ... [2022-02-20 14:46:40,732 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem02_label16.c [2022-02-20 14:46:40,738 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:46:40,738 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:46:40,769 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:46:40,774 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:46:40,774 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:46:40,790 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:46:40,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-02-20 14:46:40,796 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:46:40,797 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, 1, 1, 1, 1, 1, 1] [2022-02-20 14:46:40,797 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:46:40,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:46:40,801 INFO L85 PathProgramCache]: Analyzing trace with hash -866593277, now seen corresponding path program 1 times [2022-02-20 14:46:40,808 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:46:40,808 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623820324] [2022-02-20 14:46:40,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:46:40,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:46:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:46:41,150 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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,151 INFO L290 TraceCheckUtils]: 3: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,152 INFO L290 TraceCheckUtils]: 4: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,153 INFO L290 TraceCheckUtils]: 6: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,159 INFO L290 TraceCheckUtils]: 11: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,160 INFO L290 TraceCheckUtils]: 13: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,160 INFO L290 TraceCheckUtils]: 14: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,162 INFO L290 TraceCheckUtils]: 16: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,162 INFO L290 TraceCheckUtils]: 17: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,163 INFO L290 TraceCheckUtils]: 18: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,164 INFO L290 TraceCheckUtils]: 19: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,164 INFO L290 TraceCheckUtils]: 20: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,165 INFO L290 TraceCheckUtils]: 21: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,166 INFO L290 TraceCheckUtils]: 22: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,166 INFO L290 TraceCheckUtils]: 23: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,167 INFO L290 TraceCheckUtils]: 24: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,167 INFO L290 TraceCheckUtils]: 25: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,168 INFO L290 TraceCheckUtils]: 26: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,169 INFO L290 TraceCheckUtils]: 27: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,170 INFO L290 TraceCheckUtils]: 28: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,171 INFO L290 TraceCheckUtils]: 29: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,171 INFO L290 TraceCheckUtils]: 30: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,172 INFO L290 TraceCheckUtils]: 31: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,172 INFO L290 TraceCheckUtils]: 32: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,173 INFO L290 TraceCheckUtils]: 33: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,173 INFO L290 TraceCheckUtils]: 34: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,174 INFO L290 TraceCheckUtils]: 35: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,174 INFO L290 TraceCheckUtils]: 36: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,174 INFO L290 TraceCheckUtils]: 37: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,175 INFO L290 TraceCheckUtils]: 38: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,175 INFO L290 TraceCheckUtils]: 39: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,176 INFO L290 TraceCheckUtils]: 40: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,176 INFO L290 TraceCheckUtils]: 41: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,177 INFO L290 TraceCheckUtils]: 42: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,177 INFO L290 TraceCheckUtils]: 43: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,178 INFO L290 TraceCheckUtils]: 44: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,178 INFO L290 TraceCheckUtils]: 45: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,179 INFO L290 TraceCheckUtils]: 46: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,179 INFO L290 TraceCheckUtils]: 47: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,180 INFO L290 TraceCheckUtils]: 48: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,180 INFO L290 TraceCheckUtils]: 49: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,183 INFO L290 TraceCheckUtils]: 50: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,183 INFO L290 TraceCheckUtils]: 51: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,184 INFO L290 TraceCheckUtils]: 52: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,184 INFO L290 TraceCheckUtils]: 53: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,185 INFO L290 TraceCheckUtils]: 54: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,185 INFO L290 TraceCheckUtils]: 55: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,186 INFO L290 TraceCheckUtils]: 56: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,187 INFO L290 TraceCheckUtils]: 57: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,189 INFO L290 TraceCheckUtils]: 58: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,190 INFO L290 TraceCheckUtils]: 59: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,191 INFO L290 TraceCheckUtils]: 60: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,192 INFO L290 TraceCheckUtils]: 61: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,192 INFO L290 TraceCheckUtils]: 62: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,194 INFO L290 TraceCheckUtils]: 63: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,194 INFO L290 TraceCheckUtils]: 64: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,195 INFO L290 TraceCheckUtils]: 65: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,195 INFO L290 TraceCheckUtils]: 66: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,196 INFO L290 TraceCheckUtils]: 67: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,196 INFO L290 TraceCheckUtils]: 68: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,197 INFO L290 TraceCheckUtils]: 69: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,197 INFO L290 TraceCheckUtils]: 70: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,198 INFO L290 TraceCheckUtils]: 71: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,198 INFO L290 TraceCheckUtils]: 72: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,198 INFO L290 TraceCheckUtils]: 73: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,199 INFO L290 TraceCheckUtils]: 74: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,199 INFO L290 TraceCheckUtils]: 75: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,200 INFO L290 TraceCheckUtils]: 76: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,200 INFO L290 TraceCheckUtils]: 77: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,201 INFO L290 TraceCheckUtils]: 78: Hoare triple {232#(<= 8 ~a17~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#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,202 INFO L290 TraceCheckUtils]: 79: Hoare triple {232#(<= 8 ~a17~0)} assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); {232#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,204 INFO L290 TraceCheckUtils]: 80: Hoare triple {232#(<= 8 ~a17~0)} assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); {232#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,205 INFO L290 TraceCheckUtils]: 81: Hoare triple {232#(<= 8 ~a17~0)} assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); {232#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,206 INFO L290 TraceCheckUtils]: 82: Hoare triple {232#(<= 8 ~a17~0)} assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); {232#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,206 INFO L290 TraceCheckUtils]: 83: Hoare triple {232#(<= 8 ~a17~0)} assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); {232#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,207 INFO L290 TraceCheckUtils]: 84: Hoare triple {232#(<= 8 ~a17~0)} assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); {232#(<= 8 ~a17~0)} is VALID [2022-02-20 14:46:41,207 INFO L290 TraceCheckUtils]: 85: Hoare triple {232#(<= 8 ~a17~0)} assume ((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0; {231#false} is VALID [2022-02-20 14:46:41,208 INFO L290 TraceCheckUtils]: 86: Hoare triple {231#false} assume !false; {231#false} is VALID [2022-02-20 14:46:41,210 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:46:41,211 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:46:41,214 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623820324] [2022-02-20 14:46:41,215 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623820324] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:46:41,215 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:46:41,216 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:46:41,217 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032602917] [2022-02-20 14:46:41,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:46:41,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2022-02-20 14:46:41,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:46:41,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have 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:46:41,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:46:41,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:46:41,319 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:46:41,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:46:41,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:46:41,336 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 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have 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:46:42,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:46:42,377 INFO L93 Difference]: Finished difference Result 596 states and 1030 transitions. [2022-02-20 14:46:42,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:46:42,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2022-02-20 14:46:42,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:46:42,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have 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:46:42,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1030 transitions. [2022-02-20 14:46:42,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have 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:46:42,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1030 transitions. [2022-02-20 14:46:42,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1030 transitions. [2022-02-20 14:46:43,039 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1030 edges. 1030 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:46:43,054 INFO L225 Difference]: With dead ends: 596 [2022-02-20 14:46:43,055 INFO L226 Difference]: Without dead ends: 305 [2022-02-20 14:46:43,058 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:46:43,060 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 157 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 14:46:43,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 89 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 14:46:43,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-02-20 14:46:43,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2022-02-20 14:46:43,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:46:43,094 INFO L82 GeneralOperation]: Start isEquivalent. First operand 305 states. Second operand has 305 states, 304 states have (on average 1.5263157894736843) internal successors, (464), 304 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have 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:46:43,096 INFO L74 IsIncluded]: Start isIncluded. First operand 305 states. Second operand has 305 states, 304 states have (on average 1.5263157894736843) internal successors, (464), 304 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have 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:46:43,097 INFO L87 Difference]: Start difference. First operand 305 states. Second operand has 305 states, 304 states have (on average 1.5263157894736843) internal successors, (464), 304 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have 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:46:43,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:46:43,108 INFO L93 Difference]: Finished difference Result 305 states and 464 transitions. [2022-02-20 14:46:43,108 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 464 transitions. [2022-02-20 14:46:43,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:46:43,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:46:43,111 INFO L74 IsIncluded]: Start isIncluded. First operand has 305 states, 304 states have (on average 1.5263157894736843) internal successors, (464), 304 states have internal predecessors, (464), 0 states have call successors, (0), 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 305 states. [2022-02-20 14:46:43,111 INFO L87 Difference]: Start difference. First operand has 305 states, 304 states have (on average 1.5263157894736843) internal successors, (464), 304 states have internal predecessors, (464), 0 states have call successors, (0), 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 305 states. [2022-02-20 14:46:43,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:46:43,120 INFO L93 Difference]: Finished difference Result 305 states and 464 transitions. [2022-02-20 14:46:43,120 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 464 transitions. [2022-02-20 14:46:43,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:46:43,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:46:43,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:46:43,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:46:43,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 1.5263157894736843) internal successors, (464), 304 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have 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:46:43,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 464 transitions. [2022-02-20 14:46:43,130 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 464 transitions. Word has length 87 [2022-02-20 14:46:43,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:46:43,131 INFO L470 AbstractCegarLoop]: Abstraction has 305 states and 464 transitions. [2022-02-20 14:46:43,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have 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:46:43,131 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 464 transitions. [2022-02-20 14:46:43,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-02-20 14:46:43,133 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:46:43,133 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:46:43,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:46:43,134 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:46:43,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:46:43,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1684381881, now seen corresponding path program 1 times [2022-02-20 14:46:43,135 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:46:43,135 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765513417] [2022-02-20 14:46:43,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:46:43,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:46:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:46:43,181 INFO L290 TraceCheckUtils]: 0: Hoare triple {1759#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; {1761#(= ~a11~0 0)} is VALID [2022-02-20 14:46:43,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {1761#(= ~a11~0 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; {1761#(= ~a11~0 0)} is VALID [2022-02-20 14:46:43,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {1761#(= ~a11~0 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; {1761#(= ~a11~0 0)} is VALID [2022-02-20 14:46:43,183 INFO L290 TraceCheckUtils]: 3: Hoare triple {1761#(= ~a11~0 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; {1761#(= ~a11~0 0)} is VALID [2022-02-20 14:46:43,183 INFO L290 TraceCheckUtils]: 4: Hoare triple {1761#(= ~a11~0 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); {1761#(= ~a11~0 0)} is VALID [2022-02-20 14:46:43,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {1761#(= ~a11~0 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)); {1761#(= ~a11~0 0)} is VALID [2022-02-20 14:46:43,184 INFO L290 TraceCheckUtils]: 6: Hoare triple {1761#(= ~a11~0 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); {1761#(= ~a11~0 0)} is VALID [2022-02-20 14:46:43,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {1761#(= ~a11~0 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); {1761#(= ~a11~0 0)} is VALID [2022-02-20 14:46:43,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {1761#(= ~a11~0 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); {1761#(= ~a11~0 0)} is VALID [2022-02-20 14:46:43,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {1761#(= ~a11~0 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); {1761#(= ~a11~0 0)} is VALID [2022-02-20 14:46:43,185 INFO L290 TraceCheckUtils]: 10: Hoare triple {1761#(= ~a11~0 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)); {1761#(= ~a11~0 0)} is VALID [2022-02-20 14:46:43,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {1761#(= ~a11~0 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;~a28~0 := 11;~a17~0 := 7;~a11~0 := 0;~a25~0 := 1;calculate_output_#res#1 := 22; {1760#false} is VALID [2022-02-20 14:46:43,186 INFO L290 TraceCheckUtils]: 12: Hoare triple {1760#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; {1760#false} is VALID [2022-02-20 14:46:43,186 INFO L290 TraceCheckUtils]: 13: Hoare triple {1760#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; {1760#false} is VALID [2022-02-20 14:46:43,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {1760#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; {1760#false} is VALID [2022-02-20 14:46:43,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,187 INFO L290 TraceCheckUtils]: 16: Hoare triple {1760#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)); {1760#false} is VALID [2022-02-20 14:46:43,187 INFO L290 TraceCheckUtils]: 17: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,187 INFO L290 TraceCheckUtils]: 20: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,188 INFO L290 TraceCheckUtils]: 21: Hoare triple {1760#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)); {1760#false} is VALID [2022-02-20 14:46:43,188 INFO L290 TraceCheckUtils]: 22: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,188 INFO L290 TraceCheckUtils]: 23: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,188 INFO L290 TraceCheckUtils]: 24: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,188 INFO L290 TraceCheckUtils]: 25: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,188 INFO L290 TraceCheckUtils]: 26: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,189 INFO L290 TraceCheckUtils]: 27: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,189 INFO L290 TraceCheckUtils]: 28: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,189 INFO L290 TraceCheckUtils]: 29: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,189 INFO L290 TraceCheckUtils]: 30: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,189 INFO L290 TraceCheckUtils]: 31: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,189 INFO L290 TraceCheckUtils]: 32: Hoare triple {1760#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)); {1760#false} is VALID [2022-02-20 14:46:43,190 INFO L290 TraceCheckUtils]: 33: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,190 INFO L290 TraceCheckUtils]: 34: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,190 INFO L290 TraceCheckUtils]: 35: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,190 INFO L290 TraceCheckUtils]: 36: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,190 INFO L290 TraceCheckUtils]: 37: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,190 INFO L290 TraceCheckUtils]: 38: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,191 INFO L290 TraceCheckUtils]: 39: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,191 INFO L290 TraceCheckUtils]: 40: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,191 INFO L290 TraceCheckUtils]: 41: Hoare triple {1760#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)); {1760#false} is VALID [2022-02-20 14:46:43,191 INFO L290 TraceCheckUtils]: 42: Hoare triple {1760#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)); {1760#false} is VALID [2022-02-20 14:46:43,191 INFO L290 TraceCheckUtils]: 43: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,191 INFO L290 TraceCheckUtils]: 44: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,191 INFO L290 TraceCheckUtils]: 45: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,192 INFO L290 TraceCheckUtils]: 46: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,192 INFO L290 TraceCheckUtils]: 47: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,192 INFO L290 TraceCheckUtils]: 48: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,192 INFO L290 TraceCheckUtils]: 49: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,192 INFO L290 TraceCheckUtils]: 50: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,192 INFO L290 TraceCheckUtils]: 51: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,193 INFO L290 TraceCheckUtils]: 52: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,193 INFO L290 TraceCheckUtils]: 53: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,193 INFO L290 TraceCheckUtils]: 54: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,193 INFO L290 TraceCheckUtils]: 55: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,193 INFO L290 TraceCheckUtils]: 56: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,193 INFO L290 TraceCheckUtils]: 57: Hoare triple {1760#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)); {1760#false} is VALID [2022-02-20 14:46:43,194 INFO L290 TraceCheckUtils]: 58: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,194 INFO L290 TraceCheckUtils]: 59: Hoare triple {1760#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)); {1760#false} is VALID [2022-02-20 14:46:43,194 INFO L290 TraceCheckUtils]: 60: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,194 INFO L290 TraceCheckUtils]: 61: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,194 INFO L290 TraceCheckUtils]: 62: Hoare triple {1760#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)); {1760#false} is VALID [2022-02-20 14:46:43,194 INFO L290 TraceCheckUtils]: 63: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,195 INFO L290 TraceCheckUtils]: 64: Hoare triple {1760#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)); {1760#false} is VALID [2022-02-20 14:46:43,195 INFO L290 TraceCheckUtils]: 65: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,195 INFO L290 TraceCheckUtils]: 66: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,195 INFO L290 TraceCheckUtils]: 67: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,195 INFO L290 TraceCheckUtils]: 68: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,195 INFO L290 TraceCheckUtils]: 69: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,196 INFO L290 TraceCheckUtils]: 70: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,196 INFO L290 TraceCheckUtils]: 71: Hoare triple {1760#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)); {1760#false} is VALID [2022-02-20 14:46:43,196 INFO L290 TraceCheckUtils]: 72: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,196 INFO L290 TraceCheckUtils]: 73: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,196 INFO L290 TraceCheckUtils]: 74: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,196 INFO L290 TraceCheckUtils]: 75: Hoare triple {1760#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)); {1760#false} is VALID [2022-02-20 14:46:43,197 INFO L290 TraceCheckUtils]: 76: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,197 INFO L290 TraceCheckUtils]: 77: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,197 INFO L290 TraceCheckUtils]: 78: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,197 INFO L290 TraceCheckUtils]: 79: Hoare triple {1760#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)); {1760#false} is VALID [2022-02-20 14:46:43,197 INFO L290 TraceCheckUtils]: 80: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,197 INFO L290 TraceCheckUtils]: 81: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,198 INFO L290 TraceCheckUtils]: 82: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,198 INFO L290 TraceCheckUtils]: 83: Hoare triple {1760#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)); {1760#false} is VALID [2022-02-20 14:46:43,198 INFO L290 TraceCheckUtils]: 84: Hoare triple {1760#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)); {1760#false} is VALID [2022-02-20 14:46:43,198 INFO L290 TraceCheckUtils]: 85: Hoare triple {1760#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)); {1760#false} is VALID [2022-02-20 14:46:43,198 INFO L290 TraceCheckUtils]: 86: Hoare triple {1760#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)); {1760#false} is VALID [2022-02-20 14:46:43,198 INFO L290 TraceCheckUtils]: 87: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,199 INFO L290 TraceCheckUtils]: 88: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,199 INFO L290 TraceCheckUtils]: 89: Hoare triple {1760#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); {1760#false} is VALID [2022-02-20 14:46:43,199 INFO L290 TraceCheckUtils]: 90: Hoare triple {1760#false} assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); {1760#false} is VALID [2022-02-20 14:46:43,199 INFO L290 TraceCheckUtils]: 91: Hoare triple {1760#false} assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); {1760#false} is VALID [2022-02-20 14:46:43,199 INFO L290 TraceCheckUtils]: 92: Hoare triple {1760#false} assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); {1760#false} is VALID [2022-02-20 14:46:43,199 INFO L290 TraceCheckUtils]: 93: Hoare triple {1760#false} assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); {1760#false} is VALID [2022-02-20 14:46:43,199 INFO L290 TraceCheckUtils]: 94: Hoare triple {1760#false} assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); {1760#false} is VALID [2022-02-20 14:46:43,200 INFO L290 TraceCheckUtils]: 95: Hoare triple {1760#false} assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); {1760#false} is VALID [2022-02-20 14:46:43,200 INFO L290 TraceCheckUtils]: 96: Hoare triple {1760#false} assume ((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0; {1760#false} is VALID [2022-02-20 14:46:43,200 INFO L290 TraceCheckUtils]: 97: Hoare triple {1760#false} assume !false; {1760#false} is VALID [2022-02-20 14:46:43,200 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:46:43,201 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:46:43,201 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765513417] [2022-02-20 14:46:43,201 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765513417] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:46:43,201 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:46:43,201 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:46:43,201 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748021178] [2022-02-20 14:46:43,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:46:43,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2022-02-20 14:46:43,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:46:43,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have 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:46:43,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:46:43,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:46:43,268 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:46:43,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:46:43,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:46:43,269 INFO L87 Difference]: Start difference. First operand 305 states and 464 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have 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:46:43,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:46:43,838 INFO L93 Difference]: Finished difference Result 900 states and 1374 transitions. [2022-02-20 14:46:43,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:46:43,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2022-02-20 14:46:43,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:46:43,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have 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:46:43,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 728 transitions. [2022-02-20 14:46:43,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have 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:46:43,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 728 transitions. [2022-02-20 14:46:43,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 728 transitions. [2022-02-20 14:46:44,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 728 edges. 728 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:46:44,313 INFO L225 Difference]: With dead ends: 900 [2022-02-20 14:46:44,313 INFO L226 Difference]: Without dead ends: 597 [2022-02-20 14:46:44,316 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:46:44,317 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 191 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:46:44,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 72 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:46:44,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2022-02-20 14:46:44,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 456. [2022-02-20 14:46:44,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:46:44,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 597 states. Second operand has 456 states, 455 states have (on average 1.4901098901098901) internal successors, (678), 455 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have 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:46:44,332 INFO L74 IsIncluded]: Start isIncluded. First operand 597 states. Second operand has 456 states, 455 states have (on average 1.4901098901098901) internal successors, (678), 455 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have 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:46:44,333 INFO L87 Difference]: Start difference. First operand 597 states. Second operand has 456 states, 455 states have (on average 1.4901098901098901) internal successors, (678), 455 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have 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:46:44,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:46:44,347 INFO L93 Difference]: Finished difference Result 597 states and 879 transitions. [2022-02-20 14:46:44,347 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 879 transitions. [2022-02-20 14:46:44,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:46:44,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:46:44,349 INFO L74 IsIncluded]: Start isIncluded. First operand has 456 states, 455 states have (on average 1.4901098901098901) internal successors, (678), 455 states have internal predecessors, (678), 0 states have call successors, (0), 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 597 states. [2022-02-20 14:46:44,350 INFO L87 Difference]: Start difference. First operand has 456 states, 455 states have (on average 1.4901098901098901) internal successors, (678), 455 states have internal predecessors, (678), 0 states have call successors, (0), 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 597 states. [2022-02-20 14:46:44,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:46:44,366 INFO L93 Difference]: Finished difference Result 597 states and 879 transitions. [2022-02-20 14:46:44,366 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 879 transitions. [2022-02-20 14:46:44,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:46:44,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:46:44,367 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:46:44,367 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:46:44,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 1.4901098901098901) internal successors, (678), 455 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have 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:46:44,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 678 transitions. [2022-02-20 14:46:44,379 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 678 transitions. Word has length 98 [2022-02-20 14:46:44,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:46:44,379 INFO L470 AbstractCegarLoop]: Abstraction has 456 states and 678 transitions. [2022-02-20 14:46:44,380 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have 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:46:44,380 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 678 transitions. [2022-02-20 14:46:44,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-20 14:46:44,381 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:46:44,381 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:46:44,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 14:46:44,381 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:46:44,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:46:44,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1709716194, now seen corresponding path program 1 times [2022-02-20 14:46:44,382 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:46:44,382 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145971970] [2022-02-20 14:46:44,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:46:44,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:46:44,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:46:44,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {4332#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; {4334#(= ~a25~0 0)} is VALID [2022-02-20 14:46:44,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {4334#(= ~a25~0 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; {4334#(= ~a25~0 0)} is VALID [2022-02-20 14:46:44,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {4334#(= ~a25~0 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; {4334#(= ~a25~0 0)} is VALID [2022-02-20 14:46:44,436 INFO L290 TraceCheckUtils]: 3: Hoare triple {4334#(= ~a25~0 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; {4334#(= ~a25~0 0)} is VALID [2022-02-20 14:46:44,436 INFO L290 TraceCheckUtils]: 4: Hoare triple {4334#(= ~a25~0 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); {4334#(= ~a25~0 0)} is VALID [2022-02-20 14:46:44,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {4334#(= ~a25~0 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)); {4334#(= ~a25~0 0)} is VALID [2022-02-20 14:46:44,437 INFO L290 TraceCheckUtils]: 6: Hoare triple {4334#(= ~a25~0 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); {4334#(= ~a25~0 0)} is VALID [2022-02-20 14:46:44,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {4334#(= ~a25~0 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); {4334#(= ~a25~0 0)} is VALID [2022-02-20 14:46:44,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {4334#(= ~a25~0 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); {4334#(= ~a25~0 0)} is VALID [2022-02-20 14:46:44,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {4334#(= ~a25~0 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); {4334#(= ~a25~0 0)} is VALID [2022-02-20 14:46:44,438 INFO L290 TraceCheckUtils]: 10: Hoare triple {4334#(= ~a25~0 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)); {4334#(= ~a25~0 0)} is VALID [2022-02-20 14:46:44,438 INFO L290 TraceCheckUtils]: 11: Hoare triple {4334#(= ~a25~0 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); {4334#(= ~a25~0 0)} is VALID [2022-02-20 14:46:44,439 INFO L290 TraceCheckUtils]: 12: Hoare triple {4334#(= ~a25~0 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); {4334#(= ~a25~0 0)} is VALID [2022-02-20 14:46:44,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {4334#(= ~a25~0 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); {4334#(= ~a25~0 0)} is VALID [2022-02-20 14:46:44,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {4334#(= ~a25~0 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); {4334#(= ~a25~0 0)} is VALID [2022-02-20 14:46:44,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {4334#(= ~a25~0 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); {4334#(= ~a25~0 0)} is VALID [2022-02-20 14:46:44,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {4334#(= ~a25~0 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); {4334#(= ~a25~0 0)} is VALID [2022-02-20 14:46:44,440 INFO L290 TraceCheckUtils]: 17: Hoare triple {4334#(= ~a25~0 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); {4334#(= ~a25~0 0)} is VALID [2022-02-20 14:46:44,441 INFO L290 TraceCheckUtils]: 18: Hoare triple {4334#(= ~a25~0 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;~a17~0 := 7;~a25~0 := 0;~a11~0 := 1;~a28~0 := 10;~a19~0 := 0;calculate_output_#res#1 := -1; {4333#false} is VALID [2022-02-20 14:46:44,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {4333#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; {4333#false} is VALID [2022-02-20 14:46:44,441 INFO L290 TraceCheckUtils]: 20: Hoare triple {4333#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; {4333#false} is VALID [2022-02-20 14:46:44,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {4333#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; {4333#false} is VALID [2022-02-20 14:46:44,441 INFO L290 TraceCheckUtils]: 22: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {4333#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)); {4333#false} is VALID [2022-02-20 14:46:44,442 INFO L290 TraceCheckUtils]: 24: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,442 INFO L290 TraceCheckUtils]: 25: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,442 INFO L290 TraceCheckUtils]: 26: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,442 INFO L290 TraceCheckUtils]: 27: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,442 INFO L290 TraceCheckUtils]: 28: Hoare triple {4333#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)); {4333#false} is VALID [2022-02-20 14:46:44,442 INFO L290 TraceCheckUtils]: 29: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,443 INFO L290 TraceCheckUtils]: 30: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,443 INFO L290 TraceCheckUtils]: 31: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,443 INFO L290 TraceCheckUtils]: 32: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,443 INFO L290 TraceCheckUtils]: 33: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,443 INFO L290 TraceCheckUtils]: 34: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,443 INFO L290 TraceCheckUtils]: 35: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,443 INFO L290 TraceCheckUtils]: 36: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,444 INFO L290 TraceCheckUtils]: 37: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,444 INFO L290 TraceCheckUtils]: 38: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,444 INFO L290 TraceCheckUtils]: 39: Hoare triple {4333#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)); {4333#false} is VALID [2022-02-20 14:46:44,444 INFO L290 TraceCheckUtils]: 40: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,444 INFO L290 TraceCheckUtils]: 41: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,444 INFO L290 TraceCheckUtils]: 42: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,445 INFO L290 TraceCheckUtils]: 43: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,445 INFO L290 TraceCheckUtils]: 44: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,445 INFO L290 TraceCheckUtils]: 45: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,445 INFO L290 TraceCheckUtils]: 46: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,445 INFO L290 TraceCheckUtils]: 47: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,445 INFO L290 TraceCheckUtils]: 48: Hoare triple {4333#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)); {4333#false} is VALID [2022-02-20 14:46:44,445 INFO L290 TraceCheckUtils]: 49: Hoare triple {4333#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)); {4333#false} is VALID [2022-02-20 14:46:44,446 INFO L290 TraceCheckUtils]: 50: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,446 INFO L290 TraceCheckUtils]: 51: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,446 INFO L290 TraceCheckUtils]: 52: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,446 INFO L290 TraceCheckUtils]: 53: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,446 INFO L290 TraceCheckUtils]: 54: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,446 INFO L290 TraceCheckUtils]: 55: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,447 INFO L290 TraceCheckUtils]: 56: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,447 INFO L290 TraceCheckUtils]: 57: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,447 INFO L290 TraceCheckUtils]: 58: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,447 INFO L290 TraceCheckUtils]: 59: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,447 INFO L290 TraceCheckUtils]: 60: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,447 INFO L290 TraceCheckUtils]: 61: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,448 INFO L290 TraceCheckUtils]: 62: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,448 INFO L290 TraceCheckUtils]: 63: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,448 INFO L290 TraceCheckUtils]: 64: Hoare triple {4333#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)); {4333#false} is VALID [2022-02-20 14:46:44,448 INFO L290 TraceCheckUtils]: 65: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,448 INFO L290 TraceCheckUtils]: 66: Hoare triple {4333#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)); {4333#false} is VALID [2022-02-20 14:46:44,448 INFO L290 TraceCheckUtils]: 67: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,448 INFO L290 TraceCheckUtils]: 68: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,449 INFO L290 TraceCheckUtils]: 69: Hoare triple {4333#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)); {4333#false} is VALID [2022-02-20 14:46:44,449 INFO L290 TraceCheckUtils]: 70: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,449 INFO L290 TraceCheckUtils]: 71: Hoare triple {4333#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)); {4333#false} is VALID [2022-02-20 14:46:44,449 INFO L290 TraceCheckUtils]: 72: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,449 INFO L290 TraceCheckUtils]: 73: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,449 INFO L290 TraceCheckUtils]: 74: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,450 INFO L290 TraceCheckUtils]: 75: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,450 INFO L290 TraceCheckUtils]: 76: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,450 INFO L290 TraceCheckUtils]: 77: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,450 INFO L290 TraceCheckUtils]: 78: Hoare triple {4333#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)); {4333#false} is VALID [2022-02-20 14:46:44,450 INFO L290 TraceCheckUtils]: 79: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,450 INFO L290 TraceCheckUtils]: 80: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,450 INFO L290 TraceCheckUtils]: 81: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,451 INFO L290 TraceCheckUtils]: 82: Hoare triple {4333#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)); {4333#false} is VALID [2022-02-20 14:46:44,451 INFO L290 TraceCheckUtils]: 83: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,451 INFO L290 TraceCheckUtils]: 84: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,451 INFO L290 TraceCheckUtils]: 85: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,451 INFO L290 TraceCheckUtils]: 86: Hoare triple {4333#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)); {4333#false} is VALID [2022-02-20 14:46:44,451 INFO L290 TraceCheckUtils]: 87: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,451 INFO L290 TraceCheckUtils]: 88: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,452 INFO L290 TraceCheckUtils]: 89: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,452 INFO L290 TraceCheckUtils]: 90: Hoare triple {4333#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)); {4333#false} is VALID [2022-02-20 14:46:44,452 INFO L290 TraceCheckUtils]: 91: Hoare triple {4333#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)); {4333#false} is VALID [2022-02-20 14:46:44,452 INFO L290 TraceCheckUtils]: 92: Hoare triple {4333#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)); {4333#false} is VALID [2022-02-20 14:46:44,452 INFO L290 TraceCheckUtils]: 93: Hoare triple {4333#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)); {4333#false} is VALID [2022-02-20 14:46:44,452 INFO L290 TraceCheckUtils]: 94: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,452 INFO L290 TraceCheckUtils]: 95: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,453 INFO L290 TraceCheckUtils]: 96: Hoare triple {4333#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); {4333#false} is VALID [2022-02-20 14:46:44,453 INFO L290 TraceCheckUtils]: 97: Hoare triple {4333#false} assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); {4333#false} is VALID [2022-02-20 14:46:44,453 INFO L290 TraceCheckUtils]: 98: Hoare triple {4333#false} assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); {4333#false} is VALID [2022-02-20 14:46:44,453 INFO L290 TraceCheckUtils]: 99: Hoare triple {4333#false} assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); {4333#false} is VALID [2022-02-20 14:46:44,453 INFO L290 TraceCheckUtils]: 100: Hoare triple {4333#false} assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); {4333#false} is VALID [2022-02-20 14:46:44,453 INFO L290 TraceCheckUtils]: 101: Hoare triple {4333#false} assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); {4333#false} is VALID [2022-02-20 14:46:44,454 INFO L290 TraceCheckUtils]: 102: Hoare triple {4333#false} assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); {4333#false} is VALID [2022-02-20 14:46:44,454 INFO L290 TraceCheckUtils]: 103: Hoare triple {4333#false} assume ((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0; {4333#false} is VALID [2022-02-20 14:46:44,454 INFO L290 TraceCheckUtils]: 104: Hoare triple {4333#false} assume !false; {4333#false} is VALID [2022-02-20 14:46:44,454 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:46:44,454 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:46:44,455 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145971970] [2022-02-20 14:46:44,455 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145971970] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:46:44,455 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:46:44,455 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:46:44,455 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68693667] [2022-02-20 14:46:44,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:46:44,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-02-20 14:46:44,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:46:44,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have 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:46:44,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:46:44,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:46:44,531 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:46:44,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:46:44,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:46:44,532 INFO L87 Difference]: Start difference. First operand 456 states and 678 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have 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:46:45,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:46:45,121 INFO L93 Difference]: Finished difference Result 1352 states and 2016 transitions. [2022-02-20 14:46:45,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:46:45,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-02-20 14:46:45,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:46:45,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have 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:46:45,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 733 transitions. [2022-02-20 14:46:45,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have 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:46:45,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 733 transitions. [2022-02-20 14:46:45,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 733 transitions. [2022-02-20 14:46:45,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 733 edges. 733 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:46:45,626 INFO L225 Difference]: With dead ends: 1352 [2022-02-20 14:46:45,627 INFO L226 Difference]: Without dead ends: 898 [2022-02-20 14:46:45,627 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:46:45,628 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 158 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:46:45,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 123 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:46:45,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2022-02-20 14:46:45,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 889. [2022-02-20 14:46:45,647 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:46:45,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 898 states. Second operand has 889 states, 888 states have (on average 1.4391891891891893) internal successors, (1278), 888 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have 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:46:45,649 INFO L74 IsIncluded]: Start isIncluded. First operand 898 states. Second operand has 889 states, 888 states have (on average 1.4391891891891893) internal successors, (1278), 888 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have 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:46:45,651 INFO L87 Difference]: Start difference. First operand 898 states. Second operand has 889 states, 888 states have (on average 1.4391891891891893) internal successors, (1278), 888 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have 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:46:45,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:46:45,678 INFO L93 Difference]: Finished difference Result 898 states and 1291 transitions. [2022-02-20 14:46:45,678 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1291 transitions. [2022-02-20 14:46:45,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:46:45,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:46:45,681 INFO L74 IsIncluded]: Start isIncluded. First operand has 889 states, 888 states have (on average 1.4391891891891893) internal successors, (1278), 888 states have internal predecessors, (1278), 0 states have call successors, (0), 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 898 states. [2022-02-20 14:46:45,682 INFO L87 Difference]: Start difference. First operand has 889 states, 888 states have (on average 1.4391891891891893) internal successors, (1278), 888 states have internal predecessors, (1278), 0 states have call successors, (0), 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 898 states. [2022-02-20 14:46:45,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:46:45,711 INFO L93 Difference]: Finished difference Result 898 states and 1291 transitions. [2022-02-20 14:46:45,711 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1291 transitions. [2022-02-20 14:46:45,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:46:45,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:46:45,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:46:45,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:46:45,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 888 states have (on average 1.4391891891891893) internal successors, (1278), 888 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have 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:46:45,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1278 transitions. [2022-02-20 14:46:45,741 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1278 transitions. Word has length 105 [2022-02-20 14:46:45,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:46:45,741 INFO L470 AbstractCegarLoop]: Abstraction has 889 states and 1278 transitions. [2022-02-20 14:46:45,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have 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:46:45,742 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1278 transitions. [2022-02-20 14:46:45,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-02-20 14:46:45,743 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:46:45,743 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:46:45,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 14:46:45,743 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:46:45,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:46:45,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1852917719, now seen corresponding path program 1 times [2022-02-20 14:46:45,744 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:46:45,744 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543034888] [2022-02-20 14:46:45,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:46:45,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:46:45,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:46:45,794 INFO L290 TraceCheckUtils]: 0: Hoare triple {8404#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; {8406#(and (= ~a25~0 ~a11~0) (<= ~a28~0 7))} is VALID [2022-02-20 14:46:45,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {8406#(and (= ~a25~0 ~a11~0) (<= ~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; {8406#(and (= ~a25~0 ~a11~0) (<= ~a28~0 7))} is VALID [2022-02-20 14:46:45,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {8406#(and (= ~a25~0 ~a11~0) (<= ~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; {8406#(and (= ~a25~0 ~a11~0) (<= ~a28~0 7))} is VALID [2022-02-20 14:46:45,796 INFO L290 TraceCheckUtils]: 3: Hoare triple {8406#(and (= ~a25~0 ~a11~0) (<= ~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; {8406#(and (= ~a25~0 ~a11~0) (<= ~a28~0 7))} is VALID [2022-02-20 14:46:45,797 INFO L290 TraceCheckUtils]: 4: Hoare triple {8406#(and (= ~a25~0 ~a11~0) (<= ~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;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res#1 := -1; {8405#false} is VALID [2022-02-20 14:46:45,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {8405#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; {8405#false} is VALID [2022-02-20 14:46:45,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {8405#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; {8405#false} is VALID [2022-02-20 14:46:45,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {8405#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; {8405#false} is VALID [2022-02-20 14:46:45,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {8405#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)); {8405#false} is VALID [2022-02-20 14:46:45,797 INFO L290 TraceCheckUtils]: 10: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,798 INFO L290 TraceCheckUtils]: 14: Hoare triple {8405#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)); {8405#false} is VALID [2022-02-20 14:46:45,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,798 INFO L290 TraceCheckUtils]: 17: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,799 INFO L290 TraceCheckUtils]: 19: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {8405#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;~a17~0 := 7;~a25~0 := 0;~a11~0 := 1;~a28~0 := 10;~a19~0 := 0;calculate_output_#res#1 := -1; {8405#false} is VALID [2022-02-20 14:46:45,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {8405#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; {8405#false} is VALID [2022-02-20 14:46:45,799 INFO L290 TraceCheckUtils]: 24: Hoare triple {8405#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; {8405#false} is VALID [2022-02-20 14:46:45,800 INFO L290 TraceCheckUtils]: 25: Hoare triple {8405#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; {8405#false} is VALID [2022-02-20 14:46:45,800 INFO L290 TraceCheckUtils]: 26: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,800 INFO L290 TraceCheckUtils]: 27: Hoare triple {8405#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)); {8405#false} is VALID [2022-02-20 14:46:45,800 INFO L290 TraceCheckUtils]: 28: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,800 INFO L290 TraceCheckUtils]: 29: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,800 INFO L290 TraceCheckUtils]: 30: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,800 INFO L290 TraceCheckUtils]: 31: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,800 INFO L290 TraceCheckUtils]: 32: Hoare triple {8405#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)); {8405#false} is VALID [2022-02-20 14:46:45,801 INFO L290 TraceCheckUtils]: 33: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,801 INFO L290 TraceCheckUtils]: 34: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,801 INFO L290 TraceCheckUtils]: 35: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,801 INFO L290 TraceCheckUtils]: 36: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,801 INFO L290 TraceCheckUtils]: 37: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,801 INFO L290 TraceCheckUtils]: 38: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,801 INFO L290 TraceCheckUtils]: 39: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,802 INFO L290 TraceCheckUtils]: 40: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,802 INFO L290 TraceCheckUtils]: 41: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,802 INFO L290 TraceCheckUtils]: 42: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,802 INFO L290 TraceCheckUtils]: 43: Hoare triple {8405#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)); {8405#false} is VALID [2022-02-20 14:46:45,802 INFO L290 TraceCheckUtils]: 44: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,802 INFO L290 TraceCheckUtils]: 45: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,802 INFO L290 TraceCheckUtils]: 46: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,803 INFO L290 TraceCheckUtils]: 47: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,803 INFO L290 TraceCheckUtils]: 48: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,803 INFO L290 TraceCheckUtils]: 49: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,803 INFO L290 TraceCheckUtils]: 50: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,803 INFO L290 TraceCheckUtils]: 51: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,803 INFO L290 TraceCheckUtils]: 52: Hoare triple {8405#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)); {8405#false} is VALID [2022-02-20 14:46:45,803 INFO L290 TraceCheckUtils]: 53: Hoare triple {8405#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)); {8405#false} is VALID [2022-02-20 14:46:45,804 INFO L290 TraceCheckUtils]: 54: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,804 INFO L290 TraceCheckUtils]: 55: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,804 INFO L290 TraceCheckUtils]: 56: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,804 INFO L290 TraceCheckUtils]: 57: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,804 INFO L290 TraceCheckUtils]: 58: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,804 INFO L290 TraceCheckUtils]: 59: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,804 INFO L290 TraceCheckUtils]: 60: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,805 INFO L290 TraceCheckUtils]: 61: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,805 INFO L290 TraceCheckUtils]: 62: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,805 INFO L290 TraceCheckUtils]: 63: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,805 INFO L290 TraceCheckUtils]: 64: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,805 INFO L290 TraceCheckUtils]: 65: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,805 INFO L290 TraceCheckUtils]: 66: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,805 INFO L290 TraceCheckUtils]: 67: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,806 INFO L290 TraceCheckUtils]: 68: Hoare triple {8405#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)); {8405#false} is VALID [2022-02-20 14:46:45,806 INFO L290 TraceCheckUtils]: 69: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,806 INFO L290 TraceCheckUtils]: 70: Hoare triple {8405#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)); {8405#false} is VALID [2022-02-20 14:46:45,806 INFO L290 TraceCheckUtils]: 71: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,806 INFO L290 TraceCheckUtils]: 72: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,806 INFO L290 TraceCheckUtils]: 73: Hoare triple {8405#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)); {8405#false} is VALID [2022-02-20 14:46:45,806 INFO L290 TraceCheckUtils]: 74: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,806 INFO L290 TraceCheckUtils]: 75: Hoare triple {8405#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)); {8405#false} is VALID [2022-02-20 14:46:45,807 INFO L290 TraceCheckUtils]: 76: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,807 INFO L290 TraceCheckUtils]: 77: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,807 INFO L290 TraceCheckUtils]: 78: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,807 INFO L290 TraceCheckUtils]: 79: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,807 INFO L290 TraceCheckUtils]: 80: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,807 INFO L290 TraceCheckUtils]: 81: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,807 INFO L290 TraceCheckUtils]: 82: Hoare triple {8405#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)); {8405#false} is VALID [2022-02-20 14:46:45,808 INFO L290 TraceCheckUtils]: 83: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,808 INFO L290 TraceCheckUtils]: 84: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,808 INFO L290 TraceCheckUtils]: 85: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,808 INFO L290 TraceCheckUtils]: 86: Hoare triple {8405#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)); {8405#false} is VALID [2022-02-20 14:46:45,808 INFO L290 TraceCheckUtils]: 87: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,808 INFO L290 TraceCheckUtils]: 88: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,808 INFO L290 TraceCheckUtils]: 89: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,809 INFO L290 TraceCheckUtils]: 90: Hoare triple {8405#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)); {8405#false} is VALID [2022-02-20 14:46:45,809 INFO L290 TraceCheckUtils]: 91: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,809 INFO L290 TraceCheckUtils]: 92: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,809 INFO L290 TraceCheckUtils]: 93: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,809 INFO L290 TraceCheckUtils]: 94: Hoare triple {8405#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)); {8405#false} is VALID [2022-02-20 14:46:45,809 INFO L290 TraceCheckUtils]: 95: Hoare triple {8405#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)); {8405#false} is VALID [2022-02-20 14:46:45,809 INFO L290 TraceCheckUtils]: 96: Hoare triple {8405#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)); {8405#false} is VALID [2022-02-20 14:46:45,810 INFO L290 TraceCheckUtils]: 97: Hoare triple {8405#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)); {8405#false} is VALID [2022-02-20 14:46:45,810 INFO L290 TraceCheckUtils]: 98: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,810 INFO L290 TraceCheckUtils]: 99: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,810 INFO L290 TraceCheckUtils]: 100: Hoare triple {8405#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); {8405#false} is VALID [2022-02-20 14:46:45,810 INFO L290 TraceCheckUtils]: 101: Hoare triple {8405#false} assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); {8405#false} is VALID [2022-02-20 14:46:45,810 INFO L290 TraceCheckUtils]: 102: Hoare triple {8405#false} assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); {8405#false} is VALID [2022-02-20 14:46:45,810 INFO L290 TraceCheckUtils]: 103: Hoare triple {8405#false} assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); {8405#false} is VALID [2022-02-20 14:46:45,811 INFO L290 TraceCheckUtils]: 104: Hoare triple {8405#false} assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); {8405#false} is VALID [2022-02-20 14:46:45,811 INFO L290 TraceCheckUtils]: 105: Hoare triple {8405#false} assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); {8405#false} is VALID [2022-02-20 14:46:45,811 INFO L290 TraceCheckUtils]: 106: Hoare triple {8405#false} assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); {8405#false} is VALID [2022-02-20 14:46:45,811 INFO L290 TraceCheckUtils]: 107: Hoare triple {8405#false} assume ((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0; {8405#false} is VALID [2022-02-20 14:46:45,811 INFO L290 TraceCheckUtils]: 108: Hoare triple {8405#false} assume !false; {8405#false} is VALID [2022-02-20 14:46:45,812 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-20 14:46:45,812 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:46:45,812 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543034888] [2022-02-20 14:46:45,812 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543034888] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:46:45,812 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:46:45,812 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:46:45,812 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208148396] [2022-02-20 14:46:45,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:46:45,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2022-02-20 14:46:45,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:46:45,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:46:45,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:46:45,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:46:45,881 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:46:45,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:46:45,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:46:45,882 INFO L87 Difference]: Start difference. First operand 889 states and 1278 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:46:46,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:46:46,681 INFO L93 Difference]: Finished difference Result 2201 states and 3179 transitions. [2022-02-20 14:46:46,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:46:46,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2022-02-20 14:46:46,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:46:46,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:46:46,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2022-02-20 14:46:46,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:46:46,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2022-02-20 14:46:46,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 718 transitions. [2022-02-20 14:46:47,133 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:46:47,185 INFO L225 Difference]: With dead ends: 2201 [2022-02-20 14:46:47,185 INFO L226 Difference]: Without dead ends: 1314 [2022-02-20 14:46:47,186 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:46:47,187 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 143 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 14:46:47,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 122 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 14:46:47,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2022-02-20 14:46:47,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1172. [2022-02-20 14:46:47,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:46:47,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1314 states. Second operand has 1172 states, 1171 states have (on average 1.354397950469684) internal successors, (1586), 1171 states have internal predecessors, (1586), 0 states have call successors, (0), 0 states have 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:46:47,211 INFO L74 IsIncluded]: Start isIncluded. First operand 1314 states. Second operand has 1172 states, 1171 states have (on average 1.354397950469684) internal successors, (1586), 1171 states have internal predecessors, (1586), 0 states have call successors, (0), 0 states have 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:46:47,213 INFO L87 Difference]: Start difference. First operand 1314 states. Second operand has 1172 states, 1171 states have (on average 1.354397950469684) internal successors, (1586), 1171 states have internal predecessors, (1586), 0 states have call successors, (0), 0 states have 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:46:47,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:46:47,276 INFO L93 Difference]: Finished difference Result 1314 states and 1745 transitions. [2022-02-20 14:46:47,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1745 transitions. [2022-02-20 14:46:47,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:46:47,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:46:47,279 INFO L74 IsIncluded]: Start isIncluded. First operand has 1172 states, 1171 states have (on average 1.354397950469684) internal successors, (1586), 1171 states have internal predecessors, (1586), 0 states have call successors, (0), 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 1314 states. [2022-02-20 14:46:47,280 INFO L87 Difference]: Start difference. First operand has 1172 states, 1171 states have (on average 1.354397950469684) internal successors, (1586), 1171 states have internal predecessors, (1586), 0 states have call successors, (0), 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 1314 states. [2022-02-20 14:46:47,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:46:47,329 INFO L93 Difference]: Finished difference Result 1314 states and 1745 transitions. [2022-02-20 14:46:47,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1745 transitions. [2022-02-20 14:46:47,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:46:47,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:46:47,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:46:47,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:46:47,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 1171 states have (on average 1.354397950469684) internal successors, (1586), 1171 states have internal predecessors, (1586), 0 states have call successors, (0), 0 states have 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:46:47,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1586 transitions. [2022-02-20 14:46:47,371 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1586 transitions. Word has length 109 [2022-02-20 14:46:47,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:46:47,371 INFO L470 AbstractCegarLoop]: Abstraction has 1172 states and 1586 transitions. [2022-02-20 14:46:47,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:46:47,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1586 transitions. [2022-02-20 14:46:47,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-20 14:46:47,373 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:46:47,374 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:46:47,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 14:46:47,374 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:46:47,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:46:47,374 INFO L85 PathProgramCache]: Analyzing trace with hash -953514324, now seen corresponding path program 1 times [2022-02-20 14:46:47,375 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:46:47,375 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110015596] [2022-02-20 14:46:47,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:46:47,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:46:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:46:47,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {14456#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; {14456#true} is VALID [2022-02-20 14:46:47,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {14456#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; {14456#true} is VALID [2022-02-20 14:46:47,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {14456#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; {14456#true} is VALID [2022-02-20 14:46:47,420 INFO L290 TraceCheckUtils]: 3: Hoare triple {14456#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; {14456#true} is VALID [2022-02-20 14:46:47,421 INFO L290 TraceCheckUtils]: 4: Hoare triple {14456#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); {14456#true} is VALID [2022-02-20 14:46:47,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {14456#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; {14458#(and (<= 10 ~a28~0) (not (= ~a25~0 1)))} is VALID [2022-02-20 14:46:47,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {14458#(and (<= 10 ~a28~0) (not (= ~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; {14458#(and (<= 10 ~a28~0) (not (= ~a25~0 1)))} is VALID [2022-02-20 14:46:47,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {14458#(and (<= 10 ~a28~0) (not (= ~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; {14458#(and (<= 10 ~a28~0) (not (= ~a25~0 1)))} is VALID [2022-02-20 14:46:47,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {14458#(and (<= 10 ~a28~0) (not (= ~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; {14458#(and (<= 10 ~a28~0) (not (= ~a25~0 1)))} is VALID [2022-02-20 14:46:47,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {14458#(and (<= 10 ~a28~0) (not (= ~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;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res#1 := -1; {14457#false} is VALID [2022-02-20 14:46:47,423 INFO L290 TraceCheckUtils]: 10: Hoare triple {14457#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; {14457#false} is VALID [2022-02-20 14:46:47,423 INFO L290 TraceCheckUtils]: 11: Hoare triple {14457#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; {14457#false} is VALID [2022-02-20 14:46:47,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {14457#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; {14457#false} is VALID [2022-02-20 14:46:47,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {14457#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)); {14457#false} is VALID [2022-02-20 14:46:47,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,424 INFO L290 TraceCheckUtils]: 17: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,424 INFO L290 TraceCheckUtils]: 18: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,424 INFO L290 TraceCheckUtils]: 19: Hoare triple {14457#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)); {14457#false} is VALID [2022-02-20 14:46:47,424 INFO L290 TraceCheckUtils]: 20: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,425 INFO L290 TraceCheckUtils]: 23: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,425 INFO L290 TraceCheckUtils]: 24: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,425 INFO L290 TraceCheckUtils]: 25: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,425 INFO L290 TraceCheckUtils]: 26: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,425 INFO L290 TraceCheckUtils]: 27: Hoare triple {14457#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;~a17~0 := 7;~a25~0 := 0;~a11~0 := 1;~a28~0 := 10;~a19~0 := 0;calculate_output_#res#1 := -1; {14457#false} is VALID [2022-02-20 14:46:47,425 INFO L290 TraceCheckUtils]: 28: Hoare triple {14457#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; {14457#false} is VALID [2022-02-20 14:46:47,425 INFO L290 TraceCheckUtils]: 29: Hoare triple {14457#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; {14457#false} is VALID [2022-02-20 14:46:47,426 INFO L290 TraceCheckUtils]: 30: Hoare triple {14457#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; {14457#false} is VALID [2022-02-20 14:46:47,426 INFO L290 TraceCheckUtils]: 31: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,426 INFO L290 TraceCheckUtils]: 32: Hoare triple {14457#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)); {14457#false} is VALID [2022-02-20 14:46:47,426 INFO L290 TraceCheckUtils]: 33: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,426 INFO L290 TraceCheckUtils]: 34: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,426 INFO L290 TraceCheckUtils]: 35: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,427 INFO L290 TraceCheckUtils]: 36: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,427 INFO L290 TraceCheckUtils]: 37: Hoare triple {14457#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)); {14457#false} is VALID [2022-02-20 14:46:47,427 INFO L290 TraceCheckUtils]: 38: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,427 INFO L290 TraceCheckUtils]: 39: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,427 INFO L290 TraceCheckUtils]: 40: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,427 INFO L290 TraceCheckUtils]: 41: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,427 INFO L290 TraceCheckUtils]: 42: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,428 INFO L290 TraceCheckUtils]: 43: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,428 INFO L290 TraceCheckUtils]: 44: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,428 INFO L290 TraceCheckUtils]: 45: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,428 INFO L290 TraceCheckUtils]: 46: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,428 INFO L290 TraceCheckUtils]: 47: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,428 INFO L290 TraceCheckUtils]: 48: Hoare triple {14457#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)); {14457#false} is VALID [2022-02-20 14:46:47,428 INFO L290 TraceCheckUtils]: 49: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,428 INFO L290 TraceCheckUtils]: 50: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,429 INFO L290 TraceCheckUtils]: 51: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,429 INFO L290 TraceCheckUtils]: 52: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,429 INFO L290 TraceCheckUtils]: 53: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,429 INFO L290 TraceCheckUtils]: 54: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,429 INFO L290 TraceCheckUtils]: 55: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,429 INFO L290 TraceCheckUtils]: 56: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,429 INFO L290 TraceCheckUtils]: 57: Hoare triple {14457#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)); {14457#false} is VALID [2022-02-20 14:46:47,430 INFO L290 TraceCheckUtils]: 58: Hoare triple {14457#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)); {14457#false} is VALID [2022-02-20 14:46:47,430 INFO L290 TraceCheckUtils]: 59: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,430 INFO L290 TraceCheckUtils]: 60: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,430 INFO L290 TraceCheckUtils]: 61: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,430 INFO L290 TraceCheckUtils]: 62: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,430 INFO L290 TraceCheckUtils]: 63: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,430 INFO L290 TraceCheckUtils]: 64: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,430 INFO L290 TraceCheckUtils]: 65: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,431 INFO L290 TraceCheckUtils]: 66: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,431 INFO L290 TraceCheckUtils]: 67: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,431 INFO L290 TraceCheckUtils]: 68: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,431 INFO L290 TraceCheckUtils]: 69: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,431 INFO L290 TraceCheckUtils]: 70: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,431 INFO L290 TraceCheckUtils]: 71: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,431 INFO L290 TraceCheckUtils]: 72: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,432 INFO L290 TraceCheckUtils]: 73: Hoare triple {14457#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)); {14457#false} is VALID [2022-02-20 14:46:47,432 INFO L290 TraceCheckUtils]: 74: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,432 INFO L290 TraceCheckUtils]: 75: Hoare triple {14457#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)); {14457#false} is VALID [2022-02-20 14:46:47,432 INFO L290 TraceCheckUtils]: 76: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,432 INFO L290 TraceCheckUtils]: 77: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,432 INFO L290 TraceCheckUtils]: 78: Hoare triple {14457#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)); {14457#false} is VALID [2022-02-20 14:46:47,432 INFO L290 TraceCheckUtils]: 79: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,433 INFO L290 TraceCheckUtils]: 80: Hoare triple {14457#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)); {14457#false} is VALID [2022-02-20 14:46:47,433 INFO L290 TraceCheckUtils]: 81: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,433 INFO L290 TraceCheckUtils]: 82: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,433 INFO L290 TraceCheckUtils]: 83: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,433 INFO L290 TraceCheckUtils]: 84: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,433 INFO L290 TraceCheckUtils]: 85: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,433 INFO L290 TraceCheckUtils]: 86: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,434 INFO L290 TraceCheckUtils]: 87: Hoare triple {14457#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)); {14457#false} is VALID [2022-02-20 14:46:47,434 INFO L290 TraceCheckUtils]: 88: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,434 INFO L290 TraceCheckUtils]: 89: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,434 INFO L290 TraceCheckUtils]: 90: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,434 INFO L290 TraceCheckUtils]: 91: Hoare triple {14457#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)); {14457#false} is VALID [2022-02-20 14:46:47,434 INFO L290 TraceCheckUtils]: 92: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,434 INFO L290 TraceCheckUtils]: 93: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,434 INFO L290 TraceCheckUtils]: 94: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,435 INFO L290 TraceCheckUtils]: 95: Hoare triple {14457#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)); {14457#false} is VALID [2022-02-20 14:46:47,435 INFO L290 TraceCheckUtils]: 96: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,435 INFO L290 TraceCheckUtils]: 97: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,435 INFO L290 TraceCheckUtils]: 98: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,435 INFO L290 TraceCheckUtils]: 99: Hoare triple {14457#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)); {14457#false} is VALID [2022-02-20 14:46:47,435 INFO L290 TraceCheckUtils]: 100: Hoare triple {14457#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)); {14457#false} is VALID [2022-02-20 14:46:47,435 INFO L290 TraceCheckUtils]: 101: Hoare triple {14457#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)); {14457#false} is VALID [2022-02-20 14:46:47,436 INFO L290 TraceCheckUtils]: 102: Hoare triple {14457#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)); {14457#false} is VALID [2022-02-20 14:46:47,436 INFO L290 TraceCheckUtils]: 103: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,436 INFO L290 TraceCheckUtils]: 104: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,436 INFO L290 TraceCheckUtils]: 105: Hoare triple {14457#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); {14457#false} is VALID [2022-02-20 14:46:47,436 INFO L290 TraceCheckUtils]: 106: Hoare triple {14457#false} assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); {14457#false} is VALID [2022-02-20 14:46:47,436 INFO L290 TraceCheckUtils]: 107: Hoare triple {14457#false} assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); {14457#false} is VALID [2022-02-20 14:46:47,436 INFO L290 TraceCheckUtils]: 108: Hoare triple {14457#false} assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); {14457#false} is VALID [2022-02-20 14:46:47,437 INFO L290 TraceCheckUtils]: 109: Hoare triple {14457#false} assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); {14457#false} is VALID [2022-02-20 14:46:47,437 INFO L290 TraceCheckUtils]: 110: Hoare triple {14457#false} assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); {14457#false} is VALID [2022-02-20 14:46:47,437 INFO L290 TraceCheckUtils]: 111: Hoare triple {14457#false} assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); {14457#false} is VALID [2022-02-20 14:46:47,437 INFO L290 TraceCheckUtils]: 112: Hoare triple {14457#false} assume ((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0; {14457#false} is VALID [2022-02-20 14:46:47,437 INFO L290 TraceCheckUtils]: 113: Hoare triple {14457#false} assume !false; {14457#false} is VALID [2022-02-20 14:46:47,437 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-20 14:46:47,438 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:46:47,438 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110015596] [2022-02-20 14:46:47,438 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110015596] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:46:47,438 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:46:47,438 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:46:47,438 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892939056] [2022-02-20 14:46:47,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:46:47,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 114 [2022-02-20 14:46:47,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:46:47,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have 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:46:47,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:46:47,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:46:47,489 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:46:47,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:46:47,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:46:47,490 INFO L87 Difference]: Start difference. First operand 1172 states and 1586 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have 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:46:48,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:46:48,480 INFO L93 Difference]: Finished difference Result 3189 states and 4396 transitions. [2022-02-20 14:46:48,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:46:48,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 114 [2022-02-20 14:46:48,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:46:48,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have 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:46:48,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 715 transitions. [2022-02-20 14:46:48,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have 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:46:48,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 715 transitions. [2022-02-20 14:46:48,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 715 transitions. [2022-02-20 14:46:48,860 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:46:48,984 INFO L225 Difference]: With dead ends: 3189 [2022-02-20 14:46:48,984 INFO L226 Difference]: Without dead ends: 2019 [2022-02-20 14:46:48,985 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:46:48,986 INFO L933 BasicCegarLoop]: 234 mSDtfsCounter, 146 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 14:46:48,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 249 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 14:46:48,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2019 states. [2022-02-20 14:46:49,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2019 to 2014. [2022-02-20 14:46:49,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:46:49,057 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2019 states. Second operand has 2014 states, 2013 states have (on average 1.2518628912071534) internal successors, (2520), 2013 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have 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:46:49,059 INFO L74 IsIncluded]: Start isIncluded. First operand 2019 states. Second operand has 2014 states, 2013 states have (on average 1.2518628912071534) internal successors, (2520), 2013 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have 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:46:49,063 INFO L87 Difference]: Start difference. First operand 2019 states. Second operand has 2014 states, 2013 states have (on average 1.2518628912071534) internal successors, (2520), 2013 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have 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:46:49,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:46:49,177 INFO L93 Difference]: Finished difference Result 2019 states and 2525 transitions. [2022-02-20 14:46:49,177 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 2525 transitions. [2022-02-20 14:46:49,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:46:49,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:46:49,185 INFO L74 IsIncluded]: Start isIncluded. First operand has 2014 states, 2013 states have (on average 1.2518628912071534) internal successors, (2520), 2013 states have internal predecessors, (2520), 0 states have call successors, (0), 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 2019 states. [2022-02-20 14:46:49,199 INFO L87 Difference]: Start difference. First operand has 2014 states, 2013 states have (on average 1.2518628912071534) internal successors, (2520), 2013 states have internal predecessors, (2520), 0 states have call successors, (0), 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 2019 states. [2022-02-20 14:46:49,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:46:49,319 INFO L93 Difference]: Finished difference Result 2019 states and 2525 transitions. [2022-02-20 14:46:49,319 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 2525 transitions. [2022-02-20 14:46:49,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:46:49,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:46:49,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:46:49,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:46:49,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2014 states, 2013 states have (on average 1.2518628912071534) internal successors, (2520), 2013 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have 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:46:49,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 2520 transitions. [2022-02-20 14:46:49,442 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 2520 transitions. Word has length 114 [2022-02-20 14:46:49,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:46:49,442 INFO L470 AbstractCegarLoop]: Abstraction has 2014 states and 2520 transitions. [2022-02-20 14:46:49,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have 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:46:49,443 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 2520 transitions. [2022-02-20 14:46:49,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-20 14:46:49,445 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:46:49,445 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, 1, 1, 1, 1, 1, 1] [2022-02-20 14:46:49,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 14:46:49,445 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:46:49,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:46:49,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1619945599, now seen corresponding path program 1 times [2022-02-20 14:46:49,446 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:46:49,446 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803392572] [2022-02-20 14:46:49,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:46:49,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:46:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 14:46:49,474 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 14:46:49,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 14:46:49,548 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 14:46:49,548 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 14:46:49,549 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 14:46:49,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 14:46:49,553 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-02-20 14:46:49,555 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 14:46:49,616 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 14:46:49,618 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 14:46:49,619 WARN L170 areAnnotationChecker]: L616-2 has no Hoare annotation [2022-02-20 14:46:49,619 WARN L170 areAnnotationChecker]: L616-2 has no Hoare annotation [2022-02-20 14:46:49,619 WARN L170 areAnnotationChecker]: L616-2 has no Hoare annotation [2022-02-20 14:46:49,619 WARN L170 areAnnotationChecker]: L610 has no Hoare annotation [2022-02-20 14:46:49,619 WARN L170 areAnnotationChecker]: L621 has no Hoare annotation [2022-02-20 14:46:49,619 WARN L170 areAnnotationChecker]: L621 has no Hoare annotation [2022-02-20 14:46:49,619 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 14:46:49,619 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 14:46:49,619 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 14:46:49,619 WARN L170 areAnnotationChecker]: L607 has no Hoare annotation [2022-02-20 14:46:49,620 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-02-20 14:46:49,620 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-02-20 14:46:49,620 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 14:46:49,620 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 14:46:49,620 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-02-20 14:46:49,620 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-02-20 14:46:49,620 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 14:46:49,620 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 14:46:49,620 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 14:46:49,620 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 14:46:49,620 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2022-02-20 14:46:49,621 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2022-02-20 14:46:49,621 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 14:46:49,621 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 14:46:49,621 WARN L170 areAnnotationChecker]: L75 has no Hoare annotation [2022-02-20 14:46:49,621 WARN L170 areAnnotationChecker]: L75 has no Hoare annotation [2022-02-20 14:46:49,621 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2022-02-20 14:46:49,621 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2022-02-20 14:46:49,621 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-02-20 14:46:49,621 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-02-20 14:46:49,621 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2022-02-20 14:46:49,621 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2022-02-20 14:46:49,622 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2022-02-20 14:46:49,622 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2022-02-20 14:46:49,622 WARN L170 areAnnotationChecker]: L85-2 has no Hoare annotation [2022-02-20 14:46:49,622 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2022-02-20 14:46:49,622 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2022-02-20 14:46:49,622 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2022-02-20 14:46:49,622 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2022-02-20 14:46:49,622 WARN L170 areAnnotationChecker]: L93-2 has no Hoare annotation [2022-02-20 14:46:49,622 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2022-02-20 14:46:49,622 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2022-02-20 14:46:49,622 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 14:46:49,623 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 14:46:49,623 WARN L170 areAnnotationChecker]: L116 has no Hoare annotation [2022-02-20 14:46:49,623 WARN L170 areAnnotationChecker]: L116 has no Hoare annotation [2022-02-20 14:46:49,623 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-02-20 14:46:49,623 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-02-20 14:46:49,623 WARN L170 areAnnotationChecker]: L129 has no Hoare annotation [2022-02-20 14:46:49,623 WARN L170 areAnnotationChecker]: L129 has no Hoare annotation [2022-02-20 14:46:49,623 WARN L170 areAnnotationChecker]: L133 has no Hoare annotation [2022-02-20 14:46:49,623 WARN L170 areAnnotationChecker]: L133 has no Hoare annotation [2022-02-20 14:46:49,623 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2022-02-20 14:46:49,623 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2022-02-20 14:46:49,624 WARN L170 areAnnotationChecker]: L144 has no Hoare annotation [2022-02-20 14:46:49,624 WARN L170 areAnnotationChecker]: L144 has no Hoare annotation [2022-02-20 14:46:49,624 WARN L170 areAnnotationChecker]: L149 has no Hoare annotation [2022-02-20 14:46:49,624 WARN L170 areAnnotationChecker]: L149 has no Hoare annotation [2022-02-20 14:46:49,624 WARN L170 areAnnotationChecker]: L153 has no Hoare annotation [2022-02-20 14:46:49,624 WARN L170 areAnnotationChecker]: L153 has no Hoare annotation [2022-02-20 14:46:49,624 WARN L170 areAnnotationChecker]: L158 has no Hoare annotation [2022-02-20 14:46:49,624 WARN L170 areAnnotationChecker]: L158 has no Hoare annotation [2022-02-20 14:46:49,624 WARN L170 areAnnotationChecker]: L164 has no Hoare annotation [2022-02-20 14:46:49,624 WARN L170 areAnnotationChecker]: L164 has no Hoare annotation [2022-02-20 14:46:49,624 WARN L170 areAnnotationChecker]: L169 has no Hoare annotation [2022-02-20 14:46:49,625 WARN L170 areAnnotationChecker]: L169 has no Hoare annotation [2022-02-20 14:46:49,625 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2022-02-20 14:46:49,625 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2022-02-20 14:46:49,625 WARN L170 areAnnotationChecker]: L179 has no Hoare annotation [2022-02-20 14:46:49,625 WARN L170 areAnnotationChecker]: L179 has no Hoare annotation [2022-02-20 14:46:49,625 WARN L170 areAnnotationChecker]: L185 has no Hoare annotation [2022-02-20 14:46:49,625 WARN L170 areAnnotationChecker]: L185 has no Hoare annotation [2022-02-20 14:46:49,625 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2022-02-20 14:46:49,625 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2022-02-20 14:46:49,625 WARN L170 areAnnotationChecker]: L195 has no Hoare annotation [2022-02-20 14:46:49,625 WARN L170 areAnnotationChecker]: L195 has no Hoare annotation [2022-02-20 14:46:49,626 WARN L170 areAnnotationChecker]: L197 has no Hoare annotation [2022-02-20 14:46:49,626 WARN L170 areAnnotationChecker]: L197 has no Hoare annotation [2022-02-20 14:46:49,626 WARN L170 areAnnotationChecker]: L199 has no Hoare annotation [2022-02-20 14:46:49,626 WARN L170 areAnnotationChecker]: L199 has no Hoare annotation [2022-02-20 14:46:49,626 WARN L170 areAnnotationChecker]: L201 has no Hoare annotation [2022-02-20 14:46:49,626 WARN L170 areAnnotationChecker]: L201 has no Hoare annotation [2022-02-20 14:46:49,626 WARN L170 areAnnotationChecker]: L204 has no Hoare annotation [2022-02-20 14:46:49,626 WARN L170 areAnnotationChecker]: L204 has no Hoare annotation [2022-02-20 14:46:49,626 WARN L170 areAnnotationChecker]: L208 has no Hoare annotation [2022-02-20 14:46:49,626 WARN L170 areAnnotationChecker]: L208 has no Hoare annotation [2022-02-20 14:46:49,626 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2022-02-20 14:46:49,627 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2022-02-20 14:46:49,627 WARN L170 areAnnotationChecker]: L213 has no Hoare annotation [2022-02-20 14:46:49,627 WARN L170 areAnnotationChecker]: L213 has no Hoare annotation [2022-02-20 14:46:49,627 WARN L170 areAnnotationChecker]: L222 has no Hoare annotation [2022-02-20 14:46:49,627 WARN L170 areAnnotationChecker]: L222 has no Hoare annotation [2022-02-20 14:46:49,627 WARN L170 areAnnotationChecker]: L213-2 has no Hoare annotation [2022-02-20 14:46:49,630 WARN L170 areAnnotationChecker]: L225 has no Hoare annotation [2022-02-20 14:46:49,630 WARN L170 areAnnotationChecker]: L225 has no Hoare annotation [2022-02-20 14:46:49,630 WARN L170 areAnnotationChecker]: L228 has no Hoare annotation [2022-02-20 14:46:49,630 WARN L170 areAnnotationChecker]: L228 has no Hoare annotation [2022-02-20 14:46:49,630 WARN L170 areAnnotationChecker]: L233 has no Hoare annotation [2022-02-20 14:46:49,630 WARN L170 areAnnotationChecker]: L233 has no Hoare annotation [2022-02-20 14:46:49,630 WARN L170 areAnnotationChecker]: L235 has no Hoare annotation [2022-02-20 14:46:49,630 WARN L170 areAnnotationChecker]: L235 has no Hoare annotation [2022-02-20 14:46:49,631 WARN L170 areAnnotationChecker]: L242 has no Hoare annotation [2022-02-20 14:46:49,631 WARN L170 areAnnotationChecker]: L242 has no Hoare annotation [2022-02-20 14:46:49,631 WARN L170 areAnnotationChecker]: L244 has no Hoare annotation [2022-02-20 14:46:49,631 WARN L170 areAnnotationChecker]: L244 has no Hoare annotation [2022-02-20 14:46:49,631 WARN L170 areAnnotationChecker]: L247 has no Hoare annotation [2022-02-20 14:46:49,631 WARN L170 areAnnotationChecker]: L247 has no Hoare annotation [2022-02-20 14:46:49,631 WARN L170 areAnnotationChecker]: L248 has no Hoare annotation [2022-02-20 14:46:49,631 WARN L170 areAnnotationChecker]: L248 has no Hoare annotation [2022-02-20 14:46:49,631 WARN L170 areAnnotationChecker]: L258 has no Hoare annotation [2022-02-20 14:46:49,631 WARN L170 areAnnotationChecker]: L258 has no Hoare annotation [2022-02-20 14:46:49,631 WARN L170 areAnnotationChecker]: L248-2 has no Hoare annotation [2022-02-20 14:46:49,632 WARN L170 areAnnotationChecker]: L263 has no Hoare annotation [2022-02-20 14:46:49,632 WARN L170 areAnnotationChecker]: L263 has no Hoare annotation [2022-02-20 14:46:49,632 WARN L170 areAnnotationChecker]: L269 has no Hoare annotation [2022-02-20 14:46:49,632 WARN L170 areAnnotationChecker]: L269 has no Hoare annotation [2022-02-20 14:46:49,632 WARN L170 areAnnotationChecker]: L271 has no Hoare annotation [2022-02-20 14:46:49,632 WARN L170 areAnnotationChecker]: L271 has no Hoare annotation [2022-02-20 14:46:49,632 WARN L170 areAnnotationChecker]: L272 has no Hoare annotation [2022-02-20 14:46:49,632 WARN L170 areAnnotationChecker]: L272 has no Hoare annotation [2022-02-20 14:46:49,632 WARN L170 areAnnotationChecker]: L286 has no Hoare annotation [2022-02-20 14:46:49,632 WARN L170 areAnnotationChecker]: L286 has no Hoare annotation [2022-02-20 14:46:49,633 WARN L170 areAnnotationChecker]: L272-2 has no Hoare annotation [2022-02-20 14:46:49,633 WARN L170 areAnnotationChecker]: L290 has no Hoare annotation [2022-02-20 14:46:49,633 WARN L170 areAnnotationChecker]: L290 has no Hoare annotation [2022-02-20 14:46:49,633 WARN L170 areAnnotationChecker]: L293 has no Hoare annotation [2022-02-20 14:46:49,633 WARN L170 areAnnotationChecker]: L293 has no Hoare annotation [2022-02-20 14:46:49,633 WARN L170 areAnnotationChecker]: L296 has no Hoare annotation [2022-02-20 14:46:49,633 WARN L170 areAnnotationChecker]: L296 has no Hoare annotation [2022-02-20 14:46:49,633 WARN L170 areAnnotationChecker]: L301 has no Hoare annotation [2022-02-20 14:46:49,633 WARN L170 areAnnotationChecker]: L301 has no Hoare annotation [2022-02-20 14:46:49,633 WARN L170 areAnnotationChecker]: L303 has no Hoare annotation [2022-02-20 14:46:49,633 WARN L170 areAnnotationChecker]: L303 has no Hoare annotation [2022-02-20 14:46:49,634 WARN L170 areAnnotationChecker]: L307 has no Hoare annotation [2022-02-20 14:46:49,634 WARN L170 areAnnotationChecker]: L307 has no Hoare annotation [2022-02-20 14:46:49,634 WARN L170 areAnnotationChecker]: L308 has no Hoare annotation [2022-02-20 14:46:49,634 WARN L170 areAnnotationChecker]: L308 has no Hoare annotation [2022-02-20 14:46:49,634 WARN L170 areAnnotationChecker]: L319 has no Hoare annotation [2022-02-20 14:46:49,634 WARN L170 areAnnotationChecker]: L319 has no Hoare annotation [2022-02-20 14:46:49,634 WARN L170 areAnnotationChecker]: L308-2 has no Hoare annotation [2022-02-20 14:46:49,634 WARN L170 areAnnotationChecker]: L324 has no Hoare annotation [2022-02-20 14:46:49,634 WARN L170 areAnnotationChecker]: L324 has no Hoare annotation [2022-02-20 14:46:49,634 WARN L170 areAnnotationChecker]: L325 has no Hoare annotation [2022-02-20 14:46:49,634 WARN L170 areAnnotationChecker]: L325 has no Hoare annotation [2022-02-20 14:46:49,635 WARN L170 areAnnotationChecker]: L338 has no Hoare annotation [2022-02-20 14:46:49,635 WARN L170 areAnnotationChecker]: L338 has no Hoare annotation [2022-02-20 14:46:49,635 WARN L170 areAnnotationChecker]: L325-2 has no Hoare annotation [2022-02-20 14:46:49,635 WARN L170 areAnnotationChecker]: L341 has no Hoare annotation [2022-02-20 14:46:49,635 WARN L170 areAnnotationChecker]: L341 has no Hoare annotation [2022-02-20 14:46:49,635 WARN L170 areAnnotationChecker]: L342 has no Hoare annotation [2022-02-20 14:46:49,635 WARN L170 areAnnotationChecker]: L342 has no Hoare annotation [2022-02-20 14:46:49,635 WARN L170 areAnnotationChecker]: L347 has no Hoare annotation [2022-02-20 14:46:49,635 WARN L170 areAnnotationChecker]: L347 has no Hoare annotation [2022-02-20 14:46:49,635 WARN L170 areAnnotationChecker]: L342-2 has no Hoare annotation [2022-02-20 14:46:49,635 WARN L170 areAnnotationChecker]: L348 has no Hoare annotation [2022-02-20 14:46:49,636 WARN L170 areAnnotationChecker]: L348 has no Hoare annotation [2022-02-20 14:46:49,636 WARN L170 areAnnotationChecker]: L359 has no Hoare annotation [2022-02-20 14:46:49,636 WARN L170 areAnnotationChecker]: L359 has no Hoare annotation [2022-02-20 14:46:49,636 WARN L170 areAnnotationChecker]: L348-2 has no Hoare annotation [2022-02-20 14:46:49,636 WARN L170 areAnnotationChecker]: L364 has no Hoare annotation [2022-02-20 14:46:49,636 WARN L170 areAnnotationChecker]: L364 has no Hoare annotation [2022-02-20 14:46:49,636 WARN L170 areAnnotationChecker]: L371 has no Hoare annotation [2022-02-20 14:46:49,636 WARN L170 areAnnotationChecker]: L371 has no Hoare annotation [2022-02-20 14:46:49,636 WARN L170 areAnnotationChecker]: L378 has no Hoare annotation [2022-02-20 14:46:49,636 WARN L170 areAnnotationChecker]: L378 has no Hoare annotation [2022-02-20 14:46:49,636 WARN L170 areAnnotationChecker]: L385 has no Hoare annotation [2022-02-20 14:46:49,637 WARN L170 areAnnotationChecker]: L385 has no Hoare annotation [2022-02-20 14:46:49,637 WARN L170 areAnnotationChecker]: L388 has no Hoare annotation [2022-02-20 14:46:49,637 WARN L170 areAnnotationChecker]: L388 has no Hoare annotation [2022-02-20 14:46:49,637 WARN L170 areAnnotationChecker]: L390 has no Hoare annotation [2022-02-20 14:46:49,637 WARN L170 areAnnotationChecker]: L390 has no Hoare annotation [2022-02-20 14:46:49,637 WARN L170 areAnnotationChecker]: L391 has no Hoare annotation [2022-02-20 14:46:49,637 WARN L170 areAnnotationChecker]: L391 has no Hoare annotation [2022-02-20 14:46:49,637 WARN L170 areAnnotationChecker]: L399 has no Hoare annotation [2022-02-20 14:46:49,637 WARN L170 areAnnotationChecker]: L399 has no Hoare annotation [2022-02-20 14:46:49,637 WARN L170 areAnnotationChecker]: L391-2 has no Hoare annotation [2022-02-20 14:46:49,637 WARN L170 areAnnotationChecker]: L404 has no Hoare annotation [2022-02-20 14:46:49,638 WARN L170 areAnnotationChecker]: L404 has no Hoare annotation [2022-02-20 14:46:49,638 WARN L170 areAnnotationChecker]: L408 has no Hoare annotation [2022-02-20 14:46:49,638 WARN L170 areAnnotationChecker]: L408 has no Hoare annotation [2022-02-20 14:46:49,638 WARN L170 areAnnotationChecker]: L412 has no Hoare annotation [2022-02-20 14:46:49,638 WARN L170 areAnnotationChecker]: L412 has no Hoare annotation [2022-02-20 14:46:49,638 WARN L170 areAnnotationChecker]: L414 has no Hoare annotation [2022-02-20 14:46:49,638 WARN L170 areAnnotationChecker]: L414 has no Hoare annotation [2022-02-20 14:46:49,638 WARN L170 areAnnotationChecker]: L417 has no Hoare annotation [2022-02-20 14:46:49,638 WARN L170 areAnnotationChecker]: L417 has no Hoare annotation [2022-02-20 14:46:49,638 WARN L170 areAnnotationChecker]: L419 has no Hoare annotation [2022-02-20 14:46:49,639 WARN L170 areAnnotationChecker]: L419 has no Hoare annotation [2022-02-20 14:46:49,639 WARN L170 areAnnotationChecker]: L424 has no Hoare annotation [2022-02-20 14:46:49,639 WARN L170 areAnnotationChecker]: L424 has no Hoare annotation [2022-02-20 14:46:49,639 WARN L170 areAnnotationChecker]: L425 has no Hoare annotation [2022-02-20 14:46:49,639 WARN L170 areAnnotationChecker]: L424-2 has no Hoare annotation [2022-02-20 14:46:49,639 WARN L170 areAnnotationChecker]: L424-2 has no Hoare annotation [2022-02-20 14:46:49,639 WARN L170 areAnnotationChecker]: L428 has no Hoare annotation [2022-02-20 14:46:49,639 WARN L170 areAnnotationChecker]: L427-1 has no Hoare annotation [2022-02-20 14:46:49,639 WARN L170 areAnnotationChecker]: L427-1 has no Hoare annotation [2022-02-20 14:46:49,639 WARN L170 areAnnotationChecker]: L431 has no Hoare annotation [2022-02-20 14:46:49,639 WARN L170 areAnnotationChecker]: L430-1 has no Hoare annotation [2022-02-20 14:46:49,640 WARN L170 areAnnotationChecker]: L430-1 has no Hoare annotation [2022-02-20 14:46:49,640 WARN L170 areAnnotationChecker]: L434 has no Hoare annotation [2022-02-20 14:46:49,640 WARN L170 areAnnotationChecker]: L433-1 has no Hoare annotation [2022-02-20 14:46:49,640 WARN L170 areAnnotationChecker]: L433-1 has no Hoare annotation [2022-02-20 14:46:49,640 WARN L170 areAnnotationChecker]: L437 has no Hoare annotation [2022-02-20 14:46:49,640 WARN L170 areAnnotationChecker]: L436-1 has no Hoare annotation [2022-02-20 14:46:49,640 WARN L170 areAnnotationChecker]: L436-1 has no Hoare annotation [2022-02-20 14:46:49,640 WARN L170 areAnnotationChecker]: L440 has no Hoare annotation [2022-02-20 14:46:49,640 WARN L170 areAnnotationChecker]: L439-1 has no Hoare annotation [2022-02-20 14:46:49,640 WARN L170 areAnnotationChecker]: L439-1 has no Hoare annotation [2022-02-20 14:46:49,640 WARN L170 areAnnotationChecker]: L443 has no Hoare annotation [2022-02-20 14:46:49,641 WARN L170 areAnnotationChecker]: L443 has no Hoare annotation [2022-02-20 14:46:49,641 WARN L170 areAnnotationChecker]: L442-1 has no Hoare annotation [2022-02-20 14:46:49,641 WARN L170 areAnnotationChecker]: L442-1 has no Hoare annotation [2022-02-20 14:46:49,641 WARN L170 areAnnotationChecker]: L446 has no Hoare annotation [2022-02-20 14:46:49,641 WARN L170 areAnnotationChecker]: L445-1 has no Hoare annotation [2022-02-20 14:46:49,641 WARN L170 areAnnotationChecker]: L445-1 has no Hoare annotation [2022-02-20 14:46:49,641 WARN L170 areAnnotationChecker]: L449 has no Hoare annotation [2022-02-20 14:46:49,641 WARN L170 areAnnotationChecker]: L448-1 has no Hoare annotation [2022-02-20 14:46:49,641 WARN L170 areAnnotationChecker]: L448-1 has no Hoare annotation [2022-02-20 14:46:49,641 WARN L170 areAnnotationChecker]: L452 has no Hoare annotation [2022-02-20 14:46:49,641 WARN L170 areAnnotationChecker]: L451-1 has no Hoare annotation [2022-02-20 14:46:49,642 WARN L170 areAnnotationChecker]: L451-1 has no Hoare annotation [2022-02-20 14:46:49,642 WARN L170 areAnnotationChecker]: L455 has no Hoare annotation [2022-02-20 14:46:49,642 WARN L170 areAnnotationChecker]: L454-1 has no Hoare annotation [2022-02-20 14:46:49,642 WARN L170 areAnnotationChecker]: L454-1 has no Hoare annotation [2022-02-20 14:46:49,642 WARN L170 areAnnotationChecker]: L458 has no Hoare annotation [2022-02-20 14:46:49,642 WARN L170 areAnnotationChecker]: L457-1 has no Hoare annotation [2022-02-20 14:46:49,642 WARN L170 areAnnotationChecker]: L457-1 has no Hoare annotation [2022-02-20 14:46:49,642 WARN L170 areAnnotationChecker]: L461 has no Hoare annotation [2022-02-20 14:46:49,642 WARN L170 areAnnotationChecker]: L460-1 has no Hoare annotation [2022-02-20 14:46:49,642 WARN L170 areAnnotationChecker]: L460-1 has no Hoare annotation [2022-02-20 14:46:49,642 WARN L170 areAnnotationChecker]: L464 has no Hoare annotation [2022-02-20 14:46:49,642 WARN L170 areAnnotationChecker]: L463-1 has no Hoare annotation [2022-02-20 14:46:49,643 WARN L170 areAnnotationChecker]: L463-1 has no Hoare annotation [2022-02-20 14:46:49,643 WARN L170 areAnnotationChecker]: L467 has no Hoare annotation [2022-02-20 14:46:49,643 WARN L170 areAnnotationChecker]: L466-1 has no Hoare annotation [2022-02-20 14:46:49,643 WARN L170 areAnnotationChecker]: L466-1 has no Hoare annotation [2022-02-20 14:46:49,643 WARN L170 areAnnotationChecker]: L470 has no Hoare annotation [2022-02-20 14:46:49,643 WARN L170 areAnnotationChecker]: L469-1 has no Hoare annotation [2022-02-20 14:46:49,643 WARN L170 areAnnotationChecker]: L469-1 has no Hoare annotation [2022-02-20 14:46:49,643 WARN L170 areAnnotationChecker]: L473 has no Hoare annotation [2022-02-20 14:46:49,643 WARN L170 areAnnotationChecker]: L472-1 has no Hoare annotation [2022-02-20 14:46:49,643 WARN L170 areAnnotationChecker]: L472-1 has no Hoare annotation [2022-02-20 14:46:49,644 WARN L170 areAnnotationChecker]: L476 has no Hoare annotation [2022-02-20 14:46:49,644 WARN L170 areAnnotationChecker]: L475-1 has no Hoare annotation [2022-02-20 14:46:49,644 WARN L170 areAnnotationChecker]: L475-1 has no Hoare annotation [2022-02-20 14:46:49,644 WARN L170 areAnnotationChecker]: L479 has no Hoare annotation [2022-02-20 14:46:49,644 WARN L170 areAnnotationChecker]: L478-1 has no Hoare annotation [2022-02-20 14:46:49,644 WARN L170 areAnnotationChecker]: L478-1 has no Hoare annotation [2022-02-20 14:46:49,644 WARN L170 areAnnotationChecker]: L482 has no Hoare annotation [2022-02-20 14:46:49,644 WARN L170 areAnnotationChecker]: L481-1 has no Hoare annotation [2022-02-20 14:46:49,644 WARN L170 areAnnotationChecker]: L481-1 has no Hoare annotation [2022-02-20 14:46:49,644 WARN L170 areAnnotationChecker]: L485 has no Hoare annotation [2022-02-20 14:46:49,644 WARN L170 areAnnotationChecker]: L484-1 has no Hoare annotation [2022-02-20 14:46:49,645 WARN L170 areAnnotationChecker]: L484-1 has no Hoare annotation [2022-02-20 14:46:49,645 WARN L170 areAnnotationChecker]: L488 has no Hoare annotation [2022-02-20 14:46:49,645 WARN L170 areAnnotationChecker]: L487-1 has no Hoare annotation [2022-02-20 14:46:49,645 WARN L170 areAnnotationChecker]: L487-1 has no Hoare annotation [2022-02-20 14:46:49,645 WARN L170 areAnnotationChecker]: L491 has no Hoare annotation [2022-02-20 14:46:49,645 WARN L170 areAnnotationChecker]: L490-1 has no Hoare annotation [2022-02-20 14:46:49,645 WARN L170 areAnnotationChecker]: L490-1 has no Hoare annotation [2022-02-20 14:46:49,645 WARN L170 areAnnotationChecker]: L494 has no Hoare annotation [2022-02-20 14:46:49,645 WARN L170 areAnnotationChecker]: L493-1 has no Hoare annotation [2022-02-20 14:46:49,645 WARN L170 areAnnotationChecker]: L493-1 has no Hoare annotation [2022-02-20 14:46:49,646 WARN L170 areAnnotationChecker]: L497 has no Hoare annotation [2022-02-20 14:46:49,646 WARN L170 areAnnotationChecker]: L496-1 has no Hoare annotation [2022-02-20 14:46:49,646 WARN L170 areAnnotationChecker]: L496-1 has no Hoare annotation [2022-02-20 14:46:49,646 WARN L170 areAnnotationChecker]: L500 has no Hoare annotation [2022-02-20 14:46:49,646 WARN L170 areAnnotationChecker]: L499-1 has no Hoare annotation [2022-02-20 14:46:49,646 WARN L170 areAnnotationChecker]: L499-1 has no Hoare annotation [2022-02-20 14:46:49,646 WARN L170 areAnnotationChecker]: L503 has no Hoare annotation [2022-02-20 14:46:49,646 WARN L170 areAnnotationChecker]: L502-1 has no Hoare annotation [2022-02-20 14:46:49,646 WARN L170 areAnnotationChecker]: L502-1 has no Hoare annotation [2022-02-20 14:46:49,646 WARN L170 areAnnotationChecker]: L506 has no Hoare annotation [2022-02-20 14:46:49,646 WARN L170 areAnnotationChecker]: L505-1 has no Hoare annotation [2022-02-20 14:46:49,647 WARN L170 areAnnotationChecker]: L505-1 has no Hoare annotation [2022-02-20 14:46:49,647 WARN L170 areAnnotationChecker]: L509 has no Hoare annotation [2022-02-20 14:46:49,647 WARN L170 areAnnotationChecker]: L508-1 has no Hoare annotation [2022-02-20 14:46:49,647 WARN L170 areAnnotationChecker]: L508-1 has no Hoare annotation [2022-02-20 14:46:49,647 WARN L170 areAnnotationChecker]: L512 has no Hoare annotation [2022-02-20 14:46:49,647 WARN L170 areAnnotationChecker]: L511-1 has no Hoare annotation [2022-02-20 14:46:49,647 WARN L170 areAnnotationChecker]: L511-1 has no Hoare annotation [2022-02-20 14:46:49,647 WARN L170 areAnnotationChecker]: L515 has no Hoare annotation [2022-02-20 14:46:49,647 WARN L170 areAnnotationChecker]: L514-1 has no Hoare annotation [2022-02-20 14:46:49,647 WARN L170 areAnnotationChecker]: L514-1 has no Hoare annotation [2022-02-20 14:46:49,647 WARN L170 areAnnotationChecker]: L518 has no Hoare annotation [2022-02-20 14:46:49,648 WARN L170 areAnnotationChecker]: L517-1 has no Hoare annotation [2022-02-20 14:46:49,648 WARN L170 areAnnotationChecker]: L517-1 has no Hoare annotation [2022-02-20 14:46:49,648 WARN L170 areAnnotationChecker]: L521 has no Hoare annotation [2022-02-20 14:46:49,648 WARN L170 areAnnotationChecker]: L520-1 has no Hoare annotation [2022-02-20 14:46:49,648 WARN L170 areAnnotationChecker]: L520-1 has no Hoare annotation [2022-02-20 14:46:49,648 WARN L170 areAnnotationChecker]: L524 has no Hoare annotation [2022-02-20 14:46:49,648 WARN L170 areAnnotationChecker]: L523-1 has no Hoare annotation [2022-02-20 14:46:49,648 WARN L170 areAnnotationChecker]: L523-1 has no Hoare annotation [2022-02-20 14:46:49,648 WARN L170 areAnnotationChecker]: L527 has no Hoare annotation [2022-02-20 14:46:49,648 WARN L170 areAnnotationChecker]: L526-1 has no Hoare annotation [2022-02-20 14:46:49,648 WARN L170 areAnnotationChecker]: L526-1 has no Hoare annotation [2022-02-20 14:46:49,649 WARN L170 areAnnotationChecker]: L530 has no Hoare annotation [2022-02-20 14:46:49,649 WARN L170 areAnnotationChecker]: L529-1 has no Hoare annotation [2022-02-20 14:46:49,649 WARN L170 areAnnotationChecker]: L529-1 has no Hoare annotation [2022-02-20 14:46:49,649 WARN L170 areAnnotationChecker]: L533 has no Hoare annotation [2022-02-20 14:46:49,649 WARN L170 areAnnotationChecker]: L532-1 has no Hoare annotation [2022-02-20 14:46:49,649 WARN L170 areAnnotationChecker]: L532-1 has no Hoare annotation [2022-02-20 14:46:49,649 WARN L170 areAnnotationChecker]: L536 has no Hoare annotation [2022-02-20 14:46:49,649 WARN L170 areAnnotationChecker]: L535-1 has no Hoare annotation [2022-02-20 14:46:49,649 WARN L170 areAnnotationChecker]: L535-1 has no Hoare annotation [2022-02-20 14:46:49,649 WARN L170 areAnnotationChecker]: L539 has no Hoare annotation [2022-02-20 14:46:49,649 WARN L170 areAnnotationChecker]: L538-1 has no Hoare annotation [2022-02-20 14:46:49,650 WARN L170 areAnnotationChecker]: L538-1 has no Hoare annotation [2022-02-20 14:46:49,650 WARN L170 areAnnotationChecker]: L542 has no Hoare annotation [2022-02-20 14:46:49,650 WARN L170 areAnnotationChecker]: L541-1 has no Hoare annotation [2022-02-20 14:46:49,650 WARN L170 areAnnotationChecker]: L541-1 has no Hoare annotation [2022-02-20 14:46:49,650 WARN L170 areAnnotationChecker]: L545 has no Hoare annotation [2022-02-20 14:46:49,650 WARN L170 areAnnotationChecker]: L544-1 has no Hoare annotation [2022-02-20 14:46:49,650 WARN L170 areAnnotationChecker]: L544-1 has no Hoare annotation [2022-02-20 14:46:49,650 WARN L170 areAnnotationChecker]: L548 has no Hoare annotation [2022-02-20 14:46:49,650 WARN L170 areAnnotationChecker]: L547-1 has no Hoare annotation [2022-02-20 14:46:49,650 WARN L170 areAnnotationChecker]: L547-1 has no Hoare annotation [2022-02-20 14:46:49,650 WARN L170 areAnnotationChecker]: L551 has no Hoare annotation [2022-02-20 14:46:49,651 WARN L170 areAnnotationChecker]: L550-1 has no Hoare annotation [2022-02-20 14:46:49,651 WARN L170 areAnnotationChecker]: L550-1 has no Hoare annotation [2022-02-20 14:46:49,651 WARN L170 areAnnotationChecker]: L554 has no Hoare annotation [2022-02-20 14:46:49,651 WARN L170 areAnnotationChecker]: L553-1 has no Hoare annotation [2022-02-20 14:46:49,651 WARN L170 areAnnotationChecker]: L553-1 has no Hoare annotation [2022-02-20 14:46:49,651 WARN L170 areAnnotationChecker]: L557 has no Hoare annotation [2022-02-20 14:46:49,651 WARN L170 areAnnotationChecker]: L556-1 has no Hoare annotation [2022-02-20 14:46:49,651 WARN L170 areAnnotationChecker]: L556-1 has no Hoare annotation [2022-02-20 14:46:49,651 WARN L170 areAnnotationChecker]: L560 has no Hoare annotation [2022-02-20 14:46:49,651 WARN L170 areAnnotationChecker]: L559-1 has no Hoare annotation [2022-02-20 14:46:49,651 WARN L170 areAnnotationChecker]: L559-1 has no Hoare annotation [2022-02-20 14:46:49,652 WARN L170 areAnnotationChecker]: L563 has no Hoare annotation [2022-02-20 14:46:49,652 WARN L170 areAnnotationChecker]: L562-1 has no Hoare annotation [2022-02-20 14:46:49,652 WARN L170 areAnnotationChecker]: L562-1 has no Hoare annotation [2022-02-20 14:46:49,652 WARN L170 areAnnotationChecker]: L566 has no Hoare annotation [2022-02-20 14:46:49,652 WARN L170 areAnnotationChecker]: L565-1 has no Hoare annotation [2022-02-20 14:46:49,652 WARN L170 areAnnotationChecker]: L565-1 has no Hoare annotation [2022-02-20 14:46:49,652 WARN L170 areAnnotationChecker]: L569 has no Hoare annotation [2022-02-20 14:46:49,652 WARN L170 areAnnotationChecker]: L568-1 has no Hoare annotation [2022-02-20 14:46:49,652 WARN L170 areAnnotationChecker]: L568-1 has no Hoare annotation [2022-02-20 14:46:49,652 WARN L170 areAnnotationChecker]: L572 has no Hoare annotation [2022-02-20 14:46:49,652 WARN L170 areAnnotationChecker]: L571-1 has no Hoare annotation [2022-02-20 14:46:49,653 WARN L170 areAnnotationChecker]: L571-1 has no Hoare annotation [2022-02-20 14:46:49,653 WARN L170 areAnnotationChecker]: L575 has no Hoare annotation [2022-02-20 14:46:49,653 WARN L170 areAnnotationChecker]: L574-1 has no Hoare annotation [2022-02-20 14:46:49,653 WARN L170 areAnnotationChecker]: L574-1 has no Hoare annotation [2022-02-20 14:46:49,653 WARN L170 areAnnotationChecker]: L578 has no Hoare annotation [2022-02-20 14:46:49,653 WARN L170 areAnnotationChecker]: L577-1 has no Hoare annotation [2022-02-20 14:46:49,653 WARN L170 areAnnotationChecker]: L577-1 has no Hoare annotation [2022-02-20 14:46:49,653 WARN L170 areAnnotationChecker]: L581 has no Hoare annotation [2022-02-20 14:46:49,653 WARN L170 areAnnotationChecker]: L580-1 has no Hoare annotation [2022-02-20 14:46:49,653 WARN L170 areAnnotationChecker]: L580-1 has no Hoare annotation [2022-02-20 14:46:49,653 WARN L170 areAnnotationChecker]: L584 has no Hoare annotation [2022-02-20 14:46:49,653 WARN L170 areAnnotationChecker]: L583-1 has no Hoare annotation [2022-02-20 14:46:49,654 WARN L170 areAnnotationChecker]: L583-1 has no Hoare annotation [2022-02-20 14:46:49,654 WARN L170 areAnnotationChecker]: L587 has no Hoare annotation [2022-02-20 14:46:49,654 WARN L170 areAnnotationChecker]: L586-1 has no Hoare annotation [2022-02-20 14:46:49,654 WARN L170 areAnnotationChecker]: L586-1 has no Hoare annotation [2022-02-20 14:46:49,654 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2022-02-20 14:46:49,654 WARN L170 areAnnotationChecker]: L589-1 has no Hoare annotation [2022-02-20 14:46:49,654 WARN L170 areAnnotationChecker]: L589-1 has no Hoare annotation [2022-02-20 14:46:49,654 WARN L170 areAnnotationChecker]: L593 has no Hoare annotation [2022-02-20 14:46:49,654 WARN L170 areAnnotationChecker]: L592-1 has no Hoare annotation [2022-02-20 14:46:49,654 WARN L170 areAnnotationChecker]: L592-1 has no Hoare annotation [2022-02-20 14:46:49,654 WARN L170 areAnnotationChecker]: L596 has no Hoare annotation [2022-02-20 14:46:49,655 WARN L170 areAnnotationChecker]: L595-1 has no Hoare annotation [2022-02-20 14:46:49,655 WARN L170 areAnnotationChecker]: L595-1 has no Hoare annotation [2022-02-20 14:46:49,655 WARN L170 areAnnotationChecker]: L599 has no Hoare annotation [2022-02-20 14:46:49,655 WARN L170 areAnnotationChecker]: L598-1 has no Hoare annotation [2022-02-20 14:46:49,655 WARN L170 areAnnotationChecker]: L598-1 has no Hoare annotation [2022-02-20 14:46:49,655 WARN L170 areAnnotationChecker]: L602 has no Hoare annotation [2022-02-20 14:46:49,655 WARN L170 areAnnotationChecker]: L601-1 has no Hoare annotation [2022-02-20 14:46:49,655 WARN L170 areAnnotationChecker]: L601-1 has no Hoare annotation [2022-02-20 14:46:49,655 WARN L170 areAnnotationChecker]: L605 has no Hoare annotation [2022-02-20 14:46:49,655 WARN L170 areAnnotationChecker]: L604-1 has no Hoare annotation [2022-02-20 14:46:49,655 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:46:49,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 02:46:49 BoogieIcfgContainer [2022-02-20 14:46:49,657 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 14:46:49,657 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 14:46:49,657 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 14:46:49,657 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 14:46:49,658 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:46:40" (3/4) ... [2022-02-20 14:46:49,659 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 14:46:49,747 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 14:46:49,748 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 14:46:49,749 INFO L158 Benchmark]: Toolchain (without parser) took 10648.45ms. Allocated memory was 123.7MB in the beginning and 230.7MB in the end (delta: 107.0MB). Free memory was 89.6MB in the beginning and 137.1MB in the end (delta: -47.6MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2022-02-20 14:46:49,749 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 79.7MB. Free memory was 53.5MB in the beginning and 53.5MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 14:46:49,749 INFO L158 Benchmark]: CACSL2BoogieTranslator took 437.92ms. Allocated memory is still 123.7MB. Free memory was 89.6MB in the beginning and 78.0MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 14:46:49,749 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.22ms. Allocated memory is still 123.7MB. Free memory was 78.0MB in the beginning and 69.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 14:46:49,750 INFO L158 Benchmark]: Boogie Preprocessor took 50.34ms. Allocated memory is still 123.7MB. Free memory was 69.6MB in the beginning and 65.3MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 14:46:49,750 INFO L158 Benchmark]: RCFGBuilder took 1030.34ms. Allocated memory is still 123.7MB. Free memory was 64.8MB in the beginning and 59.2MB in the end (delta: 5.6MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. [2022-02-20 14:46:49,750 INFO L158 Benchmark]: TraceAbstraction took 8930.04ms. Allocated memory was 123.7MB in the beginning and 230.7MB in the end (delta: 107.0MB). Free memory was 58.8MB in the beginning and 158.1MB in the end (delta: -99.3MB). Peak memory consumption was 101.0MB. Max. memory is 16.1GB. [2022-02-20 14:46:49,750 INFO L158 Benchmark]: Witness Printer took 90.84ms. Allocated memory is still 230.7MB. Free memory was 158.1MB in the beginning and 137.1MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-02-20 14:46:49,752 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.15ms. Allocated memory is still 79.7MB. Free memory was 53.5MB in the beginning and 53.5MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 437.92ms. Allocated memory is still 123.7MB. Free memory was 89.6MB in the beginning and 78.0MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.22ms. Allocated memory is still 123.7MB. Free memory was 78.0MB in the beginning and 69.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.34ms. Allocated memory is still 123.7MB. Free memory was 69.6MB in the beginning and 65.3MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1030.34ms. Allocated memory is still 123.7MB. Free memory was 64.8MB in the beginning and 59.2MB in the end (delta: 5.6MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. * TraceAbstraction took 8930.04ms. Allocated memory was 123.7MB in the beginning and 230.7MB in the end (delta: 107.0MB). Free memory was 58.8MB in the beginning and 158.1MB in the end (delta: -99.3MB). Peak memory consumption was 101.0MB. Max. memory is 16.1GB. * Witness Printer took 90.84ms. Allocated memory is still 230.7MB. Free memory was 158.1MB in the beginning and 137.1MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. 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: 443]: 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)=1, a=1, a11=0, a17=8, a19=1, 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=1, 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=1, 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=1, 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=1, 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 TRUE ((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7))))) [L61] a28 = 11 [L62] a25 = 1 [L63] return 26; VAL [\old(input)=1, \result=26, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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, 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=1, a21=1, a25=1, a28=11, 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=1, a21=1, a25=1, a28=11, 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=1, a21=1, a25=1, a28=11, 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=1, a21=1, a25=1, a28=11, 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=1, a21=1, a25=1, a28=11, 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=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, 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)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, 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)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, 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)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, 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)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, 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)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, 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)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, 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)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, 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)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND TRUE ((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1)) [L110] a17 = 7 [L111] a25 = 0 [L112] a11 = 1 [L113] a28 = 10 [L114] a19 = 0 [L115] return -1; VAL [\old(input)=1, \result=-1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L424] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(input)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L427] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(input)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L430] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(input)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L433] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) VAL [\old(input)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L436] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(input)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L439] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7))) VAL [\old(input)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L442] COND TRUE (((((!(a25==1)&&(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==7)) VAL [\old(input)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L443] reach_error() VAL [\old(input)=4, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=4, 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: 8.8s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 795 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 795 mSDsluCounter, 655 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 89 mSDsCounter, 366 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1966 IncrementalHoareTripleChecker+Invalid, 2332 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 366 mSolverCounterUnsat, 566 mSDtfsCounter, 1966 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2014occurred in iteration=5, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 5 MinimizatonAttempts, 297 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 627 NumberOfCodeBlocks, 627 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 508 ConstructedInterpolants, 0 QuantifiedInterpolants, 788 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 88/88 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:46:49,792 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