./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label39.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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_label39.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 0228d1b7f2a33ef725fbf35c42c49b2757875a719edcc71c3b2f152eb58a8ad1 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 12:42:32,735 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 12:42:32,737 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 12:42:32,798 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 12:42:32,799 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 12:42:32,800 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 12:42:32,802 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 12:42:32,805 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 12:42:32,806 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 12:42:32,810 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 12:42:32,811 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 12:42:32,813 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 12:42:32,813 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 12:42:32,815 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 12:42:32,816 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 12:42:32,818 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 12:42:32,819 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 12:42:32,820 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 12:42:32,822 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 12:42:32,827 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 12:42:32,829 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 12:42:32,830 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 12:42:32,831 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 12:42:32,831 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 12:42:32,833 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 12:42:32,839 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 12:42:32,839 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 12:42:32,839 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 12:42:32,840 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 12:42:32,841 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 12:42:32,842 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 12:42:32,842 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 12:42:32,843 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 12:42:32,844 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 12:42:32,845 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 12:42:32,846 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 12:42:32,846 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 12:42:32,846 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 12:42:32,847 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 12:42:32,847 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 12:42:32,848 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 12:42:32,849 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 12:42:32,850 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 12:42:32,878 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 12:42:32,879 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 12:42:32,879 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 12:42:32,879 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 12:42:32,880 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 12:42:32,880 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 12:42:32,881 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 12:42:32,881 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 12:42:32,881 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 12:42:32,882 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 12:42:32,883 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 12:42:32,883 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 12:42:32,883 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 12:42:32,883 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 12:42:32,883 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 12:42:32,884 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 12:42:32,884 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 12:42:32,884 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 12:42:32,884 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 12:42:32,884 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 12:42:32,886 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 12:42:32,886 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 12:42:32,886 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 12:42:32,887 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 12:42:32,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 12:42:32,887 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 12:42:32,887 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 12:42:32,888 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 12:42:32,888 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 12:42:32,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 12:42:32,888 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 12:42:32,889 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 12:42:32,889 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 12:42:32,889 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 -> 0228d1b7f2a33ef725fbf35c42c49b2757875a719edcc71c3b2f152eb58a8ad1 [2022-07-13 12:42:33,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 12:42:33,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 12:42:33,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 12:42:33,170 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 12:42:33,171 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 12:42:33,171 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label39.c [2022-07-13 12:42:33,223 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eca9b4930/4d8b99fa52614287a7491ce962b94045/FLAG4a7b90b08 [2022-07-13 12:42:33,775 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 12:42:33,776 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label39.c [2022-07-13 12:42:33,792 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eca9b4930/4d8b99fa52614287a7491ce962b94045/FLAG4a7b90b08 [2022-07-13 12:42:34,194 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eca9b4930/4d8b99fa52614287a7491ce962b94045 [2022-07-13 12:42:34,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 12:42:34,198 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 12:42:34,203 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 12:42:34,204 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 12:42:34,207 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 12:42:34,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 12:42:34" (1/1) ... [2022-07-13 12:42:34,208 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@363fac65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 12:42:34, skipping insertion in model container [2022-07-13 12:42:34,209 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 12:42:34" (1/1) ... [2022-07-13 12:42:34,215 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 12:42:34,263 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 12:42:34,451 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_label39.c[1593,1606] [2022-07-13 12:42:34,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 12:42:34,752 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 12:42:34,772 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_label39.c[1593,1606] [2022-07-13 12:42:34,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 12:42:34,889 INFO L208 MainTranslator]: Completed translation [2022-07-13 12:42:34,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 12:42:34 WrapperNode [2022-07-13 12:42:34,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 12:42:34,891 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 12:42:34,891 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 12:42:34,891 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 12:42:34,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 12:42:34" (1/1) ... [2022-07-13 12:42:34,921 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 12:42:34" (1/1) ... [2022-07-13 12:42:35,029 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 999 [2022-07-13 12:42:35,029 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 12:42:35,030 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 12:42:35,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 12:42:35,031 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 12:42:35,038 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 12:42:34" (1/1) ... [2022-07-13 12:42:35,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 12:42:34" (1/1) ... [2022-07-13 12:42:35,054 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 12:42:34" (1/1) ... [2022-07-13 12:42:35,055 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 12:42:34" (1/1) ... [2022-07-13 12:42:35,103 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 12:42:34" (1/1) ... [2022-07-13 12:42:35,121 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 12:42:34" (1/1) ... [2022-07-13 12:42:35,131 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 12:42:34" (1/1) ... [2022-07-13 12:42:35,143 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 12:42:35,145 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 12:42:35,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 12:42:35,146 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 12:42:35,146 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 12:42:34" (1/1) ... [2022-07-13 12:42:35,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 12:42:35,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 12:42:35,180 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-13 12:42:35,220 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-13 12:42:35,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 12:42:35,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 12:42:35,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 12:42:35,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 12:42:35,319 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 12:42:35,320 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 12:42:36,516 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 12:42:36,532 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 12:42:36,533 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 12:42:36,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 12:42:36 BoogieIcfgContainer [2022-07-13 12:42:36,535 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 12:42:36,537 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 12:42:36,538 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 12:42:36,540 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 12:42:36,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 12:42:34" (1/3) ... [2022-07-13 12:42:36,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6e5d90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 12:42:36, skipping insertion in model container [2022-07-13 12:42:36,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 12:42:34" (2/3) ... [2022-07-13 12:42:36,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6e5d90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 12:42:36, skipping insertion in model container [2022-07-13 12:42:36,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 12:42:36" (3/3) ... [2022-07-13 12:42:36,543 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem11_label39.c [2022-07-13 12:42:36,555 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 12:42:36,555 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 12:42:36,611 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 12:42:36,619 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@55a1025d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4df0af9f [2022-07-13 12:42:36,619 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 12:42:36,626 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-13 12:42:36,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-13 12:42:36,632 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:42:36,632 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 12:42:36,633 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:42:36,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:42:36,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1417350502, now seen corresponding path program 1 times [2022-07-13 12:42:36,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:42:36,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159484053] [2022-07-13 12:42:36,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:42:36,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:42:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:42:36,818 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-13 12:42:36,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:42:36,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159484053] [2022-07-13 12:42:36,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159484053] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:42:36,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:42:36,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 12:42:36,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558416737] [2022-07-13 12:42:36,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:42:36,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 12:42:36,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:42:36,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 12:42:36,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 12:42:36,849 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 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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-13 12:42:37,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:42:37,884 INFO L93 Difference]: Finished difference Result 763 states and 1352 transitions. [2022-07-13 12:42:37,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 12:42:37,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-07-13 12:42:37,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:42:37,901 INFO L225 Difference]: With dead ends: 763 [2022-07-13 12:42:37,905 INFO L226 Difference]: Without dead ends: 416 [2022-07-13 12:42:37,912 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-13 12:42:37,917 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 263 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-13 12:42:37,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 89 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-13 12:42:37,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2022-07-13 12:42:37,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 408. [2022-07-13 12:42:37,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 1.6142506142506143) internal successors, (657), 407 states have internal predecessors, (657), 0 states have call successors, (0), 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-13 12:42:37,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 657 transitions. [2022-07-13 12:42:37,973 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 657 transitions. Word has length 10 [2022-07-13 12:42:37,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:42:37,973 INFO L495 AbstractCegarLoop]: Abstraction has 408 states and 657 transitions. [2022-07-13 12:42:37,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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-13 12:42:37,974 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 657 transitions. [2022-07-13 12:42:37,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-13 12:42:37,984 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:42:37,984 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 12:42:37,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 12:42:37,985 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:42:37,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:42:37,986 INFO L85 PathProgramCache]: Analyzing trace with hash -932027650, now seen corresponding path program 1 times [2022-07-13 12:42:37,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:42:37,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115597547] [2022-07-13 12:42:37,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:42:37,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:42:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:42:38,103 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 12:42:38,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:42:38,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115597547] [2022-07-13 12:42:38,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115597547] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:42:38,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:42:38,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 12:42:38,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145657909] [2022-07-13 12:42:38,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:42:38,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 12:42:38,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:42:38,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 12:42:38,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 12:42:38,107 INFO L87 Difference]: Start difference. First operand 408 states and 657 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 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-13 12:42:38,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:42:38,792 INFO L93 Difference]: Finished difference Result 1193 states and 1931 transitions. [2022-07-13 12:42:38,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 12:42:38,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2022-07-13 12:42:38,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:42:38,798 INFO L225 Difference]: With dead ends: 1193 [2022-07-13 12:42:38,798 INFO L226 Difference]: Without dead ends: 787 [2022-07-13 12:42:38,799 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-13 12:42:38,800 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 143 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 12:42:38,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 153 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 12:42:38,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2022-07-13 12:42:38,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 783. [2022-07-13 12:42:38,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 782 states have (on average 1.4398976982097187) internal successors, (1126), 782 states have internal predecessors, (1126), 0 states have call successors, (0), 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-13 12:42:38,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1126 transitions. [2022-07-13 12:42:38,829 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1126 transitions. Word has length 75 [2022-07-13 12:42:38,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:42:38,829 INFO L495 AbstractCegarLoop]: Abstraction has 783 states and 1126 transitions. [2022-07-13 12:42:38,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 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-13 12:42:38,830 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1126 transitions. [2022-07-13 12:42:38,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-13 12:42:38,832 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:42:38,832 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 12:42:38,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 12:42:38,832 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:42:38,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:42:38,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1800636210, now seen corresponding path program 1 times [2022-07-13 12:42:38,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:42:38,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098080139] [2022-07-13 12:42:38,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:42:38,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:42:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:42:38,972 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 12:42:38,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:42:38,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098080139] [2022-07-13 12:42:38,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098080139] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:42:38,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:42:38,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 12:42:38,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390672985] [2022-07-13 12:42:38,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:42:38,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 12:42:38,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:42:38,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 12:42:38,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 12:42:38,975 INFO L87 Difference]: Start difference. First operand 783 states and 1126 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:39,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:42:39,691 INFO L93 Difference]: Finished difference Result 1948 states and 2803 transitions. [2022-07-13 12:42:39,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 12:42:39,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-07-13 12:42:39,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:42:39,696 INFO L225 Difference]: With dead ends: 1948 [2022-07-13 12:42:39,697 INFO L226 Difference]: Without dead ends: 1167 [2022-07-13 12:42:39,698 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-13 12:42:39,699 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 144 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 12:42:39,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 116 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 12:42:39,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2022-07-13 12:42:39,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1154. [2022-07-13 12:42:39,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1153 states have (on average 1.3399826539462272) internal successors, (1545), 1153 states have internal predecessors, (1545), 0 states have call successors, (0), 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-13 12:42:39,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1545 transitions. [2022-07-13 12:42:39,723 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1545 transitions. Word has length 78 [2022-07-13 12:42:39,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:42:39,724 INFO L495 AbstractCegarLoop]: Abstraction has 1154 states and 1545 transitions. [2022-07-13 12:42:39,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:39,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1545 transitions. [2022-07-13 12:42:39,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-13 12:42:39,726 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:42:39,727 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 12:42:39,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 12:42:39,727 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:42:39,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:42:39,728 INFO L85 PathProgramCache]: Analyzing trace with hash -506886028, now seen corresponding path program 1 times [2022-07-13 12:42:39,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:42:39,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022732895] [2022-07-13 12:42:39,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:42:39,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:42:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:42:39,817 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 12:42:39,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:42:39,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022732895] [2022-07-13 12:42:39,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022732895] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:42:39,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:42:39,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 12:42:39,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742926340] [2022-07-13 12:42:39,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:42:39,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 12:42:39,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:42:39,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 12:42:39,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 12:42:39,820 INFO L87 Difference]: Start difference. First operand 1154 states and 1545 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 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-13 12:42:40,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:42:40,494 INFO L93 Difference]: Finished difference Result 2676 states and 3531 transitions. [2022-07-13 12:42:40,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 12:42:40,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2022-07-13 12:42:40,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:42:40,501 INFO L225 Difference]: With dead ends: 2676 [2022-07-13 12:42:40,501 INFO L226 Difference]: Without dead ends: 1524 [2022-07-13 12:42:40,502 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-13 12:42:40,503 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 12:42:40,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 189 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 12:42:40,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2022-07-13 12:42:40,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1523. [2022-07-13 12:42:40,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1523 states, 1522 states have (on average 1.269382391590013) internal successors, (1932), 1522 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-13 12:42:40,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 1932 transitions. [2022-07-13 12:42:40,529 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 1932 transitions. Word has length 79 [2022-07-13 12:42:40,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:42:40,529 INFO L495 AbstractCegarLoop]: Abstraction has 1523 states and 1932 transitions. [2022-07-13 12:42:40,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 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-13 12:42:40,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 1932 transitions. [2022-07-13 12:42:40,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-13 12:42:40,532 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:42:40,532 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:42:40,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 12:42:40,532 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:42:40,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:42:40,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1306346415, now seen corresponding path program 1 times [2022-07-13 12:42:40,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:42:40,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607762184] [2022-07-13 12:42:40,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:42:40,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:42:40,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:42:40,671 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 12:42:40,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:42:40,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607762184] [2022-07-13 12:42:40,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607762184] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:42:40,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:42:40,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 12:42:40,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855265869] [2022-07-13 12:42:40,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:42:40,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 12:42:40,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:42:40,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 12:42:40,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 12:42:40,674 INFO L87 Difference]: Start difference. First operand 1523 states and 1932 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 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-13 12:42:41,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:42:41,361 INFO L93 Difference]: Finished difference Result 3968 states and 5154 transitions. [2022-07-13 12:42:41,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 12:42:41,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2022-07-13 12:42:41,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:42:41,370 INFO L225 Difference]: With dead ends: 3968 [2022-07-13 12:42:41,370 INFO L226 Difference]: Without dead ends: 2631 [2022-07-13 12:42:41,372 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-13 12:42:41,373 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 115 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 12:42:41,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 154 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 12:42:41,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2631 states. [2022-07-13 12:42:41,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2631 to 2631. [2022-07-13 12:42:41,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2631 states, 2630 states have (on average 1.2133079847908745) internal successors, (3191), 2630 states have internal predecessors, (3191), 0 states have call successors, (0), 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-13 12:42:41,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2631 states to 2631 states and 3191 transitions. [2022-07-13 12:42:41,418 INFO L78 Accepts]: Start accepts. Automaton has 2631 states and 3191 transitions. Word has length 137 [2022-07-13 12:42:41,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:42:41,418 INFO L495 AbstractCegarLoop]: Abstraction has 2631 states and 3191 transitions. [2022-07-13 12:42:41,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 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-13 12:42:41,419 INFO L276 IsEmpty]: Start isEmpty. Operand 2631 states and 3191 transitions. [2022-07-13 12:42:41,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-13 12:42:41,421 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:42:41,421 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:42:41,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 12:42:41,422 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:42:41,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:42:41,422 INFO L85 PathProgramCache]: Analyzing trace with hash -2060663887, now seen corresponding path program 1 times [2022-07-13 12:42:41,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:42:41,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97505040] [2022-07-13 12:42:41,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:42:41,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:42:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:42:41,537 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 12:42:41,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:42:41,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97505040] [2022-07-13 12:42:41,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97505040] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:42:41,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:42:41,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 12:42:41,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990914744] [2022-07-13 12:42:41,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:42:41,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 12:42:41,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:42:41,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 12:42:41,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 12:42:41,543 INFO L87 Difference]: Start difference. First operand 2631 states and 3191 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 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-13 12:42:42,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:42:42,185 INFO L93 Difference]: Finished difference Result 5634 states and 6859 transitions. [2022-07-13 12:42:42,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 12:42:42,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2022-07-13 12:42:42,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:42:42,195 INFO L225 Difference]: With dead ends: 5634 [2022-07-13 12:42:42,196 INFO L226 Difference]: Without dead ends: 3189 [2022-07-13 12:42:42,198 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-13 12:42:42,199 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 75 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 12:42:42,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 153 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 12:42:42,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3189 states. [2022-07-13 12:42:42,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3189 to 3004. [2022-07-13 12:42:42,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3004 states, 3003 states have (on average 1.2131202131202132) internal successors, (3643), 3003 states have internal predecessors, (3643), 0 states have call successors, (0), 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-13 12:42:42,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 3643 transitions. [2022-07-13 12:42:42,244 INFO L78 Accepts]: Start accepts. Automaton has 3004 states and 3643 transitions. Word has length 153 [2022-07-13 12:42:42,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:42:42,245 INFO L495 AbstractCegarLoop]: Abstraction has 3004 states and 3643 transitions. [2022-07-13 12:42:42,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 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-13 12:42:42,245 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 3643 transitions. [2022-07-13 12:42:42,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-13 12:42:42,247 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:42:42,248 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:42:42,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 12:42:42,248 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:42:42,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:42:42,249 INFO L85 PathProgramCache]: Analyzing trace with hash -2099034226, now seen corresponding path program 1 times [2022-07-13 12:42:42,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:42:42,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110387110] [2022-07-13 12:42:42,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:42:42,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:42:42,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:42:42,339 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 12:42:42,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:42:42,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110387110] [2022-07-13 12:42:42,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110387110] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:42:42,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:42:42,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 12:42:42,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812242463] [2022-07-13 12:42:42,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:42:42,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 12:42:42,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:42:42,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 12:42:42,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 12:42:42,342 INFO L87 Difference]: Start difference. First operand 3004 states and 3643 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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-13 12:42:43,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:42:43,040 INFO L93 Difference]: Finished difference Result 6935 states and 8497 transitions. [2022-07-13 12:42:43,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 12:42:43,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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 190 [2022-07-13 12:42:43,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:42:43,057 INFO L225 Difference]: With dead ends: 6935 [2022-07-13 12:42:43,057 INFO L226 Difference]: Without dead ends: 4117 [2022-07-13 12:42:43,061 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-13 12:42:43,062 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 135 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 12:42:43,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 332 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 12:42:43,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4117 states. [2022-07-13 12:42:43,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4117 to 3740. [2022-07-13 12:42:43,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3740 states, 3739 states have (on average 1.2048676116608719) internal successors, (4505), 3739 states have internal predecessors, (4505), 0 states have call successors, (0), 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-13 12:42:43,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3740 states to 3740 states and 4505 transitions. [2022-07-13 12:42:43,148 INFO L78 Accepts]: Start accepts. Automaton has 3740 states and 4505 transitions. Word has length 190 [2022-07-13 12:42:43,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:42:43,149 INFO L495 AbstractCegarLoop]: Abstraction has 3740 states and 4505 transitions. [2022-07-13 12:42:43,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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-13 12:42:43,149 INFO L276 IsEmpty]: Start isEmpty. Operand 3740 states and 4505 transitions. [2022-07-13 12:42:43,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-07-13 12:42:43,151 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:42:43,151 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:42:43,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 12:42:43,152 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:42:43,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:42:43,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1137585256, now seen corresponding path program 1 times [2022-07-13 12:42:43,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:42:43,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168611409] [2022-07-13 12:42:43,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:42:43,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:42:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:42:43,274 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-07-13 12:42:43,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:42:43,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168611409] [2022-07-13 12:42:43,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168611409] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:42:43,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:42:43,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 12:42:43,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471530388] [2022-07-13 12:42:43,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:42:43,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 12:42:43,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:42:43,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 12:42:43,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 12:42:43,277 INFO L87 Difference]: Start difference. First operand 3740 states and 4505 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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-13 12:42:44,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:42:44,015 INFO L93 Difference]: Finished difference Result 9889 states and 12024 transitions. [2022-07-13 12:42:44,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 12:42:44,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 191 [2022-07-13 12:42:44,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:42:44,033 INFO L225 Difference]: With dead ends: 9889 [2022-07-13 12:42:44,034 INFO L226 Difference]: Without dead ends: 6151 [2022-07-13 12:42:44,037 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-13 12:42:44,038 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 216 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 12:42:44,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 332 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 12:42:44,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6151 states. [2022-07-13 12:42:44,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6151 to 5415. [2022-07-13 12:42:44,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5415 states, 5414 states have (on average 1.2016992981159955) internal successors, (6506), 5414 states have internal predecessors, (6506), 0 states have call successors, (0), 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-13 12:42:44,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5415 states to 5415 states and 6506 transitions. [2022-07-13 12:42:44,114 INFO L78 Accepts]: Start accepts. Automaton has 5415 states and 6506 transitions. Word has length 191 [2022-07-13 12:42:44,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:42:44,115 INFO L495 AbstractCegarLoop]: Abstraction has 5415 states and 6506 transitions. [2022-07-13 12:42:44,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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-13 12:42:44,115 INFO L276 IsEmpty]: Start isEmpty. Operand 5415 states and 6506 transitions. [2022-07-13 12:42:44,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2022-07-13 12:42:44,118 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:42:44,118 INFO L195 NwaCegarLoop]: trace histogram [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, 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] [2022-07-13 12:42:44,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 12:42:44,119 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:42:44,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:42:44,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1821003992, now seen corresponding path program 1 times [2022-07-13 12:42:44,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:42:44,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010077202] [2022-07-13 12:42:44,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:42:44,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:42:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:42:44,227 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 12:42:44,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:42:44,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010077202] [2022-07-13 12:42:44,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010077202] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:42:44,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:42:44,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 12:42:44,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423195226] [2022-07-13 12:42:44,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:42:44,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 12:42:44,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:42:44,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 12:42:44,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 12:42:44,230 INFO L87 Difference]: Start difference. First operand 5415 states and 6506 transitions. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 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-13 12:42:44,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:42:44,914 INFO L93 Difference]: Finished difference Result 10825 states and 13007 transitions. [2022-07-13 12:42:44,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 12:42:44,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 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 228 [2022-07-13 12:42:44,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:42:44,930 INFO L225 Difference]: With dead ends: 10825 [2022-07-13 12:42:44,931 INFO L226 Difference]: Without dead ends: 5412 [2022-07-13 12:42:44,936 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-13 12:42:44,938 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 142 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 12:42:44,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 304 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 12:42:44,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5412 states. [2022-07-13 12:42:45,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5412 to 5412. [2022-07-13 12:42:45,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5412 states, 5411 states have (on average 1.1750138606542229) internal successors, (6358), 5411 states have internal predecessors, (6358), 0 states have call successors, (0), 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-13 12:42:45,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5412 states to 5412 states and 6358 transitions. [2022-07-13 12:42:45,021 INFO L78 Accepts]: Start accepts. Automaton has 5412 states and 6358 transitions. Word has length 228 [2022-07-13 12:42:45,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:42:45,022 INFO L495 AbstractCegarLoop]: Abstraction has 5412 states and 6358 transitions. [2022-07-13 12:42:45,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 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-13 12:42:45,022 INFO L276 IsEmpty]: Start isEmpty. Operand 5412 states and 6358 transitions. [2022-07-13 12:42:45,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2022-07-13 12:42:45,025 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:42:45,026 INFO L195 NwaCegarLoop]: trace histogram [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, 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-13 12:42:45,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 12:42:45,026 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:42:45,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:42:45,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1429898405, now seen corresponding path program 1 times [2022-07-13 12:42:45,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:42:45,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980184696] [2022-07-13 12:42:45,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:42:45,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:42:45,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:42:45,137 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-07-13 12:42:45,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:42:45,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980184696] [2022-07-13 12:42:45,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980184696] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:42:45,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:42:45,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 12:42:45,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734344527] [2022-07-13 12:42:45,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:42:45,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 12:42:45,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:42:45,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 12:42:45,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 12:42:45,143 INFO L87 Difference]: Start difference. First operand 5412 states and 6358 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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-13 12:42:45,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:42:45,770 INFO L93 Difference]: Finished difference Result 11563 states and 13590 transitions. [2022-07-13 12:42:45,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 12:42:45,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 242 [2022-07-13 12:42:45,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:42:45,788 INFO L225 Difference]: With dead ends: 11563 [2022-07-13 12:42:45,788 INFO L226 Difference]: Without dead ends: 6153 [2022-07-13 12:42:45,794 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-13 12:42:45,794 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 212 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 12:42:45,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 148 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 12:42:45,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6153 states. [2022-07-13 12:42:45,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6153 to 5412. [2022-07-13 12:42:45,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5412 states, 5411 states have (on average 1.1750138606542229) internal successors, (6358), 5411 states have internal predecessors, (6358), 0 states have call successors, (0), 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-13 12:42:45,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5412 states to 5412 states and 6358 transitions. [2022-07-13 12:42:45,876 INFO L78 Accepts]: Start accepts. Automaton has 5412 states and 6358 transitions. Word has length 242 [2022-07-13 12:42:45,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:42:45,876 INFO L495 AbstractCegarLoop]: Abstraction has 5412 states and 6358 transitions. [2022-07-13 12:42:45,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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-13 12:42:45,877 INFO L276 IsEmpty]: Start isEmpty. Operand 5412 states and 6358 transitions. [2022-07-13 12:42:45,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2022-07-13 12:42:45,880 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:42:45,880 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:42:45,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 12:42:45,881 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:42:45,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:42:45,881 INFO L85 PathProgramCache]: Analyzing trace with hash -783309825, now seen corresponding path program 1 times [2022-07-13 12:42:45,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:42:45,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123775037] [2022-07-13 12:42:45,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:42:45,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:42:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:42:46,014 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-07-13 12:42:46,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:42:46,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123775037] [2022-07-13 12:42:46,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123775037] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:42:46,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:42:46,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 12:42:46,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331028331] [2022-07-13 12:42:46,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:42:46,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 12:42:46,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:42:46,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 12:42:46,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 12:42:46,018 INFO L87 Difference]: Start difference. First operand 5412 states and 6358 transitions. Second operand has 4 states, 4 states have (on average 44.75) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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-13 12:42:47,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:42:47,244 INFO L93 Difference]: Finished difference Result 16177 states and 19208 transitions. [2022-07-13 12:42:47,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 12:42:47,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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 245 [2022-07-13 12:42:47,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:42:47,261 INFO L225 Difference]: With dead ends: 16177 [2022-07-13 12:42:47,261 INFO L226 Difference]: Without dead ends: 10767 [2022-07-13 12:42:47,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-13 12:42:47,268 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 253 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-13 12:42:47,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 117 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-13 12:42:47,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10767 states. [2022-07-13 12:42:47,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10767 to 10203. [2022-07-13 12:42:47,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10203 states, 10202 states have (on average 1.1782983728680652) internal successors, (12021), 10202 states have internal predecessors, (12021), 0 states have call successors, (0), 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-13 12:42:47,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10203 states to 10203 states and 12021 transitions. [2022-07-13 12:42:47,439 INFO L78 Accepts]: Start accepts. Automaton has 10203 states and 12021 transitions. Word has length 245 [2022-07-13 12:42:47,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:42:47,440 INFO L495 AbstractCegarLoop]: Abstraction has 10203 states and 12021 transitions. [2022-07-13 12:42:47,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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-13 12:42:47,441 INFO L276 IsEmpty]: Start isEmpty. Operand 10203 states and 12021 transitions. [2022-07-13 12:42:47,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2022-07-13 12:42:47,452 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:42:47,453 INFO L195 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-13 12:42:47,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 12:42:47,453 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:42:47,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:42:47,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1822240153, now seen corresponding path program 1 times [2022-07-13 12:42:47,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:42:47,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422890716] [2022-07-13 12:42:47,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:42:47,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:42:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:42:47,576 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 12:42:47,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:42:47,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422890716] [2022-07-13 12:42:47,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422890716] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:42:47,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:42:47,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 12:42:47,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375897741] [2022-07-13 12:42:47,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:42:47,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 12:42:47,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:42:47,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 12:42:47,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 12:42:47,579 INFO L87 Difference]: Start difference. First operand 10203 states and 12021 transitions. Second operand has 4 states, 4 states have (on average 63.5) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 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-13 12:42:48,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:42:48,782 INFO L93 Difference]: Finished difference Result 25948 states and 30535 transitions. [2022-07-13 12:42:48,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 12:42:48,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 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 254 [2022-07-13 12:42:48,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:42:48,812 INFO L225 Difference]: With dead ends: 25948 [2022-07-13 12:42:48,812 INFO L226 Difference]: Without dead ends: 16115 [2022-07-13 12:42:48,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-13 12:42:48,825 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 259 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-13 12:42:48,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 77 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-13 12:42:48,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16115 states. [2022-07-13 12:42:49,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16115 to 15929. [2022-07-13 12:42:49,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15929 states, 15928 states have (on average 1.167817679558011) internal successors, (18601), 15928 states have internal predecessors, (18601), 0 states have call successors, (0), 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-13 12:42:49,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15929 states to 15929 states and 18601 transitions. [2022-07-13 12:42:49,073 INFO L78 Accepts]: Start accepts. Automaton has 15929 states and 18601 transitions. Word has length 254 [2022-07-13 12:42:49,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:42:49,073 INFO L495 AbstractCegarLoop]: Abstraction has 15929 states and 18601 transitions. [2022-07-13 12:42:49,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 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-13 12:42:49,074 INFO L276 IsEmpty]: Start isEmpty. Operand 15929 states and 18601 transitions. [2022-07-13 12:42:49,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2022-07-13 12:42:49,078 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:42:49,079 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:42:49,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 12:42:49,079 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:42:49,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:42:49,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1804337915, now seen corresponding path program 1 times [2022-07-13 12:42:49,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:42:49,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683251046] [2022-07-13 12:42:49,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:42:49,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:42:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:42:49,248 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2022-07-13 12:42:49,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:42:49,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683251046] [2022-07-13 12:42:49,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683251046] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:42:49,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:42:49,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 12:42:49,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662866387] [2022-07-13 12:42:49,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:42:49,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 12:42:49,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:42:49,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 12:42:49,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 12:42:49,250 INFO L87 Difference]: Start difference. First operand 15929 states and 18601 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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-13 12:42:49,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:42:49,969 INFO L93 Difference]: Finished difference Result 32771 states and 38344 transitions. [2022-07-13 12:42:49,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 12:42:49,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 265 [2022-07-13 12:42:49,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:42:49,991 INFO L225 Difference]: With dead ends: 32771 [2022-07-13 12:42:49,992 INFO L226 Difference]: Without dead ends: 18320 [2022-07-13 12:42:50,004 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-13 12:42:50,005 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 209 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 12:42:50,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 151 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 12:42:50,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18320 states. [2022-07-13 12:42:50,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18320 to 13344. [2022-07-13 12:42:50,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13344 states, 13343 states have (on average 1.1708011691523645) internal successors, (15622), 13343 states have internal predecessors, (15622), 0 states have call successors, (0), 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-13 12:42:50,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13344 states to 13344 states and 15622 transitions. [2022-07-13 12:42:50,265 INFO L78 Accepts]: Start accepts. Automaton has 13344 states and 15622 transitions. Word has length 265 [2022-07-13 12:42:50,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:42:50,265 INFO L495 AbstractCegarLoop]: Abstraction has 13344 states and 15622 transitions. [2022-07-13 12:42:50,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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-13 12:42:50,266 INFO L276 IsEmpty]: Start isEmpty. Operand 13344 states and 15622 transitions. [2022-07-13 12:42:50,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2022-07-13 12:42:50,271 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:42:50,271 INFO L195 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-13 12:42:50,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 12:42:50,271 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:42:50,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:42:50,272 INFO L85 PathProgramCache]: Analyzing trace with hash 2031798723, now seen corresponding path program 1 times [2022-07-13 12:42:50,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:42:50,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161749902] [2022-07-13 12:42:50,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:42:50,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:42:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:42:50,444 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 12:42:50,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:42:50,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161749902] [2022-07-13 12:42:50,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161749902] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:42:50,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:42:50,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 12:42:50,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631694118] [2022-07-13 12:42:50,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:42:50,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 12:42:50,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:42:50,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 12:42:50,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 12:42:50,446 INFO L87 Difference]: Start difference. First operand 13344 states and 15622 transitions. Second operand has 4 states, 4 states have (on average 71.25) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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-13 12:42:51,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:42:51,604 INFO L93 Difference]: Finished difference Result 28361 states and 33226 transitions. [2022-07-13 12:42:51,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 12:42:51,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.25) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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 285 [2022-07-13 12:42:51,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:42:51,622 INFO L225 Difference]: With dead ends: 28361 [2022-07-13 12:42:51,622 INFO L226 Difference]: Without dead ends: 15387 [2022-07-13 12:42:51,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-13 12:42:51,632 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 168 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-13 12:42:51,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 141 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-13 12:42:51,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15387 states. [2022-07-13 12:42:51,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15387 to 13902. [2022-07-13 12:42:51,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13902 states, 13901 states have (on average 1.167038342565283) internal successors, (16223), 13901 states have internal predecessors, (16223), 0 states have call successors, (0), 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-13 12:42:51,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13902 states to 13902 states and 16223 transitions. [2022-07-13 12:42:51,801 INFO L78 Accepts]: Start accepts. Automaton has 13902 states and 16223 transitions. Word has length 285 [2022-07-13 12:42:51,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:42:51,802 INFO L495 AbstractCegarLoop]: Abstraction has 13902 states and 16223 transitions. [2022-07-13 12:42:51,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.25) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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-13 12:42:51,803 INFO L276 IsEmpty]: Start isEmpty. Operand 13902 states and 16223 transitions. [2022-07-13 12:42:51,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2022-07-13 12:42:51,853 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:42:51,854 INFO L195 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-13 12:42:51,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 12:42:51,854 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:42:51,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:42:51,855 INFO L85 PathProgramCache]: Analyzing trace with hash -888982911, now seen corresponding path program 1 times [2022-07-13 12:42:51,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:42:51,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930823160] [2022-07-13 12:42:51,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:42:51,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:42:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:42:51,979 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-07-13 12:42:51,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:42:51,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930823160] [2022-07-13 12:42:51,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930823160] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:42:51,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:42:51,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 12:42:51,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370748746] [2022-07-13 12:42:51,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:42:51,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 12:42:51,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:42:51,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 12:42:51,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 12:42:51,981 INFO L87 Difference]: Start difference. First operand 13902 states and 16223 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 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-13 12:42:52,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:42:52,389 INFO L93 Difference]: Finished difference Result 26870 states and 31337 transitions. [2022-07-13 12:42:52,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 12:42:52,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 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 292 [2022-07-13 12:42:52,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:42:52,403 INFO L225 Difference]: With dead ends: 26870 [2022-07-13 12:42:52,403 INFO L226 Difference]: Without dead ends: 13338 [2022-07-13 12:42:52,412 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-13 12:42:52,413 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 187 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 12:42:52,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 38 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 12:42:52,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13338 states. [2022-07-13 12:42:52,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13338 to 13336. [2022-07-13 12:42:52,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13336 states, 13335 states have (on average 1.1616047994000749) internal successors, (15490), 13335 states have internal predecessors, (15490), 0 states have call successors, (0), 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-13 12:42:52,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13336 states to 13336 states and 15490 transitions. [2022-07-13 12:42:52,600 INFO L78 Accepts]: Start accepts. Automaton has 13336 states and 15490 transitions. Word has length 292 [2022-07-13 12:42:52,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:42:52,601 INFO L495 AbstractCegarLoop]: Abstraction has 13336 states and 15490 transitions. [2022-07-13 12:42:52,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 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-13 12:42:52,601 INFO L276 IsEmpty]: Start isEmpty. Operand 13336 states and 15490 transitions. [2022-07-13 12:42:52,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2022-07-13 12:42:52,606 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:42:52,607 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-13 12:42:52,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 12:42:52,607 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:42:52,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:42:52,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1739667143, now seen corresponding path program 1 times [2022-07-13 12:42:52,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:42:52,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661447524] [2022-07-13 12:42:52,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:42:52,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:42:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:42:52,722 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-07-13 12:42:52,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:42:52,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661447524] [2022-07-13 12:42:52,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661447524] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:42:52,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:42:52,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 12:42:52,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739870756] [2022-07-13 12:42:52,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:42:52,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 12:42:52,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:42:52,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 12:42:52,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 12:42:52,727 INFO L87 Difference]: Start difference. First operand 13336 states and 15490 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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-13 12:42:53,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:42:53,410 INFO L93 Difference]: Finished difference Result 27960 states and 32461 transitions. [2022-07-13 12:42:53,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 12:42:53,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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 316 [2022-07-13 12:42:53,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:42:53,427 INFO L225 Difference]: With dead ends: 27960 [2022-07-13 12:42:53,427 INFO L226 Difference]: Without dead ends: 14994 [2022-07-13 12:42:53,438 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-13 12:42:53,439 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 148 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 12:42:53,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 304 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 12:42:53,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14994 states. [2022-07-13 12:42:53,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14994 to 13513. [2022-07-13 12:42:53,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13513 states, 13512 states have (on average 1.1573416222616932) internal successors, (15638), 13512 states have internal predecessors, (15638), 0 states have call successors, (0), 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-13 12:42:53,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13513 states to 13513 states and 15638 transitions. [2022-07-13 12:42:53,661 INFO L78 Accepts]: Start accepts. Automaton has 13513 states and 15638 transitions. Word has length 316 [2022-07-13 12:42:53,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:42:53,662 INFO L495 AbstractCegarLoop]: Abstraction has 13513 states and 15638 transitions. [2022-07-13 12:42:53,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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-13 12:42:53,662 INFO L276 IsEmpty]: Start isEmpty. Operand 13513 states and 15638 transitions. [2022-07-13 12:42:53,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2022-07-13 12:42:53,671 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:42:53,672 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 12:42:53,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 12:42:53,672 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:42:53,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:42:53,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1494130800, now seen corresponding path program 1 times [2022-07-13 12:42:53,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:42:53,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831741301] [2022-07-13 12:42:53,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:42:53,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:42:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:42:53,833 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2022-07-13 12:42:53,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:42:53,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831741301] [2022-07-13 12:42:53,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831741301] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:42:53,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:42:53,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 12:42:53,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639041155] [2022-07-13 12:42:53,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:42:53,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 12:42:53,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:42:53,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 12:42:53,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 12:42:53,835 INFO L87 Difference]: Start difference. First operand 13513 states and 15638 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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-13 12:42:54,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:42:54,531 INFO L93 Difference]: Finished difference Result 29982 states and 34796 transitions. [2022-07-13 12:42:54,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 12:42:54,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 317 [2022-07-13 12:42:54,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:42:54,553 INFO L225 Difference]: With dead ends: 29982 [2022-07-13 12:42:54,554 INFO L226 Difference]: Without dead ends: 16839 [2022-07-13 12:42:54,562 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-13 12:42:54,563 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 207 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 12:42:54,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 345 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 12:42:54,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16839 states. [2022-07-13 12:42:54,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16839 to 15547. [2022-07-13 12:42:54,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15547 states, 15546 states have (on average 1.1573395085552554) internal successors, (17992), 15546 states have internal predecessors, (17992), 0 states have call successors, (0), 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-13 12:42:54,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15547 states to 15547 states and 17992 transitions. [2022-07-13 12:42:54,786 INFO L78 Accepts]: Start accepts. Automaton has 15547 states and 17992 transitions. Word has length 317 [2022-07-13 12:42:54,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:42:54,787 INFO L495 AbstractCegarLoop]: Abstraction has 15547 states and 17992 transitions. [2022-07-13 12:42:54,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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-13 12:42:54,788 INFO L276 IsEmpty]: Start isEmpty. Operand 15547 states and 17992 transitions. [2022-07-13 12:42:54,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2022-07-13 12:42:54,794 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:42:54,794 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 12:42:54,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 12:42:54,795 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:42:54,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:42:54,795 INFO L85 PathProgramCache]: Analyzing trace with hash 36720221, now seen corresponding path program 1 times [2022-07-13 12:42:54,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:42:54,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721901484] [2022-07-13 12:42:54,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:42:54,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:42:54,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:42:54,933 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2022-07-13 12:42:54,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:42:54,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721901484] [2022-07-13 12:42:54,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721901484] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:42:54,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:42:54,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 12:42:54,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978833715] [2022-07-13 12:42:54,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:42:54,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 12:42:54,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:42:54,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 12:42:54,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 12:42:54,935 INFO L87 Difference]: Start difference. First operand 15547 states and 17992 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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-13 12:42:55,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:42:55,547 INFO L93 Difference]: Finished difference Result 15917 states and 18373 transitions. [2022-07-13 12:42:55,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 12:42:55,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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 321 [2022-07-13 12:42:55,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:42:55,568 INFO L225 Difference]: With dead ends: 15917 [2022-07-13 12:42:55,568 INFO L226 Difference]: Without dead ends: 15915 [2022-07-13 12:42:55,574 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-13 12:42:55,575 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 206 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 12:42:55,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 303 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 12:42:55,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15915 states. [2022-07-13 12:42:55,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15915 to 13138. [2022-07-13 12:42:55,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13138 states, 13137 states have (on average 1.1441729466392632) internal successors, (15031), 13137 states have internal predecessors, (15031), 0 states have call successors, (0), 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-13 12:42:55,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13138 states to 13138 states and 15031 transitions. [2022-07-13 12:42:55,776 INFO L78 Accepts]: Start accepts. Automaton has 13138 states and 15031 transitions. Word has length 321 [2022-07-13 12:42:55,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:42:55,777 INFO L495 AbstractCegarLoop]: Abstraction has 13138 states and 15031 transitions. [2022-07-13 12:42:55,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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-13 12:42:55,777 INFO L276 IsEmpty]: Start isEmpty. Operand 13138 states and 15031 transitions. [2022-07-13 12:42:55,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2022-07-13 12:42:55,784 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:42:55,785 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 12:42:55,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 12:42:55,785 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:42:55,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:42:55,785 INFO L85 PathProgramCache]: Analyzing trace with hash 244368998, now seen corresponding path program 1 times [2022-07-13 12:42:55,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:42:55,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590728757] [2022-07-13 12:42:55,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:42:55,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:42:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:42:55,898 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-13 12:42:55,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:42:55,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590728757] [2022-07-13 12:42:55,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590728757] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:42:55,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:42:55,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 12:42:55,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983833680] [2022-07-13 12:42:55,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:42:55,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 12:42:55,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:42:55,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 12:42:55,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 12:42:55,903 INFO L87 Difference]: Start difference. First operand 13138 states and 15031 transitions. Second operand has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 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-13 12:42:56,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:42:56,573 INFO L93 Difference]: Finished difference Result 27751 states and 31850 transitions. [2022-07-13 12:42:56,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 12:42:56,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 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 332 [2022-07-13 12:42:56,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:42:56,585 INFO L225 Difference]: With dead ends: 27751 [2022-07-13 12:42:56,585 INFO L226 Difference]: Without dead ends: 14799 [2022-07-13 12:42:56,594 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-13 12:42:56,595 INFO L413 NwaCegarLoop]: 327 mSDtfsCounter, 106 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 12:42:56,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 347 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 12:42:56,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14799 states. [2022-07-13 12:42:56,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14799 to 14426. [2022-07-13 12:42:56,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14426 states, 14425 states have (on average 1.1379549393414212) internal successors, (16415), 14425 states have internal predecessors, (16415), 0 states have call successors, (0), 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-13 12:42:56,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14426 states to 14426 states and 16415 transitions. [2022-07-13 12:42:56,719 INFO L78 Accepts]: Start accepts. Automaton has 14426 states and 16415 transitions. Word has length 332 [2022-07-13 12:42:56,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:42:56,719 INFO L495 AbstractCegarLoop]: Abstraction has 14426 states and 16415 transitions. [2022-07-13 12:42:56,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 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-13 12:42:56,720 INFO L276 IsEmpty]: Start isEmpty. Operand 14426 states and 16415 transitions. [2022-07-13 12:42:56,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2022-07-13 12:42:56,727 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:42:56,728 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-13 12:42:56,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 12:42:56,728 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:42:56,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:42:56,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1041535103, now seen corresponding path program 1 times [2022-07-13 12:42:56,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:42:56,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072421976] [2022-07-13 12:42:56,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:42:56,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:42:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:42:56,876 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 12:42:56,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:42:56,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072421976] [2022-07-13 12:42:56,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072421976] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:42:56,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:42:56,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 12:42:56,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023026728] [2022-07-13 12:42:56,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:42:56,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 12:42:56,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:42:56,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 12:42:56,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 12:42:56,879 INFO L87 Difference]: Start difference. First operand 14426 states and 16415 transitions. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 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-13 12:42:57,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:42:57,527 INFO L93 Difference]: Finished difference Result 31440 states and 35902 transitions. [2022-07-13 12:42:57,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 12:42:57,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 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 352 [2022-07-13 12:42:57,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:42:57,545 INFO L225 Difference]: With dead ends: 31440 [2022-07-13 12:42:57,546 INFO L226 Difference]: Without dead ends: 17384 [2022-07-13 12:42:57,555 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-13 12:42:57,555 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 140 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 12:42:57,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 121 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 12:42:57,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17384 states. [2022-07-13 12:42:57,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17384 to 17014. [2022-07-13 12:42:57,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17014 states, 17013 states have (on average 1.1326632575089637) internal successors, (19270), 17013 states have internal predecessors, (19270), 0 states have call successors, (0), 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-13 12:42:57,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17014 states to 17014 states and 19270 transitions. [2022-07-13 12:42:57,704 INFO L78 Accepts]: Start accepts. Automaton has 17014 states and 19270 transitions. Word has length 352 [2022-07-13 12:42:57,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:42:57,705 INFO L495 AbstractCegarLoop]: Abstraction has 17014 states and 19270 transitions. [2022-07-13 12:42:57,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 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-13 12:42:57,705 INFO L276 IsEmpty]: Start isEmpty. Operand 17014 states and 19270 transitions. [2022-07-13 12:42:57,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2022-07-13 12:42:57,712 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:42:57,712 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-13 12:42:57,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-13 12:42:57,712 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:42:57,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:42:57,713 INFO L85 PathProgramCache]: Analyzing trace with hash -718698362, now seen corresponding path program 1 times [2022-07-13 12:42:57,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:42:57,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412636684] [2022-07-13 12:42:57,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:42:57,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:42:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 12:42:57,784 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 12:42:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 12:42:57,932 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 12:42:57,932 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 12:42:57,933 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 12:42:57,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-13 12:42:57,937 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 12:42:57,942 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 12:42:58,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 12:42:58 BoogieIcfgContainer [2022-07-13 12:42:58,143 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 12:42:58,143 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 12:42:58,143 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 12:42:58,144 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 12:42:58,144 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 12:42:36" (3/4) ... [2022-07-13 12:42:58,145 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 12:42:58,300 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 12:42:58,300 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 12:42:58,301 INFO L158 Benchmark]: Toolchain (without parser) took 24102.70ms. Allocated memory was 90.2MB in the beginning and 1.2GB in the end (delta: 1.2GB). Free memory was 56.8MB in the beginning and 1.0GB in the end (delta: -955.0MB). Peak memory consumption was 202.1MB. Max. memory is 16.1GB. [2022-07-13 12:42:58,301 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 90.2MB. Free memory was 48.5MB in the beginning and 48.4MB in the end (delta: 45.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 12:42:58,302 INFO L158 Benchmark]: CACSL2BoogieTranslator took 686.60ms. Allocated memory was 90.2MB in the beginning and 123.7MB in the end (delta: 33.6MB). Free memory was 56.8MB in the beginning and 67.3MB in the end (delta: -10.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-07-13 12:42:58,302 INFO L158 Benchmark]: Boogie Procedure Inliner took 138.99ms. Allocated memory is still 123.7MB. Free memory was 67.3MB in the beginning and 49.8MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-13 12:42:58,302 INFO L158 Benchmark]: Boogie Preprocessor took 113.00ms. Allocated memory is still 123.7MB. Free memory was 49.8MB in the beginning and 40.7MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 12:42:58,303 INFO L158 Benchmark]: RCFGBuilder took 1390.80ms. Allocated memory is still 123.7MB. Free memory was 40.7MB in the beginning and 60.5MB in the end (delta: -19.8MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. [2022-07-13 12:42:58,303 INFO L158 Benchmark]: TraceAbstraction took 21605.32ms. Allocated memory was 123.7MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 60.5MB in the beginning and 1.0GB in the end (delta: -978.5MB). Peak memory consumption was 512.2MB. Max. memory is 16.1GB. [2022-07-13 12:42:58,304 INFO L158 Benchmark]: Witness Printer took 156.79ms. Allocated memory is still 1.2GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-07-13 12:42:58,307 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.20ms. Allocated memory is still 90.2MB. Free memory was 48.5MB in the beginning and 48.4MB in the end (delta: 45.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 686.60ms. Allocated memory was 90.2MB in the beginning and 123.7MB in the end (delta: 33.6MB). Free memory was 56.8MB in the beginning and 67.3MB in the end (delta: -10.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 138.99ms. Allocated memory is still 123.7MB. Free memory was 67.3MB in the beginning and 49.8MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 113.00ms. Allocated memory is still 123.7MB. Free memory was 49.8MB in the beginning and 40.7MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1390.80ms. Allocated memory is still 123.7MB. Free memory was 40.7MB in the beginning and 60.5MB in the end (delta: -19.8MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. * TraceAbstraction took 21605.32ms. Allocated memory was 123.7MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 60.5MB in the beginning and 1.0GB in the end (delta: -978.5MB). Peak memory consumption was 512.2MB. Max. memory is 16.1GB. * Witness Printer took 156.79ms. Allocated memory is still 1.2GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. 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: 46]: 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L591] COND TRUE ((a8==15) && ((((a3==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 3)) && (a4==1))) && 306 < a23 ) && a29 <= 140 )) [L592] a29 = (((((a29 - 0) % 15)+ 262) + 241270) + -241271) [L593] a25 = 12 [L595] return 24; VAL [\old(input)=3, \result=24, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=3, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, 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)=5, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L320] COND TRUE ((a3==1) && ( ((245 < a29) && (277 >= a29)) && (((a4==1) && ((a8==15) && ((((a25==11) || (a25==12)) || (a25==13)) && (input == 5)))) && 306 < a23 ))) [L321] a29 = (((a29 / 5) / 5) + -580303) [L322] a23 = (((a23 - 600264) + -12) / 5) [L323] a4 = 0 [L324] a25 = 12 [L326] return -1; VAL [\old(input)=5, \result=-1, a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=5, 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)=6, a23=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, 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=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L613] COND FALSE !(( a29 <= 140 && (((a4==1) && ((a8==15) && (((input == 6) && (((a25==10) || (a25==11)) || (a25==12))) && 306 < a23 ))) && (a3==1)))) VAL [\old(input)=6, a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L625] COND FALSE !(((((((a3==1) && ((input == 5) && ((a25==11) || (a25==12)))) && (a4==1)) && 306 < a23 ) && ((140 < a29) && (245 >= a29)) ) && (a8==15))) VAL [\old(input)=6, a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L631] COND FALSE !(((((a4==1) && ( 306 < a23 && ((a8==15) && (((a25==11) || (a25==12)) && (input == 2))))) && ((140 < a29) && (245 >= a29)) ) && (a3==1))) VAL [\old(input)=6, a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L638] COND FALSE !(((((a8==15) && ( a23 <= -43 && (!(a4==1) && ((a25==11) && (input == 5))))) && (a3==1)) && ((245 < a29) && (277 >= a29)) )) VAL [\old(input)=6, a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L645] COND FALSE !((((((((input == 2) && ((a25==9) || (a25==10))) && (a8==15)) && ((140 < a29) && (245 >= a29)) ) && 306 < a23 ) && (a3==1)) && (a4==1))) VAL [\old(input)=6, a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L652] COND FALSE !(((a8==15) && (((( 277 < a29 && ((input == 2) && ((a25==11) || ((a25==9) || (a25==10))))) && (a4==1)) && (a3==1)) && 306 < a23 ))) VAL [\old(input)=6, a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L657] COND FALSE !(((((( ((-43 < a23) && (138 >= a23)) && ((input == 3) && ((a25==12) || ((a25==10) || (a25==11))))) && !(a4==1)) && (a8==15)) && a29 <= 140 ) && (a3==1))) VAL [\old(input)=6, a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L668] COND FALSE !((((!(a4==1) && ((((input == 6) && ((a25==12) || ((a25==10) || (a25==11)))) && (a8==15)) && ((-43 < a23) && (138 >= a23)) )) && (a3==1)) && a29 <= 140 )) VAL [\old(input)=6, a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L673] COND FALSE !(((a25==9) && (( a29 <= 140 && ((a3==1) && (!(a4==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 2))))) && (a8==15)))) VAL [\old(input)=6, a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L680] COND FALSE !((!(a4==1) && ( a23 <= -43 && (((a8==15) && (((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ( ((245 < a29) && (277 >= a29)) && (a25==13))) || ((a25==9) && 277 < a29 )) && (input == 3))) && (a3==1))))) VAL [\old(input)=6, a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L685] COND FALSE !((((!(a4==1) && ((a3==1) && ((input == 5) && ((( ((245 < a29) && (277 >= a29)) && (a25==12)) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ((a25==9) && 277 < a29 ))))) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L691] COND FALSE !(( a23 <= -43 && (!(a4==1) && ( ((245 < a29) && (277 >= a29)) && ((a8==15) && ((a25==11) && ((a3==1) && (input == 3)))))))) VAL [\old(input)=6, a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L698] COND FALSE !(((((a8==15) && ( 306 < a23 && ( ((140 < a29) && (245 >= a29)) && ((input == 1) && ((a25==9) || (a25==10)))))) && (a4==1)) && (a3==1))) VAL [\old(input)=6, a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L704] COND FALSE !((!(a4==1) && (((((a3==1) && ((input == 2) && (((a25==9) || (a25==10)) || (a25==11)))) && ((140 < a29) && (245 >= a29)) ) && a23 <= -43 ) && (a8==15)))) VAL [\old(input)=6, a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L716] COND FALSE !(((((((( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) ))) && (input == 6)) && (a3==1)) && 306 < a23 ) && (a4==1)) && (a8==15))) VAL [\old(input)=6, a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L722] COND FALSE !(( 306 < a23 && ((a8==15) && ( 277 < a29 && ((a4==1) && ((a3==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 5)))))))) VAL [\old(input)=6, a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L727] COND FALSE !(((( 277 < a29 && ((a8==15) && (((input == 6) && a23 <= -43 ) && (a25==13)))) && !(a4==1)) && (a3==1))) VAL [\old(input)=6, a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L741] COND FALSE !(((a3==1) && (((!(a4==1) && ((( ((140 < a29) && (245 >= a29)) && (a25==10)) || (( a29 <= 140 && (a25==13)) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))) && (input == 3))) && ((-43 < a23) && (138 >= a23)) ) && (a8==15)))) VAL [\old(input)=6, a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L748] COND FALSE !(((a3==1) && (( 306 < a23 && (((a4==1) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 1))) && a29 <= 140 )) && (a8==15)))) VAL [\old(input)=6, a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L753] COND FALSE !((((( a23 <= -43 && ((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) ))))) && (a3==1)) && !(a4==1)) && (a8==15))) VAL [\old(input)=6, a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L760] COND FALSE !(((!(a4==1) && (((a8==15) && ( a29 <= 140 && (((a25==10) || (a25==11)) && (input == 5)))) && a23 <= -43 )) && (a3==1))) VAL [\old(input)=6, a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L767] COND FALSE !((((((a8==15) && ((a3==1) && ( a23 <= -43 && (input == 5)))) && !(a4==1)) && (a25==13)) && 277 < a29 )) VAL [\old(input)=6, a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L779] COND FALSE !(((a8==15) && ((a3==1) && ( 306 < a23 && ((((((a25==11) || (a25==12)) || (a25==13)) && (input == 1)) && (a4==1)) && ((245 < a29) && (277 >= a29)) ))))) VAL [\old(input)=6, a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L784] COND TRUE (!(a4==1) && (((((((a25==12) || (a25==13)) && (input == 6)) && (a8==15)) && a23 <= -43 ) && (a3==1)) && a29 <= 140 )) [L785] a23 = (((((a23 % 83)- -241) * 10)/ 9) - 2) [L786] a4 = 1 [L787] a25 = 9 [L789] return -1; VAL [\old(input)=6, \result=-1, a23=202, a25=9, a29=-580293, a3=1, a4=1, 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 calculate_output(input) [L33] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=202, a25=9, a29=-580293, 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=202, a25=9, a29=-580293, 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=202, a25=9, a29=-580293, 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=202, a25=9, a29=-580293, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND TRUE ((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15)) VAL [\old(input)=6, a23=202, a25=9, a29=-580293, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] reach_error() VAL [\old(input)=6, a23=202, a25=9, a29=-580293, a3=1, a4=1, a8=15, input=6, 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: 21.3s, OverallIterations: 21, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 15.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3448 SdHoareTripleChecker+Valid, 13.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3448 mSDsluCounter, 3914 SdHoareTripleChecker+Invalid, 11.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 452 mSDsCounter, 2054 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12283 IncrementalHoareTripleChecker+Invalid, 14337 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2054 mSolverCounterUnsat, 3462 mSDtfsCounter, 12283 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17014occurred in iteration=20, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 15571 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 4724 NumberOfCodeBlocks, 4724 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 4342 ConstructedInterpolants, 0 QuantifiedInterpolants, 9368 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 2598/2598 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-13 12:42:58,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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