/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/Problem02_label50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 20:22:44,099 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 20:22:44,100 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 20:22:44,120 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 20:22:44,120 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 20:22:44,121 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 20:22:44,122 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 20:22:44,123 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 20:22:44,124 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 20:22:44,125 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 20:22:44,125 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 20:22:44,126 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 20:22:44,126 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 20:22:44,127 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 20:22:44,127 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 20:22:44,128 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 20:22:44,129 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 20:22:44,129 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 20:22:44,130 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 20:22:44,131 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 20:22:44,132 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 20:22:44,133 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 20:22:44,133 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 20:22:44,134 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 20:22:44,136 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 20:22:44,136 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 20:22:44,136 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 20:22:44,137 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 20:22:44,137 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 20:22:44,138 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 20:22:44,138 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 20:22:44,139 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 20:22:44,139 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 20:22:44,140 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 20:22:44,140 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 20:22:44,140 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 20:22:44,141 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 20:22:44,141 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 20:22:44,141 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 20:22:44,142 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 20:22:44,142 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 20:22:44,148 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 20:22:44,174 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 20:22:44,175 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 20:22:44,175 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 20:22:44,175 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 20:22:44,176 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 20:22:44,176 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 20:22:44,177 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-04-01 20:22:44,177 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-04-01 20:22:44,177 INFO L138 SettingsManager]: * Use SBE=true [2023-04-01 20:22:44,177 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 20:22:44,177 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 20:22:44,178 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 20:22:44,178 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 20:22:44,178 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 20:22:44,178 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 20:22:44,178 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 20:22:44,178 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 20:22:44,178 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 20:22:44,178 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 20:22:44,178 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 20:22:44,178 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 20:22:44,179 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 20:22:44,179 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-04-01 20:22:44,179 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 20:22:44,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 20:22:44,179 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 20:22:44,179 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 20:22:44,179 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 20:22:44,179 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-04-01 20:22:44,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 20:22:44,180 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-04-01 20:22:44,180 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 20:22:44,180 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-04-01 20:22:44,180 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-04-01 20:22:44,180 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-04-01 20:22:44,180 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 20:22:44,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 20:22:44,355 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 20:22:44,357 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 20:22:44,358 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 20:22:44,358 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 20:22:44,359 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label50.c [2023-04-01 20:22:45,355 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 20:22:45,560 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 20:22:45,561 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label50.c [2023-04-01 20:22:45,569 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa0aee8af/5ef755217fd647f6b4d963d56c37ac87/FLAG11227136f [2023-04-01 20:22:45,581 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa0aee8af/5ef755217fd647f6b4d963d56c37ac87 [2023-04-01 20:22:45,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 20:22:45,583 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 20:22:45,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 20:22:45,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 20:22:45,586 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 20:22:45,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 08:22:45" (1/1) ... [2023-04-01 20:22:45,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3588e29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:22:45, skipping insertion in model container [2023-04-01 20:22:45,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 08:22:45" (1/1) ... [2023-04-01 20:22:45,592 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 20:22:45,630 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 20:22:45,923 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/Problem02_label50.c[14631,14644] [2023-04-01 20:22:45,966 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 20:22:45,975 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 20:22:46,039 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/Problem02_label50.c[14631,14644] [2023-04-01 20:22:46,070 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 20:22:46,079 INFO L208 MainTranslator]: Completed translation [2023-04-01 20:22:46,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:22:46 WrapperNode [2023-04-01 20:22:46,080 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 20:22:46,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 20:22:46,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 20:22:46,081 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 20:22:46,105 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:22:46" (1/1) ... [2023-04-01 20:22:46,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:22:46" (1/1) ... [2023-04-01 20:22:46,140 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:22:46" (1/1) ... [2023-04-01 20:22:46,141 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:22:46" (1/1) ... [2023-04-01 20:22:46,174 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:22:46" (1/1) ... [2023-04-01 20:22:46,180 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:22:46" (1/1) ... [2023-04-01 20:22:46,182 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:22:46" (1/1) ... [2023-04-01 20:22:46,185 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:22:46" (1/1) ... [2023-04-01 20:22:46,196 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 20:22:46,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 20:22:46,197 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 20:22:46,197 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 20:22:46,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:22:46" (1/1) ... [2023-04-01 20:22:46,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 20:22:46,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:22:46,230 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 20:22:46,254 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 20:22:46,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 20:22:46,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 20:22:46,270 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 20:22:46,270 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2023-04-01 20:22:46,270 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 20:22:46,270 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2023-04-01 20:22:46,270 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 20:22:46,270 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 20:22:46,270 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 20:22:46,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 20:22:46,271 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-01 20:22:46,271 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2023-04-01 20:22:46,271 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 20:22:46,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 20:22:46,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 20:22:46,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 20:22:46,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 20:22:46,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 20:22:46,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 20:22:46,339 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 20:22:46,340 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 20:22:46,996 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 20:22:47,009 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 20:22:47,009 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-04-01 20:22:47,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 08:22:47 BoogieIcfgContainer [2023-04-01 20:22:47,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 20:22:47,015 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 20:22:47,015 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 20:22:47,017 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 20:22:47,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 08:22:45" (1/3) ... [2023-04-01 20:22:47,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b420a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 08:22:47, skipping insertion in model container [2023-04-01 20:22:47,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:22:46" (2/3) ... [2023-04-01 20:22:47,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b420a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 08:22:47, skipping insertion in model container [2023-04-01 20:22:47,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 08:22:47" (3/3) ... [2023-04-01 20:22:47,019 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label50.c [2023-04-01 20:22:47,030 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 20:22:47,031 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 20:22:47,079 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 20:22:47,084 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;@6b5a990f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-04-01 20:22:47,085 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 20:22:47,088 INFO L276 IsEmpty]: Start isEmpty. Operand has 236 states, 228 states have (on average 1.6578947368421053) internal successors, (378), 229 states have internal predecessors, (378), 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 20:22:47,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-04-01 20:22:47,099 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:22:47,099 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:22:47,100 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:22:47,104 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:22:47,104 INFO L85 PathProgramCache]: Analyzing trace with hash 863149356, now seen corresponding path program 1 times [2023-04-01 20:22:47,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:22:47,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927802717] [2023-04-01 20:22:47,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:22:47,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:22:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:22:47,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:22:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:22:47,681 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 20:22:47,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:22:47,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927802717] [2023-04-01 20:22:47,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927802717] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 20:22:47,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 20:22:47,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-04-01 20:22:47,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036761546] [2023-04-01 20:22:47,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 20:22:47,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 20:22:47,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:22:47,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 20:22:47,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-04-01 20:22:47,725 INFO L87 Difference]: Start difference. First operand has 236 states, 228 states have (on average 1.6578947368421053) internal successors, (378), 229 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 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 20:22:48,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:22:48,896 INFO L93 Difference]: Finished difference Result 813 states and 1406 transitions. [2023-04-01 20:22:48,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-01 20:22:48,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 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 87 [2023-04-01 20:22:48,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:22:48,908 INFO L225 Difference]: With dead ends: 813 [2023-04-01 20:22:48,908 INFO L226 Difference]: Without dead ends: 488 [2023-04-01 20:22:48,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-04-01 20:22:48,917 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 889 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-04-01 20:22:48,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 49 Invalid, 1113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-04-01 20:22:48,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2023-04-01 20:22:48,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 481. [2023-04-01 20:22:48,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 469 states have (on average 1.443496801705757) internal successors, (677), 471 states have internal predecessors, (677), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-04-01 20:22:48,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 692 transitions. [2023-04-01 20:22:48,968 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 692 transitions. Word has length 87 [2023-04-01 20:22:48,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:22:48,969 INFO L495 AbstractCegarLoop]: Abstraction has 481 states and 692 transitions. [2023-04-01 20:22:48,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 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 20:22:48,969 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 692 transitions. [2023-04-01 20:22:48,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-04-01 20:22:48,972 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:22:48,972 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 20:22:48,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 20:22:48,973 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:22:48,973 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:22:48,973 INFO L85 PathProgramCache]: Analyzing trace with hash 975764216, now seen corresponding path program 1 times [2023-04-01 20:22:48,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:22:48,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563721934] [2023-04-01 20:22:48,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:22:48,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:22:48,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:22:49,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:22:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:22:49,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 20:22:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:22:49,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 20:22:49,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:22:49,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563721934] [2023-04-01 20:22:49,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563721934] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 20:22:49,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036479890] [2023-04-01 20:22:49,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:22:49,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:22:49,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:22:49,146 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 20:22:49,194 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 20:22:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:22:49,245 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-01 20:22:49,250 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:22:49,447 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 20:22:49,448 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 20:22:49,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036479890] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 20:22:49,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-01 20:22:49,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-04-01 20:22:49,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100536080] [2023-04-01 20:22:49,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 20:22:49,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-01 20:22:49,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:22:49,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-01 20:22:49,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-04-01 20:22:49,450 INFO L87 Difference]: Start difference. First operand 481 states and 692 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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 20:22:49,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:22:49,800 INFO L93 Difference]: Finished difference Result 1396 states and 2040 transitions. [2023-04-01 20:22:49,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-01 20:22:49,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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 95 [2023-04-01 20:22:49,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:22:49,813 INFO L225 Difference]: With dead ends: 1396 [2023-04-01 20:22:49,813 INFO L226 Difference]: Without dead ends: 921 [2023-04-01 20:22:49,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-04-01 20:22:49,817 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 76 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-01 20:22:49,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 280 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-01 20:22:49,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2023-04-01 20:22:49,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 919. [2023-04-01 20:22:49,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 899 states have (on average 1.3870967741935485) internal successors, (1247), 903 states have internal predecessors, (1247), 8 states have call successors, (8), 8 states have call predecessors, (8), 11 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) [2023-04-01 20:22:49,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1288 transitions. [2023-04-01 20:22:49,854 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1288 transitions. Word has length 95 [2023-04-01 20:22:49,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:22:49,854 INFO L495 AbstractCegarLoop]: Abstraction has 919 states and 1288 transitions. [2023-04-01 20:22:49,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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 20:22:49,855 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1288 transitions. [2023-04-01 20:22:49,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-04-01 20:22:49,862 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:22:49,863 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 20:22:49,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-01 20:22:50,067 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 20:22:50,068 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:22:50,068 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:22:50,068 INFO L85 PathProgramCache]: Analyzing trace with hash -589691196, now seen corresponding path program 1 times [2023-04-01 20:22:50,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:22:50,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727416477] [2023-04-01 20:22:50,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:22:50,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:22:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:22:50,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:22:50,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:22:50,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 20:22:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:22:50,215 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 20:22:50,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:22:50,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727416477] [2023-04-01 20:22:50,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727416477] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 20:22:50,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 20:22:50,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-01 20:22:50,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930226598] [2023-04-01 20:22:50,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 20:22:50,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-01 20:22:50,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:22:50,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-01 20:22:50,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-04-01 20:22:50,222 INFO L87 Difference]: Start difference. First operand 919 states and 1288 transitions. Second operand has 7 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 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 20:22:51,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:22:51,087 INFO L93 Difference]: Finished difference Result 2770 states and 4117 transitions. [2023-04-01 20:22:51,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-01 20:22:51,087 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 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 101 [2023-04-01 20:22:51,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:22:51,094 INFO L225 Difference]: With dead ends: 2770 [2023-04-01 20:22:51,095 INFO L226 Difference]: Without dead ends: 1857 [2023-04-01 20:22:51,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-04-01 20:22:51,098 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 616 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-04-01 20:22:51,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 85 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-04-01 20:22:51,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1857 states. [2023-04-01 20:22:51,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1857 to 1819. [2023-04-01 20:22:51,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1819 states, 1768 states have (on average 1.3082579185520362) internal successors, (2313), 1791 states have internal predecessors, (2313), 14 states have call successors, (14), 14 states have call predecessors, (14), 36 states have return successors, (169), 13 states have call predecessors, (169), 13 states have call successors, (169) [2023-04-01 20:22:51,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 1819 states and 2496 transitions. [2023-04-01 20:22:51,229 INFO L78 Accepts]: Start accepts. Automaton has 1819 states and 2496 transitions. Word has length 101 [2023-04-01 20:22:51,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:22:51,230 INFO L495 AbstractCegarLoop]: Abstraction has 1819 states and 2496 transitions. [2023-04-01 20:22:51,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 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 20:22:51,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1819 states and 2496 transitions. [2023-04-01 20:22:51,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-04-01 20:22:51,233 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:22:51,233 INFO L195 NwaCegarLoop]: trace histogram [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 20:22:51,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-04-01 20:22:51,233 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:22:51,234 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:22:51,234 INFO L85 PathProgramCache]: Analyzing trace with hash -972242393, now seen corresponding path program 1 times [2023-04-01 20:22:51,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:22:51,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949683568] [2023-04-01 20:22:51,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:22:51,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:22:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:22:51,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:22:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:22:51,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 20:22:51,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:22:51,446 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 20:22:51,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:22:51,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949683568] [2023-04-01 20:22:51,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949683568] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 20:22:51,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 20:22:51,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-04-01 20:22:51,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876498538] [2023-04-01 20:22:51,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 20:22:51,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-04-01 20:22:51,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:22:51,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-04-01 20:22:51,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-04-01 20:22:51,448 INFO L87 Difference]: Start difference. First operand 1819 states and 2496 transitions. Second operand has 8 states, 7 states have (on average 15.571428571428571) internal successors, (109), 5 states have internal predecessors, (109), 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 20:22:52,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:22:52,796 INFO L93 Difference]: Finished difference Result 5012 states and 6998 transitions. [2023-04-01 20:22:52,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-01 20:22:52,797 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 15.571428571428571) internal successors, (109), 5 states have internal predecessors, (109), 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 115 [2023-04-01 20:22:52,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:22:52,806 INFO L225 Difference]: With dead ends: 5012 [2023-04-01 20:22:52,806 INFO L226 Difference]: Without dead ends: 3199 [2023-04-01 20:22:52,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2023-04-01 20:22:52,810 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 1369 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1369 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-04-01 20:22:52,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1369 Valid, 98 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-04-01 20:22:52,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3199 states. [2023-04-01 20:22:52,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3199 to 3177. [2023-04-01 20:22:52,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3177 states, 3079 states have (on average 1.1753816174082494) internal successors, (3619), 3131 states have internal predecessors, (3619), 23 states have call successors, (23), 23 states have call predecessors, (23), 74 states have return successors, (280), 22 states have call predecessors, (280), 22 states have call successors, (280) [2023-04-01 20:22:52,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3177 states to 3177 states and 3922 transitions. [2023-04-01 20:22:52,881 INFO L78 Accepts]: Start accepts. Automaton has 3177 states and 3922 transitions. Word has length 115 [2023-04-01 20:22:52,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:22:52,882 INFO L495 AbstractCegarLoop]: Abstraction has 3177 states and 3922 transitions. [2023-04-01 20:22:52,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 15.571428571428571) internal successors, (109), 5 states have internal predecessors, (109), 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 20:22:52,882 INFO L276 IsEmpty]: Start isEmpty. Operand 3177 states and 3922 transitions. [2023-04-01 20:22:52,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-04-01 20:22:52,886 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:22:52,886 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:22:52,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-04-01 20:22:52,886 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:22:52,886 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:22:52,886 INFO L85 PathProgramCache]: Analyzing trace with hash 577607829, now seen corresponding path program 1 times [2023-04-01 20:22:52,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:22:52,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282099367] [2023-04-01 20:22:52,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:22:52,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:22:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:22:53,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:22:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:22:53,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 20:22:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:22:53,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-04-01 20:22:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:22:53,047 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 45 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 20:22:53,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:22:53,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282099367] [2023-04-01 20:22:53,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282099367] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 20:22:53,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965895351] [2023-04-01 20:22:53,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:22:53,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:22:53,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:22:53,061 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 20:22:53,062 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 20:22:53,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:22:53,143 INFO L262 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 7 conjunts are in the unsatisfiable core [2023-04-01 20:22:53,146 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:22:53,185 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 46 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 20:22:53,185 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:22:53,268 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 46 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 20:22:53,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965895351] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:22:53,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 20:22:53,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 9 [2023-04-01 20:22:53,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110858695] [2023-04-01 20:22:53,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 20:22:53,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-01 20:22:53,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:22:53,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-01 20:22:53,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-04-01 20:22:53,269 INFO L87 Difference]: Start difference. First operand 3177 states and 3922 transitions. Second operand has 9 states, 9 states have (on average 16.333333333333332) internal successors, (147), 7 states have internal predecessors, (147), 3 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-04-01 20:22:54,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:22:54,492 INFO L93 Difference]: Finished difference Result 8054 states and 9964 transitions. [2023-04-01 20:22:54,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-01 20:22:54,493 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.333333333333332) internal successors, (147), 7 states have internal predecessors, (147), 3 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 128 [2023-04-01 20:22:54,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:22:54,507 INFO L225 Difference]: With dead ends: 8054 [2023-04-01 20:22:54,507 INFO L226 Difference]: Without dead ends: 4575 [2023-04-01 20:22:54,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-04-01 20:22:54,513 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 713 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 1905 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 2049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-04-01 20:22:54,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 122 Invalid, 2049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1905 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-04-01 20:22:54,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4575 states. [2023-04-01 20:22:54,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4575 to 4556. [2023-04-01 20:22:54,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4556 states, 4402 states have (on average 1.1363016810540663) internal successors, (5002), 4491 states have internal predecessors, (5002), 33 states have call successors, (33), 32 states have call predecessors, (33), 120 states have return successors, (424), 32 states have call predecessors, (424), 32 states have call successors, (424) [2023-04-01 20:22:54,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4556 states to 4556 states and 5459 transitions. [2023-04-01 20:22:54,599 INFO L78 Accepts]: Start accepts. Automaton has 4556 states and 5459 transitions. Word has length 128 [2023-04-01 20:22:54,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:22:54,599 INFO L495 AbstractCegarLoop]: Abstraction has 4556 states and 5459 transitions. [2023-04-01 20:22:54,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.333333333333332) internal successors, (147), 7 states have internal predecessors, (147), 3 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-04-01 20:22:54,599 INFO L276 IsEmpty]: Start isEmpty. Operand 4556 states and 5459 transitions. [2023-04-01 20:22:54,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-04-01 20:22:54,604 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:22:54,604 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:22:54,620 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 20:22:54,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:22:54,810 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:22:54,811 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:22:54,811 INFO L85 PathProgramCache]: Analyzing trace with hash 715952805, now seen corresponding path program 1 times [2023-04-01 20:22:54,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:22:54,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278710127] [2023-04-01 20:22:54,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:22:54,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:22:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:22:54,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:22:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:22:54,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 20:22:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:22:54,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-04-01 20:22:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:22:54,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-04-01 20:22:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:22:54,981 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 72 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-01 20:22:54,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:22:54,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278710127] [2023-04-01 20:22:54,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278710127] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 20:22:54,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221590642] [2023-04-01 20:22:54,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:22:54,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:22:54,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:22:54,997 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 20:22:55,029 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 20:22:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:22:55,119 INFO L262 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-01 20:22:55,126 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:22:55,169 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 74 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-04-01 20:22:55,169 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:22:55,242 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 74 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-04-01 20:22:55,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221590642] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:22:55,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 20:22:55,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2023-04-01 20:22:55,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886811238] [2023-04-01 20:22:55,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 20:22:55,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-04-01 20:22:55,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:22:55,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-04-01 20:22:55,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-04-01 20:22:55,248 INFO L87 Difference]: Start difference. First operand 4556 states and 5459 transitions. Second operand has 12 states, 12 states have (on average 12.666666666666666) internal successors, (152), 10 states have internal predecessors, (152), 4 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-04-01 20:22:57,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:22:57,644 INFO L93 Difference]: Finished difference Result 9454 states and 11375 transitions. [2023-04-01 20:22:57,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-04-01 20:22:57,644 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 12.666666666666666) internal successors, (152), 10 states have internal predecessors, (152), 4 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 139 [2023-04-01 20:22:57,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:22:57,658 INFO L225 Difference]: With dead ends: 9454 [2023-04-01 20:22:57,659 INFO L226 Difference]: Without dead ends: 4316 [2023-04-01 20:22:57,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 289 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2023-04-01 20:22:57,666 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2775 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 2558 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2775 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 2877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 2558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-04-01 20:22:57,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2775 Valid, 110 Invalid, 2877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 2558 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-04-01 20:22:57,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4316 states. [2023-04-01 20:22:57,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4316 to 4314. [2023-04-01 20:22:57,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4314 states, 4200 states have (on average 1.1002380952380952) internal successors, (4621), 4252 states have internal predecessors, (4621), 31 states have call successors, (31), 31 states have call predecessors, (31), 82 states have return successors, (289), 30 states have call predecessors, (289), 30 states have call successors, (289) [2023-04-01 20:22:57,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4314 states to 4314 states and 4941 transitions. [2023-04-01 20:22:57,757 INFO L78 Accepts]: Start accepts. Automaton has 4314 states and 4941 transitions. Word has length 139 [2023-04-01 20:22:57,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:22:57,757 INFO L495 AbstractCegarLoop]: Abstraction has 4314 states and 4941 transitions. [2023-04-01 20:22:57,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.666666666666666) internal successors, (152), 10 states have internal predecessors, (152), 4 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-04-01 20:22:57,758 INFO L276 IsEmpty]: Start isEmpty. Operand 4314 states and 4941 transitions. [2023-04-01 20:22:57,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-04-01 20:22:57,761 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:22:57,762 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:22:57,789 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 20:22:57,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:22:57,969 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:22:57,969 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:22:57,969 INFO L85 PathProgramCache]: Analyzing trace with hash 478923355, now seen corresponding path program 1 times [2023-04-01 20:22:57,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:22:57,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382424426] [2023-04-01 20:22:57,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:22:57,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:22:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:22:58,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:22:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:22:58,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 20:22:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:22:58,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-04-01 20:22:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:22:58,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-04-01 20:22:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:22:58,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-04-01 20:22:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:22:58,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-04-01 20:22:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:22:58,339 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 66 proven. 20 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-04-01 20:22:58,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:22:58,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382424426] [2023-04-01 20:22:58,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382424426] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 20:22:58,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171730319] [2023-04-01 20:22:58,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:22:58,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:22:58,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:22:58,341 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 20:22:58,342 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 20:22:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:22:58,437 INFO L262 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-01 20:22:58,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:22:58,471 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 88 proven. 2 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-04-01 20:22:58,471 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:22:58,534 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 86 proven. 18 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-04-01 20:22:58,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171730319] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:22:58,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 20:22:58,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 13 [2023-04-01 20:22:58,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339909705] [2023-04-01 20:22:58,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 20:22:58,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-01 20:22:58,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:22:58,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-01 20:22:58,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-04-01 20:22:58,536 INFO L87 Difference]: Start difference. First operand 4314 states and 4941 transitions. Second operand has 13 states, 13 states have (on average 10.615384615384615) internal successors, (138), 11 states have internal predecessors, (138), 4 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-04-01 20:23:00,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:23:00,024 INFO L93 Difference]: Finished difference Result 6878 states and 7831 transitions. [2023-04-01 20:23:00,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-04-01 20:23:00,027 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.615384615384615) internal successors, (138), 11 states have internal predecessors, (138), 4 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 154 [2023-04-01 20:23:00,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:23:00,031 INFO L225 Difference]: With dead ends: 6878 [2023-04-01 20:23:00,031 INFO L226 Difference]: Without dead ends: 1640 [2023-04-01 20:23:00,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 323 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2023-04-01 20:23:00,053 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 1318 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1480 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1318 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-04-01 20:23:00,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1318 Valid, 74 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1480 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-04-01 20:23:00,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2023-04-01 20:23:00,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1638. [2023-04-01 20:23:00,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1638 states, 1594 states have (on average 1.0382685069008784) internal successors, (1655), 1612 states have internal predecessors, (1655), 13 states have call successors, (13), 13 states have call predecessors, (13), 30 states have return successors, (55), 12 states have call predecessors, (55), 12 states have call successors, (55) [2023-04-01 20:23:00,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 1723 transitions. [2023-04-01 20:23:00,107 INFO L78 Accepts]: Start accepts. Automaton has 1638 states and 1723 transitions. Word has length 154 [2023-04-01 20:23:00,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:23:00,108 INFO L495 AbstractCegarLoop]: Abstraction has 1638 states and 1723 transitions. [2023-04-01 20:23:00,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.615384615384615) internal successors, (138), 11 states have internal predecessors, (138), 4 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-04-01 20:23:00,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 1723 transitions. [2023-04-01 20:23:00,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2023-04-01 20:23:00,110 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:23:00,110 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, 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] [2023-04-01 20:23:00,129 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 20:23:00,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:23:00,311 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:23:00,311 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:23:00,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1642161590, now seen corresponding path program 1 times [2023-04-01 20:23:00,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:23:00,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778653312] [2023-04-01 20:23:00,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:23:00,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:23:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:23:00,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:23:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:23:00,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 20:23:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:23:00,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-04-01 20:23:00,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:23:00,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-04-01 20:23:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:23:00,864 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 135 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-04-01 20:23:00,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:23:00,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778653312] [2023-04-01 20:23:00,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778653312] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 20:23:00,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806072556] [2023-04-01 20:23:00,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:23:00,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:23:00,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:23:00,881 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 20:23:00,889 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 20:23:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:23:00,994 INFO L262 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 10 conjunts are in the unsatisfiable core [2023-04-01 20:23:00,997 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:23:01,087 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 136 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-04-01 20:23:01,087 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:23:01,329 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 136 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-04-01 20:23:01,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806072556] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:23:01,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 20:23:01,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2023-04-01 20:23:01,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172213289] [2023-04-01 20:23:01,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 20:23:01,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-01 20:23:01,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:23:01,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-01 20:23:01,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-04-01 20:23:01,331 INFO L87 Difference]: Start difference. First operand 1638 states and 1723 transitions. Second operand has 13 states, 13 states have (on average 15.076923076923077) internal successors, (196), 11 states have internal predecessors, (196), 6 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2023-04-01 20:23:03,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:23:03,204 INFO L93 Difference]: Finished difference Result 2838 states and 2995 transitions. [2023-04-01 20:23:03,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-04-01 20:23:03,205 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 15.076923076923077) internal successors, (196), 11 states have internal predecessors, (196), 6 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 197 [2023-04-01 20:23:03,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:23:03,208 INFO L225 Difference]: With dead ends: 2838 [2023-04-01 20:23:03,208 INFO L226 Difference]: Without dead ends: 1342 [2023-04-01 20:23:03,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 407 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=192, Invalid=620, Unknown=0, NotChecked=0, Total=812 [2023-04-01 20:23:03,210 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 964 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 2900 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 3019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 2900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-04-01 20:23:03,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [964 Valid, 103 Invalid, 3019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 2900 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-04-01 20:23:03,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2023-04-01 20:23:03,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1332. [2023-04-01 20:23:03,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1332 states, 1299 states have (on average 1.031562740569669) internal successors, (1340), 1310 states have internal predecessors, (1340), 11 states have call successors, (11), 11 states have call predecessors, (11), 21 states have return successors, (36), 10 states have call predecessors, (36), 10 states have call successors, (36) [2023-04-01 20:23:03,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 1387 transitions. [2023-04-01 20:23:03,232 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 1387 transitions. Word has length 197 [2023-04-01 20:23:03,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:23:03,232 INFO L495 AbstractCegarLoop]: Abstraction has 1332 states and 1387 transitions. [2023-04-01 20:23:03,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 15.076923076923077) internal successors, (196), 11 states have internal predecessors, (196), 6 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2023-04-01 20:23:03,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 1387 transitions. [2023-04-01 20:23:03,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-04-01 20:23:03,234 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:23:03,235 INFO L195 NwaCegarLoop]: trace histogram [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, 2, 2, 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] [2023-04-01 20:23:03,242 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 20:23:03,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:23:03,440 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:23:03,441 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:23:03,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1816663788, now seen corresponding path program 1 times [2023-04-01 20:23:03,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:23:03,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278153996] [2023-04-01 20:23:03,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:23:03,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:23:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-01 20:23:03,481 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-04-01 20:23:03,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-01 20:23:03,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-04-01 20:23:03,549 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-04-01 20:23:03,550 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-01 20:23:03,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-04-01 20:23:03,555 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 20:23:03,559 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-01 20:23:03,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.04 08:23:03 BoogieIcfgContainer [2023-04-01 20:23:03,680 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-01 20:23:03,680 INFO L158 Benchmark]: Toolchain (without parser) took 18097.01ms. Allocated memory was 198.2MB in the beginning and 512.8MB in the end (delta: 314.6MB). Free memory was 151.5MB in the beginning and 277.6MB in the end (delta: -126.1MB). Peak memory consumption was 189.5MB. Max. memory is 8.0GB. [2023-04-01 20:23:03,680 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 198.2MB. Free memory is still 149.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-01 20:23:03,681 INFO L158 Benchmark]: CACSL2BoogieTranslator took 496.02ms. Allocated memory is still 198.2MB. Free memory was 151.5MB in the beginning and 124.9MB in the end (delta: 26.6MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2023-04-01 20:23:03,681 INFO L158 Benchmark]: Boogie Preprocessor took 115.10ms. Allocated memory is still 198.2MB. Free memory was 124.9MB in the beginning and 120.0MB in the end (delta: 4.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-04-01 20:23:03,681 INFO L158 Benchmark]: RCFGBuilder took 816.25ms. Allocated memory was 198.2MB in the beginning and 287.3MB in the end (delta: 89.1MB). Free memory was 120.0MB in the beginning and 211.4MB in the end (delta: -91.4MB). Peak memory consumption was 37.6MB. Max. memory is 8.0GB. [2023-04-01 20:23:03,681 INFO L158 Benchmark]: TraceAbstraction took 16664.74ms. Allocated memory was 287.3MB in the beginning and 512.8MB in the end (delta: 225.4MB). Free memory was 210.9MB in the beginning and 277.6MB in the end (delta: -66.6MB). Peak memory consumption was 159.2MB. Max. memory is 8.0GB. [2023-04-01 20:23:03,683 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.12ms. Allocated memory is still 198.2MB. Free memory is still 149.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 496.02ms. Allocated memory is still 198.2MB. Free memory was 151.5MB in the beginning and 124.9MB in the end (delta: 26.6MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 115.10ms. Allocated memory is still 198.2MB. Free memory was 124.9MB in the beginning and 120.0MB in the end (delta: 4.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 816.25ms. Allocated memory was 198.2MB in the beginning and 287.3MB in the end (delta: 89.1MB). Free memory was 120.0MB in the beginning and 211.4MB in the end (delta: -91.4MB). Peak memory consumption was 37.6MB. Max. memory is 8.0GB. * TraceAbstraction took 16664.74ms. Allocated memory was 287.3MB in the beginning and 512.8MB in the end (delta: 225.4MB). Free memory was 210.9MB in the beginning and 277.6MB in the end (delta: -66.6MB). Peak memory consumption was 159.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 425]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int e= 5; [L19] int d= 4; [L20] int f= 6; [L21] int c= 3; [L24] int u = 21; [L25] int v = 22; [L26] int w = 23; [L27] int x = 24; [L28] int y = 25; [L29] int z = 26; [L32] int a25 = 0; [L33] int a11 = 0; [L34] int a28 = 7; [L35] int a19 = 1; [L36] int a21 = 1; [L37] int a17 = 8; VAL [\old(a)=56, \old(a11)=59, \old(a17)=62, \old(a19)=61, \old(a21)=67, \old(a25)=65, \old(a28)=51, \old(c)=64, \old(d)=53, \old(e)=63, \old(f)=60, \old(u)=54, \old(v)=50, \old(w)=58, \old(x)=52, \old(y)=49, \old(z)=55, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L613] int output = -1; VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L624] CALL, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND TRUE ((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1))) [L245] a28 = 9 [L246] return 23; VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, \result=23, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, calculate_output(input)=23, d=4, e=5, f=6, input=4, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, output=23, u=21, v=22, w=23, x=24, y=25, z=26] [L624] CALL, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L247] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L258] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L263] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L269] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L290] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L301] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L303] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L307] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L319] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L338] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L341] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L359] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L364] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L385] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L388] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L390] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L399] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND TRUE (((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1)) [L405] a19 = 0 [L406] a28 = 7 [L407] return 25; VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, \result=25, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, calculate_output(input)=25, d=4, e=5, f=6, input=3, output=23, u=21, v=22, w=23, x=24, y=25, z=26] [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, output=25, u=21, v=22, w=23, x=24, y=25, z=26] [L624] CALL, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND TRUE ((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1)) [L65] a28 = 7 [L66] a11 = 1 [L67] a25 = 0 [L68] return -1; VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, \result=-1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, calculate_output(input)=-1, d=4, e=5, f=6, input=1, output=25, u=21, v=22, w=23, x=24, y=25, z=26] [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L624] CALL calculate_output(input) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L247] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L258] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L263] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L269] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L290] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L301] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L303] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L307] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L319] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L338] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L341] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L359] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L364] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L385] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L388] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L390] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L399] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L408] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L412] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L414] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L417] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L419] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L424] COND TRUE (((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8)) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L425] reach_error() VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 239 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.5s, OverallIterations: 9, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8722 SdHoareTripleChecker+Valid, 8.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8720 mSDsluCounter, 921 SdHoareTripleChecker+Invalid, 7.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 486 mSDsCounter, 1336 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11887 IncrementalHoareTripleChecker+Invalid, 13223 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1336 mSolverCounterUnsat, 435 mSDtfsCounter, 11887 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1505 GetRequests, 1388 SyntacticMatches, 3 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4556occurred in iteration=5, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 102 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1958 NumberOfCodeBlocks, 1958 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2330 ConstructedInterpolants, 0 QuantifiedInterpolants, 4963 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2274 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 1344/1405 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 20:23:03,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...