/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_label16.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-03-30 22:42:49,362 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-03-30 22:42:49,364 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-03-30 22:42:49,386 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-03-30 22:42:49,387 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-03-30 22:42:49,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-03-30 22:42:49,389 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-03-30 22:42:49,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-03-30 22:42:49,391 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-03-30 22:42:49,392 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-03-30 22:42:49,393 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-03-30 22:42:49,394 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-03-30 22:42:49,394 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-03-30 22:42:49,395 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-03-30 22:42:49,396 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-03-30 22:42:49,397 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-03-30 22:42:49,397 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-03-30 22:42:49,398 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-03-30 22:42:49,399 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-03-30 22:42:49,400 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-03-30 22:42:49,402 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-03-30 22:42:49,403 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-03-30 22:42:49,403 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-03-30 22:42:49,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-03-30 22:42:49,407 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-03-30 22:42:49,407 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-03-30 22:42:49,408 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-03-30 22:42:49,408 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-03-30 22:42:49,409 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-03-30 22:42:49,410 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-03-30 22:42:49,410 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-03-30 22:42:49,411 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-03-30 22:42:49,411 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-03-30 22:42:49,412 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-03-30 22:42:49,413 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-03-30 22:42:49,413 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-03-30 22:42:49,414 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-03-30 22:42:49,414 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-03-30 22:42:49,414 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-03-30 22:42:49,415 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-03-30 22:42:49,416 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-03-30 22:42:49,417 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-03-30 22:42:49,435 INFO L113 SettingsManager]: Loading preferences was successful [2023-03-30 22:42:49,436 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-03-30 22:42:49,436 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-03-30 22:42:49,436 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-03-30 22:42:49,437 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-03-30 22:42:49,437 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-03-30 22:42:49,437 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-03-30 22:42:49,438 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-03-30 22:42:49,438 INFO L138 SettingsManager]: * Use SBE=true [2023-03-30 22:42:49,438 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-03-30 22:42:49,438 INFO L138 SettingsManager]: * sizeof long=4 [2023-03-30 22:42:49,438 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-03-30 22:42:49,438 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-03-30 22:42:49,439 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-03-30 22:42:49,439 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-03-30 22:42:49,439 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-03-30 22:42:49,439 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-03-30 22:42:49,439 INFO L138 SettingsManager]: * sizeof long double=12 [2023-03-30 22:42:49,439 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-03-30 22:42:49,439 INFO L138 SettingsManager]: * Use constant arrays=true [2023-03-30 22:42:49,439 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-03-30 22:42:49,440 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-03-30 22:42:49,440 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-03-30 22:42:49,440 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-03-30 22:42:49,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-30 22:42:49,440 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-03-30 22:42:49,440 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-03-30 22:42:49,440 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-03-30 22:42:49,441 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-03-30 22:42:49,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-03-30 22:42:49,441 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-03-30 22:42:49,441 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-03-30 22:42:49,441 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-03-30 22:42:49,441 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-03-30 22:42:49,441 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-03-30 22:42:49,442 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-03-30 22:42:49,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-03-30 22:42:49,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-03-30 22:42:49,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-03-30 22:42:49,679 INFO L271 PluginConnector]: Initializing CDTParser... [2023-03-30 22:42:49,680 INFO L275 PluginConnector]: CDTParser initialized [2023-03-30 22:42:49,681 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label16.c [2023-03-30 22:42:50,886 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-03-30 22:42:51,178 INFO L351 CDTParser]: Found 1 translation units. [2023-03-30 22:42:51,179 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label16.c [2023-03-30 22:42:51,188 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/309ad77d2/093991d6dc774447929350723497a6e6/FLAGf11c3dfd4 [2023-03-30 22:42:51,201 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/309ad77d2/093991d6dc774447929350723497a6e6 [2023-03-30 22:42:51,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-03-30 22:42:51,204 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-03-30 22:42:51,205 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-03-30 22:42:51,205 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-03-30 22:42:51,213 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-03-30 22:42:51,214 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.03 10:42:51" (1/1) ... [2023-03-30 22:42:51,215 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4634a735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 10:42:51, skipping insertion in model container [2023-03-30 22:42:51,215 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.03 10:42:51" (1/1) ... [2023-03-30 22:42:51,221 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-03-30 22:42:51,264 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-03-30 22:42:51,553 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_label16.c[15312,15325] [2023-03-30 22:42:51,599 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-30 22:42:51,609 INFO L203 MainTranslator]: Completed pre-run [2023-03-30 22:42:51,674 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_label16.c[15312,15325] [2023-03-30 22:42:51,688 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-30 22:42:51,701 INFO L208 MainTranslator]: Completed translation [2023-03-30 22:42:51,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 10:42:51 WrapperNode [2023-03-30 22:42:51,702 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-03-30 22:42:51,703 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-03-30 22:42:51,703 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-03-30 22:42:51,703 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-03-30 22:42:51,714 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 10:42:51" (1/1) ... [2023-03-30 22:42:51,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 10:42:51" (1/1) ... [2023-03-30 22:42:51,735 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 10:42:51" (1/1) ... [2023-03-30 22:42:51,735 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 10:42:51" (1/1) ... [2023-03-30 22:42:51,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 10:42:51" (1/1) ... [2023-03-30 22:42:51,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 10:42:51" (1/1) ... [2023-03-30 22:42:51,773 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 10:42:51" (1/1) ... [2023-03-30 22:42:51,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 10:42:51" (1/1) ... [2023-03-30 22:42:51,783 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-03-30 22:42:51,784 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-03-30 22:42:51,784 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-03-30 22:42:51,784 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-03-30 22:42:51,785 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 10:42:51" (1/1) ... [2023-03-30 22:42:51,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-30 22:42:51,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 22:42:51,814 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-03-30 22:42:51,828 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-03-30 22:42:51,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-03-30 22:42:51,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-03-30 22:42:51,866 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-03-30 22:42:51,867 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2023-03-30 22:42:51,867 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-03-30 22:42:51,867 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2023-03-30 22:42:51,867 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-03-30 22:42:51,867 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-03-30 22:42:51,867 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-03-30 22:42:51,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-03-30 22:42:51,867 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-03-30 22:42:51,868 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2023-03-30 22:42:51,868 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-03-30 22:42:51,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-03-30 22:42:51,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-03-30 22:42:51,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-03-30 22:42:51,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-03-30 22:42:51,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-03-30 22:42:51,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-03-30 22:42:51,958 INFO L236 CfgBuilder]: Building ICFG [2023-03-30 22:42:51,961 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-03-30 22:42:52,912 INFO L277 CfgBuilder]: Performing block encoding [2023-03-30 22:42:52,924 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-03-30 22:42:52,925 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-03-30 22:42:52,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.03 10:42:52 BoogieIcfgContainer [2023-03-30 22:42:52,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-03-30 22:42:52,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-03-30 22:42:52,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-03-30 22:42:52,936 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-03-30 22:42:52,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.03 10:42:51" (1/3) ... [2023-03-30 22:42:52,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45251b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.03 10:42:52, skipping insertion in model container [2023-03-30 22:42:52,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 10:42:51" (2/3) ... [2023-03-30 22:42:52,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45251b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.03 10:42:52, skipping insertion in model container [2023-03-30 22:42:52,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.03 10:42:52" (3/3) ... [2023-03-30 22:42:52,939 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label16.c [2023-03-30 22:42:52,960 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-03-30 22:42:52,961 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-03-30 22:42:53,025 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-03-30 22:42:53,033 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;@54f9fe5f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-03-30 22:42:53,033 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-03-30 22:42:53,038 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-03-30 22:42:53,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-03-30 22:42:53,052 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 22:42:53,053 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, 1, 1, 1, 1, 1, 1] [2023-03-30 22:42:53,054 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 22:42:53,060 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 22:42:53,061 INFO L85 PathProgramCache]: Analyzing trace with hash 807629860, now seen corresponding path program 1 times [2023-03-30 22:42:53,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 22:42:53,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65571569] [2023-03-30 22:42:53,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:42:53,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 22:42:53,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:42:53,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 22:42:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:42:53,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:42:53,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 22:42:53,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65571569] [2023-03-30 22:42:53,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65571569] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-30 22:42:53,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-30 22:42:53,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-03-30 22:42:53,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145659063] [2023-03-30 22:42:53,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-30 22:42:53,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-03-30 22:42:53,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 22:42:53,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-03-30 22:42:53,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-03-30 22:42:53,909 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 22.25) internal successors, (89), 3 states have internal predecessors, (89), 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-03-30 22:42:55,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 22:42:55,051 INFO L93 Difference]: Finished difference Result 627 states and 1073 transitions. [2023-03-30 22:42:55,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-03-30 22:42:55,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 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 93 [2023-03-30 22:42:55,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 22:42:55,064 INFO L225 Difference]: With dead ends: 627 [2023-03-30 22:42:55,064 INFO L226 Difference]: Without dead ends: 327 [2023-03-30 22:42:55,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-03-30 22:42:55,073 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 826 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-03-30 22:42:55,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 33 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-03-30 22:42:55,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2023-03-30 22:42:55,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 319. [2023-03-30 22:42:55,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 310 states have (on average 1.5161290322580645) internal successors, (470), 311 states have internal predecessors, (470), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-03-30 22:42:55,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 480 transitions. [2023-03-30 22:42:55,130 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 480 transitions. Word has length 93 [2023-03-30 22:42:55,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 22:42:55,131 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 480 transitions. [2023-03-30 22:42:55,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 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-03-30 22:42:55,132 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 480 transitions. [2023-03-30 22:42:55,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-03-30 22:42:55,135 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 22:42:55,135 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 22:42:55,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-03-30 22:42:55,136 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 22:42:55,136 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 22:42:55,137 INFO L85 PathProgramCache]: Analyzing trace with hash -108115626, now seen corresponding path program 1 times [2023-03-30 22:42:55,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 22:42:55,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615827211] [2023-03-30 22:42:55,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:42:55,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 22:42:55,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:42:55,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 22:42:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:42:55,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-03-30 22:42:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:42:55,472 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:42:55,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 22:42:55,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615827211] [2023-03-30 22:42:55,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615827211] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-30 22:42:55,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-30 22:42:55,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-03-30 22:42:55,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104701180] [2023-03-30 22:42:55,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-30 22:42:55,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-03-30 22:42:55,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 22:42:55,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-03-30 22:42:55,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-03-30 22:42:55,476 INFO L87 Difference]: Start difference. First operand 319 states and 480 transitions. Second operand has 8 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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-03-30 22:42:56,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 22:42:56,773 INFO L93 Difference]: Finished difference Result 1100 states and 1689 transitions. [2023-03-30 22:42:56,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-03-30 22:42:56,773 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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 108 [2023-03-30 22:42:56,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 22:42:56,778 INFO L225 Difference]: With dead ends: 1100 [2023-03-30 22:42:56,778 INFO L226 Difference]: Without dead ends: 787 [2023-03-30 22:42:56,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2023-03-30 22:42:56,780 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 1126 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1126 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-03-30 22:42:56,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1126 Valid, 106 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-03-30 22:42:56,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2023-03-30 22:42:56,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 626. [2023-03-30 22:42:56,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 609 states have (on average 1.4597701149425288) internal successors, (889), 614 states have internal predecessors, (889), 6 states have call successors, (6), 6 states have call predecessors, (6), 10 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2023-03-30 22:42:56,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 916 transitions. [2023-03-30 22:42:56,817 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 916 transitions. Word has length 108 [2023-03-30 22:42:56,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 22:42:56,818 INFO L495 AbstractCegarLoop]: Abstraction has 626 states and 916 transitions. [2023-03-30 22:42:56,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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-03-30 22:42:56,818 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 916 transitions. [2023-03-30 22:42:56,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-03-30 22:42:56,821 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 22:42:56,821 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 22:42:56,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-03-30 22:42:56,821 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 22:42:56,822 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 22:42:56,822 INFO L85 PathProgramCache]: Analyzing trace with hash 335092243, now seen corresponding path program 1 times [2023-03-30 22:42:56,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 22:42:56,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540755205] [2023-03-30 22:42:56,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:42:56,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 22:42:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:42:57,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 22:42:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:42:57,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-03-30 22:42:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:42:57,056 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:42:57,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 22:42:57,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540755205] [2023-03-30 22:42:57,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540755205] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-30 22:42:57,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-30 22:42:57,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-03-30 22:42:57,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472847248] [2023-03-30 22:42:57,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-30 22:42:57,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-03-30 22:42:57,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 22:42:57,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-03-30 22:42:57,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-03-30 22:42:57,059 INFO L87 Difference]: Start difference. First operand 626 states and 916 transitions. Second operand has 7 states, 6 states have (on average 18.166666666666668) internal successors, (109), 4 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-03-30 22:42:58,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 22:42:58,087 INFO L93 Difference]: Finished difference Result 1929 states and 2927 transitions. [2023-03-30 22:42:58,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-03-30 22:42:58,088 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 18.166666666666668) internal successors, (109), 4 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-03-30 22:42:58,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 22:42:58,095 INFO L225 Difference]: With dead ends: 1929 [2023-03-30 22:42:58,095 INFO L226 Difference]: Without dead ends: 1309 [2023-03-30 22:42:58,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-03-30 22:42:58,098 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 542 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-03-30 22:42:58,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 104 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-03-30 22:42:58,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2023-03-30 22:42:58,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1255. [2023-03-30 22:42:58,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1215 states have (on average 1.4065843621399177) internal successors, (1709), 1235 states have internal predecessors, (1709), 10 states have call successors, (10), 10 states have call predecessors, (10), 29 states have return successors, (83), 9 states have call predecessors, (83), 9 states have call successors, (83) [2023-03-30 22:42:58,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1802 transitions. [2023-03-30 22:42:58,165 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1802 transitions. Word has length 115 [2023-03-30 22:42:58,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 22:42:58,166 INFO L495 AbstractCegarLoop]: Abstraction has 1255 states and 1802 transitions. [2023-03-30 22:42:58,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 18.166666666666668) internal successors, (109), 4 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-03-30 22:42:58,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1802 transitions. [2023-03-30 22:42:58,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-03-30 22:42:58,169 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 22:42:58,173 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-30 22:42:58,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-03-30 22:42:58,174 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 22:42:58,174 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 22:42:58,174 INFO L85 PathProgramCache]: Analyzing trace with hash 814890651, now seen corresponding path program 1 times [2023-03-30 22:42:58,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 22:42:58,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668254123] [2023-03-30 22:42:58,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:42:58,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 22:42:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:42:58,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 22:42:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:42:58,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-03-30 22:42:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:42:58,692 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:42:58,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 22:42:58,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668254123] [2023-03-30 22:42:58,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668254123] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-30 22:42:58,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972315412] [2023-03-30 22:42:58,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:42:58,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 22:42:58,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 22:42:58,697 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-03-30 22:42:58,708 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-03-30 22:42:58,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:42:58,823 INFO L262 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 4 conjunts are in the unsatisfiable core [2023-03-30 22:42:58,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 22:42:59,051 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:42:59,051 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-03-30 22:42:59,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972315412] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-30 22:42:59,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-03-30 22:42:59,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-03-30 22:42:59,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448261638] [2023-03-30 22:42:59,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-30 22:42:59,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-03-30 22:42:59,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 22:42:59,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-03-30 22:42:59,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-03-30 22:42:59,057 INFO L87 Difference]: Start difference. First operand 1255 states and 1802 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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-03-30 22:42:59,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 22:42:59,455 INFO L93 Difference]: Finished difference Result 3536 states and 5211 transitions. [2023-03-30 22:42:59,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-30 22:42:59,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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 119 [2023-03-30 22:42:59,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 22:42:59,469 INFO L225 Difference]: With dead ends: 3536 [2023-03-30 22:42:59,469 INFO L226 Difference]: Without dead ends: 2287 [2023-03-30 22:42:59,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-03-30 22:42:59,480 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 65 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-03-30 22:42:59,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 129 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-03-30 22:42:59,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2287 states. [2023-03-30 22:42:59,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2287 to 2139. [2023-03-30 22:42:59,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2139 states, 2079 states have (on average 1.2712842712842713) internal successors, (2643), 2107 states have internal predecessors, (2643), 16 states have call successors, (16), 16 states have call predecessors, (16), 43 states have return successors, (173), 15 states have call predecessors, (173), 15 states have call successors, (173) [2023-03-30 22:42:59,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 2832 transitions. [2023-03-30 22:42:59,574 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 2832 transitions. Word has length 119 [2023-03-30 22:42:59,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 22:42:59,575 INFO L495 AbstractCegarLoop]: Abstraction has 2139 states and 2832 transitions. [2023-03-30 22:42:59,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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-03-30 22:42:59,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 2832 transitions. [2023-03-30 22:42:59,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-03-30 22:42:59,581 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 22:42:59,581 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-30 22:42:59,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-03-30 22:42:59,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 22:42:59,787 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 22:42:59,787 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 22:42:59,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1884942465, now seen corresponding path program 1 times [2023-03-30 22:42:59,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 22:42:59,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221179021] [2023-03-30 22:42:59,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:42:59,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 22:42:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-03-30 22:42:59,821 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-03-30 22:42:59,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-03-30 22:42:59,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-03-30 22:42:59,886 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-03-30 22:42:59,888 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-03-30 22:42:59,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-03-30 22:42:59,894 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-03-30 22:42:59,897 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-03-30 22:43:00,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.03 10:43:00 BoogieIcfgContainer [2023-03-30 22:43:00,001 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-03-30 22:43:00,002 INFO L158 Benchmark]: Toolchain (without parser) took 8797.30ms. Allocated memory was 222.3MB in the beginning and 267.4MB in the end (delta: 45.1MB). Free memory was 169.1MB in the beginning and 96.0MB in the end (delta: 73.1MB). Peak memory consumption was 119.2MB. Max. memory is 8.0GB. [2023-03-30 22:43:00,002 INFO L158 Benchmark]: CDTParser took 0.58ms. Allocated memory is still 184.5MB. Free memory was 132.0MB in the beginning and 131.9MB in the end (delta: 142.7kB). There was no memory consumed. Max. memory is 8.0GB. [2023-03-30 22:43:00,002 INFO L158 Benchmark]: CACSL2BoogieTranslator took 496.94ms. Allocated memory is still 222.3MB. Free memory was 168.6MB in the beginning and 142.3MB in the end (delta: 26.3MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2023-03-30 22:43:00,002 INFO L158 Benchmark]: Boogie Preprocessor took 80.11ms. Allocated memory is still 222.3MB. Free memory was 142.3MB in the beginning and 137.7MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-03-30 22:43:00,003 INFO L158 Benchmark]: RCFGBuilder took 1147.95ms. Allocated memory is still 222.3MB. Free memory was 137.7MB in the beginning and 132.9MB in the end (delta: 4.9MB). Peak memory consumption was 28.1MB. Max. memory is 8.0GB. [2023-03-30 22:43:00,003 INFO L158 Benchmark]: TraceAbstraction took 7067.76ms. Allocated memory was 222.3MB in the beginning and 267.4MB in the end (delta: 45.1MB). Free memory was 132.1MB in the beginning and 96.0MB in the end (delta: 36.1MB). Peak memory consumption was 80.6MB. Max. memory is 8.0GB. [2023-03-30 22:43:00,004 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.58ms. Allocated memory is still 184.5MB. Free memory was 132.0MB in the beginning and 131.9MB in the end (delta: 142.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 496.94ms. Allocated memory is still 222.3MB. Free memory was 168.6MB in the beginning and 142.3MB in the end (delta: 26.3MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 80.11ms. Allocated memory is still 222.3MB. Free memory was 142.3MB in the beginning and 137.7MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1147.95ms. Allocated memory is still 222.3MB. Free memory was 137.7MB in the beginning and 132.9MB in the end (delta: 4.9MB). Peak memory consumption was 28.1MB. Max. memory is 8.0GB. * TraceAbstraction took 7067.76ms. Allocated memory was 222.3MB in the beginning and 267.4MB in the end (delta: 45.1MB). Free memory was 132.1MB in the beginning and 96.0MB in the end (delta: 36.1MB). Peak memory consumption was 80.6MB. 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: 443]: 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=1, 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)=1, 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)=1, a11=0, a17=8, a19=1, 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)=1, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=0, a17=8, a19=1, 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)=1, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=0, a17=8, a19=1, 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)=1, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=0, a17=8, a19=1, 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)=1, \old(a25)=0, \old(a28)=7, \old(input)=1, a11=0, a17=8, a19=1, 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 TRUE ((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7))))) [L61] a28 = 11 [L62] a25 = 1 [L63] return 26; VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=1, \result=26, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, calculate_output(input)=26, d=4, e=5, f=6, input=1, 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=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, output=26, 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)=1, \old(a28)=11, \old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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)=1, \old(a28)=11, \old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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)=1, \old(a25)=1, \old(a28)=11, \old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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)=1, \old(a25)=1, \old(a28)=11, \old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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)=1, \old(a25)=1, \old(a28)=11, \old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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)=1, \old(a25)=1, \old(a28)=11, \old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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)=1, \old(a25)=1, \old(a28)=11, \old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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 TRUE ((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1)) [L110] a17 = 7 [L111] a25 = 0 [L112] a11 = 1 [L113] a28 = 10 [L114] a19 = 0 [L115] return -1; VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=1, \result=-1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, calculate_output(input)=-1, d=4, e=5, f=6, input=1, output=26, 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=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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 FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L427] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L430] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L433] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) VAL [\old(a11)=1, \old(a17)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L436] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L439] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7))) VAL [\old(a11)=1, \old(a17)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L442] COND TRUE (((((!(a25==1)&&(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==7)) VAL [\old(a11)=1, \old(a17)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L443] reach_error() VAL [\old(a11)=1, \old(a17)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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: 6.9s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2559 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2559 mSDsluCounter, 372 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 198 mSDsCounter, 542 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3128 IncrementalHoareTripleChecker+Invalid, 3670 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 542 mSolverCounterUnsat, 174 mSDtfsCounter, 3128 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 162 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2139occurred in iteration=4, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 371 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 682 NumberOfCodeBlocks, 682 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 549 ConstructedInterpolants, 0 QuantifiedInterpolants, 2917 SizeOfPredicates, 1 NumberOfNonLiveVariables, 353 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 76/77 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-03-30 22:43:00,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...