./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label45.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/bin/utaipan-verify-SwPr7d2a91/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/bin/utaipan-verify-SwPr7d2a91/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/bin/utaipan-verify-SwPr7d2a91/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/bin/utaipan-verify-SwPr7d2a91/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label45.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/bin/utaipan-verify-SwPr7d2a91 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bd7bfdc90ad274b856f062dcd9b414cf1c7c524311f5a91ee1cc532e8e6a452d --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 23:18:20,830 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 23:18:20,926 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-24 23:18:20,946 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 23:18:20,961 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 23:18:20,997 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 23:18:20,997 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 23:18:20,998 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 23:18:20,999 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 23:18:21,000 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 23:18:21,000 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-24 23:18:21,001 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-24 23:18:21,001 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-24 23:18:21,002 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-24 23:18:21,003 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-24 23:18:21,003 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-24 23:18:21,004 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-24 23:18:21,004 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-24 23:18:21,005 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-24 23:18:21,006 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-24 23:18:21,006 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-24 23:18:21,007 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-24 23:18:21,008 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 23:18:21,009 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-24 23:18:21,009 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 23:18:21,010 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 23:18:21,010 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 23:18:21,011 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 23:18:21,011 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-24 23:18:21,012 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 23:18:21,012 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-24 23:18:21,013 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 23:18:21,013 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-24 23:18:21,014 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 23:18:21,015 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 23:18:21,015 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 23:18:21,016 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 23:18:21,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 23:18:21,017 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 23:18:21,017 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 23:18:21,018 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-24 23:18:21,018 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-24 23:18:21,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 23:18:21,019 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 23:18:21,020 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-24 23:18:21,020 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-24 23:18:21,020 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 23:18:21,021 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/bin/utaipan-verify-SwPr7d2a91/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/bin/utaipan-verify-SwPr7d2a91 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bd7bfdc90ad274b856f062dcd9b414cf1c7c524311f5a91ee1cc532e8e6a452d [2023-11-24 23:18:21,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 23:18:21,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 23:18:21,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 23:18:21,393 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 23:18:21,393 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 23:18:21,395 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/bin/utaipan-verify-SwPr7d2a91/../../sv-benchmarks/c/eca-rers2012/Problem02_label45.c [2023-11-24 23:18:24,563 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 23:18:24,890 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 23:18:24,891 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/sv-benchmarks/c/eca-rers2012/Problem02_label45.c [2023-11-24 23:18:24,907 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/bin/utaipan-verify-SwPr7d2a91/data/ac4740b99/c39bb07f541b4a6bb7ede51946e78bd5/FLAG84bf4a28f [2023-11-24 23:18:24,923 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/bin/utaipan-verify-SwPr7d2a91/data/ac4740b99/c39bb07f541b4a6bb7ede51946e78bd5 [2023-11-24 23:18:24,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 23:18:24,929 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 23:18:24,930 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 23:18:24,931 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 23:18:24,950 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 23:18:24,951 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 11:18:24" (1/1) ... [2023-11-24 23:18:24,952 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@288c67df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:18:24, skipping insertion in model container [2023-11-24 23:18:24,952 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 11:18:24" (1/1) ... [2023-11-24 23:18:25,006 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 23:18:25,411 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/sv-benchmarks/c/eca-rers2012/Problem02_label45.c[14744,14757] [2023-11-24 23:18:25,453 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 23:18:25,465 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 23:18:25,568 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/sv-benchmarks/c/eca-rers2012/Problem02_label45.c[14744,14757] [2023-11-24 23:18:25,612 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 23:18:25,638 INFO L206 MainTranslator]: Completed translation [2023-11-24 23:18:25,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:18:25 WrapperNode [2023-11-24 23:18:25,639 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 23:18:25,640 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 23:18:25,640 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 23:18:25,640 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 23:18:25,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:18:25" (1/1) ... [2023-11-24 23:18:25,683 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:18:25" (1/1) ... [2023-11-24 23:18:25,738 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2023-11-24 23:18:25,738 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 23:18:25,739 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 23:18:25,739 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 23:18:25,740 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 23:18:25,756 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:18:25" (1/1) ... [2023-11-24 23:18:25,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:18:25" (1/1) ... [2023-11-24 23:18:25,761 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:18:25" (1/1) ... [2023-11-24 23:18:25,762 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:18:25" (1/1) ... [2023-11-24 23:18:25,787 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:18:25" (1/1) ... [2023-11-24 23:18:25,796 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:18:25" (1/1) ... [2023-11-24 23:18:25,800 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:18:25" (1/1) ... [2023-11-24 23:18:25,805 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:18:25" (1/1) ... [2023-11-24 23:18:25,812 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 23:18:25,814 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 23:18:25,814 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 23:18:25,814 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 23:18:25,815 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:18:25" (1/1) ... [2023-11-24 23:18:25,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 23:18:25,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:18:25,867 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-24 23:18:25,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-24 23:18:25,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 23:18:25,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-24 23:18:25,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 23:18:25,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 23:18:26,012 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 23:18:26,015 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 23:18:27,245 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 23:18:27,564 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 23:18:27,565 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-24 23:18:27,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:18:27 BoogieIcfgContainer [2023-11-24 23:18:27,567 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 23:18:27,570 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 23:18:27,570 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 23:18:27,573 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 23:18:27,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 11:18:24" (1/3) ... [2023-11-24 23:18:27,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dad2324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 11:18:27, skipping insertion in model container [2023-11-24 23:18:27,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:18:25" (2/3) ... [2023-11-24 23:18:27,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dad2324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 11:18:27, skipping insertion in model container [2023-11-24 23:18:27,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:18:27" (3/3) ... [2023-11-24 23:18:27,579 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label45.c [2023-11-24 23:18:27,600 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 23:18:27,600 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-24 23:18:27,667 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 23:18:27,674 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@26afdc04, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 23:18:27,675 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-24 23:18:27,680 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 83 states have (on average 1.9518072289156627) internal successors, (162), 84 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:18:27,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-24 23:18:27,692 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:18:27,693 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] [2023-11-24 23:18:27,694 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 23:18:27,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:18:27,703 INFO L85 PathProgramCache]: Analyzing trace with hash 671996297, now seen corresponding path program 1 times [2023-11-24 23:18:27,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:18:27,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692427774] [2023-11-24 23:18:27,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:18:27,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:18:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:18:28,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:18:28,296 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:18:28,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692427774] [2023-11-24 23:18:28,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692427774] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:18:28,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:18:28,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 23:18:28,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743100906] [2023-11-24 23:18:28,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:18:28,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 23:18:28,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:18:28,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 23:18:28,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:18:28,354 INFO L87 Difference]: Start difference. First operand has 85 states, 83 states have (on average 1.9518072289156627) internal successors, (162), 84 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:18:28,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:18:28,978 INFO L93 Difference]: Finished difference Result 251 states and 482 transitions. [2023-11-24 23:18:28,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 23:18:28,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2023-11-24 23:18:28,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:18:28,993 INFO L225 Difference]: With dead ends: 251 [2023-11-24 23:18:28,993 INFO L226 Difference]: Without dead ends: 163 [2023-11-24 23:18:28,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:18:29,001 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 20 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-24 23:18:29,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 55 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-24 23:18:29,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-11-24 23:18:29,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2023-11-24 23:18:29,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.8395061728395061) internal successors, (298), 162 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:18:29,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 298 transitions. [2023-11-24 23:18:29,057 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 298 transitions. Word has length 80 [2023-11-24 23:18:29,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:18:29,058 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 298 transitions. [2023-11-24 23:18:29,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:18:29,059 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 298 transitions. [2023-11-24 23:18:29,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-11-24 23:18:29,063 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:18:29,064 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-24 23:18:29,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 23:18:29,064 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 23:18:29,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:18:29,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1254059522, now seen corresponding path program 1 times [2023-11-24 23:18:29,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:18:29,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418910015] [2023-11-24 23:18:29,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:18:29,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:18:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:18:29,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:18:29,453 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:18:29,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418910015] [2023-11-24 23:18:29,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418910015] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:18:29,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:18:29,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 23:18:29,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527638391] [2023-11-24 23:18:29,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:18:29,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 23:18:29,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:18:29,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 23:18:29,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:18:29,461 INFO L87 Difference]: Start difference. First operand 163 states and 298 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:18:29,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:18:29,968 INFO L93 Difference]: Finished difference Result 485 states and 891 transitions. [2023-11-24 23:18:29,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 23:18:29,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2023-11-24 23:18:29,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:18:29,973 INFO L225 Difference]: With dead ends: 485 [2023-11-24 23:18:29,973 INFO L226 Difference]: Without dead ends: 323 [2023-11-24 23:18:29,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:18:29,977 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 78 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 23:18:29,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 63 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-24 23:18:29,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2023-11-24 23:18:30,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2023-11-24 23:18:30,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 322 states have (on average 1.515527950310559) internal successors, (488), 322 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:18:30,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 488 transitions. [2023-11-24 23:18:30,018 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 488 transitions. Word has length 84 [2023-11-24 23:18:30,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:18:30,019 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 488 transitions. [2023-11-24 23:18:30,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:18:30,020 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 488 transitions. [2023-11-24 23:18:30,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-24 23:18:30,036 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:18:30,036 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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-11-24 23:18:30,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 23:18:30,039 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 23:18:30,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:18:30,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1864341989, now seen corresponding path program 1 times [2023-11-24 23:18:30,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:18:30,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195125213] [2023-11-24 23:18:30,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:18:30,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:18:30,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:18:30,290 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:18:30,291 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:18:30,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195125213] [2023-11-24 23:18:30,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195125213] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:18:30,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:18:30,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 23:18:30,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816102513] [2023-11-24 23:18:30,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:18:30,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 23:18:30,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:18:30,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 23:18:30,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:18:30,299 INFO L87 Difference]: Start difference. First operand 323 states and 488 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:18:30,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:18:30,789 INFO L93 Difference]: Finished difference Result 805 states and 1271 transitions. [2023-11-24 23:18:30,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 23:18:30,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2023-11-24 23:18:30,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:18:30,794 INFO L225 Difference]: With dead ends: 805 [2023-11-24 23:18:30,794 INFO L226 Difference]: Without dead ends: 483 [2023-11-24 23:18:30,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:18:30,804 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 77 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-24 23:18:30,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 139 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-24 23:18:30,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2023-11-24 23:18:30,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2023-11-24 23:18:30,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 482 states have (on average 1.4066390041493777) internal successors, (678), 482 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:18:30,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 678 transitions. [2023-11-24 23:18:30,850 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 678 transitions. Word has length 89 [2023-11-24 23:18:30,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:18:30,856 INFO L495 AbstractCegarLoop]: Abstraction has 483 states and 678 transitions. [2023-11-24 23:18:30,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:18:30,859 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 678 transitions. [2023-11-24 23:18:30,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-24 23:18:30,862 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:18:30,862 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:18:30,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 23:18:30,862 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 23:18:30,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:18:30,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1736677818, now seen corresponding path program 1 times [2023-11-24 23:18:30,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:18:30,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483913114] [2023-11-24 23:18:30,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:18:30,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:18:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:18:31,088 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:18:31,088 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:18:31,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483913114] [2023-11-24 23:18:31,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483913114] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:18:31,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278867094] [2023-11-24 23:18:31,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:18:31,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:18:31,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:18:31,097 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:18:31,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-24 23:18:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:18:31,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-24 23:18:31,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:18:31,415 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-24 23:18:31,415 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 23:18:31,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278867094] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:18:31,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-24 23:18:31,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2023-11-24 23:18:31,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341455843] [2023-11-24 23:18:31,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:18:31,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 23:18:31,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:18:31,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 23:18:31,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 23:18:31,422 INFO L87 Difference]: Start difference. First operand 483 states and 678 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:18:31,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:18:31,834 INFO L93 Difference]: Finished difference Result 1285 states and 1841 transitions. [2023-11-24 23:18:31,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 23:18:31,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2023-11-24 23:18:31,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:18:31,841 INFO L225 Difference]: With dead ends: 1285 [2023-11-24 23:18:31,841 INFO L226 Difference]: Without dead ends: 803 [2023-11-24 23:18:31,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 23:18:31,844 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 43 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 23:18:31,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 20 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-24 23:18:31,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2023-11-24 23:18:31,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 803. [2023-11-24 23:18:31,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 802 states have (on average 1.4064837905236909) internal successors, (1128), 802 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:18:31,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1128 transitions. [2023-11-24 23:18:31,907 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1128 transitions. Word has length 89 [2023-11-24 23:18:31,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:18:31,910 INFO L495 AbstractCegarLoop]: Abstraction has 803 states and 1128 transitions. [2023-11-24 23:18:31,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:18:31,910 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1128 transitions. [2023-11-24 23:18:31,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-24 23:18:31,914 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:18:31,914 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:18:31,931 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-24 23:18:32,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:18:32,132 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 23:18:32,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:18:32,132 INFO L85 PathProgramCache]: Analyzing trace with hash -964111953, now seen corresponding path program 1 times [2023-11-24 23:18:32,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:18:32,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825007624] [2023-11-24 23:18:32,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:18:32,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:18:32,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:18:32,270 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:18:32,270 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:18:32,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825007624] [2023-11-24 23:18:32,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825007624] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:18:32,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:18:32,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 23:18:32,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145968280] [2023-11-24 23:18:32,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:18:32,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 23:18:32,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:18:32,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 23:18:32,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:18:32,277 INFO L87 Difference]: Start difference. First operand 803 states and 1128 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:18:32,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:18:32,707 INFO L93 Difference]: Finished difference Result 2085 states and 2931 transitions. [2023-11-24 23:18:32,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 23:18:32,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2023-11-24 23:18:32,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:18:32,715 INFO L225 Difference]: With dead ends: 2085 [2023-11-24 23:18:32,715 INFO L226 Difference]: Without dead ends: 1283 [2023-11-24 23:18:32,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:18:32,718 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 78 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 23:18:32,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 147 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-24 23:18:32,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2023-11-24 23:18:32,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2023-11-24 23:18:32,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 1282 states have (on average 1.3088923556942278) internal successors, (1678), 1282 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:18:32,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1678 transitions. [2023-11-24 23:18:32,757 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1678 transitions. Word has length 93 [2023-11-24 23:18:32,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:18:32,758 INFO L495 AbstractCegarLoop]: Abstraction has 1283 states and 1678 transitions. [2023-11-24 23:18:32,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:18:32,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1678 transitions. [2023-11-24 23:18:32,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-24 23:18:32,762 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:18:32,762 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:18:32,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 23:18:32,762 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 23:18:32,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:18:32,764 INFO L85 PathProgramCache]: Analyzing trace with hash -678512318, now seen corresponding path program 1 times [2023-11-24 23:18:32,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:18:32,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207902003] [2023-11-24 23:18:32,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:18:32,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:18:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:18:32,852 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-24 23:18:32,852 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:18:32,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207902003] [2023-11-24 23:18:32,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207902003] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:18:32,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:18:32,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 23:18:32,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867229730] [2023-11-24 23:18:32,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:18:32,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 23:18:32,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:18:32,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 23:18:32,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:18:32,858 INFO L87 Difference]: Start difference. First operand 1283 states and 1678 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:18:33,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:18:33,266 INFO L93 Difference]: Finished difference Result 3045 states and 4101 transitions. [2023-11-24 23:18:33,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 23:18:33,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2023-11-24 23:18:33,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:18:33,276 INFO L225 Difference]: With dead ends: 3045 [2023-11-24 23:18:33,277 INFO L226 Difference]: Without dead ends: 1763 [2023-11-24 23:18:33,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:18:33,279 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 95 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 23:18:33,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 48 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-24 23:18:33,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2023-11-24 23:18:33,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1763. [2023-11-24 23:18:33,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1763 states, 1762 states have (on average 1.2905788876276958) internal successors, (2274), 1762 states have internal predecessors, (2274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:18:33,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 2274 transitions. [2023-11-24 23:18:33,322 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 2274 transitions. Word has length 94 [2023-11-24 23:18:33,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:18:33,323 INFO L495 AbstractCegarLoop]: Abstraction has 1763 states and 2274 transitions. [2023-11-24 23:18:33,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:18:33,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 2274 transitions. [2023-11-24 23:18:33,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-24 23:18:33,327 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:18:33,327 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2023-11-24 23:18:33,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 23:18:33,328 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 23:18:33,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:18:33,328 INFO L85 PathProgramCache]: Analyzing trace with hash -218555629, now seen corresponding path program 1 times [2023-11-24 23:18:33,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:18:33,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912323035] [2023-11-24 23:18:33,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:18:33,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:18:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:18:33,429 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-24 23:18:33,429 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:18:33,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912323035] [2023-11-24 23:18:33,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912323035] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:18:33,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:18:33,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 23:18:33,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87323713] [2023-11-24 23:18:33,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:18:33,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 23:18:33,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:18:33,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 23:18:33,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:18:33,432 INFO L87 Difference]: Start difference. First operand 1763 states and 2274 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:18:33,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:18:33,786 INFO L93 Difference]: Finished difference Result 3525 states and 4547 transitions. [2023-11-24 23:18:33,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 23:18:33,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2023-11-24 23:18:33,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:18:33,796 INFO L225 Difference]: With dead ends: 3525 [2023-11-24 23:18:33,796 INFO L226 Difference]: Without dead ends: 1763 [2023-11-24 23:18:33,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:18:33,802 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 79 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-24 23:18:33,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 16 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-24 23:18:33,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2023-11-24 23:18:33,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1603. [2023-11-24 23:18:33,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1602 states have (on average 1.2602996254681649) internal successors, (2019), 1602 states have internal predecessors, (2019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:18:33,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2019 transitions. [2023-11-24 23:18:33,847 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2019 transitions. Word has length 113 [2023-11-24 23:18:33,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:18:33,849 INFO L495 AbstractCegarLoop]: Abstraction has 1603 states and 2019 transitions. [2023-11-24 23:18:33,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:18:33,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2019 transitions. [2023-11-24 23:18:33,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-24 23:18:33,885 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:18:33,885 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-24 23:18:33,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 23:18:33,886 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 23:18:33,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:18:33,886 INFO L85 PathProgramCache]: Analyzing trace with hash -695098392, now seen corresponding path program 1 times [2023-11-24 23:18:33,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:18:33,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369403487] [2023-11-24 23:18:33,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:18:33,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:18:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:18:34,358 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:18:34,358 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:18:34,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369403487] [2023-11-24 23:18:34,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369403487] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:18:34,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794488078] [2023-11-24 23:18:34,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:18:34,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:18:34,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:18:34,362 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:18:34,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-24 23:18:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:18:34,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-24 23:18:34,496 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:18:34,623 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-24 23:18:34,623 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 23:18:34,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794488078] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:18:34,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-24 23:18:34,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2023-11-24 23:18:34,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288278878] [2023-11-24 23:18:34,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:18:34,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 23:18:34,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:18:34,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 23:18:34,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:18:34,626 INFO L87 Difference]: Start difference. First operand 1603 states and 2019 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:18:35,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:18:35,124 INFO L93 Difference]: Finished difference Result 3445 states and 4483 transitions. [2023-11-24 23:18:35,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 23:18:35,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2023-11-24 23:18:35,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:18:35,136 INFO L225 Difference]: With dead ends: 3445 [2023-11-24 23:18:35,136 INFO L226 Difference]: Without dead ends: 1843 [2023-11-24 23:18:35,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:18:35,139 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 23:18:35,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 131 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-24 23:18:35,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2023-11-24 23:18:35,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1843. [2023-11-24 23:18:35,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1843 states, 1842 states have (on average 1.267100977198697) internal successors, (2334), 1842 states have internal predecessors, (2334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:18:35,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1843 states to 1843 states and 2334 transitions. [2023-11-24 23:18:35,191 INFO L78 Accepts]: Start accepts. Automaton has 1843 states and 2334 transitions. Word has length 113 [2023-11-24 23:18:35,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:18:35,191 INFO L495 AbstractCegarLoop]: Abstraction has 1843 states and 2334 transitions. [2023-11-24 23:18:35,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:18:35,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 2334 transitions. [2023-11-24 23:18:35,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-24 23:18:35,196 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:18:35,196 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-24 23:18:35,208 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-24 23:18:35,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-24 23:18:35,403 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 23:18:35,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:18:35,404 INFO L85 PathProgramCache]: Analyzing trace with hash -879946373, now seen corresponding path program 1 times [2023-11-24 23:18:35,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:18:35,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162290976] [2023-11-24 23:18:35,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:18:35,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:18:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:18:35,579 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-24 23:18:35,580 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:18:35,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162290976] [2023-11-24 23:18:35,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162290976] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:18:35,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:18:35,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 23:18:35,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916482111] [2023-11-24 23:18:35,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:18:35,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 23:18:35,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:18:35,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 23:18:35,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:18:35,583 INFO L87 Difference]: Start difference. First operand 1843 states and 2334 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:18:36,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:18:36,027 INFO L93 Difference]: Finished difference Result 4085 states and 5233 transitions. [2023-11-24 23:18:36,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 23:18:36,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2023-11-24 23:18:36,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:18:36,042 INFO L225 Difference]: With dead ends: 4085 [2023-11-24 23:18:36,042 INFO L226 Difference]: Without dead ends: 2243 [2023-11-24 23:18:36,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:18:36,047 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 14 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 23:18:36,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 31 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-24 23:18:36,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2243 states. [2023-11-24 23:18:36,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2243 to 2003. [2023-11-24 23:18:36,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2003 states, 2002 states have (on average 1.2602397602397601) internal successors, (2523), 2002 states have internal predecessors, (2523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:18:36,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2003 states to 2003 states and 2523 transitions. [2023-11-24 23:18:36,114 INFO L78 Accepts]: Start accepts. Automaton has 2003 states and 2523 transitions. Word has length 114 [2023-11-24 23:18:36,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:18:36,114 INFO L495 AbstractCegarLoop]: Abstraction has 2003 states and 2523 transitions. [2023-11-24 23:18:36,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:18:36,115 INFO L276 IsEmpty]: Start isEmpty. Operand 2003 states and 2523 transitions. [2023-11-24 23:18:36,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-24 23:18:36,120 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:18:36,120 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-24 23:18:36,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 23:18:36,121 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 23:18:36,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:18:36,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1042675468, now seen corresponding path program 1 times [2023-11-24 23:18:36,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:18:36,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862891657] [2023-11-24 23:18:36,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:18:36,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:18:36,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:18:36,509 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 60 proven. 8 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-24 23:18:36,510 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:18:36,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862891657] [2023-11-24 23:18:36,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862891657] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:18:36,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701518247] [2023-11-24 23:18:36,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:18:36,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:18:36,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:18:36,512 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:18:36,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-24 23:18:36,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:18:36,652 INFO L262 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 23:18:36,664 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:18:36,729 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-24 23:18:36,729 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 23:18:36,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701518247] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:18:36,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-24 23:18:36,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2023-11-24 23:18:36,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910290600] [2023-11-24 23:18:36,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:18:36,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 23:18:36,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:18:36,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 23:18:36,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:18:36,732 INFO L87 Difference]: Start difference. First operand 2003 states and 2523 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:18:37,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:18:37,145 INFO L93 Difference]: Finished difference Result 4005 states and 5035 transitions. [2023-11-24 23:18:37,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 23:18:37,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2023-11-24 23:18:37,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:18:37,156 INFO L225 Difference]: With dead ends: 4005 [2023-11-24 23:18:37,156 INFO L226 Difference]: Without dead ends: 2003 [2023-11-24 23:18:37,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:18:37,160 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 70 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 23:18:37,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 145 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-24 23:18:37,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2023-11-24 23:18:37,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 2003. [2023-11-24 23:18:37,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2003 states, 2002 states have (on average 1.1953046953046953) internal successors, (2393), 2002 states have internal predecessors, (2393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:18:37,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2003 states to 2003 states and 2393 transitions. [2023-11-24 23:18:37,218 INFO L78 Accepts]: Start accepts. Automaton has 2003 states and 2393 transitions. Word has length 133 [2023-11-24 23:18:37,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:18:37,218 INFO L495 AbstractCegarLoop]: Abstraction has 2003 states and 2393 transitions. [2023-11-24 23:18:37,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:18:37,218 INFO L276 IsEmpty]: Start isEmpty. Operand 2003 states and 2393 transitions. [2023-11-24 23:18:37,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-11-24 23:18:37,224 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:18:37,224 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-24 23:18:37,230 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-24 23:18:37,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-24 23:18:37,430 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 23:18:37,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:18:37,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1405699860, now seen corresponding path program 1 times [2023-11-24 23:18:37,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:18:37,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459752105] [2023-11-24 23:18:37,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:18:37,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:18:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:18:37,597 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-24 23:18:37,597 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:18:37,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459752105] [2023-11-24 23:18:37,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459752105] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:18:37,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:18:37,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 23:18:37,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571555513] [2023-11-24 23:18:37,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:18:37,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 23:18:37,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:18:37,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 23:18:37,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:18:37,600 INFO L87 Difference]: Start difference. First operand 2003 states and 2393 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:18:38,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:18:38,048 INFO L93 Difference]: Finished difference Result 4805 states and 5830 transitions. [2023-11-24 23:18:38,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 23:18:38,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 162 [2023-11-24 23:18:38,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:18:38,063 INFO L225 Difference]: With dead ends: 4805 [2023-11-24 23:18:38,063 INFO L226 Difference]: Without dead ends: 2803 [2023-11-24 23:18:38,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:18:38,067 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 65 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 23:18:38,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 115 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-24 23:18:38,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2803 states. [2023-11-24 23:18:38,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2803 to 2803. [2023-11-24 23:18:38,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2803 states, 2802 states have (on average 1.1805852962169878) internal successors, (3308), 2802 states have internal predecessors, (3308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:18:38,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2803 states to 2803 states and 3308 transitions. [2023-11-24 23:18:38,141 INFO L78 Accepts]: Start accepts. Automaton has 2803 states and 3308 transitions. Word has length 162 [2023-11-24 23:18:38,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:18:38,142 INFO L495 AbstractCegarLoop]: Abstraction has 2803 states and 3308 transitions. [2023-11-24 23:18:38,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:18:38,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2803 states and 3308 transitions. [2023-11-24 23:18:38,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-11-24 23:18:38,149 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:18:38,150 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-24 23:18:38,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 23:18:38,150 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 23:18:38,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:18:38,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1276307316, now seen corresponding path program 1 times [2023-11-24 23:18:38,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:18:38,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219075950] [2023-11-24 23:18:38,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:18:38,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:18:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:18:38,268 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-24 23:18:38,268 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:18:38,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219075950] [2023-11-24 23:18:38,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219075950] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:18:38,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:18:38,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 23:18:38,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500579081] [2023-11-24 23:18:38,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:18:38,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 23:18:38,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:18:38,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 23:18:38,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:18:38,271 INFO L87 Difference]: Start difference. First operand 2803 states and 3308 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:18:38,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:18:38,793 INFO L93 Difference]: Finished difference Result 6165 states and 7301 transitions. [2023-11-24 23:18:38,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 23:18:38,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2023-11-24 23:18:38,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:18:38,809 INFO L225 Difference]: With dead ends: 6165 [2023-11-24 23:18:38,809 INFO L226 Difference]: Without dead ends: 2963 [2023-11-24 23:18:38,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:18:38,814 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 76 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-24 23:18:38,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 135 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-24 23:18:38,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2963 states. [2023-11-24 23:18:38,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2963 to 2723. [2023-11-24 23:18:38,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2723 states, 2722 states have (on average 1.1620132255694342) internal successors, (3163), 2722 states have internal predecessors, (3163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:18:38,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 3163 transitions. [2023-11-24 23:18:38,905 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 3163 transitions. Word has length 163 [2023-11-24 23:18:38,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:18:38,905 INFO L495 AbstractCegarLoop]: Abstraction has 2723 states and 3163 transitions. [2023-11-24 23:18:38,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:18:38,906 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 3163 transitions. [2023-11-24 23:18:38,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-11-24 23:18:38,913 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:18:38,914 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-24 23:18:38,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 23:18:38,914 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 23:18:38,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:18:38,915 INFO L85 PathProgramCache]: Analyzing trace with hash 518511061, now seen corresponding path program 1 times [2023-11-24 23:18:38,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:18:38,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858420616] [2023-11-24 23:18:38,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:18:38,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:18:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:18:39,379 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 135 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:18:39,380 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:18:39,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858420616] [2023-11-24 23:18:39,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858420616] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:18:39,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249460487] [2023-11-24 23:18:39,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:18:39,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:18:39,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:18:39,386 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:18:39,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-24 23:18:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:18:39,522 INFO L262 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-24 23:18:39,533 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:18:40,289 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 162 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:18:40,289 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:18:40,926 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 162 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:18:40,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249460487] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:18:40,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1169134240] [2023-11-24 23:18:40,956 INFO L159 IcfgInterpreter]: Started Sifa with 82 locations of interest [2023-11-24 23:18:40,956 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:18:40,960 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-24 23:18:40,966 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-24 23:18:40,966 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-24 23:18:56,267 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-24 23:19:02,419 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '54670#(and (= ~a17~0 8) (<= 1 |ULTIMATE.start_calculate_output_~input#1|) (= ~a25~0 1) (<= 1 |ULTIMATE.start_main_~input~0#1|) (= ~a11~0 1) (= ~a28~0 10) (= ~a21~0 1) (<= 0 (+ |ULTIMATE.start_main_~output~0#1| 1)) (<= 1 |ULTIMATE.start_calculate_output_#in~input#1|) (= ~a19~0 1))' at error location [2023-11-24 23:19:02,419 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-24 23:19:02,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:19:02,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-11-24 23:19:02,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810358726] [2023-11-24 23:19:02,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 23:19:02,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-24 23:19:02,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:19:02,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-24 23:19:02,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2023-11-24 23:19:02,430 INFO L87 Difference]: Start difference. First operand 2723 states and 3163 transitions. Second operand has 10 states, 10 states have (on average 29.0) internal successors, (290), 9 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:19:04,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:19:04,534 INFO L93 Difference]: Finished difference Result 6214 states and 7153 transitions. [2023-11-24 23:19:04,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-24 23:19:04,536 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 29.0) internal successors, (290), 9 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 185 [2023-11-24 23:19:04,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:19:04,544 INFO L225 Difference]: With dead ends: 6214 [2023-11-24 23:19:04,544 INFO L226 Difference]: Without dead ends: 1625 [2023-11-24 23:19:04,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 573 GetRequests, 393 SyntacticMatches, 148 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1883 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=220, Invalid=902, Unknown=0, NotChecked=0, Total=1122 [2023-11-24 23:19:04,552 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 808 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1643 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 1860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-24 23:19:04,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 56 Invalid, 1860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1643 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-24 23:19:04,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2023-11-24 23:19:04,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 963. [2023-11-24 23:19:04,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 962 states have (on average 1.0675675675675675) internal successors, (1027), 962 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:19:04,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1027 transitions. [2023-11-24 23:19:04,581 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1027 transitions. Word has length 185 [2023-11-24 23:19:04,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:19:04,581 INFO L495 AbstractCegarLoop]: Abstraction has 963 states and 1027 transitions. [2023-11-24 23:19:04,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 29.0) internal successors, (290), 9 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:19:04,582 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1027 transitions. [2023-11-24 23:19:04,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2023-11-24 23:19:04,585 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:19:04,586 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:19:04,597 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-24 23:19:04,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-24 23:19:04,792 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 23:19:04,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:19:04,792 INFO L85 PathProgramCache]: Analyzing trace with hash 2031644906, now seen corresponding path program 1 times [2023-11-24 23:19:04,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:19:04,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450639856] [2023-11-24 23:19:04,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:19:04,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:19:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:19:05,080 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-24 23:19:05,080 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:19:05,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450639856] [2023-11-24 23:19:05,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450639856] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:19:05,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:19:05,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 23:19:05,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922365526] [2023-11-24 23:19:05,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:19:05,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 23:19:05,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:19:05,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 23:19:05,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:19:05,083 INFO L87 Difference]: Start difference. First operand 963 states and 1027 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:19:05,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:19:05,354 INFO L93 Difference]: Finished difference Result 2005 states and 2140 transitions. [2023-11-24 23:19:05,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 23:19:05,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 220 [2023-11-24 23:19:05,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:19:05,361 INFO L225 Difference]: With dead ends: 2005 [2023-11-24 23:19:05,361 INFO L226 Difference]: Without dead ends: 1043 [2023-11-24 23:19:05,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:19:05,363 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 61 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 23:19:05,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 24 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 23:19:05,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2023-11-24 23:19:05,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1043. [2023-11-24 23:19:05,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1043 states, 1042 states have (on average 1.062380038387716) internal successors, (1107), 1042 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:19:05,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1107 transitions. [2023-11-24 23:19:05,393 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1107 transitions. Word has length 220 [2023-11-24 23:19:05,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:19:05,393 INFO L495 AbstractCegarLoop]: Abstraction has 1043 states and 1107 transitions. [2023-11-24 23:19:05,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:19:05,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1107 transitions. [2023-11-24 23:19:05,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2023-11-24 23:19:05,397 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:19:05,398 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:19:05,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-24 23:19:05,398 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 23:19:05,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:19:05,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1041191633, now seen corresponding path program 1 times [2023-11-24 23:19:05,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:19:05,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217293060] [2023-11-24 23:19:05,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:19:05,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:19:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 23:19:05,465 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 23:19:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 23:19:05,584 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-24 23:19:05,584 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 23:19:05,586 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-24 23:19:05,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-24 23:19:05,591 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:19:05,597 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 23:19:05,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 11:19:05 BoogieIcfgContainer [2023-11-24 23:19:05,797 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 23:19:05,797 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 23:19:05,798 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 23:19:05,798 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 23:19:05,798 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:18:27" (3/4) ... [2023-11-24 23:19:05,799 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-24 23:19:06,204 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/bin/utaipan-verify-SwPr7d2a91/witness.graphml [2023-11-24 23:19:06,204 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 23:19:06,205 INFO L158 Benchmark]: Toolchain (without parser) took 41277.21ms. Allocated memory was 127.9MB in the beginning and 1.1GB in the end (delta: 952.1MB). Free memory was 84.7MB in the beginning and 789.3MB in the end (delta: -704.6MB). Peak memory consumption was 250.2MB. Max. memory is 16.1GB. [2023-11-24 23:19:06,205 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 100.7MB. Free memory is still 52.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 23:19:06,206 INFO L158 Benchmark]: CACSL2BoogieTranslator took 708.86ms. Allocated memory is still 127.9MB. Free memory was 84.4MB in the beginning and 95.1MB in the end (delta: -10.6MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. [2023-11-24 23:19:06,206 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.72ms. Allocated memory was 127.9MB in the beginning and 172.0MB in the end (delta: 44.0MB). Free memory was 95.0MB in the beginning and 137.8MB in the end (delta: -42.8MB). Peak memory consumption was 6.1MB. Max. memory is 16.1GB. [2023-11-24 23:19:06,207 INFO L158 Benchmark]: Boogie Preprocessor took 73.67ms. Allocated memory is still 172.0MB. Free memory was 137.8MB in the beginning and 132.8MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-24 23:19:06,208 INFO L158 Benchmark]: RCFGBuilder took 1753.52ms. Allocated memory is still 172.0MB. Free memory was 132.8MB in the beginning and 119.8MB in the end (delta: 13.0MB). Peak memory consumption was 70.1MB. Max. memory is 16.1GB. [2023-11-24 23:19:06,208 INFO L158 Benchmark]: TraceAbstraction took 38227.35ms. Allocated memory was 172.0MB in the beginning and 1.1GB in the end (delta: 908.1MB). Free memory was 118.8MB in the beginning and 811.3MB in the end (delta: -692.5MB). Peak memory consumption was 215.6MB. Max. memory is 16.1GB. [2023-11-24 23:19:06,208 INFO L158 Benchmark]: Witness Printer took 406.78ms. Allocated memory is still 1.1GB. Free memory was 811.3MB in the beginning and 789.3MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-24 23:19:06,214 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 100.7MB. Free memory is still 52.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 708.86ms. Allocated memory is still 127.9MB. Free memory was 84.4MB in the beginning and 95.1MB in the end (delta: -10.6MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.72ms. Allocated memory was 127.9MB in the beginning and 172.0MB in the end (delta: 44.0MB). Free memory was 95.0MB in the beginning and 137.8MB in the end (delta: -42.8MB). Peak memory consumption was 6.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.67ms. Allocated memory is still 172.0MB. Free memory was 137.8MB in the beginning and 132.8MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1753.52ms. Allocated memory is still 172.0MB. Free memory was 132.8MB in the beginning and 119.8MB in the end (delta: 13.0MB). Peak memory consumption was 70.1MB. Max. memory is 16.1GB. * TraceAbstraction took 38227.35ms. Allocated memory was 172.0MB in the beginning and 1.1GB in the end (delta: 908.1MB). Free memory was 118.8MB in the beginning and 811.3MB in the end (delta: -692.5MB). Peak memory consumption was 215.6MB. Max. memory is 16.1GB. * Witness Printer took 406.78ms. Allocated memory is still 1.1GB. Free memory was 811.3MB in the beginning and 789.3MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 428]: 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; [L613] int output = -1; VAL [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] EXPR input = __VERIFIER_nondet_int() [L621] COND FALSE, EXPR !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL, EXPR calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND TRUE ((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1))) [L245] a28 = 9 [L246] return 23; VAL [\old(input)=4, \result=23, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) [L624] EXPR output = calculate_output(input) [L617-L626] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, output=23, u=21, v=22, w=23, x=24, y=25, z=26] [L616] COND TRUE 1 [L619] int input; [L620] EXPR input = __VERIFIER_nondet_int() [L621] COND FALSE, EXPR !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL, EXPR calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L247] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L258] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L263] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L269] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L290] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L301] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L303] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L307] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L319] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L338] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L341] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L359] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L364] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L385] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L388] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L390] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L399] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND TRUE (((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1)) [L405] a19 = 0 [L406] a28 = 7 [L407] return 25; VAL [\old(input)=3, \result=25, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) [L624] EXPR output = calculate_output(input) [L617-L626] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } VAL [a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, output=25, u=21, v=22, w=23, x=24, y=25, z=26] [L616] COND TRUE 1 [L619] int input; [L620] EXPR input = __VERIFIER_nondet_int() [L621] COND FALSE, EXPR !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL, EXPR calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=3, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=3, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=3, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=3, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(input)=3, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [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(input)=3, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [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(input)=3, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(input)=3, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [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(input)=3, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(input)=3, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(input)=3, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [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(input)=3, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(input)=3, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(input)=3, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [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(input)=3, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(input)=3, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(input)=3, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(input)=3, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(input)=3, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND TRUE ((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1)) [L159] a11 = 1 [L160] a19 = 1 [L161] a28 = 10 [L162] a25 = 1 [L163] return -1; VAL [\old(input)=3, \result=-1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) [L624] EXPR output = calculate_output(input) [L617-L626] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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)) [L624] CALL calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, 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))))) [L424] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L427] COND TRUE ((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8)) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L428] reach_error() VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.9s, OverallIterations: 15, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1574 SdHoareTripleChecker+Valid, 6.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1574 mSDsluCounter, 1125 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 103 mSDsCounter, 1011 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4765 IncrementalHoareTripleChecker+Invalid, 5776 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1011 mSolverCounterUnsat, 1022 mSDtfsCounter, 4765 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 943 GetRequests, 742 SyntacticMatches, 148 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1883 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2803occurred in iteration=11, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 1302 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 2479 NumberOfCodeBlocks, 2479 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2418 ConstructedInterpolants, 0 QuantifiedInterpolants, 7649 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1044 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 19 InterpolantComputations, 13 PerfectInterpolantSequences, 1349/1436 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-11-24 23:19:06,257 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36486a8d-26d4-4e1d-899e-8de8d203c59d/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE