/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_label29.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 22:13:54,637 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 22:13:54,639 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 22:13:54,669 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 22:13:54,670 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 22:13:54,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 22:13:54,675 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 22:13:54,676 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 22:13:54,677 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 22:13:54,678 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 22:13:54,679 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 22:13:54,679 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 22:13:54,680 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 22:13:54,681 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 22:13:54,681 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 22:13:54,683 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 22:13:54,684 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 22:13:54,685 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 22:13:54,687 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 22:13:54,692 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 22:13:54,695 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 22:13:54,696 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 22:13:54,698 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 22:13:54,699 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 22:13:54,707 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 22:13:54,707 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 22:13:54,707 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 22:13:54,709 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 22:13:54,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 22:13:54,710 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 22:13:54,711 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 22:13:54,711 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 22:13:54,713 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 22:13:54,713 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 22:13:54,714 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 22:13:54,714 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 22:13:54,715 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 22:13:54,715 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 22:13:54,715 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 22:13:54,716 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 22:13:54,716 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 22:13:54,717 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:13:54,749 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 22:13:54,749 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 22:13:54,750 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 22:13:54,750 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 22:13:54,752 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 22:13:54,752 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 22:13:54,752 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-04-01 22:13:54,752 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-04-01 22:13:54,752 INFO L138 SettingsManager]: * Use SBE=true [2023-04-01 22:13:54,753 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 22:13:54,753 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 22:13:54,753 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 22:13:54,754 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 22:13:54,754 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 22:13:54,754 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 22:13:54,754 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 22:13:54,754 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 22:13:54,754 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 22:13:54,754 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 22:13:54,754 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 22:13:54,755 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 22:13:54,755 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 22:13:54,755 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-04-01 22:13:54,755 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 22:13:54,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 22:13:54,755 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 22:13:54,755 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 22:13:54,755 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 22:13:54,756 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-04-01 22:13:54,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 22:13:54,756 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-04-01 22:13:54,756 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 22:13:54,756 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-04-01 22:13:54,756 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-04-01 22:13:54,756 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-04-01 22:13:54,756 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:13:54,966 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 22:13:54,986 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 22:13:54,988 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 22:13:54,989 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 22:13:54,990 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 22:13:54,991 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label29.c [2023-04-01 22:13:56,104 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 22:13:56,339 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 22:13:56,339 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label29.c [2023-04-01 22:13:56,357 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b4dc0207/7a2f2acbf33843d8b74a51f29a460fa9/FLAGfb7e6ab1f [2023-04-01 22:13:56,371 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b4dc0207/7a2f2acbf33843d8b74a51f29a460fa9 [2023-04-01 22:13:56,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 22:13:56,375 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 22:13:56,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 22:13:56,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 22:13:56,381 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 22:13:56,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 10:13:56" (1/1) ... [2023-04-01 22:13:56,383 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63f1efa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:13:56, skipping insertion in model container [2023-04-01 22:13:56,383 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 10:13:56" (1/1) ... [2023-04-01 22:13:56,389 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 22:13:56,436 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 22:13:56,603 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_label29.c[1979,1992] [2023-04-01 22:13:56,737 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 22:13:56,745 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 22:13:56,759 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_label29.c[1979,1992] [2023-04-01 22:13:56,846 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 22:13:56,877 INFO L208 MainTranslator]: Completed translation [2023-04-01 22:13:56,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:13:56 WrapperNode [2023-04-01 22:13:56,877 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 22:13:56,878 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 22:13:56,878 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 22:13:56,878 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 22:13:56,888 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:13:56" (1/1) ... [2023-04-01 22:13:56,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:13:56" (1/1) ... [2023-04-01 22:13:56,912 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:13:56" (1/1) ... [2023-04-01 22:13:56,912 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:13:56" (1/1) ... [2023-04-01 22:13:56,945 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:13:56" (1/1) ... [2023-04-01 22:13:56,957 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:13:56" (1/1) ... [2023-04-01 22:13:56,965 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:13:56" (1/1) ... [2023-04-01 22:13:56,970 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:13:56" (1/1) ... [2023-04-01 22:13:56,988 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 22:13:56,989 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 22:13:56,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 22:13:56,989 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 22:13:56,990 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:13:56" (1/1) ... [2023-04-01 22:13:56,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 22:13:57,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 22:13:57,019 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:13:57,040 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:13:57,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 22:13:57,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 22:13:57,060 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 22:13:57,060 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2023-04-01 22:13:57,060 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 22:13:57,060 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2023-04-01 22:13:57,060 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 22:13:57,060 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 22:13:57,061 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 22:13:57,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 22:13:57,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-01 22:13:57,061 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2023-04-01 22:13:57,061 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 22:13:57,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 22:13:57,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 22:13:57,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 22:13:57,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 22:13:57,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 22:13:57,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 22:13:57,144 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 22:13:57,146 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 22:13:58,149 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 22:13:58,162 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 22:13:58,162 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-04-01 22:13:58,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 10:13:58 BoogieIcfgContainer [2023-04-01 22:13:58,164 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 22:13:58,167 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 22:13:58,167 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 22:13:58,170 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 22:13:58,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 10:13:56" (1/3) ... [2023-04-01 22:13:58,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5154f6e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 10:13:58, skipping insertion in model container [2023-04-01 22:13:58,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:13:56" (2/3) ... [2023-04-01 22:13:58,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5154f6e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 10:13:58, skipping insertion in model container [2023-04-01 22:13:58,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 10:13:58" (3/3) ... [2023-04-01 22:13:58,172 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label29.c [2023-04-01 22:13:58,188 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 22:13:58,188 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 22:13:58,237 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 22:13:58,242 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;@6719092a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-04-01 22:13:58,243 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 22:13:58,247 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:13:58,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-04-01 22:13:58,253 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:13:58,254 INFO L195 NwaCegarLoop]: trace histogram [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:13:58,254 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:13:58,259 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:13:58,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1442805686, now seen corresponding path program 1 times [2023-04-01 22:13:58,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:13:58,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891390345] [2023-04-01 22:13:58,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:13:58,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:13:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:13:58,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:13:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:13:58,650 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:13:58,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:13:58,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891390345] [2023-04-01 22:13:58,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891390345] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 22:13:58,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 22:13:58,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-04-01 22:13:58,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736644252] [2023-04-01 22:13:58,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 22:13:58,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-01 22:13:58,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:13:58,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-01 22:13:58,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-01 22:13:58,682 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 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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:13:59,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:13:59,749 INFO L93 Difference]: Finished difference Result 581 states and 1006 transitions. [2023-04-01 22:13:59,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 22:13:59,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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 21 [2023-04-01 22:13:59,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:13:59,761 INFO L225 Difference]: With dead ends: 581 [2023-04-01 22:13:59,761 INFO L226 Difference]: Without dead ends: 302 [2023-04-01 22:13:59,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-04-01 22:13:59,772 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 515 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-04-01 22:13:59,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 24 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-04-01 22:13:59,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2023-04-01 22:13:59,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2023-04-01 22:13:59,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 288 states have (on average 1.3333333333333333) internal successors, (384), 290 states have internal predecessors, (384), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-04-01 22:13:59,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 395 transitions. [2023-04-01 22:13:59,848 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 395 transitions. Word has length 21 [2023-04-01 22:13:59,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:13:59,848 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 395 transitions. [2023-04-01 22:13:59,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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:13:59,849 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 395 transitions. [2023-04-01 22:13:59,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-04-01 22:13:59,853 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:13:59,854 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-04-01 22:13:59,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 22:13:59,854 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:13:59,856 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:13:59,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1789803066, now seen corresponding path program 1 times [2023-04-01 22:13:59,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:13:59,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479950026] [2023-04-01 22:13:59,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:13:59,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:13:59,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:00,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:14:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:00,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 22:14:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:00,243 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-01 22:14:00,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:14:00,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479950026] [2023-04-01 22:14:00,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479950026] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 22:14:00,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134863476] [2023-04-01 22:14:00,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:14:00,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:14:00,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 22:14:00,247 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:14:00,265 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:14:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:00,337 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-01 22:14:00,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 22:14:00,443 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:14:00,443 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 22:14:00,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134863476] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 22:14:00,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-01 22:14:00,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 7 [2023-04-01 22:14:00,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212643819] [2023-04-01 22:14:00,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 22:14:00,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-01 22:14:00,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:14:00,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-01 22:14:00,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-04-01 22:14:00,446 INFO L87 Difference]: Start difference. First operand 298 states and 395 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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:14:00,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:14:00,935 INFO L93 Difference]: Finished difference Result 590 states and 793 transitions. [2023-04-01 22:14:00,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-01 22:14:00,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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 91 [2023-04-01 22:14:00,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:14:00,940 INFO L225 Difference]: With dead ends: 590 [2023-04-01 22:14:00,940 INFO L226 Difference]: Without dead ends: 588 [2023-04-01 22:14:00,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-04-01 22:14:00,942 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 171 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-04-01 22:14:00,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 24 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-04-01 22:14:00,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2023-04-01 22:14:00,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 443. [2023-04-01 22:14:00,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 430 states have (on average 1.3976744186046512) internal successors, (601), 433 states have internal predecessors, (601), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2023-04-01 22:14:00,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 620 transitions. [2023-04-01 22:14:00,963 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 620 transitions. Word has length 91 [2023-04-01 22:14:00,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:14:00,963 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 620 transitions. [2023-04-01 22:14:00,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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:14:00,963 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 620 transitions. [2023-04-01 22:14:00,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-04-01 22:14:00,965 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:14:00,965 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-04-01 22:14:00,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-04-01 22:14:01,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:14:01,171 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:14:01,171 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:14:01,172 INFO L85 PathProgramCache]: Analyzing trace with hash 153494079, now seen corresponding path program 1 times [2023-04-01 22:14:01,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:14:01,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361781411] [2023-04-01 22:14:01,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:14:01,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:14:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:01,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:14:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:01,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 22:14:01,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:01,469 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:14:01,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:14:01,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361781411] [2023-04-01 22:14:01,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361781411] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 22:14:01,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 22:14:01,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-04-01 22:14:01,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73225452] [2023-04-01 22:14:01,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 22:14:01,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-04-01 22:14:01,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:14:01,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-04-01 22:14:01,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-04-01 22:14:01,475 INFO L87 Difference]: Start difference. First operand 443 states and 620 transitions. Second operand has 8 states, 7 states have (on average 12.571428571428571) internal successors, (88), 5 states have internal predecessors, (88), 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:14:02,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:14:02,343 INFO L93 Difference]: Finished difference Result 1196 states and 1701 transitions. [2023-04-01 22:14:02,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-01 22:14:02,348 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.571428571428571) internal successors, (88), 5 states have internal predecessors, (88), 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 94 [2023-04-01 22:14:02,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:14:02,352 INFO L225 Difference]: With dead ends: 1196 [2023-04-01 22:14:02,352 INFO L226 Difference]: Without dead ends: 759 [2023-04-01 22:14:02,353 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:14:02,354 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 1024 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1024 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-04-01 22:14:02,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1024 Valid, 40 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-04-01 22:14:02,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2023-04-01 22:14:02,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 741. [2023-04-01 22:14:02,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 718 states have (on average 1.286908077994429) internal successors, (924), 727 states have internal predecessors, (924), 7 states have call successors, (7), 7 states have call predecessors, (7), 15 states have return successors, (36), 6 states have call predecessors, (36), 6 states have call successors, (36) [2023-04-01 22:14:02,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 967 transitions. [2023-04-01 22:14:02,390 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 967 transitions. Word has length 94 [2023-04-01 22:14:02,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:14:02,390 INFO L495 AbstractCegarLoop]: Abstraction has 741 states and 967 transitions. [2023-04-01 22:14:02,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.571428571428571) internal successors, (88), 5 states have internal predecessors, (88), 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:14:02,391 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 967 transitions. [2023-04-01 22:14:02,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-04-01 22:14:02,392 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:14:02,393 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 22:14:02,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-04-01 22:14:02,393 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:14:02,393 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:14:02,394 INFO L85 PathProgramCache]: Analyzing trace with hash 133401835, now seen corresponding path program 1 times [2023-04-01 22:14:02,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:14:02,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13023212] [2023-04-01 22:14:02,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:14:02,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:14:02,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:02,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:14:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:02,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 22:14:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:02,578 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:14:02,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:14:02,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13023212] [2023-04-01 22:14:02,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13023212] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 22:14:02,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990582465] [2023-04-01 22:14:02,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:14:02,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:14:02,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 22:14:02,580 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:14:02,608 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:14:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:02,663 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-01 22:14:02,666 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 22:14:02,698 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:14:02,699 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 22:14:02,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990582465] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 22:14:02,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-01 22:14:02,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-04-01 22:14:02,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696585268] [2023-04-01 22:14:02,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 22:14:02,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-01 22:14:02,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:14:02,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-01 22:14:02,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-01 22:14:02,701 INFO L87 Difference]: Start difference. First operand 741 states and 967 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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:14:03,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:14:03,099 INFO L93 Difference]: Finished difference Result 1770 states and 2359 transitions. [2023-04-01 22:14:03,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-01 22:14:03,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 100 [2023-04-01 22:14:03,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:14:03,105 INFO L225 Difference]: With dead ends: 1770 [2023-04-01 22:14:03,105 INFO L226 Difference]: Without dead ends: 1035 [2023-04-01 22:14:03,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 104 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:14:03,107 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 142 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-01 22:14:03,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 67 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-01 22:14:03,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2023-04-01 22:14:03,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1035. [2023-04-01 22:14:03,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 1004 states have (on average 1.2151394422310757) internal successors, (1220), 1017 states have internal predecessors, (1220), 9 states have call successors, (9), 9 states have call predecessors, (9), 21 states have return successors, (66), 8 states have call predecessors, (66), 8 states have call successors, (66) [2023-04-01 22:14:03,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1295 transitions. [2023-04-01 22:14:03,138 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1295 transitions. Word has length 100 [2023-04-01 22:14:03,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:14:03,138 INFO L495 AbstractCegarLoop]: Abstraction has 1035 states and 1295 transitions. [2023-04-01 22:14:03,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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:14:03,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1295 transitions. [2023-04-01 22:14:03,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2023-04-01 22:14:03,142 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:14:03,142 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:14:03,153 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:14:03,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-04-01 22:14:03,348 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:14:03,348 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:14:03,348 INFO L85 PathProgramCache]: Analyzing trace with hash -6780758, now seen corresponding path program 1 times [2023-04-01 22:14:03,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:14:03,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557212938] [2023-04-01 22:14:03,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:14:03,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:14:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:03,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:14:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:03,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 22:14:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:03,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-04-01 22:14:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:03,642 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 95 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 22:14:03,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:14:03,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557212938] [2023-04-01 22:14:03,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557212938] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 22:14:03,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920502125] [2023-04-01 22:14:03,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:14:03,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:14:03,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 22:14:03,644 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:14:03,647 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:14:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:03,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-01 22:14:03,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 22:14:03,906 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 96 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:14:03,906 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 22:14:04,254 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 96 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:14:04,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920502125] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 22:14:04,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 22:14:04,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2023-04-01 22:14:04,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026821356] [2023-04-01 22:14:04,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 22:14:04,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-01 22:14:04,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:14:04,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-01 22:14:04,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2023-04-01 22:14:04,257 INFO L87 Difference]: Start difference. First operand 1035 states and 1295 transitions. Second operand has 13 states, 13 states have (on average 27.307692307692307) internal successors, (355), 11 states have internal predecessors, (355), 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:14:06,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:14:06,200 INFO L93 Difference]: Finished difference Result 2694 states and 3543 transitions. [2023-04-01 22:14:06,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-04-01 22:14:06,200 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 27.307692307692307) internal successors, (355), 11 states have internal predecessors, (355), 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 181 [2023-04-01 22:14:06,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:14:06,208 INFO L225 Difference]: With dead ends: 2694 [2023-04-01 22:14:06,209 INFO L226 Difference]: Without dead ends: 1665 [2023-04-01 22:14:06,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 366 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:14:06,213 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 1085 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 2285 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 2612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 2285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-04-01 22:14:06,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 124 Invalid, 2612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 2285 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-04-01 22:14:06,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2023-04-01 22:14:06,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1647. [2023-04-01 22:14:06,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1647 states, 1588 states have (on average 1.2002518891687657) internal successors, (1906), 1621 states have internal predecessors, (1906), 13 states have call successors, (13), 13 states have call predecessors, (13), 45 states have return successors, (163), 12 states have call predecessors, (163), 12 states have call successors, (163) [2023-04-01 22:14:06,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2082 transitions. [2023-04-01 22:14:06,268 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2082 transitions. Word has length 181 [2023-04-01 22:14:06,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:14:06,268 INFO L495 AbstractCegarLoop]: Abstraction has 1647 states and 2082 transitions. [2023-04-01 22:14:06,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 27.307692307692307) internal successors, (355), 11 states have internal predecessors, (355), 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:14:06,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2082 transitions. [2023-04-01 22:14:06,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2023-04-01 22:14:06,275 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:14:06,275 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-04-01 22:14:06,284 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:14:06,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:14:06,482 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:14:06,482 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:14:06,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1169342779, now seen corresponding path program 1 times [2023-04-01 22:14:06,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:14:06,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109089010] [2023-04-01 22:14:06,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:14:06,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:14:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:06,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:14:06,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:06,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 22:14:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:07,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-04-01 22:14:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:07,148 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 28 proven. 72 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 22:14:07,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:14:07,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109089010] [2023-04-01 22:14:07,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109089010] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 22:14:07,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795385334] [2023-04-01 22:14:07,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:14:07,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:14:07,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 22:14:07,153 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:14:07,156 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:14:07,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:07,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 11 conjunts are in the unsatisfiable core [2023-04-01 22:14:07,296 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 22:14:07,434 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-04-01 22:14:07,434 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 22:14:07,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795385334] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 22:14:07,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-01 22:14:07,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-04-01 22:14:07,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449034549] [2023-04-01 22:14:07,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 22:14:07,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 22:14:07,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:14:07,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 22:14:07,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-04-01 22:14:07,437 INFO L87 Difference]: Start difference. First operand 1647 states and 2082 transitions. Second operand has 5 states, 5 states have (on average 35.0) internal successors, (175), 4 states have internal predecessors, (175), 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:14:08,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:14:08,023 INFO L93 Difference]: Finished difference Result 3459 states and 4376 transitions. [2023-04-01 22:14:08,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-01 22:14:08,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.0) internal successors, (175), 4 states have internal predecessors, (175), 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:14:08,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:14:08,031 INFO L225 Difference]: With dead ends: 3459 [2023-04-01 22:14:08,031 INFO L226 Difference]: Without dead ends: 1818 [2023-04-01 22:14:08,037 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:14:08,038 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 291 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-04-01 22:14:08,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 47 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-04-01 22:14:08,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1818 states. [2023-04-01 22:14:08,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1818 to 1653. [2023-04-01 22:14:08,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1653 states, 1591 states have (on average 1.190446260213702) internal successors, (1894), 1627 states have internal predecessors, (1894), 13 states have call successors, (13), 13 states have call predecessors, (13), 48 states have return successors, (158), 12 states have call predecessors, (158), 12 states have call successors, (158) [2023-04-01 22:14:08,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 2065 transitions. [2023-04-01 22:14:08,088 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 2065 transitions. Word has length 196 [2023-04-01 22:14:08,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:14:08,089 INFO L495 AbstractCegarLoop]: Abstraction has 1653 states and 2065 transitions. [2023-04-01 22:14:08,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.0) internal successors, (175), 4 states have internal predecessors, (175), 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:14:08,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2065 transitions. [2023-04-01 22:14:08,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2023-04-01 22:14:08,092 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:14:08,093 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-04-01 22:14:08,105 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:14:08,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:14:08,303 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:14:08,303 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:14:08,303 INFO L85 PathProgramCache]: Analyzing trace with hash 740898699, now seen corresponding path program 1 times [2023-04-01 22:14:08,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:14:08,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876803631] [2023-04-01 22:14:08,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:14:08,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:14:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:08,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:14:08,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:08,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 22:14:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:08,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-04-01 22:14:08,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:08,851 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 104 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 22:14:08,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:14:08,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876803631] [2023-04-01 22:14:08,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876803631] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 22:14:08,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36984821] [2023-04-01 22:14:08,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:14:08,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:14:08,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 22:14:08,854 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:14:08,856 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:14:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:08,956 INFO L262 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-01 22:14:08,960 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 22:14:09,112 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 105 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:14:09,113 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 22:14:09,457 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 105 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:14:09,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36984821] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 22:14:09,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 22:14:09,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2023-04-01 22:14:09,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356431497] [2023-04-01 22:14:09,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 22:14:09,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-04-01 22:14:09,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:14:09,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-04-01 22:14:09,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-04-01 22:14:09,461 INFO L87 Difference]: Start difference. First operand 1653 states and 2065 transitions. Second operand has 12 states, 12 states have (on average 41.666666666666664) internal successors, (500), 10 states have internal predecessors, (500), 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:14:11,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:14:11,114 INFO L93 Difference]: Finished difference Result 4027 states and 5055 transitions. [2023-04-01 22:14:11,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-04-01 22:14:11,114 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 41.666666666666664) internal successors, (500), 10 states have internal predecessors, (500), 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 236 [2023-04-01 22:14:11,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:14:11,122 INFO L225 Difference]: With dead ends: 4027 [2023-04-01 22:14:11,122 INFO L226 Difference]: Without dead ends: 2082 [2023-04-01 22:14:11,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 478 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2023-04-01 22:14:11,129 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1367 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1706 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1367 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 1964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-04-01 22:14:11,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1367 Valid, 53 Invalid, 1964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1706 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-04-01 22:14:11,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2082 states. [2023-04-01 22:14:11,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 1351. [2023-04-01 22:14:11,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1351 states, 1301 states have (on average 1.1391237509607994) internal successors, (1482), 1329 states have internal predecessors, (1482), 11 states have call successors, (11), 11 states have call predecessors, (11), 38 states have return successors, (93), 10 states have call predecessors, (93), 10 states have call successors, (93) [2023-04-01 22:14:11,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 1586 transitions. [2023-04-01 22:14:11,172 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 1586 transitions. Word has length 236 [2023-04-01 22:14:11,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:14:11,173 INFO L495 AbstractCegarLoop]: Abstraction has 1351 states and 1586 transitions. [2023-04-01 22:14:11,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 41.666666666666664) internal successors, (500), 10 states have internal predecessors, (500), 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:14:11,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1586 transitions. [2023-04-01 22:14:11,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2023-04-01 22:14:11,177 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:14:11,177 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-04-01 22:14:11,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-04-01 22:14:11,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:14:11,383 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:14:11,384 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:14:11,384 INFO L85 PathProgramCache]: Analyzing trace with hash 694511507, now seen corresponding path program 1 times [2023-04-01 22:14:11,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:14:11,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886555927] [2023-04-01 22:14:11,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:14:11,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:14:11,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:11,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:14:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:11,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 22:14:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:11,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-04-01 22:14:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:11,715 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-04-01 22:14:11,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:14:11,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886555927] [2023-04-01 22:14:11,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886555927] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 22:14:11,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616660166] [2023-04-01 22:14:11,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:14:11,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:14:11,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 22:14:11,721 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:14:11,723 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:14:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:11,838 INFO L262 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-01 22:14:11,842 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 22:14:11,869 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-04-01 22:14:11,869 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 22:14:11,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616660166] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 22:14:11,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-01 22:14:11,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-04-01 22:14:11,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585994608] [2023-04-01 22:14:11,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 22:14:11,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-01 22:14:11,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:14:11,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-01 22:14:11,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-01 22:14:11,872 INFO L87 Difference]: Start difference. First operand 1351 states and 1586 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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:14:12,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:14:12,200 INFO L93 Difference]: Finished difference Result 1502 states and 1737 transitions. [2023-04-01 22:14:12,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-01 22:14:12,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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 272 [2023-04-01 22:14:12,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:14:12,206 INFO L225 Difference]: With dead ends: 1502 [2023-04-01 22:14:12,206 INFO L226 Difference]: Without dead ends: 1349 [2023-04-01 22:14:12,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 278 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:14:12,207 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 172 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-01 22:14:12,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 24 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-01 22:14:12,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2023-04-01 22:14:12,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1347. [2023-04-01 22:14:12,238 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, (87), 10 states have call predecessors, (87), 10 states have call successors, (87) [2023-04-01 22:14:12,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1565 transitions. [2023-04-01 22:14:12,241 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1565 transitions. Word has length 272 [2023-04-01 22:14:12,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:14:12,241 INFO L495 AbstractCegarLoop]: Abstraction has 1347 states and 1565 transitions. [2023-04-01 22:14:12,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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:14:12,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1565 transitions. [2023-04-01 22:14:12,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2023-04-01 22:14:12,246 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:14:12,247 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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, 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] [2023-04-01 22:14:12,253 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:14:12,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:14:12,453 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:14:12,454 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:14:12,454 INFO L85 PathProgramCache]: Analyzing trace with hash -568233614, now seen corresponding path program 1 times [2023-04-01 22:14:12,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:14:12,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313027559] [2023-04-01 22:14:12,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:14:12,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:14:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:13,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:14:13,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:13,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 22:14:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:13,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-04-01 22:14:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:13,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-04-01 22:14:13,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:13,411 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 120 proven. 167 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-04-01 22:14:13,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:14:13,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313027559] [2023-04-01 22:14:13,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313027559] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 22:14:13,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286825417] [2023-04-01 22:14:13,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:14:13,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:14:13,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 22:14:13,413 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:14:13,416 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:14:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:13,573 INFO L262 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 12 conjunts are in the unsatisfiable core [2023-04-01 22:14:13,577 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 22:14:14,156 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 277 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-04-01 22:14:14,156 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 22:14:16,493 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 47 proven. 243 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-01 22:14:16,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286825417] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 22:14:16,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 22:14:16,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2023-04-01 22:14:16,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815189575] [2023-04-01 22:14:16,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 22:14:16,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-04-01 22:14:16,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:14:16,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-04-01 22:14:16,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-04-01 22:14:16,499 INFO L87 Difference]: Start difference. First operand 1347 states and 1565 transitions. Second operand has 20 states, 20 states have (on average 37.85) internal successors, (757), 18 states have internal predecessors, (757), 7 states have call successors, (13), 10 states have call predecessors, (13), 9 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2023-04-01 22:14:20,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:14:20,104 INFO L93 Difference]: Finished difference Result 4458 states and 5412 transitions. [2023-04-01 22:14:20,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-04-01 22:14:20,105 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 37.85) internal successors, (757), 18 states have internal predecessors, (757), 7 states have call successors, (13), 10 states have call predecessors, (13), 9 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) Word has length 311 [2023-04-01 22:14:20,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:14:20,117 INFO L225 Difference]: With dead ends: 4458 [2023-04-01 22:14:20,117 INFO L226 Difference]: Without dead ends: 3260 [2023-04-01 22:14:20,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 640 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=593, Invalid=1857, Unknown=0, NotChecked=0, Total=2450 [2023-04-01 22:14:20,122 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 3507 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 4264 mSolverCounterSat, 666 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3507 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 4930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 666 IncrementalHoareTripleChecker+Valid, 4264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-04-01 22:14:20,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3507 Valid, 157 Invalid, 4930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [666 Valid, 4264 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-04-01 22:14:20,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3260 states. [2023-04-01 22:14:20,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3260 to 2958. [2023-04-01 22:14:20,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2958 states, 2869 states have (on average 1.109794353433252) internal successors, (3184), 2914 states have internal predecessors, (3184), 22 states have call successors, (22), 22 states have call predecessors, (22), 66 states have return successors, (226), 21 states have call predecessors, (226), 21 states have call successors, (226) [2023-04-01 22:14:20,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2958 states to 2958 states and 3432 transitions. [2023-04-01 22:14:20,199 INFO L78 Accepts]: Start accepts. Automaton has 2958 states and 3432 transitions. Word has length 311 [2023-04-01 22:14:20,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:14:20,199 INFO L495 AbstractCegarLoop]: Abstraction has 2958 states and 3432 transitions. [2023-04-01 22:14:20,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 37.85) internal successors, (757), 18 states have internal predecessors, (757), 7 states have call successors, (13), 10 states have call predecessors, (13), 9 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2023-04-01 22:14:20,200 INFO L276 IsEmpty]: Start isEmpty. Operand 2958 states and 3432 transitions. [2023-04-01 22:14:20,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2023-04-01 22:14:20,206 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:14:20,206 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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, 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] [2023-04-01 22:14:20,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-04-01 22:14:20,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:14:20,414 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:14:20,415 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:14:20,415 INFO L85 PathProgramCache]: Analyzing trace with hash -180369473, now seen corresponding path program 1 times [2023-04-01 22:14:20,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:14:20,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057696757] [2023-04-01 22:14:20,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:14:20,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:14:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-01 22:14:20,514 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-04-01 22:14:20,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-01 22:14:20,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-04-01 22:14:20,672 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-04-01 22:14:20,673 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-01 22:14:20,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-04-01 22:14:20,679 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 22:14:20,684 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-01 22:14:20,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.04 10:14:20 BoogieIcfgContainer [2023-04-01 22:14:20,818 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-01 22:14:20,819 INFO L158 Benchmark]: Toolchain (without parser) took 24443.80ms. Allocated memory was 284.2MB in the beginning and 625.0MB in the end (delta: 340.8MB). Free memory was 239.6MB in the beginning and 551.6MB in the end (delta: -312.0MB). Peak memory consumption was 364.1MB. Max. memory is 8.0GB. [2023-04-01 22:14:20,819 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 189.8MB. Free memory is still 136.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-01 22:14:20,819 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.07ms. Allocated memory is still 284.2MB. Free memory was 239.4MB in the beginning and 211.6MB in the end (delta: 27.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2023-04-01 22:14:20,819 INFO L158 Benchmark]: Boogie Preprocessor took 109.75ms. Allocated memory is still 284.2MB. Free memory was 211.6MB in the beginning and 207.2MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-04-01 22:14:20,819 INFO L158 Benchmark]: RCFGBuilder took 1175.92ms. Allocated memory is still 284.2MB. Free memory was 207.2MB in the beginning and 194.3MB in the end (delta: 12.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2023-04-01 22:14:20,820 INFO L158 Benchmark]: TraceAbstraction took 22651.20ms. Allocated memory was 284.2MB in the beginning and 625.0MB in the end (delta: 340.8MB). Free memory was 193.8MB in the beginning and 551.6MB in the end (delta: -357.8MB). Peak memory consumption was 316.9MB. Max. memory is 8.0GB. [2023-04-01 22:14:20,821 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.14ms. Allocated memory is still 189.8MB. Free memory is still 136.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 500.07ms. Allocated memory is still 284.2MB. Free memory was 239.4MB in the beginning and 211.6MB in the end (delta: 27.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 109.75ms. Allocated memory is still 284.2MB. Free memory was 211.6MB in the beginning and 207.2MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1175.92ms. Allocated memory is still 284.2MB. Free memory was 207.2MB in the beginning and 194.3MB in the end (delta: 12.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 22651.20ms. Allocated memory was 284.2MB in the beginning and 625.0MB in the end (delta: 340.8MB). Free memory was 193.8MB in the beginning and 551.6MB in the end (delta: -357.8MB). Peak memory consumption was 316.9MB. 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: 59]: 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)=518115, \old(a10)=518112, \old(a12)=518114, \old(a19)=518108, \old(a4)=518113, \old(inputB)=518106, \old(inputC)=518109, \old(inputD)=518107, \old(inputE)=518116, \old(inputF)=518110, 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=2, 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)=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L281] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L287] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L293] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, 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)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L536] COND TRUE ((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0))))) [L537] a1 = (((a1 * 5) + 278443) - -239546) [L538] return 26; VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, \result=26, a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, 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=0, a12=0, a19=9, a1=518104, a4=14, calculate_output(input)=26, input=2, 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=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=26] [L600] CALL, EXPR calculate_output(input) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND TRUE (((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0)) [L255] a1 = (((((a1 % 25)- -13) - 42605) / 5) - -8517) [L256] a10 = 3 [L258] return 26; VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, \result=26, a10=3, a12=0, a19=9, a1=0, 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=3, a12=0, a19=9, a1=0, a4=14, calculate_output(input)=26, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=26] [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=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=26] [L600] CALL, EXPR calculate_output(input) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, 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)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L281] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L287] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L293] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L322] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L336] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L355] COND TRUE (((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14)) [L356] a1 = ((((a1 - 287698) - 189392) % 89)+ 206) [L357] a10 = 2 [L358] a19 = 7 [L360] return -1; VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, \result=-1, a10=2, a12=0, a19=7, a1=156, a4=14, input=5, 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=2, a12=0, a19=7, a1=156, a4=14, calculate_output(input)=-1, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=26] [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=2, a12=0, a19=7, a1=156, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L600] CALL calculate_output(input) VAL [\old(a1)=156, \old(a10)=2, \old(a19)=7, \old(input)=2, a10=2, a12=0, a19=7, a1=156, 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)=156, \old(a10)=2, \old(a19)=7, \old(input)=2, a10=2, a12=0, a19=7, a1=156, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=156, \old(a10)=2, \old(a19)=7, \old(input)=2, a10=2, a12=0, a19=7, a1=156, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=156, \old(a10)=2, \old(a19)=7, \old(input)=2, a10=2, a12=0, a19=7, a1=156, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=156, \old(a10)=2, \old(a19)=7, \old(input)=2, a10=2, a12=0, a19=7, a1=156, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=156, \old(a10)=2, \old(a19)=7, \old(input)=2, a10=2, a12=0, a19=7, a1=156, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=156, \old(a10)=2, \old(a19)=7, \old(input)=2, a10=2, a12=0, a19=7, a1=156, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=156, \old(a10)=2, \old(a19)=7, \old(input)=2, a10=2, a12=0, a19=7, a1=156, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=156, \old(a10)=2, \old(a19)=7, \old(input)=2, a10=2, a12=0, a19=7, a1=156, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=156, \old(a10)=2, \old(a19)=7, \old(input)=2, a10=2, a12=0, a19=7, a1=156, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND TRUE (((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)) VAL [\old(a1)=156, \old(a10)=2, \old(a19)=7, \old(input)=2, a10=2, a12=0, a19=7, a1=156, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] reach_error() VAL [\old(a1)=156, \old(a10)=2, \old(a19)=7, \old(input)=2, a10=2, a12=0, a19=7, a1=156, a4=14, input=2, 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: 22.5s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8274 SdHoareTripleChecker+Valid, 9.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8274 mSDsluCounter, 560 SdHoareTripleChecker+Invalid, 7.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 373 mSDsCounter, 1813 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11330 IncrementalHoareTripleChecker+Invalid, 13143 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1813 mSolverCounterUnsat, 187 mSDtfsCounter, 11330 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2300 GetRequests, 2164 SyntacticMatches, 3 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2958occurred in iteration=9, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 1385 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 3219 NumberOfCodeBlocks, 3219 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3598 ConstructedInterpolants, 0 QuantifiedInterpolants, 14439 SizeOfPredicates, 5 NumberOfNonLiveVariables, 2751 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 19 InterpolantComputations, 6 PerfectInterpolantSequences, 1563/2063 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:14:20,841 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...