./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label28.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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/Problem10_label28.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 bfdec3efb2e3689086e52b498036bfe20677fd5e46edd94f0588e543016085db --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-20 23:38:45,305 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 23:38:45,307 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 23:38:45,338 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 23:38:45,339 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 23:38:45,340 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 23:38:45,342 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 23:38:45,345 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 23:38:45,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 23:38:45,350 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 23:38:45,351 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 23:38:45,352 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 23:38:45,353 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 23:38:45,354 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 23:38:45,355 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 23:38:45,359 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 23:38:45,360 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 23:38:45,361 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 23:38:45,362 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 23:38:45,366 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 23:38:45,367 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 23:38:45,368 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 23:38:45,369 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 23:38:45,369 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 23:38:45,370 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 23:38:45,375 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 23:38:45,376 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 23:38:45,376 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 23:38:45,377 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 23:38:45,377 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 23:38:45,377 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 23:38:45,378 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 23:38:45,379 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 23:38:45,379 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 23:38:45,380 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 23:38:45,381 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 23:38:45,381 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 23:38:45,382 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 23:38:45,382 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 23:38:45,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 23:38:45,383 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 23:38:45,383 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 23:38:45,388 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-20 23:38:45,411 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 23:38:45,412 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 23:38:45,412 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 23:38:45,412 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 23:38:45,413 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 23:38:45,413 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 23:38:45,413 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 23:38:45,414 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 23:38:45,414 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 23:38:45,414 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 23:38:45,414 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 23:38:45,421 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 23:38:45,421 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 23:38:45,421 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 23:38:45,422 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 23:38:45,422 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 23:38:45,422 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 23:38:45,422 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 23:38:45,422 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 23:38:45,422 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 23:38:45,423 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 23:38:45,423 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 23:38:45,423 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 23:38:45,423 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 23:38:45,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 23:38:45,423 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 23:38:45,424 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 23:38:45,424 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 23:38:45,424 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 23:38:45,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 23:38:45,424 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 23:38:45,424 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 23:38:45,425 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 23:38:45,425 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 -> bfdec3efb2e3689086e52b498036bfe20677fd5e46edd94f0588e543016085db [2022-07-20 23:38:45,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 23:38:45,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 23:38:45,702 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 23:38:45,703 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 23:38:45,704 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 23:38:45,705 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label28.c [2022-07-20 23:38:45,755 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5acb8ced0/5e371651354641138efbee5e6d01b98a/FLAGaa657f9ce [2022-07-20 23:38:46,173 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 23:38:46,174 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label28.c [2022-07-20 23:38:46,182 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5acb8ced0/5e371651354641138efbee5e6d01b98a/FLAGaa657f9ce [2022-07-20 23:38:46,191 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5acb8ced0/5e371651354641138efbee5e6d01b98a [2022-07-20 23:38:46,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 23:38:46,193 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 23:38:46,194 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 23:38:46,195 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 23:38:46,197 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 23:38:46,197 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 11:38:46" (1/1) ... [2022-07-20 23:38:46,198 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2169b00e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:38:46, skipping insertion in model container [2022-07-20 23:38:46,198 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 11:38:46" (1/1) ... [2022-07-20 23:38:46,206 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 23:38:46,242 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 23:38:46,392 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/Problem10_label28.c[1526,1539] [2022-07-20 23:38:46,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 23:38:46,555 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 23:38:46,563 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/Problem10_label28.c[1526,1539] [2022-07-20 23:38:46,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 23:38:46,618 INFO L208 MainTranslator]: Completed translation [2022-07-20 23:38:46,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:38:46 WrapperNode [2022-07-20 23:38:46,618 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 23:38:46,619 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 23:38:46,619 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 23:38:46,620 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 23:38:46,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:38:46" (1/1) ... [2022-07-20 23:38:46,639 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:38:46" (1/1) ... [2022-07-20 23:38:46,714 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 597 [2022-07-20 23:38:46,714 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 23:38:46,715 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 23:38:46,715 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 23:38:46,715 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 23:38:46,721 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:38:46" (1/1) ... [2022-07-20 23:38:46,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:38:46" (1/1) ... [2022-07-20 23:38:46,734 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:38:46" (1/1) ... [2022-07-20 23:38:46,734 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:38:46" (1/1) ... [2022-07-20 23:38:46,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:38:46" (1/1) ... [2022-07-20 23:38:46,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:38:46" (1/1) ... [2022-07-20 23:38:46,773 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:38:46" (1/1) ... [2022-07-20 23:38:46,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 23:38:46,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 23:38:46,786 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 23:38:46,786 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 23:38:46,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:38:46" (1/1) ... [2022-07-20 23:38:46,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 23:38:46,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 23:38:46,808 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-20 23:38:46,821 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-20 23:38:46,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 23:38:46,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 23:38:46,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 23:38:46,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 23:38:46,896 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 23:38:46,897 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 23:38:47,611 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 23:38:47,619 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 23:38:47,620 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-20 23:38:47,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 11:38:47 BoogieIcfgContainer [2022-07-20 23:38:47,621 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 23:38:47,623 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 23:38:47,623 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 23:38:47,625 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 23:38:47,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 11:38:46" (1/3) ... [2022-07-20 23:38:47,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c69a929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 11:38:47, skipping insertion in model container [2022-07-20 23:38:47,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:38:46" (2/3) ... [2022-07-20 23:38:47,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c69a929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 11:38:47, skipping insertion in model container [2022-07-20 23:38:47,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 11:38:47" (3/3) ... [2022-07-20 23:38:47,627 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label28.c [2022-07-20 23:38:47,637 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 23:38:47,637 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 23:38:47,677 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 23:38:47,682 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@791a641e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@609f4c46 [2022-07-20 23:38:47,682 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 23:38:47,685 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 0 states have call successors, (0), 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-20 23:38:47,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 23:38:47,689 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 23:38:47,689 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 23:38:47,690 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 23:38:47,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 23:38:47,693 INFO L85 PathProgramCache]: Analyzing trace with hash -988188511, now seen corresponding path program 1 times [2022-07-20 23:38:47,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 23:38:47,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279751762] [2022-07-20 23:38:47,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 23:38:47,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 23:38:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 23:38:47,830 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-20 23:38:47,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 23:38:47,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279751762] [2022-07-20 23:38:47,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279751762] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 23:38:47,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 23:38:47,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 23:38:47,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123861402] [2022-07-20 23:38:47,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 23:38:47,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 23:38:47,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 23:38:47,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 23:38:47,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 23:38:47,864 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 0 states have call successors, (0), 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.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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-20 23:38:48,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 23:38:48,426 INFO L93 Difference]: Finished difference Result 552 states and 966 transitions. [2022-07-20 23:38:48,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 23:38:48,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-07-20 23:38:48,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 23:38:48,435 INFO L225 Difference]: With dead ends: 552 [2022-07-20 23:38:48,436 INFO L226 Difference]: Without dead ends: 282 [2022-07-20 23:38:48,438 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-20 23:38:48,440 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 177 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 23:38:48,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 76 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 23:38:48,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-07-20 23:38:48,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2022-07-20 23:38:48,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.5373665480427046) internal successors, (432), 281 states have internal predecessors, (432), 0 states have call successors, (0), 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-20 23:38:48,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 432 transitions. [2022-07-20 23:38:48,495 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 432 transitions. Word has length 11 [2022-07-20 23:38:48,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 23:38:48,496 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 432 transitions. [2022-07-20 23:38:48,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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-20 23:38:48,496 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 432 transitions. [2022-07-20 23:38:48,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-20 23:38:48,498 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 23:38:48,498 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 23:38:48,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 23:38:48,498 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 23:38:48,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 23:38:48,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1081014105, now seen corresponding path program 1 times [2022-07-20 23:38:48,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 23:38:48,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6589419] [2022-07-20 23:38:48,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 23:38:48,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 23:38:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 23:38:48,633 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 23:38:48,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 23:38:48,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6589419] [2022-07-20 23:38:48,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6589419] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 23:38:48,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 23:38:48,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 23:38:48,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410574549] [2022-07-20 23:38:48,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 23:38:48,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 23:38:48,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 23:38:48,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 23:38:48,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 23:38:48,638 INFO L87 Difference]: Start difference. First operand 282 states and 432 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 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-20 23:38:49,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 23:38:49,000 INFO L93 Difference]: Finished difference Result 701 states and 1076 transitions. [2022-07-20 23:38:49,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 23:38:49,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2022-07-20 23:38:49,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 23:38:49,003 INFO L225 Difference]: With dead ends: 701 [2022-07-20 23:38:49,003 INFO L226 Difference]: Without dead ends: 421 [2022-07-20 23:38:49,004 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-20 23:38:49,004 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 73 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 23:38:49,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 52 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 23:38:49,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2022-07-20 23:38:49,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2022-07-20 23:38:49,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.4428571428571428) internal successors, (606), 420 states have internal predecessors, (606), 0 states have call successors, (0), 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-20 23:38:49,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 606 transitions. [2022-07-20 23:38:49,025 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 606 transitions. Word has length 80 [2022-07-20 23:38:49,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 23:38:49,025 INFO L495 AbstractCegarLoop]: Abstraction has 421 states and 606 transitions. [2022-07-20 23:38:49,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 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-20 23:38:49,026 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 606 transitions. [2022-07-20 23:38:49,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-20 23:38:49,027 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 23:38:49,027 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 23:38:49,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 23:38:49,028 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 23:38:49,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 23:38:49,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1549752968, now seen corresponding path program 1 times [2022-07-20 23:38:49,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 23:38:49,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495663237] [2022-07-20 23:38:49,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 23:38:49,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 23:38:49,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 23:38:49,103 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 23:38:49,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 23:38:49,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495663237] [2022-07-20 23:38:49,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495663237] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 23:38:49,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 23:38:49,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 23:38:49,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087945855] [2022-07-20 23:38:49,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 23:38:49,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 23:38:49,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 23:38:49,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 23:38:49,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 23:38:49,106 INFO L87 Difference]: Start difference. First operand 421 states and 606 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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-20 23:38:49,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 23:38:49,500 INFO L93 Difference]: Finished difference Result 562 states and 822 transitions. [2022-07-20 23:38:49,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 23:38:49,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2022-07-20 23:38:49,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 23:38:49,504 INFO L225 Difference]: With dead ends: 562 [2022-07-20 23:38:49,504 INFO L226 Difference]: Without dead ends: 560 [2022-07-20 23:38:49,504 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-20 23:38:49,505 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 173 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 23:38:49,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 11 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 23:38:49,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2022-07-20 23:38:49,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 421. [2022-07-20 23:38:49,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.4428571428571428) internal successors, (606), 420 states have internal predecessors, (606), 0 states have call successors, (0), 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-20 23:38:49,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 606 transitions. [2022-07-20 23:38:49,527 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 606 transitions. Word has length 86 [2022-07-20 23:38:49,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 23:38:49,527 INFO L495 AbstractCegarLoop]: Abstraction has 421 states and 606 transitions. [2022-07-20 23:38:49,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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-20 23:38:49,528 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 606 transitions. [2022-07-20 23:38:49,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-20 23:38:49,529 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 23:38:49,529 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 23:38:49,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 23:38:49,529 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 23:38:49,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 23:38:49,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1254754554, now seen corresponding path program 1 times [2022-07-20 23:38:49,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 23:38:49,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051749328] [2022-07-20 23:38:49,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 23:38:49,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 23:38:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 23:38:49,629 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 23:38:49,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 23:38:49,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051749328] [2022-07-20 23:38:49,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051749328] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 23:38:49,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 23:38:49,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 23:38:49,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555334424] [2022-07-20 23:38:49,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 23:38:49,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 23:38:49,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 23:38:49,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 23:38:49,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 23:38:49,631 INFO L87 Difference]: Start difference. First operand 421 states and 606 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 23:38:49,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 23:38:49,956 INFO L93 Difference]: Finished difference Result 1118 states and 1639 transitions. [2022-07-20 23:38:49,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 23:38:49,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-07-20 23:38:49,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 23:38:49,959 INFO L225 Difference]: With dead ends: 1118 [2022-07-20 23:38:49,959 INFO L226 Difference]: Without dead ends: 699 [2022-07-20 23:38:49,959 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-20 23:38:49,960 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 51 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 23:38:49,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 77 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 23:38:49,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-07-20 23:38:49,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 560. [2022-07-20 23:38:49,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.3237924865831843) internal successors, (740), 559 states have internal predecessors, (740), 0 states have call successors, (0), 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-20 23:38:49,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 740 transitions. [2022-07-20 23:38:49,974 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 740 transitions. Word has length 105 [2022-07-20 23:38:49,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 23:38:49,975 INFO L495 AbstractCegarLoop]: Abstraction has 560 states and 740 transitions. [2022-07-20 23:38:49,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 23:38:49,976 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 740 transitions. [2022-07-20 23:38:49,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-20 23:38:49,985 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 23:38:49,985 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 23:38:49,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 23:38:49,985 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 23:38:49,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 23:38:49,987 INFO L85 PathProgramCache]: Analyzing trace with hash -645966282, now seen corresponding path program 1 times [2022-07-20 23:38:49,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 23:38:49,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211771220] [2022-07-20 23:38:49,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 23:38:49,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 23:38:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 23:38:50,120 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 23:38:50,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 23:38:50,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211771220] [2022-07-20 23:38:50,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211771220] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 23:38:50,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 23:38:50,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 23:38:50,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151326202] [2022-07-20 23:38:50,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 23:38:50,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 23:38:50,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 23:38:50,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 23:38:50,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 23:38:50,125 INFO L87 Difference]: Start difference. First operand 560 states and 740 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 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-20 23:38:50,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 23:38:50,509 INFO L93 Difference]: Finished difference Result 990 states and 1340 transitions. [2022-07-20 23:38:50,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 23:38:50,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 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 129 [2022-07-20 23:38:50,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 23:38:50,513 INFO L225 Difference]: With dead ends: 990 [2022-07-20 23:38:50,514 INFO L226 Difference]: Without dead ends: 571 [2022-07-20 23:38:50,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 23:38:50,515 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 90 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 23:38:50,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 92 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 23:38:50,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-07-20 23:38:50,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 560. [2022-07-20 23:38:50,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.3148479427549196) internal successors, (735), 559 states have internal predecessors, (735), 0 states have call successors, (0), 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-20 23:38:50,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 735 transitions. [2022-07-20 23:38:50,523 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 735 transitions. Word has length 129 [2022-07-20 23:38:50,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 23:38:50,524 INFO L495 AbstractCegarLoop]: Abstraction has 560 states and 735 transitions. [2022-07-20 23:38:50,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 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-20 23:38:50,524 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 735 transitions. [2022-07-20 23:38:50,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-07-20 23:38:50,525 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 23:38:50,525 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 23:38:50,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 23:38:50,526 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 23:38:50,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 23:38:50,526 INFO L85 PathProgramCache]: Analyzing trace with hash -623288027, now seen corresponding path program 1 times [2022-07-20 23:38:50,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 23:38:50,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411858878] [2022-07-20 23:38:50,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 23:38:50,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 23:38:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 23:38:50,606 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-20 23:38:50,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 23:38:50,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411858878] [2022-07-20 23:38:50,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411858878] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 23:38:50,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 23:38:50,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 23:38:50,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084014929] [2022-07-20 23:38:50,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 23:38:50,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 23:38:50,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 23:38:50,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 23:38:50,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 23:38:50,609 INFO L87 Difference]: Start difference. First operand 560 states and 735 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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-20 23:38:50,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 23:38:50,980 INFO L93 Difference]: Finished difference Result 1257 states and 1753 transitions. [2022-07-20 23:38:50,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 23:38:50,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 155 [2022-07-20 23:38:50,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 23:38:50,987 INFO L225 Difference]: With dead ends: 1257 [2022-07-20 23:38:50,987 INFO L226 Difference]: Without dead ends: 838 [2022-07-20 23:38:50,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-20 23:38:50,989 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 87 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 23:38:50,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 19 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 23:38:50,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2022-07-20 23:38:50,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2022-07-20 23:38:50,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.3667861409796893) internal successors, (1144), 837 states have internal predecessors, (1144), 0 states have call successors, (0), 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-20 23:38:51,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1144 transitions. [2022-07-20 23:38:51,001 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1144 transitions. Word has length 155 [2022-07-20 23:38:51,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 23:38:51,001 INFO L495 AbstractCegarLoop]: Abstraction has 838 states and 1144 transitions. [2022-07-20 23:38:51,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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-20 23:38:51,002 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1144 transitions. [2022-07-20 23:38:51,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-20 23:38:51,003 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 23:38:51,003 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 23:38:51,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 23:38:51,003 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 23:38:51,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 23:38:51,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1821181619, now seen corresponding path program 1 times [2022-07-20 23:38:51,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 23:38:51,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951947213] [2022-07-20 23:38:51,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 23:38:51,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 23:38:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 23:38:51,076 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-20 23:38:51,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 23:38:51,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951947213] [2022-07-20 23:38:51,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951947213] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 23:38:51,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 23:38:51,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 23:38:51,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20465669] [2022-07-20 23:38:51,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 23:38:51,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 23:38:51,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 23:38:51,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 23:38:51,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 23:38:51,079 INFO L87 Difference]: Start difference. First operand 838 states and 1144 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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-20 23:38:51,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 23:38:51,415 INFO L93 Difference]: Finished difference Result 1813 states and 2551 transitions. [2022-07-20 23:38:51,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 23:38:51,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 171 [2022-07-20 23:38:51,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 23:38:51,418 INFO L225 Difference]: With dead ends: 1813 [2022-07-20 23:38:51,418 INFO L226 Difference]: Without dead ends: 1116 [2022-07-20 23:38:51,419 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-20 23:38:51,420 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 52 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 23:38:51,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 213 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 23:38:51,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2022-07-20 23:38:51,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1116. [2022-07-20 23:38:51,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1115 states have (on average 1.294170403587444) internal successors, (1443), 1115 states have internal predecessors, (1443), 0 states have call successors, (0), 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-20 23:38:51,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1443 transitions. [2022-07-20 23:38:51,433 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1443 transitions. Word has length 171 [2022-07-20 23:38:51,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 23:38:51,434 INFO L495 AbstractCegarLoop]: Abstraction has 1116 states and 1443 transitions. [2022-07-20 23:38:51,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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-20 23:38:51,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1443 transitions. [2022-07-20 23:38:51,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-07-20 23:38:51,435 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 23:38:51,435 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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-20 23:38:51,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 23:38:51,435 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 23:38:51,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 23:38:51,436 INFO L85 PathProgramCache]: Analyzing trace with hash 992881825, now seen corresponding path program 1 times [2022-07-20 23:38:51,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 23:38:51,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177611693] [2022-07-20 23:38:51,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 23:38:51,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 23:38:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 23:38:51,565 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 23:38:51,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 23:38:51,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177611693] [2022-07-20 23:38:51,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177611693] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 23:38:51,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 23:38:51,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 23:38:51,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080291989] [2022-07-20 23:38:51,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 23:38:51,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 23:38:51,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 23:38:51,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 23:38:51,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-20 23:38:51,568 INFO L87 Difference]: Start difference. First operand 1116 states and 1443 transitions. Second operand has 7 states, 7 states have (on average 25.714285714285715) internal successors, (180), 6 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 23:38:51,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 23:38:51,935 INFO L93 Difference]: Finished difference Result 2146 states and 2795 transitions. [2022-07-20 23:38:51,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 23:38:51,936 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.714285714285715) internal successors, (180), 6 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 180 [2022-07-20 23:38:51,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 23:38:51,939 INFO L225 Difference]: With dead ends: 2146 [2022-07-20 23:38:51,939 INFO L226 Difference]: Without dead ends: 1116 [2022-07-20 23:38:51,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-20 23:38:51,941 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 198 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 23:38:51,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 22 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 23:38:51,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2022-07-20 23:38:51,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1116. [2022-07-20 23:38:51,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1115 states have (on average 1.2887892376681613) internal successors, (1437), 1115 states have internal predecessors, (1437), 0 states have call successors, (0), 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-20 23:38:51,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1437 transitions. [2022-07-20 23:38:51,957 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1437 transitions. Word has length 180 [2022-07-20 23:38:51,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 23:38:51,958 INFO L495 AbstractCegarLoop]: Abstraction has 1116 states and 1437 transitions. [2022-07-20 23:38:51,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.714285714285715) internal successors, (180), 6 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 23:38:51,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1437 transitions. [2022-07-20 23:38:51,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-07-20 23:38:51,960 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 23:38:51,960 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-20 23:38:51,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 23:38:51,965 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 23:38:51,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 23:38:51,965 INFO L85 PathProgramCache]: Analyzing trace with hash -646217157, now seen corresponding path program 1 times [2022-07-20 23:38:51,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 23:38:51,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088188279] [2022-07-20 23:38:51,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 23:38:51,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 23:38:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 23:38:52,050 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 23:38:52,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 23:38:52,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088188279] [2022-07-20 23:38:52,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088188279] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 23:38:52,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 23:38:52,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 23:38:52,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468800244] [2022-07-20 23:38:52,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 23:38:52,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 23:38:52,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 23:38:52,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 23:38:52,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 23:38:52,053 INFO L87 Difference]: Start difference. First operand 1116 states and 1437 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 23:38:52,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 23:38:52,401 INFO L93 Difference]: Finished difference Result 2369 states and 3136 transitions. [2022-07-20 23:38:52,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 23:38:52,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 216 [2022-07-20 23:38:52,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 23:38:52,419 INFO L225 Difference]: With dead ends: 2369 [2022-07-20 23:38:52,419 INFO L226 Difference]: Without dead ends: 1394 [2022-07-20 23:38:52,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-20 23:38:52,421 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 73 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 23:38:52,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 15 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 23:38:52,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2022-07-20 23:38:52,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1394. [2022-07-20 23:38:52,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1393 states have (on average 1.3094041636755205) internal successors, (1824), 1393 states have internal predecessors, (1824), 0 states have call successors, (0), 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-20 23:38:52,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1824 transitions. [2022-07-20 23:38:52,446 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1824 transitions. Word has length 216 [2022-07-20 23:38:52,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 23:38:52,459 INFO L495 AbstractCegarLoop]: Abstraction has 1394 states and 1824 transitions. [2022-07-20 23:38:52,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 23:38:52,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1824 transitions. [2022-07-20 23:38:52,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2022-07-20 23:38:52,462 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 23:38:52,462 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-20 23:38:52,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 23:38:52,462 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 23:38:52,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 23:38:52,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1844433973, now seen corresponding path program 1 times [2022-07-20 23:38:52,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 23:38:52,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179792453] [2022-07-20 23:38:52,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 23:38:52,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 23:38:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 23:38:52,566 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-07-20 23:38:52,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 23:38:52,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179792453] [2022-07-20 23:38:52,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179792453] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 23:38:52,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 23:38:52,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 23:38:52,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569349884] [2022-07-20 23:38:52,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 23:38:52,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 23:38:52,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 23:38:52,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 23:38:52,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 23:38:52,571 INFO L87 Difference]: Start difference. First operand 1394 states and 1824 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 23:38:52,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 23:38:52,914 INFO L93 Difference]: Finished difference Result 2786 states and 3661 transitions. [2022-07-20 23:38:52,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 23:38:52,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 237 [2022-07-20 23:38:52,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 23:38:52,918 INFO L225 Difference]: With dead ends: 2786 [2022-07-20 23:38:52,918 INFO L226 Difference]: Without dead ends: 1116 [2022-07-20 23:38:52,919 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-20 23:38:52,920 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 131 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 23:38:52,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 225 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 23:38:52,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2022-07-20 23:38:52,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1116. [2022-07-20 23:38:52,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1115 states have (on average 1.2547085201793722) internal successors, (1399), 1115 states have internal predecessors, (1399), 0 states have call successors, (0), 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-20 23:38:52,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1399 transitions. [2022-07-20 23:38:52,935 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1399 transitions. Word has length 237 [2022-07-20 23:38:52,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 23:38:52,935 INFO L495 AbstractCegarLoop]: Abstraction has 1116 states and 1399 transitions. [2022-07-20 23:38:52,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 23:38:52,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1399 transitions. [2022-07-20 23:38:52,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2022-07-20 23:38:52,937 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 23:38:52,937 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-20 23:38:52,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 23:38:52,938 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 23:38:52,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 23:38:52,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1025371890, now seen corresponding path program 1 times [2022-07-20 23:38:52,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 23:38:52,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943118784] [2022-07-20 23:38:52,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 23:38:52,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 23:38:52,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 23:38:53,046 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 32 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 23:38:53,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 23:38:53,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943118784] [2022-07-20 23:38:53,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943118784] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 23:38:53,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257837329] [2022-07-20 23:38:53,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 23:38:53,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 23:38:53,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 23:38:53,048 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 23:38:53,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-20 23:38:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 23:38:53,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 23:38:53,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 23:38:53,428 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-07-20 23:38:53,428 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 23:38:53,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257837329] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 23:38:53,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 23:38:53,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-07-20 23:38:53,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111269022] [2022-07-20 23:38:53,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 23:38:53,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 23:38:53,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 23:38:53,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 23:38:53,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-20 23:38:53,431 INFO L87 Difference]: Start difference. First operand 1116 states and 1399 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 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-20 23:38:53,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 23:38:53,750 INFO L93 Difference]: Finished difference Result 2369 states and 3006 transitions. [2022-07-20 23:38:53,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 23:38:53,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 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 238 [2022-07-20 23:38:53,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 23:38:53,754 INFO L225 Difference]: With dead ends: 2369 [2022-07-20 23:38:53,754 INFO L226 Difference]: Without dead ends: 1394 [2022-07-20 23:38:53,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-20 23:38:53,755 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 60 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 23:38:53,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 32 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 23:38:53,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2022-07-20 23:38:53,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1394. [2022-07-20 23:38:53,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1393 states have (on average 1.1844938980617372) internal successors, (1650), 1393 states have internal predecessors, (1650), 0 states have call successors, (0), 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-20 23:38:53,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1650 transitions. [2022-07-20 23:38:53,772 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1650 transitions. Word has length 238 [2022-07-20 23:38:53,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 23:38:53,773 INFO L495 AbstractCegarLoop]: Abstraction has 1394 states and 1650 transitions. [2022-07-20 23:38:53,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 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-20 23:38:53,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1650 transitions. [2022-07-20 23:38:53,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2022-07-20 23:38:53,775 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 23:38:53,775 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 23:38:53,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-20 23:38:53,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-20 23:38:53,996 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 23:38:53,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 23:38:53,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1847952940, now seen corresponding path program 1 times [2022-07-20 23:38:53,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 23:38:53,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99353983] [2022-07-20 23:38:53,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 23:38:53,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 23:38:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 23:38:54,082 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2022-07-20 23:38:54,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 23:38:54,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99353983] [2022-07-20 23:38:54,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99353983] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 23:38:54,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 23:38:54,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 23:38:54,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015158236] [2022-07-20 23:38:54,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 23:38:54,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 23:38:54,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 23:38:54,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 23:38:54,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 23:38:54,084 INFO L87 Difference]: Start difference. First operand 1394 states and 1650 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-20 23:38:54,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 23:38:54,376 INFO L93 Difference]: Finished difference Result 2647 states and 3155 transitions. [2022-07-20 23:38:54,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 23:38:54,376 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 283 [2022-07-20 23:38:54,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 23:38:54,380 INFO L225 Difference]: With dead ends: 2647 [2022-07-20 23:38:54,380 INFO L226 Difference]: Without dead ends: 1394 [2022-07-20 23:38:54,381 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-20 23:38:54,382 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 144 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 23:38:54,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 189 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 23:38:54,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2022-07-20 23:38:54,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1255. [2022-07-20 23:38:54,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.1451355661881977) internal successors, (1436), 1254 states have internal predecessors, (1436), 0 states have call successors, (0), 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-20 23:38:54,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1436 transitions. [2022-07-20 23:38:54,397 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1436 transitions. Word has length 283 [2022-07-20 23:38:54,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 23:38:54,397 INFO L495 AbstractCegarLoop]: Abstraction has 1255 states and 1436 transitions. [2022-07-20 23:38:54,398 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-20 23:38:54,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1436 transitions. [2022-07-20 23:38:54,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2022-07-20 23:38:54,400 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 23:38:54,400 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-20 23:38:54,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 23:38:54,401 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 23:38:54,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 23:38:54,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1432200997, now seen corresponding path program 1 times [2022-07-20 23:38:54,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 23:38:54,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804393278] [2022-07-20 23:38:54,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 23:38:54,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 23:38:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 23:38:54,493 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-07-20 23:38:54,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 23:38:54,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804393278] [2022-07-20 23:38:54,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804393278] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 23:38:54,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 23:38:54,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 23:38:54,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828891627] [2022-07-20 23:38:54,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 23:38:54,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 23:38:54,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 23:38:54,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 23:38:54,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 23:38:54,496 INFO L87 Difference]: Start difference. First operand 1255 states and 1436 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-20 23:38:54,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 23:38:54,831 INFO L93 Difference]: Finished difference Result 3342 states and 3859 transitions. [2022-07-20 23:38:54,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 23:38:54,832 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 289 [2022-07-20 23:38:54,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 23:38:54,837 INFO L225 Difference]: With dead ends: 3342 [2022-07-20 23:38:54,837 INFO L226 Difference]: Without dead ends: 2228 [2022-07-20 23:38:54,838 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-20 23:38:54,839 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 135 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 23:38:54,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 193 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 23:38:54,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2022-07-20 23:38:54,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 1811. [2022-07-20 23:38:54,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1810 states have (on average 1.1585635359116022) internal successors, (2097), 1810 states have internal predecessors, (2097), 0 states have call successors, (0), 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-20 23:38:54,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2097 transitions. [2022-07-20 23:38:54,869 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2097 transitions. Word has length 289 [2022-07-20 23:38:54,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 23:38:54,869 INFO L495 AbstractCegarLoop]: Abstraction has 1811 states and 2097 transitions. [2022-07-20 23:38:54,869 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-20 23:38:54,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2097 transitions. [2022-07-20 23:38:54,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2022-07-20 23:38:54,872 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 23:38:54,872 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 23:38:54,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 23:38:54,873 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 23:38:54,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 23:38:54,873 INFO L85 PathProgramCache]: Analyzing trace with hash -490183734, now seen corresponding path program 1 times [2022-07-20 23:38:54,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 23:38:54,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976029174] [2022-07-20 23:38:54,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 23:38:54,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 23:38:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 23:38:54,959 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-07-20 23:38:54,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 23:38:54,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976029174] [2022-07-20 23:38:54,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976029174] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 23:38:54,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 23:38:54,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 23:38:54,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236974094] [2022-07-20 23:38:54,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 23:38:54,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 23:38:54,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 23:38:54,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 23:38:54,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 23:38:54,961 INFO L87 Difference]: Start difference. First operand 1811 states and 2097 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 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-20 23:38:55,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 23:38:55,276 INFO L93 Difference]: Finished difference Result 4315 states and 5012 transitions. [2022-07-20 23:38:55,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 23:38:55,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 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 306 [2022-07-20 23:38:55,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 23:38:55,283 INFO L225 Difference]: With dead ends: 4315 [2022-07-20 23:38:55,283 INFO L226 Difference]: Without dead ends: 2645 [2022-07-20 23:38:55,285 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-20 23:38:55,285 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 27 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 23:38:55,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 202 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 23:38:55,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2645 states. [2022-07-20 23:38:55,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2645 to 2645. [2022-07-20 23:38:55,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2645 states, 2644 states have (on average 1.1399394856278366) internal successors, (3014), 2644 states have internal predecessors, (3014), 0 states have call successors, (0), 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-20 23:38:55,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 3014 transitions. [2022-07-20 23:38:55,321 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 3014 transitions. Word has length 306 [2022-07-20 23:38:55,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 23:38:55,322 INFO L495 AbstractCegarLoop]: Abstraction has 2645 states and 3014 transitions. [2022-07-20 23:38:55,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 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-20 23:38:55,322 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 3014 transitions. [2022-07-20 23:38:55,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2022-07-20 23:38:55,326 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 23:38:55,326 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-20 23:38:55,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 23:38:55,327 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 23:38:55,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 23:38:55,327 INFO L85 PathProgramCache]: Analyzing trace with hash -2098557402, now seen corresponding path program 1 times [2022-07-20 23:38:55,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 23:38:55,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292432984] [2022-07-20 23:38:55,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 23:38:55,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 23:38:55,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 23:38:55,387 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-20 23:38:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 23:38:55,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-20 23:38:55,501 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-20 23:38:55,502 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-20 23:38:55,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 23:38:55,505 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 23:38:55,507 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-20 23:38:55,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 11:38:55 BoogieIcfgContainer [2022-07-20 23:38:55,592 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-20 23:38:55,592 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-20 23:38:55,593 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-20 23:38:55,593 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-20 23:38:55,593 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 11:38:47" (3/4) ... [2022-07-20 23:38:55,594 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-20 23:38:55,664 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-20 23:38:55,665 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-20 23:38:55,665 INFO L158 Benchmark]: Toolchain (without parser) took 9471.70ms. Allocated memory was 54.5MB in the beginning and 207.6MB in the end (delta: 153.1MB). Free memory was 30.0MB in the beginning and 123.4MB in the end (delta: -93.4MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. [2022-07-20 23:38:55,665 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 54.5MB. Free memory is still 36.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 23:38:55,666 INFO L158 Benchmark]: CACSL2BoogieTranslator took 424.26ms. Allocated memory was 54.5MB in the beginning and 75.5MB in the end (delta: 21.0MB). Free memory was 29.7MB in the beginning and 42.5MB in the end (delta: -12.7MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2022-07-20 23:38:55,666 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.38ms. Allocated memory is still 75.5MB. Free memory was 42.5MB in the beginning and 53.8MB in the end (delta: -11.4MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2022-07-20 23:38:55,666 INFO L158 Benchmark]: Boogie Preprocessor took 69.79ms. Allocated memory is still 75.5MB. Free memory was 53.8MB in the beginning and 48.9MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-20 23:38:55,666 INFO L158 Benchmark]: RCFGBuilder took 836.03ms. Allocated memory was 75.5MB in the beginning and 96.5MB in the end (delta: 21.0MB). Free memory was 48.9MB in the beginning and 67.9MB in the end (delta: -19.0MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2022-07-20 23:38:55,667 INFO L158 Benchmark]: TraceAbstraction took 7969.39ms. Allocated memory was 96.5MB in the beginning and 207.6MB in the end (delta: 111.1MB). Free memory was 67.4MB in the beginning and 145.0MB in the end (delta: -77.6MB). Peak memory consumption was 122.3MB. Max. memory is 16.1GB. [2022-07-20 23:38:55,667 INFO L158 Benchmark]: Witness Printer took 72.31ms. Allocated memory is still 207.6MB. Free memory was 145.0MB in the beginning and 123.4MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-07-20 23:38:55,668 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.19ms. Allocated memory is still 54.5MB. Free memory is still 36.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 424.26ms. Allocated memory was 54.5MB in the beginning and 75.5MB in the end (delta: 21.0MB). Free memory was 29.7MB in the beginning and 42.5MB in the end (delta: -12.7MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.38ms. Allocated memory is still 75.5MB. Free memory was 42.5MB in the beginning and 53.8MB in the end (delta: -11.4MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.79ms. Allocated memory is still 75.5MB. Free memory was 53.8MB in the beginning and 48.9MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 836.03ms. Allocated memory was 75.5MB in the beginning and 96.5MB in the end (delta: 21.0MB). Free memory was 48.9MB in the beginning and 67.9MB in the end (delta: -19.0MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7969.39ms. Allocated memory was 96.5MB in the beginning and 207.6MB in the end (delta: 111.1MB). Free memory was 67.4MB in the beginning and 145.0MB in the end (delta: -77.6MB). Peak memory consumption was 122.3MB. Max. memory is 16.1GB. * Witness Printer took 72.31ms. Allocated memory is still 207.6MB. Free memory was 145.0MB in the beginning and 123.4MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 47]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int inputC = 3; [L18] int inputD = 4; [L19] int inputE = 5; [L20] int inputF = 6; [L21] int inputB = 2; [L24] int a1 = 23; [L25] int a19 = 9; [L26] int a10 = 0; [L27] int a12 = 0; [L28] int a4 = 14; VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L589] int output = -1; VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L600] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L281] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L287] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L293] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L322] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L336] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L355] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L361] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L364] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L367] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L380] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L385] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L393] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L413] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L429] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) VAL [\old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L435] COND TRUE ((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)) [L436] a1 = ((((a1 / 5) * 5) / 5) + 505228) [L437] a10 = 1 [L439] return 25; VAL [\old(input)=3, \result=25, a1=505232, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] RET, EXPR calculate_output(input) [L600] output = calculate_output(input) [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L600] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L281] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L287] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L293] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [\old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND TRUE ((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 ))) [L297] a1 = ((((((a1 % 89)+ 74) - -21) * 5) % 89)- -118) [L298] a19 = 10 [L300] return 25; VAL [\old(input)=2, \result=25, a1=132, a10=1, a12=0, a19=10, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] RET, EXPR calculate_output(input) [L600] output = calculate_output(input) [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L600] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L281] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L287] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L293] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L322] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L336] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L355] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L361] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L364] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L367] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L380] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L385] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L393] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L413] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L429] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L435] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L440] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L446] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L452] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L458] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) VAL [\old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L464] COND TRUE (((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1)) [L465] a1 = ((((a1 + 381077) % 25)- -1) / 5) [L466] a10 = 2 [L467] a19 = 7 [L469] return -1; VAL [\old(input)=5, \result=-1, a1=2, a10=2, a12=0, a19=7, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] RET, EXPR calculate_output(input) [L600] output = calculate_output(input) [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L600] CALL calculate_output(input) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a1=2, a10=2, a12=0, a19=7, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a1=2, a10=2, a12=0, a19=7, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a1=2, a10=2, a12=0, a19=7, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a1=2, a10=2, a12=0, a19=7, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a1=2, a10=2, a12=0, a19=7, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND TRUE (((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)) VAL [\old(input)=6, a1=2, a10=2, a12=0, a19=7, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] reach_error() VAL [\old(input)=6, a1=2, a10=2, a12=0, a19=7, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1471 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1471 mSDsluCounter, 1418 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 75 mSDsCounter, 971 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5575 IncrementalHoareTripleChecker+Invalid, 6546 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 971 mSolverCounterUnsat, 1343 mSDtfsCounter, 5575 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 285 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2645occurred in iteration=14, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 845 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 3043 NumberOfCodeBlocks, 3043 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2709 ConstructedInterpolants, 0 QuantifiedInterpolants, 10768 SizeOfPredicates, 0 NumberOfNonLiveVariables, 354 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 1481/1576 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-20 23:38:55,693 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