./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label15.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/Problem11_label15.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 6f94f8bb4cfdb5d3c20397835eaaa4f27425eff4f685bcb39e403791a79050e3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 00:56:29,662 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 00:56:29,663 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 00:56:29,685 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 00:56:29,686 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 00:56:29,686 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 00:56:29,692 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 00:56:29,695 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 00:56:29,697 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 00:56:29,700 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 00:56:29,701 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 00:56:29,702 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 00:56:29,702 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 00:56:29,704 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 00:56:29,705 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 00:56:29,706 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 00:56:29,707 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 00:56:29,708 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 00:56:29,710 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 00:56:29,714 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 00:56:29,716 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 00:56:29,717 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 00:56:29,717 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 00:56:29,718 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 00:56:29,719 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 00:56:29,723 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 00:56:29,724 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 00:56:29,724 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 00:56:29,725 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 00:56:29,726 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 00:56:29,726 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 00:56:29,726 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 00:56:29,728 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 00:56:29,728 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 00:56:29,728 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 00:56:29,729 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 00:56:29,729 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 00:56:29,730 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 00:56:29,730 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 00:56:29,730 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 00:56:29,730 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 00:56:29,732 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 00:56:29,733 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 00:56:29,758 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 00:56:29,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 00:56:29,759 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 00:56:29,759 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 00:56:29,759 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 00:56:29,759 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 00:56:29,760 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 00:56:29,760 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 00:56:29,760 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 00:56:29,761 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 00:56:29,761 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 00:56:29,761 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 00:56:29,761 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 00:56:29,761 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 00:56:29,761 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 00:56:29,762 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 00:56:29,762 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 00:56:29,762 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 00:56:29,762 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 00:56:29,762 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 00:56:29,762 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 00:56:29,762 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 00:56:29,763 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 00:56:29,763 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 00:56:29,763 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 00:56:29,763 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 00:56:29,763 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 00:56:29,763 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 00:56:29,763 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 00:56:29,764 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 00:56:29,764 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 00:56:29,764 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 00:56:29,764 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 00:56:29,764 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 -> 6f94f8bb4cfdb5d3c20397835eaaa4f27425eff4f685bcb39e403791a79050e3 [2022-07-12 00:56:29,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 00:56:29,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 00:56:29,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 00:56:29,964 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 00:56:29,965 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 00:56:29,966 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label15.c [2022-07-12 00:56:30,006 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51f668695/db8603e57c5b4308b2a2f9f1f0749426/FLAGb842e72c7 [2022-07-12 00:56:30,502 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 00:56:30,503 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label15.c [2022-07-12 00:56:30,513 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51f668695/db8603e57c5b4308b2a2f9f1f0749426/FLAGb842e72c7 [2022-07-12 00:56:30,824 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51f668695/db8603e57c5b4308b2a2f9f1f0749426 [2022-07-12 00:56:30,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 00:56:30,827 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 00:56:30,828 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 00:56:30,828 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 00:56:30,830 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 00:56:30,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:56:30" (1/1) ... [2022-07-12 00:56:30,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d30b414 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:56:30, skipping insertion in model container [2022-07-12 00:56:30,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:56:30" (1/1) ... [2022-07-12 00:56:30,836 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 00:56:30,875 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 00:56:31,139 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/Problem11_label15.c[2145,2158] [2022-07-12 00:56:31,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 00:56:31,369 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 00:56:31,389 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/Problem11_label15.c[2145,2158] [2022-07-12 00:56:31,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 00:56:31,501 INFO L208 MainTranslator]: Completed translation [2022-07-12 00:56:31,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:56:31 WrapperNode [2022-07-12 00:56:31,502 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 00:56:31,503 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 00:56:31,503 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 00:56:31,503 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 00:56:31,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:56:31" (1/1) ... [2022-07-12 00:56:31,534 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:56:31" (1/1) ... [2022-07-12 00:56:31,616 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 999 [2022-07-12 00:56:31,616 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 00:56:31,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 00:56:31,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 00:56:31,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 00:56:31,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:56:31" (1/1) ... [2022-07-12 00:56:31,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:56:31" (1/1) ... [2022-07-12 00:56:31,630 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:56:31" (1/1) ... [2022-07-12 00:56:31,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:56:31" (1/1) ... [2022-07-12 00:56:31,653 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:56:31" (1/1) ... [2022-07-12 00:56:31,659 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:56:31" (1/1) ... [2022-07-12 00:56:31,671 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:56:31" (1/1) ... [2022-07-12 00:56:31,683 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 00:56:31,684 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 00:56:31,684 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 00:56:31,684 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 00:56:31,686 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:56:31" (1/1) ... [2022-07-12 00:56:31,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 00:56:31,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 00:56:31,708 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-07-12 00:56:31,720 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-07-12 00:56:31,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 00:56:31,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 00:56:31,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 00:56:31,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 00:56:31,790 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 00:56:31,791 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 00:56:33,169 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 00:56:33,180 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 00:56:33,181 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 00:56:33,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:56:33 BoogieIcfgContainer [2022-07-12 00:56:33,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 00:56:33,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 00:56:33,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 00:56:33,187 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 00:56:33,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 12:56:30" (1/3) ... [2022-07-12 00:56:33,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e0eda2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:56:33, skipping insertion in model container [2022-07-12 00:56:33,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:56:31" (2/3) ... [2022-07-12 00:56:33,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e0eda2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:56:33, skipping insertion in model container [2022-07-12 00:56:33,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:56:33" (3/3) ... [2022-07-12 00:56:33,190 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem11_label15.c [2022-07-12 00:56:33,199 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 00:56:33,215 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 00:56:33,312 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 00:56:33,318 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@38eaed0a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5f7b492c [2022-07-12 00:56:33,318 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 00:56:33,327 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 00:56:33,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 00:56:33,333 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:56:33,333 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 00:56:33,334 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:56:33,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:56:33,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1414013846, now seen corresponding path program 1 times [2022-07-12 00:56:33,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:56:33,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999205881] [2022-07-12 00:56:33,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:56:33,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:56:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:56:33,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 00:56:33,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:56:33,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999205881] [2022-07-12 00:56:33,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999205881] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:56:33,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:56:33,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 00:56:33,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952728664] [2022-07-12 00:56:33,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:56:33,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:56:33,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:56:33,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:56:33,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:56:33,562 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 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 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 00:56:34,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:56:34,406 INFO L93 Difference]: Finished difference Result 776 states and 1363 transitions. [2022-07-12 00:56:34,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:56:34,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-07-12 00:56:34,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:56:34,419 INFO L225 Difference]: With dead ends: 776 [2022-07-12 00:56:34,419 INFO L226 Difference]: Without dead ends: 413 [2022-07-12 00:56:34,424 INFO L412 NwaCegarLoop]: 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-07-12 00:56:34,427 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 213 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 00:56:34,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 196 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 00:56:34,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2022-07-12 00:56:34,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2022-07-12 00:56:34,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.4585365853658536) internal successors, (598), 410 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 00:56:34,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 598 transitions. [2022-07-12 00:56:34,473 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 598 transitions. Word has length 14 [2022-07-12 00:56:34,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:56:34,473 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 598 transitions. [2022-07-12 00:56:34,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 00:56:34,473 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 598 transitions. [2022-07-12 00:56:34,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-12 00:56:34,475 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:56:34,475 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 00:56:34,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 00:56:34,476 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:56:34,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:56:34,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1148773182, now seen corresponding path program 1 times [2022-07-12 00:56:34,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:56:34,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008256791] [2022-07-12 00:56:34,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:56:34,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:56:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:56:34,581 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 00:56:34,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:56:34,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008256791] [2022-07-12 00:56:34,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008256791] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:56:34,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:56:34,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 00:56:34,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454402377] [2022-07-12 00:56:34,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:56:34,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:56:34,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:56:34,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:56:34,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:56:34,584 INFO L87 Difference]: Start difference. First operand 411 states and 598 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 00:56:35,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:56:35,141 INFO L93 Difference]: Finished difference Result 1209 states and 1765 transitions. [2022-07-12 00:56:35,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:56:35,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2022-07-12 00:56:35,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:56:35,149 INFO L225 Difference]: With dead ends: 1209 [2022-07-12 00:56:35,149 INFO L226 Difference]: Without dead ends: 800 [2022-07-12 00:56:35,149 INFO L412 NwaCegarLoop]: 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-07-12 00:56:35,150 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 00:56:35,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 120 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 00:56:35,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2022-07-12 00:56:35,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 787. [2022-07-12 00:56:35,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.3854961832061068) internal successors, (1089), 786 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 00:56:35,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1089 transitions. [2022-07-12 00:56:35,187 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1089 transitions. Word has length 82 [2022-07-12 00:56:35,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:56:35,188 INFO L495 AbstractCegarLoop]: Abstraction has 787 states and 1089 transitions. [2022-07-12 00:56:35,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 00:56:35,188 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1089 transitions. [2022-07-12 00:56:35,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-12 00:56:35,190 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:56:35,190 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 00:56:35,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 00:56:35,191 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:56:35,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:56:35,191 INFO L85 PathProgramCache]: Analyzing trace with hash -936102524, now seen corresponding path program 1 times [2022-07-12 00:56:35,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:56:35,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496846734] [2022-07-12 00:56:35,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:56:35,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:56:35,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:56:35,271 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 00:56:35,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:56:35,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496846734] [2022-07-12 00:56:35,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496846734] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:56:35,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:56:35,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 00:56:35,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665551684] [2022-07-12 00:56:35,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:56:35,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:56:35,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:56:35,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:56:35,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:56:35,274 INFO L87 Difference]: Start difference. First operand 787 states and 1089 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 00:56:35,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:56:35,842 INFO L93 Difference]: Finished difference Result 1942 states and 2631 transitions. [2022-07-12 00:56:35,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:56:35,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2022-07-12 00:56:35,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:56:35,846 INFO L225 Difference]: With dead ends: 1942 [2022-07-12 00:56:35,846 INFO L226 Difference]: Without dead ends: 1157 [2022-07-12 00:56:35,847 INFO L412 NwaCegarLoop]: 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-07-12 00:56:35,849 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 00:56:35,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 190 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 00:56:35,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2022-07-12 00:56:35,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1156. [2022-07-12 00:56:35,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 1.277922077922078) internal successors, (1476), 1155 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 00:56:35,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1476 transitions. [2022-07-12 00:56:35,867 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1476 transitions. Word has length 83 [2022-07-12 00:56:35,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:56:35,867 INFO L495 AbstractCegarLoop]: Abstraction has 1156 states and 1476 transitions. [2022-07-12 00:56:35,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 00:56:35,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1476 transitions. [2022-07-12 00:56:35,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-12 00:56:35,868 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:56:35,869 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-12 00:56:35,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 00:56:35,869 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:56:35,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:56:35,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1646302342, now seen corresponding path program 1 times [2022-07-12 00:56:35,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:56:35,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645764945] [2022-07-12 00:56:35,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:56:35,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:56:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:56:35,952 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 00:56:35,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:56:35,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645764945] [2022-07-12 00:56:35,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645764945] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:56:35,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:56:35,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 00:56:35,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750011881] [2022-07-12 00:56:35,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:56:35,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:56:35,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:56:35,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:56:35,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:56:35,954 INFO L87 Difference]: Start difference. First operand 1156 states and 1476 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 00:56:36,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:56:36,856 INFO L93 Difference]: Finished difference Result 2502 states and 3339 transitions. [2022-07-12 00:56:36,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:56:36,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2022-07-12 00:56:36,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:56:36,861 INFO L225 Difference]: With dead ends: 2502 [2022-07-12 00:56:36,861 INFO L226 Difference]: Without dead ends: 1532 [2022-07-12 00:56:36,862 INFO L412 NwaCegarLoop]: 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-07-12 00:56:36,863 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 108 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 00:56:36,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 156 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 00:56:36,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2022-07-12 00:56:36,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1532. [2022-07-12 00:56:36,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1532 states, 1531 states have (on average 1.2619203135205748) internal successors, (1932), 1531 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 00:56:36,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 1932 transitions. [2022-07-12 00:56:36,881 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 1932 transitions. Word has length 126 [2022-07-12 00:56:36,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:56:36,882 INFO L495 AbstractCegarLoop]: Abstraction has 1532 states and 1932 transitions. [2022-07-12 00:56:36,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 00:56:36,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 1932 transitions. [2022-07-12 00:56:36,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-12 00:56:36,884 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:56:36,884 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-12 00:56:36,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 00:56:36,884 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:56:36,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:56:36,885 INFO L85 PathProgramCache]: Analyzing trace with hash -346911137, now seen corresponding path program 1 times [2022-07-12 00:56:36,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:56:36,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907932258] [2022-07-12 00:56:36,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:56:36,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:56:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:56:36,997 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 00:56:36,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:56:36,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907932258] [2022-07-12 00:56:36,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907932258] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:56:36,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:56:36,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:56:36,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117596085] [2022-07-12 00:56:36,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:56:36,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:56:36,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:56:36,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:56:36,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:56:36,999 INFO L87 Difference]: Start difference. First operand 1532 states and 1932 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 00:56:37,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:56:37,754 INFO L93 Difference]: Finished difference Result 3627 states and 4660 transitions. [2022-07-12 00:56:37,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:56:37,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2022-07-12 00:56:37,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:56:37,761 INFO L225 Difference]: With dead ends: 3627 [2022-07-12 00:56:37,761 INFO L226 Difference]: Without dead ends: 2281 [2022-07-12 00:56:37,762 INFO L412 NwaCegarLoop]: 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-07-12 00:56:37,763 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 191 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 00:56:37,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 337 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 00:56:37,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2281 states. [2022-07-12 00:56:37,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2281 to 2087. [2022-07-12 00:56:37,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2087 states, 2086 states have (on average 1.241131351869607) internal successors, (2589), 2086 states have internal predecessors, (2589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 00:56:37,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2087 states to 2087 states and 2589 transitions. [2022-07-12 00:56:37,787 INFO L78 Accepts]: Start accepts. Automaton has 2087 states and 2589 transitions. Word has length 141 [2022-07-12 00:56:37,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:56:37,788 INFO L495 AbstractCegarLoop]: Abstraction has 2087 states and 2589 transitions. [2022-07-12 00:56:37,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 00:56:37,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states and 2589 transitions. [2022-07-12 00:56:37,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-07-12 00:56:37,805 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:56:37,805 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-12 00:56:37,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 00:56:37,806 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:56:37,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:56:37,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1865871640, now seen corresponding path program 1 times [2022-07-12 00:56:37,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:56:37,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918753160] [2022-07-12 00:56:37,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:56:37,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:56:37,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:56:37,891 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-07-12 00:56:37,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:56:37,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918753160] [2022-07-12 00:56:37,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918753160] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:56:37,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:56:37,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:56:37,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907088604] [2022-07-12 00:56:37,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:56:37,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:56:37,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:56:37,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:56:37,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:56:37,893 INFO L87 Difference]: Start difference. First operand 2087 states and 2589 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 00:56:38,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:56:38,400 INFO L93 Difference]: Finished difference Result 4735 states and 5894 transitions. [2022-07-12 00:56:38,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:56:38,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 195 [2022-07-12 00:56:38,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:56:38,408 INFO L225 Difference]: With dead ends: 4735 [2022-07-12 00:56:38,408 INFO L226 Difference]: Without dead ends: 2650 [2022-07-12 00:56:38,425 INFO L412 NwaCegarLoop]: 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-07-12 00:56:38,428 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 188 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 00:56:38,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 346 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 00:56:38,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2022-07-12 00:56:38,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2639. [2022-07-12 00:56:38,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2639 states, 2638 states have (on average 1.2270659590598938) internal successors, (3237), 2638 states have internal predecessors, (3237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 00:56:38,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 3237 transitions. [2022-07-12 00:56:38,476 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 3237 transitions. Word has length 195 [2022-07-12 00:56:38,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:56:38,476 INFO L495 AbstractCegarLoop]: Abstraction has 2639 states and 3237 transitions. [2022-07-12 00:56:38,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 00:56:38,477 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 3237 transitions. [2022-07-12 00:56:38,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-07-12 00:56:38,478 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:56:38,478 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-12 00:56:38,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 00:56:38,479 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:56:38,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:56:38,479 INFO L85 PathProgramCache]: Analyzing trace with hash 75855929, now seen corresponding path program 1 times [2022-07-12 00:56:38,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:56:38,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643261507] [2022-07-12 00:56:38,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:56:38,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:56:38,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:56:38,556 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-12 00:56:38,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:56:38,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643261507] [2022-07-12 00:56:38,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643261507] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:56:38,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:56:38,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:56:38,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844620212] [2022-07-12 00:56:38,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:56:38,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:56:38,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:56:38,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:56:38,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:56:38,558 INFO L87 Difference]: Start difference. First operand 2639 states and 3237 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 00:56:39,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:56:39,633 INFO L93 Difference]: Finished difference Result 6020 states and 7453 transitions. [2022-07-12 00:56:39,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:56:39,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 196 [2022-07-12 00:56:39,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:56:39,644 INFO L225 Difference]: With dead ends: 6020 [2022-07-12 00:56:39,655 INFO L226 Difference]: Without dead ends: 3383 [2022-07-12 00:56:39,658 INFO L412 NwaCegarLoop]: 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-07-12 00:56:39,659 INFO L413 NwaCegarLoop]: 360 mSDtfsCounter, 183 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-12 00:56:39,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 381 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-12 00:56:39,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3383 states. [2022-07-12 00:56:39,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3383 to 3191. [2022-07-12 00:56:39,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3191 states, 3190 states have (on average 1.2178683385579938) internal successors, (3885), 3190 states have internal predecessors, (3885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 00:56:39,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3191 states to 3191 states and 3885 transitions. [2022-07-12 00:56:39,701 INFO L78 Accepts]: Start accepts. Automaton has 3191 states and 3885 transitions. Word has length 196 [2022-07-12 00:56:39,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:56:39,701 INFO L495 AbstractCegarLoop]: Abstraction has 3191 states and 3885 transitions. [2022-07-12 00:56:39,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 00:56:39,702 INFO L276 IsEmpty]: Start isEmpty. Operand 3191 states and 3885 transitions. [2022-07-12 00:56:39,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-07-12 00:56:39,703 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:56:39,704 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 00:56:39,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 00:56:39,704 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:56:39,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:56:39,704 INFO L85 PathProgramCache]: Analyzing trace with hash -498669113, now seen corresponding path program 1 times [2022-07-12 00:56:39,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:56:39,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95692367] [2022-07-12 00:56:39,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:56:39,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:56:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:56:39,847 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 00:56:39,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:56:39,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95692367] [2022-07-12 00:56:39,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95692367] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:56:39,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:56:39,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 00:56:39,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538860635] [2022-07-12 00:56:39,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:56:39,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 00:56:39,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:56:39,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 00:56:39,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 00:56:39,850 INFO L87 Difference]: Start difference. First operand 3191 states and 3885 transitions. Second operand has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 00:56:40,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:56:40,911 INFO L93 Difference]: Finished difference Result 10462 states and 12903 transitions. [2022-07-12 00:56:40,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 00:56:40,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 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 216 [2022-07-12 00:56:40,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:56:40,929 INFO L225 Difference]: With dead ends: 10462 [2022-07-12 00:56:40,930 INFO L226 Difference]: Without dead ends: 7273 [2022-07-12 00:56:40,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 00:56:40,935 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 321 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-12 00:56:40,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 194 Invalid, 1214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-12 00:56:40,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7273 states. [2022-07-12 00:56:41,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7273 to 5973. [2022-07-12 00:56:41,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5973 states, 5972 states have (on average 1.202277294038848) internal successors, (7180), 5972 states have internal predecessors, (7180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 00:56:41,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5973 states to 5973 states and 7180 transitions. [2022-07-12 00:56:41,017 INFO L78 Accepts]: Start accepts. Automaton has 5973 states and 7180 transitions. Word has length 216 [2022-07-12 00:56:41,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:56:41,017 INFO L495 AbstractCegarLoop]: Abstraction has 5973 states and 7180 transitions. [2022-07-12 00:56:41,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 00:56:41,018 INFO L276 IsEmpty]: Start isEmpty. Operand 5973 states and 7180 transitions. [2022-07-12 00:56:41,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-07-12 00:56:41,020 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:56:41,020 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 00:56:41,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 00:56:41,022 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:56:41,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:56:41,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1364944690, now seen corresponding path program 1 times [2022-07-12 00:56:41,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:56:41,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930369734] [2022-07-12 00:56:41,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:56:41,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:56:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:56:41,160 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 00:56:41,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:56:41,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930369734] [2022-07-12 00:56:41,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930369734] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:56:41,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:56:41,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 00:56:41,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326187692] [2022-07-12 00:56:41,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:56:41,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 00:56:41,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:56:41,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 00:56:41,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 00:56:41,162 INFO L87 Difference]: Start difference. First operand 5973 states and 7180 transitions. Second operand has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 00:56:42,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:56:42,142 INFO L93 Difference]: Finished difference Result 15455 states and 18862 transitions. [2022-07-12 00:56:42,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 00:56:42,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 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 226 [2022-07-12 00:56:42,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:56:42,179 INFO L225 Difference]: With dead ends: 15455 [2022-07-12 00:56:42,179 INFO L226 Difference]: Without dead ends: 9484 [2022-07-12 00:56:42,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 00:56:42,188 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 330 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 00:56:42,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 123 Invalid, 1385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1179 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 00:56:42,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9484 states. [2022-07-12 00:56:42,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9484 to 9106. [2022-07-12 00:56:42,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9106 states, 9105 states have (on average 1.2053816584294343) internal successors, (10975), 9105 states have internal predecessors, (10975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 00:56:42,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9106 states to 9106 states and 10975 transitions. [2022-07-12 00:56:42,346 INFO L78 Accepts]: Start accepts. Automaton has 9106 states and 10975 transitions. Word has length 226 [2022-07-12 00:56:42,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:56:42,349 INFO L495 AbstractCegarLoop]: Abstraction has 9106 states and 10975 transitions. [2022-07-12 00:56:42,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 00:56:42,349 INFO L276 IsEmpty]: Start isEmpty. Operand 9106 states and 10975 transitions. [2022-07-12 00:56:42,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-07-12 00:56:42,352 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:56:42,352 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-12 00:56:42,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 00:56:42,352 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:56:42,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:56:42,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1851658105, now seen corresponding path program 1 times [2022-07-12 00:56:42,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:56:42,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584208085] [2022-07-12 00:56:42,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:56:42,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:56:42,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:56:42,446 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 00:56:42,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:56:42,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584208085] [2022-07-12 00:56:42,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584208085] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:56:42,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:56:42,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:56:42,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981795366] [2022-07-12 00:56:42,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:56:42,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:56:42,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:56:42,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:56:42,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:56:42,459 INFO L87 Difference]: Start difference. First operand 9106 states and 10975 transitions. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 00:56:43,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:56:43,098 INFO L93 Difference]: Finished difference Result 22486 states and 27234 transitions. [2022-07-12 00:56:43,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:56:43,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 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 226 [2022-07-12 00:56:43,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:56:43,117 INFO L225 Difference]: With dead ends: 22486 [2022-07-12 00:56:43,117 INFO L226 Difference]: Without dead ends: 13382 [2022-07-12 00:56:43,126 INFO L412 NwaCegarLoop]: 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-07-12 00:56:43,127 INFO L413 NwaCegarLoop]: 353 mSDtfsCounter, 148 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 00:56:43,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 385 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 00:56:43,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13382 states. [2022-07-12 00:56:43,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13382 to 13378. [2022-07-12 00:56:43,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13378 states, 13377 states have (on average 1.1920460491889064) internal successors, (15946), 13377 states have internal predecessors, (15946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 00:56:43,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13378 states to 13378 states and 15946 transitions. [2022-07-12 00:56:43,529 INFO L78 Accepts]: Start accepts. Automaton has 13378 states and 15946 transitions. Word has length 226 [2022-07-12 00:56:43,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:56:43,529 INFO L495 AbstractCegarLoop]: Abstraction has 13378 states and 15946 transitions. [2022-07-12 00:56:43,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 00:56:43,530 INFO L276 IsEmpty]: Start isEmpty. Operand 13378 states and 15946 transitions. [2022-07-12 00:56:43,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2022-07-12 00:56:43,532 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:56:43,532 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-12 00:56:43,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 00:56:43,533 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:56:43,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:56:43,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1236423938, now seen corresponding path program 1 times [2022-07-12 00:56:43,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:56:43,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144999191] [2022-07-12 00:56:43,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:56:43,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:56:43,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 00:56:43,595 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 00:56:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 00:56:43,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 00:56:43,662 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 00:56:43,663 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 00:56:43,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 00:56:43,667 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 00:56:43,670 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 00:56:43,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 12:56:43 BoogieIcfgContainer [2022-07-12 00:56:43,862 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 00:56:43,862 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 00:56:43,862 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 00:56:43,863 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 00:56:43,863 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:56:33" (3/4) ... [2022-07-12 00:56:43,864 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 00:56:43,969 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 00:56:43,969 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 00:56:43,970 INFO L158 Benchmark]: Toolchain (without parser) took 13142.59ms. Allocated memory was 142.6MB in the beginning and 526.4MB in the end (delta: 383.8MB). Free memory was 108.1MB in the beginning and 428.8MB in the end (delta: -320.7MB). Peak memory consumption was 70.3MB. Max. memory is 16.1GB. [2022-07-12 00:56:43,970 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 83.9MB. Free memory was 42.8MB in the beginning and 42.8MB in the end (delta: 41.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 00:56:43,970 INFO L158 Benchmark]: CACSL2BoogieTranslator took 674.06ms. Allocated memory is still 142.6MB. Free memory was 108.1MB in the beginning and 84.3MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-07-12 00:56:43,970 INFO L158 Benchmark]: Boogie Procedure Inliner took 113.70ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 67.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-12 00:56:43,970 INFO L158 Benchmark]: Boogie Preprocessor took 65.95ms. Allocated memory is still 142.6MB. Free memory was 67.1MB in the beginning and 57.0MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 00:56:43,972 INFO L158 Benchmark]: RCFGBuilder took 1499.80ms. Allocated memory was 142.6MB in the beginning and 266.3MB in the end (delta: 123.7MB). Free memory was 57.0MB in the beginning and 218.2MB in the end (delta: -161.2MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. [2022-07-12 00:56:43,972 INFO L158 Benchmark]: TraceAbstraction took 10676.78ms. Allocated memory was 266.3MB in the beginning and 385.9MB in the end (delta: 119.5MB). Free memory was 217.1MB in the beginning and 292.8MB in the end (delta: -75.7MB). Peak memory consumption was 147.6MB. Max. memory is 16.1GB. [2022-07-12 00:56:43,973 INFO L158 Benchmark]: Witness Printer took 106.69ms. Allocated memory was 385.9MB in the beginning and 526.4MB in the end (delta: 140.5MB). Free memory was 292.8MB in the beginning and 428.8MB in the end (delta: -136.0MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2022-07-12 00:56:43,975 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 83.9MB. Free memory was 42.8MB in the beginning and 42.8MB in the end (delta: 41.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 674.06ms. Allocated memory is still 142.6MB. Free memory was 108.1MB in the beginning and 84.3MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 113.70ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 67.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.95ms. Allocated memory is still 142.6MB. Free memory was 67.1MB in the beginning and 57.0MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1499.80ms. Allocated memory was 142.6MB in the beginning and 266.3MB in the end (delta: 123.7MB). Free memory was 57.0MB in the beginning and 218.2MB in the end (delta: -161.2MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. * TraceAbstraction took 10676.78ms. Allocated memory was 266.3MB in the beginning and 385.9MB in the end (delta: 119.5MB). Free memory was 217.1MB in the beginning and 292.8MB in the end (delta: -75.7MB). Peak memory consumption was 147.6MB. Max. memory is 16.1GB. * Witness Printer took 106.69ms. Allocated memory was 385.9MB in the beginning and 526.4MB in the end (delta: 140.5MB). Free memory was 292.8MB in the beginning and 428.8MB in the end (delta: -136.0MB). Peak memory consumption was 11.5MB. 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: 58]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int inputA = 1; [L18] int inputD = 4; [L19] int inputB = 2; [L20] int inputE = 5; [L21] int inputF = 6; [L22] int inputC = 3; [L25] int a29 = 130; [L26] int a4 = 1; [L27] int a23 = 312; [L28] int a8 = 15; [L29] int a25 = 10; [L30] int a3 = 1; VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1041] int output = -1; VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L1044] COND TRUE 1 [L1047] int input; [L1048] input = __VERIFIER_nondet_int() [L1049] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1052] CALL, EXPR calculate_output(input) [L33] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L204] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L207] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L213] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L217] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==1))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L224] COND FALSE !((!(a4==1) && (((a3==1) && ((((((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 4)) && a23 <= -43 )) && (a8==15)))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a25==11) && (!(a4==1) && (((((input == 2) && (a3==1)) && a23 <= -43 ) && (a8==15)) && ((245 < a29) && (277 >= a29)) )))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L237] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L243] COND FALSE !((((a8==15) && (((((((a4==1) && 277 < a29 ) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 )) && (input == 6))) && (a3==1))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L250] COND FALSE !(((((input == 4) && (( a23 <= -43 && ((a25==9) && (!(a4==1) && a29 <= 140 ))) || (((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && ((a25==13) && ( 277 < a29 && (a4==1))))))) && (a8==15)) && (a3==1))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((a3==1) && (!(a4==1) && (( a29 <= 140 && ((input == 1) && ((a25==12) || ((a25==10) || (a25==11))))) && ((-43 < a23) && (138 >= a23)) ))) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !(((( ((245 < a29) && (277 >= a29)) && (( a23 <= -43 && (!(a4==1) && (input == 1))) && (a25==11))) && (a8==15)) && (a3==1))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !(((((a4==1) && (((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && (a8==15))) && 306 < a23 ) && (a3==1))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((( 277 < a29 && (((a8==15) && ( a23 <= -43 && ((input == 2) && (a3==1)))) && !(a4==1))) && (a25==13))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L278] COND FALSE !(( a29 <= 140 && ((((a8==15) && ((a3==1) && ((input == 1) && ((a25==12) || (a25==13))))) && !(a4==1)) && a23 <= -43 ))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((a4==1) && ((a8==15) && (((a3==1) && (((a25==9) || (a25==10)) && (input == 5))) && ((140 < a29) && (245 >= a29)) ))) && 306 < a23 )) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !(((a3==1) && (((((input == 5) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9))))) && (a8==15)) && !(a4==1)) && a23 <= -43 ))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L297] COND FALSE !(((a8==15) && ((((!(a4==1) && (((a25==12) || (a25==13)) && (input == 4))) && a23 <= -43 ) && a29 <= 140 ) && (a3==1)))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L304] COND FALSE !(((a8==15) && (!(a4==1) && ( a23 <= -43 && ((a3==1) && ( 277 < a29 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 6)))))))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(( 306 < a23 && (((a8==15) && ((a3==1) && ((a4==1) && (((a25==11) || (a25==12)) && (input == 6))))) && ((140 < a29) && (245 >= a29)) ))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !(((((a8==15) && ( a29 <= 140 && ( a23 <= -43 && ((input == 2) && ((a25==10) || (a25==11)))))) && !(a4==1)) && (a3==1))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L320] COND FALSE !(((a3==1) && ( ((245 < a29) && (277 >= a29)) && (((a4==1) && ((a8==15) && ((((a25==11) || (a25==12)) || (a25==13)) && (input == 5)))) && 306 < a23 )))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a8==15) && (((a4==1) && ((input == 2) && ((a25==13) || ((a25==11) || (a25==12))))) && ((245 < a29) && (277 >= a29)) )) && 306 < a23 ) && (a3==1))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L332] COND FALSE !((( 306 < a23 && ((a8==15) && ((((input == 6) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a4==1))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((a8==15) && (((((a25==11) || (a25==12)) && (input == 4)) && 306 < a23 ) && (a3==1))) && (a4==1)) && ((140 < a29) && (245 >= a29)) )) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L344] COND FALSE !(( a23 <= -43 && ( ((140 < a29) && (245 >= a29)) && (((a8==15) && (((input == 4) && ((a25==11) || ((a25==9) || (a25==10)))) && !(a4==1))) && (a3==1))))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND FALSE !((((((((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ( 277 < a29 && (a25==9))) && (input == 1)) && a23 <= -43 ) && (a8==15)) && !(a4==1)) && (a3==1))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L356] COND FALSE !((!(a4==1) && ( a29 <= 140 && ((((((a25==12) || (a25==13)) && (input == 2)) && a23 <= -43 ) && (a3==1)) && (a8==15))))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(((a8==15) && (( 306 < a23 && ((a3==1) && ((input == 4) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))))) && (a4==1)))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L368] COND FALSE !(((((input == 3) && (( a23 <= -43 && ((!(a4==1) && a29 <= 140 ) && (a25==9))) || (( 306 < a23 && (( 277 < a29 && (a4==1)) && (a25==12))) || ((((a4==1) && 277 < a29 ) && (a25==13)) && 306 < a23 )))) && (a3==1)) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(( 306 < a23 && ((a4==1) && (((((((a25==11) || (a25==12)) || (a25==13)) && (input == 3)) && (a8==15)) && (a3==1)) && ((245 < a29) && (277 >= a29)) )))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L380] COND FALSE !(( ((245 < a29) && (277 >= a29)) && (((((!(a4==1) && (input == 6)) && (a3==1)) && (a25==11)) && (a8==15)) && a23 <= -43 ))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L387] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && (((a8==15) && ((input == 2) && ((( a29 <= 140 && (a25==13)) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ((a25==10) && ((140 < a29) && (245 >= a29)) )))) && (a3==1))) && !(a4==1))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !(( a29 <= 140 && ((a8==15) && ((((((a25==10) || (a25==11)) && (input == 3)) && a23 <= -43 ) && (a3==1)) && !(a4==1))))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L401] COND FALSE !((((((a8==15) && (((input == 3) && (((a25==10) || (a25==11)) || (a25==12))) && (a3==1))) && a23 <= -43 ) && !(a4==1)) && 277 < a29 )) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(((!(a4==1) && ((a25==9) && ((a8==15) && ((a3==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 1)))))) && a29 <= 140 )) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L421] COND FALSE !(((a8==15) && ((( 306 < a23 && (((((a25==11) || (a25==12)) || (a25==13)) && (input == 6)) && ((245 < a29) && (277 >= a29)) )) && (a4==1)) && (a3==1)))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L427] COND FALSE !((((((!(a4==1) && ((a8==15) && (input == 2))) && (a3==1)) && ((140 < a29) && (245 >= a29)) ) && (a25==12)) && a23 <= -43 )) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L432] COND FALSE !(( a23 <= -43 && (( a29 <= 140 && ((a8==15) && (!(a4==1) && (((a25==12) || (a25==13)) && (input == 3))))) && (a3==1)))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L439] COND FALSE !(((((((input == 6) && ((((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ( ((140 < a29) && (245 >= a29)) && (a25==10)))) && (a8==15)) && (a3==1)) && !(a4==1)) && ((-43 < a23) && (138 >= a23)) )) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L446] COND FALSE !(((!(a4==1) && (((((a3==1) && (input == 4)) && (a25==11)) && ((245 < a29) && (277 >= a29)) ) && a23 <= -43 )) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L453] COND FALSE !(((a3==1) && ( ((140 < a29) && (245 >= a29)) && ( a23 <= -43 && ((a8==15) && (!(a4==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 3)))))))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L460] COND FALSE !(((((!(a4==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 4)) && 277 < a29 )) && a23 <= -43 ) && (a8==15)) && (a3==1))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L466] COND FALSE !(( ((140 < a29) && (245 >= a29)) && ((a8==15) && (((a25==12) && (!(a4==1) && ( a23 <= -43 && (input == 4)))) && (a3==1))))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L473] COND FALSE !(((a3==1) && ((((((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || (((a25==9) && (!(a4==1) && a29 <= 140 )) && a23 <= -43 )) && (input == 2)) && (a8==15)))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L480] COND FALSE !(((((input == 5) && (((((a25==12) && ((a4==1) && 277 < a29 )) && 306 < a23 ) || ((( 277 < a29 && (a4==1)) && (a25==13)) && 306 < a23 )) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 ))) && (a8==15)) && (a3==1))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L487] COND FALSE !(((a25==12) && (((a3==1) && ((((input == 1) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) ) && !(a4==1))) && (a8==15)))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L497] COND FALSE !((((a8==15) && (( ((-43 < a23) && (138 >= a23)) && ((input == 1) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (((a25==13) && a29 <= 140 ) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))))) && (a3==1))) && !(a4==1))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L510] COND FALSE !(((a3==1) && ((a8==15) && (((((( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 3)) && !(a4==1)) && a23 <= -43 )))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !((( a29 <= 140 && ( ((-43 < a23) && (138 >= a23)) && ((a3==1) && ((a8==15) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 2)))))) && !(a4==1))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L524] COND FALSE !((((a4==1) && ( 306 < a23 && ((((input == 3) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L536] COND FALSE !(((a4==1) && ((((a3==1) && ( 306 < a23 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 4)))) && a29 <= 140 ) && (a8==15)))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L541] COND FALSE !((((( ((-43 < a23) && (138 >= a23)) && ((!(a4==1) && (input == 5)) && (a3==1))) && (a25==9)) && a29 <= 140 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L547] COND FALSE !(( 306 < a23 && (((a8==15) && ((((input == 1) && ((a25==11) || (a25==12))) && (a4==1)) && (a3==1))) && ((140 < a29) && (245 >= a29)) ))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L552] COND FALSE !(((((a8==15) && ( a23 <= -43 && (((input == 1) && ((a25==10) || (a25==11))) && a29 <= 140 ))) && !(a4==1)) && (a3==1))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L559] COND FALSE !(((( a23 <= -43 && (!(a4==1) && ((a3==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 5))))) && (a8==15)) && ((140 < a29) && (245 >= a29)) )) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L565] COND FALSE !(((a3==1) && ( ((-43 < a23) && (138 >= a23)) && ((a8==15) && ((((((a25==10) || (a25==11)) || (a25==12)) && (input == 5)) && a29 <= 140 ) && !(a4==1)))))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L571] COND FALSE !(( 306 < a23 && (((a3==1) && ( 277 < a29 && (((input == 4) && (((a25==9) || (a25==10)) || (a25==11))) && (a8==15)))) && (a4==1)))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L576] COND FALSE !((!(a4==1) && ( a23 <= -43 && ((a8==15) && (((((a25==12) || ((a25==10) || (a25==11))) && (input == 1)) && (a3==1)) && 277 < a29 ))))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L582] COND FALSE !(( 277 < a29 && (((a25==13) && ( a23 <= -43 && (!(a4==1) && ((input == 1) && (a3==1))))) && (a8==15)))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L585] COND FALSE !(((( ((-43 < a23) && (138 >= a23)) && (((a25==9) && ((input == 4) && !(a4==1))) && a29 <= 140 )) && (a3==1)) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L591] COND FALSE !(((a8==15) && ((((a3==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 3)) && (a4==1))) && 306 < a23 ) && a29 <= 140 ))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L596] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && ((a3==1) && (!(a4==1) && ((input == 4) && (((a25==10) && ((140 < a29) && (245 >= a29)) ) || (((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9)))))))) && (a8==15))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L608] COND FALSE !(((((a8==15) && ((!(a4==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 6))) && (a3==1))) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) )) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L613] COND TRUE ( a29 <= 140 && (((a4==1) && ((a8==15) && (((input == 6) && (((a25==10) || (a25==11)) || (a25==12))) && 306 < a23 ))) && (a3==1))) VAL [\old(input)=6, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L614] COND TRUE (a4==1) [L615] a29 = ((((a29 % 15)+ 262) - -1) + -3) [L616] a23 = ((((a23 - 600285) - 8) + 385102) + -384893) [L617] a4 = 0 [L618] a25 = 12 VAL [\old(input)=6, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L624] return 24; VAL [\old(input)=6, \result=24, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1052] RET, EXPR calculate_output(input) [L1052] output = calculate_output(input) [L1044] COND TRUE 1 [L1047] int input; [L1048] input = __VERIFIER_nondet_int() [L1049] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1052] CALL, EXPR calculate_output(input) [L33] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L204] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L207] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L213] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L217] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==1))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L224] COND FALSE !((!(a4==1) && (((a3==1) && ((((((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 4)) && a23 <= -43 )) && (a8==15)))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a25==11) && (!(a4==1) && (((((input == 2) && (a3==1)) && a23 <= -43 ) && (a8==15)) && ((245 < a29) && (277 >= a29)) )))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L237] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L243] COND FALSE !((((a8==15) && (((((((a4==1) && 277 < a29 ) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 )) && (input == 6))) && (a3==1))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L250] COND FALSE !(((((input == 4) && (( a23 <= -43 && ((a25==9) && (!(a4==1) && a29 <= 140 ))) || (((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && ((a25==13) && ( 277 < a29 && (a4==1))))))) && (a8==15)) && (a3==1))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((a3==1) && (!(a4==1) && (( a29 <= 140 && ((input == 1) && ((a25==12) || ((a25==10) || (a25==11))))) && ((-43 < a23) && (138 >= a23)) ))) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !(((( ((245 < a29) && (277 >= a29)) && (( a23 <= -43 && (!(a4==1) && (input == 1))) && (a25==11))) && (a8==15)) && (a3==1))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !(((((a4==1) && (((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && (a8==15))) && 306 < a23 ) && (a3==1))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((( 277 < a29 && (((a8==15) && ( a23 <= -43 && ((input == 2) && (a3==1)))) && !(a4==1))) && (a25==13))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L278] COND FALSE !(( a29 <= 140 && ((((a8==15) && ((a3==1) && ((input == 1) && ((a25==12) || (a25==13))))) && !(a4==1)) && a23 <= -43 ))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((a4==1) && ((a8==15) && (((a3==1) && (((a25==9) || (a25==10)) && (input == 5))) && ((140 < a29) && (245 >= a29)) ))) && 306 < a23 )) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !(((a3==1) && (((((input == 5) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9))))) && (a8==15)) && !(a4==1)) && a23 <= -43 ))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L297] COND FALSE !(((a8==15) && ((((!(a4==1) && (((a25==12) || (a25==13)) && (input == 4))) && a23 <= -43 ) && a29 <= 140 ) && (a3==1)))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L304] COND FALSE !(((a8==15) && (!(a4==1) && ( a23 <= -43 && ((a3==1) && ( 277 < a29 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 6)))))))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(( 306 < a23 && (((a8==15) && ((a3==1) && ((a4==1) && (((a25==11) || (a25==12)) && (input == 6))))) && ((140 < a29) && (245 >= a29)) ))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !(((((a8==15) && ( a29 <= 140 && ( a23 <= -43 && ((input == 2) && ((a25==10) || (a25==11)))))) && !(a4==1)) && (a3==1))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L320] COND FALSE !(((a3==1) && ( ((245 < a29) && (277 >= a29)) && (((a4==1) && ((a8==15) && ((((a25==11) || (a25==12)) || (a25==13)) && (input == 5)))) && 306 < a23 )))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a8==15) && (((a4==1) && ((input == 2) && ((a25==13) || ((a25==11) || (a25==12))))) && ((245 < a29) && (277 >= a29)) )) && 306 < a23 ) && (a3==1))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L332] COND FALSE !((( 306 < a23 && ((a8==15) && ((((input == 6) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a4==1))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((a8==15) && (((((a25==11) || (a25==12)) && (input == 4)) && 306 < a23 ) && (a3==1))) && (a4==1)) && ((140 < a29) && (245 >= a29)) )) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L344] COND FALSE !(( a23 <= -43 && ( ((140 < a29) && (245 >= a29)) && (((a8==15) && (((input == 4) && ((a25==11) || ((a25==9) || (a25==10)))) && !(a4==1))) && (a3==1))))) VAL [\old(input)=1, a23=-599772, a25=12, a29=270, a3=1, a4=0, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND TRUE (((((((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ( 277 < a29 && (a25==9))) && (input == 1)) && a23 <= -43 ) && (a8==15)) && !(a4==1)) && (a3==1)) [L351] a29 = ((((a29 % 299861)- -278) + 162880) - -51725) [L352] a4 = 1 [L353] a25 = 10 [L355] return -1; VAL [\old(input)=1, \result=-1, a23=-599772, a25=10, a29=215153, a3=1, a4=1, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1052] RET, EXPR calculate_output(input) [L1052] output = calculate_output(input) [L1044] COND TRUE 1 [L1047] int input; [L1048] input = __VERIFIER_nondet_int() [L1049] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1052] CALL calculate_output(input) [L33] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=10, a29=215153, a3=1, a4=1, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=10, a29=215153, a3=1, a4=1, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=10, a29=215153, a3=1, a4=1, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=10, a29=215153, a3=1, a4=1, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=10, a29=215153, a3=1, a4=1, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=10, a29=215153, a3=1, a4=1, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=10, a29=215153, a3=1, a4=1, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=1, a23=-599772, a25=10, a29=215153, a3=1, a4=1, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND TRUE ((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15)) VAL [\old(input)=1, a23=-599772, a25=10, a29=215153, a3=1, a4=1, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] reach_error() VAL [\old(input)=1, a23=-599772, a25=10, a29=215153, a3=1, a4=1, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.4s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1946 SdHoareTripleChecker+Valid, 7.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1946 mSDsluCounter, 2428 SdHoareTripleChecker+Invalid, 6.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 272 mSDsCounter, 1070 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6770 IncrementalHoareTripleChecker+Invalid, 7840 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1070 mSolverCounterUnsat, 2156 mSDtfsCounter, 6770 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13378occurred in iteration=10, InterpolantAutomatonStates: 32, 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, 10 MinimizatonAttempts, 2095 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1733 NumberOfCodeBlocks, 1733 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1495 ConstructedInterpolants, 0 QuantifiedInterpolants, 3019 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 558/558 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-07-12 00:56:44,002 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