/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml -i ../sv-benchmarks/c/eca-rers2012/Problem10_label58.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 22:15:02,888 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 22:15:02,890 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 22:15:02,916 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 22:15:02,917 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 22:15:02,917 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 22:15:02,918 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 22:15:02,919 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 22:15:02,920 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 22:15:02,921 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 22:15:02,921 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 22:15:02,922 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 22:15:02,922 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 22:15:02,923 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 22:15:02,923 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 22:15:02,924 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 22:15:02,925 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 22:15:02,925 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 22:15:02,926 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 22:15:02,927 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 22:15:02,928 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 22:15:02,928 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 22:15:02,929 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 22:15:02,929 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 22:15:02,931 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 22:15:02,932 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 22:15:02,932 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 22:15:02,932 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 22:15:02,932 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 22:15:02,933 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 22:15:02,933 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 22:15:02,934 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 22:15:02,934 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 22:15:02,934 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 22:15:02,935 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 22:15:02,935 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 22:15:02,936 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 22:15:02,936 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 22:15:02,936 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 22:15:02,936 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 22:15:02,937 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 22:15:02,937 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-04-01 22:15:02,949 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 22:15:02,949 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 22:15:02,949 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 22:15:02,949 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 22:15:02,950 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 22:15:02,950 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 22:15:02,950 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-04-01 22:15:02,950 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-04-01 22:15:02,951 INFO L138 SettingsManager]: * Use SBE=true [2023-04-01 22:15:02,951 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 22:15:02,951 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 22:15:02,951 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 22:15:02,951 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 22:15:02,951 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 22:15:02,951 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 22:15:02,951 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 22:15:02,951 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 22:15:02,952 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 22:15:02,952 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 22:15:02,952 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 22:15:02,952 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 22:15:02,952 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 22:15:02,952 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-04-01 22:15:02,952 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 22:15:02,952 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 22:15:02,952 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 22:15:02,952 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 22:15:02,952 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 22:15:02,953 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-04-01 22:15:02,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 22:15:02,953 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-04-01 22:15:02,953 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 22:15:02,953 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-04-01 22:15:02,953 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-04-01 22:15:02,953 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-04-01 22:15:02,953 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2023-04-01 22:15:03,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 22:15:03,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 22:15:03,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 22:15:03,179 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 22:15:03,180 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 22:15:03,180 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label58.c [2023-04-01 22:15:04,281 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 22:15:04,513 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 22:15:04,513 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label58.c [2023-04-01 22:15:04,520 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea802b2af/06b0be07ba7d4a828e3210f1ac5b747b/FLAGdb6896332 [2023-04-01 22:15:04,532 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea802b2af/06b0be07ba7d4a828e3210f1ac5b747b [2023-04-01 22:15:04,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 22:15:04,535 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 22:15:04,536 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 22:15:04,536 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 22:15:04,538 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 22:15:04,539 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 10:15:04" (1/1) ... [2023-04-01 22:15:04,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40165908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:15:04, skipping insertion in model container [2023-04-01 22:15:04,539 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 10:15:04" (1/1) ... [2023-04-01 22:15:04,544 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 22:15:04,579 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 22:15:04,693 WARN L247 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_label58.c[1743,1756] [2023-04-01 22:15:04,835 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 22:15:04,841 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 22:15:04,850 WARN L247 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_label58.c[1743,1756] [2023-04-01 22:15:04,891 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 22:15:04,900 INFO L208 MainTranslator]: Completed translation [2023-04-01 22:15:04,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:15:04 WrapperNode [2023-04-01 22:15:04,900 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 22:15:04,901 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 22:15:04,901 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 22:15:04,901 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 22:15:04,908 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:15:04" (1/1) ... [2023-04-01 22:15:04,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:15:04" (1/1) ... [2023-04-01 22:15:04,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:15:04" (1/1) ... [2023-04-01 22:15:04,919 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:15:04" (1/1) ... [2023-04-01 22:15:04,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:15:04" (1/1) ... [2023-04-01 22:15:04,943 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:15:04" (1/1) ... [2023-04-01 22:15:04,946 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:15:04" (1/1) ... [2023-04-01 22:15:04,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:15:04" (1/1) ... [2023-04-01 22:15:04,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 22:15:04,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 22:15:04,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 22:15:04,952 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 22:15:04,952 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:15:04" (1/1) ... [2023-04-01 22:15:04,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 22:15:04,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 22:15:04,974 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) [2023-04-01 22:15:04,978 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 [2023-04-01 22:15:05,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 22:15:05,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 22:15:05,013 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 22:15:05,013 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2023-04-01 22:15:05,013 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 22:15:05,013 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2023-04-01 22:15:05,013 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 22:15:05,013 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 22:15:05,013 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 22:15:05,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 22:15:05,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-01 22:15:05,014 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2023-04-01 22:15:05,014 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 22:15:05,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 22:15:05,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 22:15:05,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 22:15:05,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 22:15:05,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 22:15:05,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 22:15:05,104 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 22:15:05,105 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 22:15:05,905 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 22:15:05,914 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 22:15:05,914 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-04-01 22:15:05,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 10:15:05 BoogieIcfgContainer [2023-04-01 22:15:05,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 22:15:05,919 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 22:15:05,919 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 22:15:05,921 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 22:15:05,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 10:15:04" (1/3) ... [2023-04-01 22:15:05,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e1edcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 10:15:05, skipping insertion in model container [2023-04-01 22:15:05,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:15:04" (2/3) ... [2023-04-01 22:15:05,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e1edcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 10:15:05, skipping insertion in model container [2023-04-01 22:15:05,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 10:15:05" (3/3) ... [2023-04-01 22:15:05,922 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label58.c [2023-04-01 22:15:05,933 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 22:15:05,933 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 22:15:05,974 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 22:15:05,979 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5bca6bfe, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-04-01 22:15:05,979 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 22:15:05,985 INFO L276 IsEmpty]: Start isEmpty. Operand has 215 states, 207 states have (on average 1.6763285024154588) internal successors, (347), 208 states have internal predecessors, (347), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 22:15:05,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-04-01 22:15:05,989 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:15:05,990 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 22:15:05,990 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:15:05,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:15:05,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1069656734, now seen corresponding path program 1 times [2023-04-01 22:15:06,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:15:06,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183637346] [2023-04-01 22:15:06,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:06,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:15:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:06,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:15:06,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:06,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:15:06,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:15:06,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183637346] [2023-04-01 22:15:06,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183637346] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 22:15:06,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 22:15:06,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-04-01 22:15:06,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925818801] [2023-04-01 22:15:06,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 22:15:06,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 22:15:06,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:15:06,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 22:15:06,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-04-01 22:15:06,309 INFO L87 Difference]: Start difference. First operand has 215 states, 207 states have (on average 1.6763285024154588) internal successors, (347), 208 states have internal predecessors, (347), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 22:15:07,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:15:07,474 INFO L93 Difference]: Finished difference Result 730 states and 1301 transitions. [2023-04-01 22:15:07,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-01 22:15:07,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2023-04-01 22:15:07,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:15:07,485 INFO L225 Difference]: With dead ends: 730 [2023-04-01 22:15:07,485 INFO L226 Difference]: Without dead ends: 447 [2023-04-01 22:15:07,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-04-01 22:15:07,492 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 687 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-04-01 22:15:07,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 38 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-04-01 22:15:07,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2023-04-01 22:15:07,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 441. [2023-04-01 22:15:07,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 429 states have (on average 1.5268065268065267) internal successors, (655), 431 states have internal predecessors, (655), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2023-04-01 22:15:07,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 672 transitions. [2023-04-01 22:15:07,540 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 672 transitions. Word has length 19 [2023-04-01 22:15:07,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:15:07,540 INFO L495 AbstractCegarLoop]: Abstraction has 441 states and 672 transitions. [2023-04-01 22:15:07,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 22:15:07,541 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 672 transitions. [2023-04-01 22:15:07,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-04-01 22:15:07,543 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:15:07,543 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 22:15:07,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 22:15:07,544 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:15:07,544 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:15:07,544 INFO L85 PathProgramCache]: Analyzing trace with hash -2036659081, now seen corresponding path program 1 times [2023-04-01 22:15:07,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:15:07,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205493064] [2023-04-01 22:15:07,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:07,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:15:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:07,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:15:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:07,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 22:15:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:07,834 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:15:07,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:15:07,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205493064] [2023-04-01 22:15:07,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205493064] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 22:15:07,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 22:15:07,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-04-01 22:15:07,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720940307] [2023-04-01 22:15:07,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 22:15:07,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-04-01 22:15:07,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:15:07,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-04-01 22:15:07,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-04-01 22:15:07,838 INFO L87 Difference]: Start difference. First operand 441 states and 672 transitions. Second operand has 8 states, 7 states have (on average 12.285714285714286) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 22:15:08,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:15:08,591 INFO L93 Difference]: Finished difference Result 1041 states and 1612 transitions. [2023-04-01 22:15:08,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-01 22:15:08,592 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.285714285714286) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 92 [2023-04-01 22:15:08,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:15:08,595 INFO L225 Difference]: With dead ends: 1041 [2023-04-01 22:15:08,595 INFO L226 Difference]: Without dead ends: 606 [2023-04-01 22:15:08,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-04-01 22:15:08,597 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 732 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-04-01 22:15:08,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 42 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-04-01 22:15:08,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2023-04-01 22:15:08,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 592. [2023-04-01 22:15:08,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 574 states have (on average 1.3937282229965158) internal successors, (800), 580 states have internal predecessors, (800), 6 states have call successors, (6), 6 states have call predecessors, (6), 11 states have return successors, (23), 5 states have call predecessors, (23), 5 states have call successors, (23) [2023-04-01 22:15:08,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 829 transitions. [2023-04-01 22:15:08,619 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 829 transitions. Word has length 92 [2023-04-01 22:15:08,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:15:08,619 INFO L495 AbstractCegarLoop]: Abstraction has 592 states and 829 transitions. [2023-04-01 22:15:08,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.285714285714286) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 22:15:08,619 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 829 transitions. [2023-04-01 22:15:08,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-04-01 22:15:08,621 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:15:08,621 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 22:15:08,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-01 22:15:08,622 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:15:08,622 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:15:08,622 INFO L85 PathProgramCache]: Analyzing trace with hash -2060924381, now seen corresponding path program 1 times [2023-04-01 22:15:08,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:15:08,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286845834] [2023-04-01 22:15:08,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:08,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:15:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:08,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:15:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:08,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 22:15:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:08,737 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:15:08,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:15:08,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286845834] [2023-04-01 22:15:08,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286845834] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 22:15:08,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318344750] [2023-04-01 22:15:08,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:08,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:08,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 22:15:08,740 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) [2023-04-01 22:15:08,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-01 22:15:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:08,808 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-01 22:15:08,812 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 22:15:08,859 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:15:08,859 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 22:15:08,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318344750] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 22:15:08,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-01 22:15:08,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-04-01 22:15:08,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268503969] [2023-04-01 22:15:08,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 22:15:08,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-01 22:15:08,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:15:08,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-01 22:15:08,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-01 22:15:08,861 INFO L87 Difference]: Start difference. First operand 592 states and 829 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 22:15:09,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:15:09,246 INFO L93 Difference]: Finished difference Result 1615 states and 2274 transitions. [2023-04-01 22:15:09,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-01 22:15:09,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 98 [2023-04-01 22:15:09,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:15:09,250 INFO L225 Difference]: With dead ends: 1615 [2023-04-01 22:15:09,250 INFO L226 Difference]: Without dead ends: 1029 [2023-04-01 22:15:09,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-01 22:15:09,252 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 150 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-01 22:15:09,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 57 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-01 22:15:09,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2023-04-01 22:15:09,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 886. [2023-04-01 22:15:09,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 860 states have (on average 1.2744186046511627) internal successors, (1096), 870 states have internal predecessors, (1096), 8 states have call successors, (8), 8 states have call predecessors, (8), 17 states have return successors, (46), 7 states have call predecessors, (46), 7 states have call successors, (46) [2023-04-01 22:15:09,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1150 transitions. [2023-04-01 22:15:09,273 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1150 transitions. Word has length 98 [2023-04-01 22:15:09,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:15:09,273 INFO L495 AbstractCegarLoop]: Abstraction has 886 states and 1150 transitions. [2023-04-01 22:15:09,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 22:15:09,273 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1150 transitions. [2023-04-01 22:15:09,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-04-01 22:15:09,277 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:15:09,277 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 22:15:09,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-01 22:15:09,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:09,482 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:15:09,483 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:15:09,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1120171742, now seen corresponding path program 1 times [2023-04-01 22:15:09,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:15:09,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079516854] [2023-04-01 22:15:09,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:09,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:15:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:09,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:15:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:09,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 22:15:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:09,709 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:15:09,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:15:09,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079516854] [2023-04-01 22:15:09,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079516854] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 22:15:09,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 22:15:09,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-01 22:15:09,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334831480] [2023-04-01 22:15:09,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 22:15:09,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-01 22:15:09,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:15:09,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-01 22:15:09,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-04-01 22:15:09,711 INFO L87 Difference]: Start difference. First operand 886 states and 1150 transitions. Second operand has 7 states, 6 states have (on average 24.833333333333332) internal successors, (149), 4 states have internal predecessors, (149), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 22:15:10,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:15:10,427 INFO L93 Difference]: Finished difference Result 2245 states and 2959 transitions. [2023-04-01 22:15:10,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-01 22:15:10,428 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 24.833333333333332) internal successors, (149), 4 states have internal predecessors, (149), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 155 [2023-04-01 22:15:10,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:15:10,432 INFO L225 Difference]: With dead ends: 2245 [2023-04-01 22:15:10,433 INFO L226 Difference]: Without dead ends: 1365 [2023-04-01 22:15:10,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-04-01 22:15:10,434 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 460 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-04-01 22:15:10,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 53 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-04-01 22:15:10,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2023-04-01 22:15:10,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1057. [2023-04-01 22:15:10,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 1015 states have (on average 1.2423645320197045) internal successors, (1261), 1039 states have internal predecessors, (1261), 9 states have call successors, (9), 9 states have call predecessors, (9), 32 states have return successors, (89), 8 states have call predecessors, (89), 8 states have call successors, (89) [2023-04-01 22:15:10,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1359 transitions. [2023-04-01 22:15:10,459 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1359 transitions. Word has length 155 [2023-04-01 22:15:10,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:15:10,460 INFO L495 AbstractCegarLoop]: Abstraction has 1057 states and 1359 transitions. [2023-04-01 22:15:10,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 24.833333333333332) internal successors, (149), 4 states have internal predecessors, (149), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 22:15:10,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1359 transitions. [2023-04-01 22:15:10,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-04-01 22:15:10,462 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:15:10,462 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-04-01 22:15:10,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-04-01 22:15:10,462 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:15:10,462 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:15:10,463 INFO L85 PathProgramCache]: Analyzing trace with hash 985761282, now seen corresponding path program 1 times [2023-04-01 22:15:10,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:15:10,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343869790] [2023-04-01 22:15:10,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:10,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:15:10,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:10,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:15:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:10,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 22:15:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:10,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-04-01 22:15:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:10,674 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 91 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 22:15:10,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:15:10,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343869790] [2023-04-01 22:15:10,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343869790] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 22:15:10,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148126675] [2023-04-01 22:15:10,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:10,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:10,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 22:15:10,675 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 22:15:10,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-01 22:15:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:10,751 INFO L262 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-01 22:15:10,754 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 22:15:10,879 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 92 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:15:10,879 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 22:15:11,120 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 92 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:15:11,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148126675] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 22:15:11,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 22:15:11,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2023-04-01 22:15:11,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69741349] [2023-04-01 22:15:11,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 22:15:11,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-01 22:15:11,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:15:11,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-01 22:15:11,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2023-04-01 22:15:11,122 INFO L87 Difference]: Start difference. First operand 1057 states and 1359 transitions. Second operand has 13 states, 13 states have (on average 27.153846153846153) internal successors, (353), 11 states have internal predecessors, (353), 5 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-04-01 22:15:12,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:15:12,725 INFO L93 Difference]: Finished difference Result 2877 states and 3891 transitions. [2023-04-01 22:15:12,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-04-01 22:15:12,725 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 27.153846153846153) internal successors, (353), 11 states have internal predecessors, (353), 5 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 179 [2023-04-01 22:15:12,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:15:12,731 INFO L225 Difference]: With dead ends: 2877 [2023-04-01 22:15:12,731 INFO L226 Difference]: Without dead ends: 1826 [2023-04-01 22:15:12,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2023-04-01 22:15:12,734 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 1126 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1801 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1126 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 2057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 1801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-04-01 22:15:12,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1126 Valid, 99 Invalid, 2057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 1801 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-04-01 22:15:12,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2023-04-01 22:15:12,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1218. [2023-04-01 22:15:12,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 1165 states have (on average 1.211158798283262) internal successors, (1411), 1198 states have internal predecessors, (1411), 10 states have call successors, (10), 10 states have call predecessors, (10), 42 states have return successors, (123), 9 states have call predecessors, (123), 9 states have call successors, (123) [2023-04-01 22:15:12,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1544 transitions. [2023-04-01 22:15:12,818 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1544 transitions. Word has length 179 [2023-04-01 22:15:12,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:15:12,818 INFO L495 AbstractCegarLoop]: Abstraction has 1218 states and 1544 transitions. [2023-04-01 22:15:12,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 27.153846153846153) internal successors, (353), 11 states have internal predecessors, (353), 5 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-04-01 22:15:12,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1544 transitions. [2023-04-01 22:15:12,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2023-04-01 22:15:12,822 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:15:12,822 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-04-01 22:15:12,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-04-01 22:15:13,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:13,023 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:15:13,023 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:15:13,023 INFO L85 PathProgramCache]: Analyzing trace with hash 2110393719, now seen corresponding path program 1 times [2023-04-01 22:15:13,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:15:13,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513043607] [2023-04-01 22:15:13,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:13,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:15:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:13,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:15:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:13,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 22:15:13,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:13,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-04-01 22:15:13,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:13,639 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 24 proven. 82 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 22:15:13,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:15:13,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513043607] [2023-04-01 22:15:13,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513043607] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 22:15:13,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748527826] [2023-04-01 22:15:13,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:13,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:13,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 22:15:13,673 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 22:15:13,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-01 22:15:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:13,765 INFO L262 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 11 conjunts are in the unsatisfiable core [2023-04-01 22:15:13,772 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 22:15:13,881 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-04-01 22:15:13,881 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 22:15:13,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748527826] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 22:15:13,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-01 22:15:13,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-04-01 22:15:13,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978519838] [2023-04-01 22:15:13,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 22:15:13,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 22:15:13,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:15:13,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 22:15:13,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-04-01 22:15:13,888 INFO L87 Difference]: Start difference. First operand 1218 states and 1544 transitions. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 4 states have internal predecessors, (177), 3 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 22:15:14,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:15:14,367 INFO L93 Difference]: Finished difference Result 2599 states and 3284 transitions. [2023-04-01 22:15:14,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-01 22:15:14,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 4 states have internal predecessors, (177), 3 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 196 [2023-04-01 22:15:14,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:15:14,372 INFO L225 Difference]: With dead ends: 2599 [2023-04-01 22:15:14,372 INFO L226 Difference]: Without dead ends: 1387 [2023-04-01 22:15:14,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-04-01 22:15:14,375 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 272 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-01 22:15:14,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 46 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-01 22:15:14,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2023-04-01 22:15:14,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1361. [2023-04-01 22:15:14,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1361 states, 1306 states have (on average 1.1921898928024501) internal successors, (1557), 1339 states have internal predecessors, (1557), 11 states have call successors, (11), 11 states have call predecessors, (11), 43 states have return successors, (126), 10 states have call predecessors, (126), 10 states have call successors, (126) [2023-04-01 22:15:14,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 1694 transitions. [2023-04-01 22:15:14,404 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 1694 transitions. Word has length 196 [2023-04-01 22:15:14,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:15:14,405 INFO L495 AbstractCegarLoop]: Abstraction has 1361 states and 1694 transitions. [2023-04-01 22:15:14,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 4 states have internal predecessors, (177), 3 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 22:15:14,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1694 transitions. [2023-04-01 22:15:14,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2023-04-01 22:15:14,407 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:15:14,407 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 22:15:14,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-04-01 22:15:14,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:14,613 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:15:14,613 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:15:14,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1293590942, now seen corresponding path program 1 times [2023-04-01 22:15:14,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:15:14,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522641515] [2023-04-01 22:15:14,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:14,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:15:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:14,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:15:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:14,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 22:15:14,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:14,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-04-01 22:15:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:15,053 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 22:15:15,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:15:15,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522641515] [2023-04-01 22:15:15,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522641515] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 22:15:15,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649588309] [2023-04-01 22:15:15,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:15,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:15,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 22:15:15,055 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 22:15:15,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-01 22:15:15,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:15,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-01 22:15:15,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 22:15:15,278 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 101 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:15:15,278 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 22:15:15,587 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 101 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:15:15,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649588309] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 22:15:15,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 22:15:15,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2023-04-01 22:15:15,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385723486] [2023-04-01 22:15:15,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 22:15:15,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-04-01 22:15:15,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:15:15,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-04-01 22:15:15,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-04-01 22:15:15,590 INFO L87 Difference]: Start difference. First operand 1361 states and 1694 transitions. Second operand has 12 states, 12 states have (on average 42.75) internal successors, (513), 10 states have internal predecessors, (513), 5 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-04-01 22:15:17,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:15:17,065 INFO L93 Difference]: Finished difference Result 3888 states and 4904 transitions. [2023-04-01 22:15:17,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-04-01 22:15:17,066 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 42.75) internal successors, (513), 10 states have internal predecessors, (513), 5 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 239 [2023-04-01 22:15:17,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:15:17,070 INFO L225 Difference]: With dead ends: 3888 [2023-04-01 22:15:17,070 INFO L226 Difference]: Without dead ends: 1788 [2023-04-01 22:15:17,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 484 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2023-04-01 22:15:17,073 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1071 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 2109 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 2411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 2109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-04-01 22:15:17,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 48 Invalid, 2411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 2109 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-04-01 22:15:17,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2023-04-01 22:15:17,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1347. [2023-04-01 22:15:17,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1347 states, 1299 states have (on average 1.1293302540415704) internal successors, (1467), 1325 states have internal predecessors, (1467), 11 states have call successors, (11), 11 states have call predecessors, (11), 36 states have return successors, (89), 10 states have call predecessors, (89), 10 states have call successors, (89) [2023-04-01 22:15:17,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1567 transitions. [2023-04-01 22:15:17,147 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1567 transitions. Word has length 239 [2023-04-01 22:15:17,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:15:17,147 INFO L495 AbstractCegarLoop]: Abstraction has 1347 states and 1567 transitions. [2023-04-01 22:15:17,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 42.75) internal successors, (513), 10 states have internal predecessors, (513), 5 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-04-01 22:15:17,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1567 transitions. [2023-04-01 22:15:17,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2023-04-01 22:15:17,166 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:15:17,166 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 22:15:17,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-04-01 22:15:17,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:17,367 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:15:17,367 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:15:17,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1213823850, now seen corresponding path program 1 times [2023-04-01 22:15:17,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:15:17,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343631036] [2023-04-01 22:15:17,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:17,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:15:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:17,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:15:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:17,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 22:15:17,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:17,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-04-01 22:15:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:18,072 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 7 proven. 23 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2023-04-01 22:15:18,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:15:18,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343631036] [2023-04-01 22:15:18,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343631036] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 22:15:18,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297712107] [2023-04-01 22:15:18,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:18,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:18,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 22:15:18,088 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 22:15:18,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-01 22:15:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:18,222 INFO L262 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 18 conjunts are in the unsatisfiable core [2023-04-01 22:15:18,225 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 22:15:20,664 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 4 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:15:20,664 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 22:15:24,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297712107] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 22:15:24,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 22:15:24,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-04-01 22:15:24,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623474709] [2023-04-01 22:15:24,764 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 22:15:24,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-04-01 22:15:24,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:15:24,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-04-01 22:15:24,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=236, Unknown=2, NotChecked=0, Total=306 [2023-04-01 22:15:24,766 INFO L87 Difference]: Start difference. First operand 1347 states and 1567 transitions. Second operand has 16 states, 16 states have (on average 19.875) internal successors, (318), 13 states have internal predecessors, (318), 7 states have call successors, (10), 9 states have call predecessors, (10), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-04-01 22:15:31,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-04-01 22:15:31,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:15:31,441 INFO L93 Difference]: Finished difference Result 5523 states and 6883 transitions. [2023-04-01 22:15:31,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-04-01 22:15:31,442 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 19.875) internal successors, (318), 13 states have internal predecessors, (318), 7 states have call successors, (10), 9 states have call predecessors, (10), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 275 [2023-04-01 22:15:31,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:15:31,455 INFO L225 Difference]: With dead ends: 5523 [2023-04-01 22:15:31,455 INFO L226 Difference]: Without dead ends: 4176 [2023-04-01 22:15:31,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 286 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=266, Invalid=662, Unknown=2, NotChecked=0, Total=930 [2023-04-01 22:15:31,459 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 2762 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 2719 mSolverCounterSat, 447 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2762 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 3167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 447 IncrementalHoareTripleChecker+Valid, 2719 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-04-01 22:15:31,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2762 Valid, 118 Invalid, 3167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [447 Valid, 2719 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2023-04-01 22:15:31,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4176 states. [2023-04-01 22:15:31,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4176 to 3409. [2023-04-01 22:15:31,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3409 states, 3303 states have (on average 1.1413866182258552) internal successors, (3770), 3359 states have internal predecessors, (3770), 25 states have call successors, (25), 25 states have call predecessors, (25), 80 states have return successors, (352), 24 states have call predecessors, (352), 24 states have call successors, (352) [2023-04-01 22:15:31,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3409 states to 3409 states and 4147 transitions. [2023-04-01 22:15:31,546 INFO L78 Accepts]: Start accepts. Automaton has 3409 states and 4147 transitions. Word has length 275 [2023-04-01 22:15:31,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:15:31,546 INFO L495 AbstractCegarLoop]: Abstraction has 3409 states and 4147 transitions. [2023-04-01 22:15:31,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 19.875) internal successors, (318), 13 states have internal predecessors, (318), 7 states have call successors, (10), 9 states have call predecessors, (10), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-04-01 22:15:31,547 INFO L276 IsEmpty]: Start isEmpty. Operand 3409 states and 4147 transitions. [2023-04-01 22:15:31,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2023-04-01 22:15:31,551 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:15:31,551 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 22:15:31,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-04-01 22:15:31,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:31,763 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:15:31,763 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:15:31,764 INFO L85 PathProgramCache]: Analyzing trace with hash -911609633, now seen corresponding path program 1 times [2023-04-01 22:15:31,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:15:31,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120641476] [2023-04-01 22:15:31,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:31,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:15:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:31,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:15:31,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:31,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 22:15:31,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:31,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-04-01 22:15:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:32,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2023-04-01 22:15:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:32,098 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 215 proven. 2 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2023-04-01 22:15:32,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:15:32,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120641476] [2023-04-01 22:15:32,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120641476] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 22:15:32,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216958269] [2023-04-01 22:15:32,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:32,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:32,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 22:15:32,120 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 22:15:32,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-04-01 22:15:32,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:32,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 12 conjunts are in the unsatisfiable core [2023-04-01 22:15:32,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 22:15:32,779 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 297 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-04-01 22:15:32,779 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 22:15:34,738 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 41 proven. 267 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-01 22:15:34,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216958269] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 22:15:34,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 22:15:34,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 18 [2023-04-01 22:15:34,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078156828] [2023-04-01 22:15:34,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 22:15:34,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-04-01 22:15:34,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:15:34,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-04-01 22:15:34,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2023-04-01 22:15:34,741 INFO L87 Difference]: Start difference. First operand 3409 states and 4147 transitions. Second operand has 18 states, 18 states have (on average 39.72222222222222) internal successors, (715), 16 states have internal predecessors, (715), 7 states have call successors, (13), 10 states have call predecessors, (13), 9 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2023-04-01 22:15:38,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:15:38,077 INFO L93 Difference]: Finished difference Result 8934 states and 11135 transitions. [2023-04-01 22:15:38,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-04-01 22:15:38,078 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 39.72222222222222) internal successors, (715), 16 states have internal predecessors, (715), 7 states have call successors, (13), 10 states have call predecessors, (13), 9 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) Word has length 320 [2023-04-01 22:15:38,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:15:38,092 INFO L225 Difference]: With dead ends: 8934 [2023-04-01 22:15:38,092 INFO L226 Difference]: Without dead ends: 5674 [2023-04-01 22:15:38,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 738 GetRequests, 674 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1183 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=750, Invalid=3410, Unknown=0, NotChecked=0, Total=4160 [2023-04-01 22:15:38,099 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 5489 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 3296 mSolverCounterSat, 1074 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5493 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 4370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1074 IncrementalHoareTripleChecker+Valid, 3296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-04-01 22:15:38,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5493 Valid, 146 Invalid, 4370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1074 Valid, 3296 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-04-01 22:15:38,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5674 states. [2023-04-01 22:15:38,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5674 to 5342. [2023-04-01 22:15:38,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5342 states, 5173 states have (on average 1.1038082350666925) internal successors, (5710), 5266 states have internal predecessors, (5710), 38 states have call successors, (38), 38 states have call predecessors, (38), 130 states have return successors, (415), 37 states have call predecessors, (415), 37 states have call successors, (415) [2023-04-01 22:15:38,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5342 states to 5342 states and 6163 transitions. [2023-04-01 22:15:38,300 INFO L78 Accepts]: Start accepts. Automaton has 5342 states and 6163 transitions. Word has length 320 [2023-04-01 22:15:38,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:15:38,301 INFO L495 AbstractCegarLoop]: Abstraction has 5342 states and 6163 transitions. [2023-04-01 22:15:38,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 39.72222222222222) internal successors, (715), 16 states have internal predecessors, (715), 7 states have call successors, (13), 10 states have call predecessors, (13), 9 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2023-04-01 22:15:38,301 INFO L276 IsEmpty]: Start isEmpty. Operand 5342 states and 6163 transitions. [2023-04-01 22:15:38,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2023-04-01 22:15:38,318 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:15:38,318 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 22:15:38,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-04-01 22:15:38,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:38,524 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:15:38,525 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:15:38,525 INFO L85 PathProgramCache]: Analyzing trace with hash 2094466394, now seen corresponding path program 1 times [2023-04-01 22:15:38,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:15:38,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993337995] [2023-04-01 22:15:38,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:38,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:15:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:38,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:15:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:38,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 22:15:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:38,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-04-01 22:15:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:38,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2023-04-01 22:15:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:38,798 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 39 proven. 3 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2023-04-01 22:15:38,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:15:38,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993337995] [2023-04-01 22:15:38,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993337995] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 22:15:38,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163943303] [2023-04-01 22:15:38,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:38,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:38,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 22:15:38,799 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 22:15:38,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-04-01 22:15:38,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:38,897 INFO L262 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 5 conjunts are in the unsatisfiable core [2023-04-01 22:15:38,900 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 22:15:38,924 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2023-04-01 22:15:38,924 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 22:15:38,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163943303] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 22:15:38,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-01 22:15:38,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2023-04-01 22:15:38,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398988625] [2023-04-01 22:15:38,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 22:15:38,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-01 22:15:38,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:15:38,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-01 22:15:38,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-04-01 22:15:38,927 INFO L87 Difference]: Start difference. First operand 5342 states and 6163 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-01 22:15:39,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:15:39,305 INFO L93 Difference]: Finished difference Result 10819 states and 12527 transitions. [2023-04-01 22:15:39,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-01 22:15:39,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 333 [2023-04-01 22:15:39,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:15:39,317 INFO L225 Difference]: With dead ends: 10819 [2023-04-01 22:15:39,317 INFO L226 Difference]: Without dead ends: 5775 [2023-04-01 22:15:39,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-04-01 22:15:39,323 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 133 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-01 22:15:39,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 53 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-01 22:15:39,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5775 states. [2023-04-01 22:15:39,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5775 to 5773. [2023-04-01 22:15:39,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5773 states, 5597 states have (on average 1.1014829372878328) internal successors, (6165), 5691 states have internal predecessors, (6165), 41 states have call successors, (41), 41 states have call predecessors, (41), 134 states have return successors, (431), 40 states have call predecessors, (431), 40 states have call successors, (431) [2023-04-01 22:15:39,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5773 states to 5773 states and 6637 transitions. [2023-04-01 22:15:39,456 INFO L78 Accepts]: Start accepts. Automaton has 5773 states and 6637 transitions. Word has length 333 [2023-04-01 22:15:39,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:15:39,456 INFO L495 AbstractCegarLoop]: Abstraction has 5773 states and 6637 transitions. [2023-04-01 22:15:39,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-01 22:15:39,457 INFO L276 IsEmpty]: Start isEmpty. Operand 5773 states and 6637 transitions. [2023-04-01 22:15:39,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2023-04-01 22:15:39,462 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:15:39,462 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 22:15:39,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-04-01 22:15:39,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:39,667 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:15:39,668 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:15:39,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1873414886, now seen corresponding path program 1 times [2023-04-01 22:15:39,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:15:39,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853837893] [2023-04-01 22:15:39,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:39,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:15:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-01 22:15:39,703 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-04-01 22:15:39,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-01 22:15:39,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-04-01 22:15:39,802 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-04-01 22:15:39,803 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-01 22:15:39,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-04-01 22:15:39,808 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 22:15:39,811 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-01 22:15:39,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.04 10:15:39 BoogieIcfgContainer [2023-04-01 22:15:39,923 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-01 22:15:39,924 INFO L158 Benchmark]: Toolchain (without parser) took 35388.64ms. Allocated memory was 362.8MB in the beginning and 747.6MB in the end (delta: 384.8MB). Free memory was 326.5MB in the beginning and 540.9MB in the end (delta: -214.4MB). Peak memory consumption was 171.1MB. Max. memory is 8.0GB. [2023-04-01 22:15:39,924 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 181.4MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-01 22:15:39,924 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.41ms. Allocated memory is still 362.8MB. Free memory was 326.1MB in the beginning and 298.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2023-04-01 22:15:39,924 INFO L158 Benchmark]: Boogie Preprocessor took 50.30ms. Allocated memory is still 362.8MB. Free memory was 298.8MB in the beginning and 294.0MB in the end (delta: 4.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-04-01 22:15:39,924 INFO L158 Benchmark]: RCFGBuilder took 965.12ms. Allocated memory is still 362.8MB. Free memory was 294.0MB in the beginning and 309.1MB in the end (delta: -15.1MB). Peak memory consumption was 72.5MB. Max. memory is 8.0GB. [2023-04-01 22:15:39,924 INFO L158 Benchmark]: TraceAbstraction took 34004.58ms. Allocated memory was 362.8MB in the beginning and 747.6MB in the end (delta: 384.8MB). Free memory was 308.5MB in the beginning and 540.9MB in the end (delta: -232.4MB). Peak memory consumption was 152.2MB. Max. memory is 8.0GB. [2023-04-01 22:15:39,926 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.09ms. Allocated memory is still 181.4MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 364.41ms. Allocated memory is still 362.8MB. Free memory was 326.1MB in the beginning and 298.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.30ms. Allocated memory is still 362.8MB. Free memory was 298.8MB in the beginning and 294.0MB in the end (delta: 4.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 965.12ms. Allocated memory is still 362.8MB. Free memory was 294.0MB in the beginning and 309.1MB in the end (delta: -15.1MB). Peak memory consumption was 72.5MB. Max. memory is 8.0GB. * TraceAbstraction took 34004.58ms. Allocated memory was 362.8MB in the beginning and 747.6MB in the end (delta: 384.8MB). Free memory was 308.5MB in the beginning and 540.9MB in the end (delta: -232.4MB). Peak memory consumption was 152.2MB. Max. memory is 8.0GB. * 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: 53]: 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 [\old(a1)=167164, \old(a10)=167161, \old(a12)=167163, \old(a19)=167157, \old(a4)=167162, \old(inputB)=167155, \old(inputC)=167158, \old(inputD)=167156, \old(inputE)=167165, \old(inputF)=167159, a10=0, a12=0, a19=9, a1=23, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L589] int output = -1; VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a10=0, a12=0, a19=9, a1=23, 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)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L600] CALL, EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L464] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L475] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L481] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L486] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L491] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L497] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L503] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L509] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L514] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L519] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L524] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L527] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L533] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L536] COND FALSE !(((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L539] COND FALSE !(((a19==9) && (((a10==1) && ((a12==0) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a4==14)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L544] COND FALSE !(((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a12==0)))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L550] COND TRUE ((a12==0) && (((((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a19==9)) && (a4==14)) && (a10==0))) [L551] a1 = (((((a1 + -272193) - -47605) - -570122) % 89)+ 110) [L552] a10 = 1 [L554] return 25; VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, \result=25, a10=1, a12=0, a19=9, a1=169, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] RET, EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a10=1, a12=0, a19=9, a1=169, a4=14, calculate_output(input)=25, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [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)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=25] [L600] CALL, EXPR calculate_output(input) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, 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(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L464] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND TRUE ((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0)))) [L471] a1 = (((a1 / 5) + 105416) + 61704) [L472] a10 = 4 [L474] return 24; VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, \result=24, a10=4, a12=0, a19=9, a1=167153, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] RET, EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a10=4, a12=0, a19=9, a1=167153, a4=14, calculate_output(input)=24, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=25] [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)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=24] [L600] CALL, EXPR calculate_output(input) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, 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(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, a10=4, a12=0, a19=9, a1=167153, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L322] COND TRUE ((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0))) [L324] a19 = 8 [L326] return -1; VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=6, \result=-1, a10=4, a12=0, a19=8, a1=167153, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] RET, EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a10=4, a12=0, a19=8, a1=167153, a4=14, calculate_output(input)=-1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=24] [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)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a10=4, a12=0, a19=8, a1=167153, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L600] CALL calculate_output(input) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=8, \old(input)=3, a10=4, a12=0, a19=8, a1=167153, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=8, \old(input)=3, a10=4, a12=0, a19=8, a1=167153, 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(a1)=167153, \old(a10)=4, \old(a19)=8, \old(input)=3, a10=4, a12=0, a19=8, a1=167153, 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(a1)=167153, \old(a10)=4, \old(a19)=8, \old(input)=3, a10=4, a12=0, a19=8, a1=167153, 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(a1)=167153, \old(a10)=4, \old(a19)=8, \old(input)=3, a10=4, a12=0, a19=8, a1=167153, 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(a1)=167153, \old(a10)=4, \old(a19)=8, \old(input)=3, a10=4, a12=0, a19=8, a1=167153, 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(a1)=167153, \old(a10)=4, \old(a19)=8, \old(input)=3, a10=4, a12=0, a19=8, a1=167153, 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(a1)=167153, \old(a10)=4, \old(a19)=8, \old(input)=3, a10=4, a12=0, a19=8, a1=167153, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND TRUE (((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=8, \old(input)=3, a10=4, a12=0, a19=8, a1=167153, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] reach_error() VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=8, \old(input)=3, a10=4, a12=0, a19=8, a1=167153, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 218 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.8s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 17.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 12886 SdHoareTripleChecker+Valid, 12.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12882 mSDsluCounter, 700 SdHoareTripleChecker+Invalid, 10.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 475 mSDsCounter, 2742 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13958 IncrementalHoareTripleChecker+Invalid, 16701 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2742 mSolverCounterUnsat, 225 mSDtfsCounter, 13958 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2642 GetRequests, 2455 SyntacticMatches, 4 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1613 ImplicationChecksByTransitivity, 10.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5773occurred in iteration=10, InterpolantAutomatonStates: 154, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 10 MinimizatonAttempts, 2647 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 13.2s InterpolantComputationTime, 3913 NumberOfCodeBlocks, 3913 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 4264 ConstructedInterpolants, 15 QuantifiedInterpolants, 17215 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3059 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 20 InterpolantComputations, 6 PerfectInterpolantSequences, 2138/2665 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! [2023-04-01 22:15:39,948 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...