./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i --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_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/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_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/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_845a9f86-ec86-41f2-b708-478c8b021d75/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 84da415e9ad0a7cbbc07d5b79a769caa1c0599f3ba39b8d5c5504fcb214f076c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-25 00:05:18,224 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-25 00:05:18,360 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-25 00:05:18,365 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-25 00:05:18,367 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-25 00:05:18,407 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-25 00:05:18,408 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-25 00:05:18,409 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-25 00:05:18,410 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-25 00:05:18,416 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-25 00:05:18,416 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-25 00:05:18,417 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-25 00:05:18,418 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-25 00:05:18,420 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-25 00:05:18,420 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-25 00:05:18,421 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-25 00:05:18,421 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-25 00:05:18,421 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-25 00:05:18,422 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-25 00:05:18,422 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-25 00:05:18,423 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-25 00:05:18,423 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-25 00:05:18,425 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-25 00:05:18,425 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-25 00:05:18,426 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-25 00:05:18,426 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-25 00:05:18,426 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-25 00:05:18,427 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-25 00:05:18,427 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-25 00:05:18,428 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-25 00:05:18,429 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-25 00:05:18,430 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-25 00:05:18,430 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-25 00:05:18,430 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-25 00:05:18,430 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-25 00:05:18,431 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-25 00:05:18,431 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-25 00:05:18,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:05:18,432 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-25 00:05:18,432 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-25 00:05:18,432 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-25 00:05:18,433 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-25 00:05:18,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-25 00:05:18,433 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-25 00:05:18,434 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-25 00:05:18,434 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-25 00:05:18,434 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-25 00:05:18,435 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_845a9f86-ec86-41f2-b708-478c8b021d75/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_845a9f86-ec86-41f2-b708-478c8b021d75/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 -> 84da415e9ad0a7cbbc07d5b79a769caa1c0599f3ba39b8d5c5504fcb214f076c [2023-11-25 00:05:18,808 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-25 00:05:18,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-25 00:05:18,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-25 00:05:18,850 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-25 00:05:18,851 INFO L274 PluginConnector]: CDTParser initialized [2023-11-25 00:05:18,852 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i [2023-11-25 00:05:22,145 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-25 00:05:22,396 INFO L384 CDTParser]: Found 1 translation units. [2023-11-25 00:05:22,397 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i [2023-11-25 00:05:22,410 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/data/309f02c6c/1fd778a1b67c40a5bc4a3c0d46fd48fc/FLAG3ce81a082 [2023-11-25 00:05:22,425 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/data/309f02c6c/1fd778a1b67c40a5bc4a3c0d46fd48fc [2023-11-25 00:05:22,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-25 00:05:22,429 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-25 00:05:22,431 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-25 00:05:22,431 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-25 00:05:22,439 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-25 00:05:22,440 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:05:22" (1/1) ... [2023-11-25 00:05:22,441 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f6f5231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:05:22, skipping insertion in model container [2023-11-25 00:05:22,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:05:22" (1/1) ... [2023-11-25 00:05:22,472 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-25 00:05:22,629 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_845a9f86-ec86-41f2-b708-478c8b021d75/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i[916,929] [2023-11-25 00:05:22,692 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:05:22,707 INFO L202 MainTranslator]: Completed pre-run [2023-11-25 00:05:22,728 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_845a9f86-ec86-41f2-b708-478c8b021d75/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i[916,929] [2023-11-25 00:05:22,772 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:05:22,791 INFO L206 MainTranslator]: Completed translation [2023-11-25 00:05:22,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:05:22 WrapperNode [2023-11-25 00:05:22,792 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-25 00:05:22,793 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-25 00:05:22,794 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-25 00:05:22,794 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-25 00:05:22,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:05:22" (1/1) ... [2023-11-25 00:05:22,816 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:05:22" (1/1) ... [2023-11-25 00:05:22,865 INFO L138 Inliner]: procedures = 29, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 363 [2023-11-25 00:05:22,866 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-25 00:05:22,867 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-25 00:05:22,867 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-25 00:05:22,867 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-25 00:05:22,877 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:05:22" (1/1) ... [2023-11-25 00:05:22,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:05:22" (1/1) ... [2023-11-25 00:05:22,885 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:05:22" (1/1) ... [2023-11-25 00:05:22,885 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:05:22" (1/1) ... [2023-11-25 00:05:22,912 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:05:22" (1/1) ... [2023-11-25 00:05:22,917 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:05:22" (1/1) ... [2023-11-25 00:05:22,921 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:05:22" (1/1) ... [2023-11-25 00:05:22,924 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:05:22" (1/1) ... [2023-11-25 00:05:22,930 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-25 00:05:22,931 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-25 00:05:22,931 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-25 00:05:22,931 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-25 00:05:22,932 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:05:22" (1/1) ... [2023-11-25 00:05:22,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:05:22,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:05:23,006 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-25 00:05:23,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-25 00:05:23,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-25 00:05:23,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-25 00:05:23,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-25 00:05:23,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-25 00:05:23,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-25 00:05:23,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-25 00:05:23,058 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-25 00:05:23,059 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-25 00:05:23,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-25 00:05:23,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-25 00:05:23,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-25 00:05:23,217 INFO L241 CfgBuilder]: Building ICFG [2023-11-25 00:05:23,220 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-25 00:05:23,816 INFO L282 CfgBuilder]: Performing block encoding [2023-11-25 00:05:24,579 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-25 00:05:24,579 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-25 00:05:24,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:05:24 BoogieIcfgContainer [2023-11-25 00:05:24,583 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-25 00:05:24,586 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-25 00:05:24,586 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-25 00:05:24,590 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-25 00:05:24,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 12:05:22" (1/3) ... [2023-11-25 00:05:24,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cdccb12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:05:24, skipping insertion in model container [2023-11-25 00:05:24,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:05:22" (2/3) ... [2023-11-25 00:05:24,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cdccb12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:05:24, skipping insertion in model container [2023-11-25 00:05:24,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:05:24" (3/3) ... [2023-11-25 00:05:24,595 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-31.i [2023-11-25 00:05:24,618 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-25 00:05:24,618 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-25 00:05:24,695 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-25 00:05:24,705 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;@5fabe44e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-25 00:05:24,706 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-25 00:05:24,710 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-25 00:05:24,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-25 00:05:24,722 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:05:24,724 INFO L195 NwaCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 00:05:24,724 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:05:24,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:05:24,732 INFO L85 PathProgramCache]: Analyzing trace with hash 108650302, now seen corresponding path program 1 times [2023-11-25 00:05:24,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:05:24,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384969274] [2023-11-25 00:05:24,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:05:24,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:05:25,019 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-25 00:05:25,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [552322253] [2023-11-25 00:05:25,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:05:25,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:05:25,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:05:25,028 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:05:25,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-25 00:05:25,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-25 00:05:25,702 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-25 00:05:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-25 00:05:26,102 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-25 00:05:26,105 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-25 00:05:26,106 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-25 00:05:26,120 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-25 00:05:26,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-11-25 00:05:26,326 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-11-25 00:05:26,331 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-25 00:05:26,385 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated [2023-11-25 00:05:26,395 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated [2023-11-25 00:05:26,396 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated [2023-11-25 00:05:26,397 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated [2023-11-25 00:05:26,397 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem38 could not be translated [2023-11-25 00:05:26,398 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem38 could not be translated [2023-11-25 00:05:26,399 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem39 could not be translated [2023-11-25 00:05:26,400 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem39 could not be translated [2023-11-25 00:05:26,400 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short43 could not be translated [2023-11-25 00:05:26,401 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short47 could not be translated [2023-11-25 00:05:26,401 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem41 could not be translated [2023-11-25 00:05:26,401 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem44 could not be translated [2023-11-25 00:05:26,401 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short46 could not be translated [2023-11-25 00:05:26,402 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem42 could not be translated [2023-11-25 00:05:26,402 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem45 could not be translated [2023-11-25 00:05:26,403 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short47 could not be translated [2023-11-25 00:05:26,403 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem44 could not be translated [2023-11-25 00:05:26,403 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short46 could not be translated [2023-11-25 00:05:26,403 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem45 could not be translated [2023-11-25 00:05:26,404 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem42 could not be translated [2023-11-25 00:05:26,404 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem41 could not be translated [2023-11-25 00:05:26,404 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short43 could not be translated [2023-11-25 00:05:26,405 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem49 could not be translated [2023-11-25 00:05:26,406 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem49 could not be translated [2023-11-25 00:05:26,406 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated [2023-11-25 00:05:26,407 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated [2023-11-25 00:05:26,408 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem52 could not be translated [2023-11-25 00:05:26,409 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem52 could not be translated [2023-11-25 00:05:26,409 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem53 could not be translated [2023-11-25 00:05:26,410 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem53 could not be translated [2023-11-25 00:05:26,411 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem55 could not be translated [2023-11-25 00:05:26,411 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem55 could not be translated [2023-11-25 00:05:26,412 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem56 could not be translated [2023-11-25 00:05:26,413 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem56 could not be translated [2023-11-25 00:05:26,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 12:05:26 BoogieIcfgContainer [2023-11-25 00:05:26,446 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-25 00:05:26,447 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-25 00:05:26,447 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-25 00:05:26,447 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-25 00:05:26,448 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:05:24" (3/4) ... [2023-11-25 00:05:26,450 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-25 00:05:26,452 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-25 00:05:26,454 INFO L158 Benchmark]: Toolchain (without parser) took 4024.27ms. Allocated memory is still 176.2MB. Free memory was 130.6MB in the beginning and 64.7MB in the end (delta: 66.0MB). Peak memory consumption was 67.9MB. Max. memory is 16.1GB. [2023-11-25 00:05:26,454 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 109.1MB. Free memory is still 59.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-25 00:05:26,456 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.97ms. Allocated memory is still 176.2MB. Free memory was 130.2MB in the beginning and 116.4MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-25 00:05:26,457 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.74ms. Allocated memory is still 176.2MB. Free memory was 116.0MB in the beginning and 112.6MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-25 00:05:26,465 INFO L158 Benchmark]: Boogie Preprocessor took 63.00ms. Allocated memory is still 176.2MB. Free memory was 112.6MB in the beginning and 109.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-25 00:05:26,469 INFO L158 Benchmark]: RCFGBuilder took 1652.57ms. Allocated memory is still 176.2MB. Free memory was 109.7MB in the beginning and 129.7MB in the end (delta: -20.0MB). Peak memory consumption was 42.7MB. Max. memory is 16.1GB. [2023-11-25 00:05:26,470 INFO L158 Benchmark]: TraceAbstraction took 1859.81ms. Allocated memory is still 176.2MB. Free memory was 129.7MB in the beginning and 65.7MB in the end (delta: 64.0MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2023-11-25 00:05:26,471 INFO L158 Benchmark]: Witness Printer took 5.73ms. Allocated memory is still 176.2MB. Free memory was 65.7MB in the beginning and 64.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-25 00:05:26,478 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.31ms. Allocated memory is still 109.1MB. Free memory is still 59.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 361.97ms. Allocated memory is still 176.2MB. Free memory was 130.2MB in the beginning and 116.4MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.74ms. Allocated memory is still 176.2MB. Free memory was 116.0MB in the beginning and 112.6MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.00ms. Allocated memory is still 176.2MB. Free memory was 112.6MB in the beginning and 109.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1652.57ms. Allocated memory is still 176.2MB. Free memory was 109.7MB in the beginning and 129.7MB in the end (delta: -20.0MB). Peak memory consumption was 42.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1859.81ms. Allocated memory is still 176.2MB. Free memory was 129.7MB in the beginning and 65.7MB in the end (delta: 64.0MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * Witness Printer took 5.73ms. Allocated memory is still 176.2MB. Free memory was 65.7MB in the beginning and 64.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem38 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem38 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem39 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem39 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short43 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short47 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem41 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem44 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short46 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem42 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem45 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short47 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem44 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short46 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem45 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem42 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem41 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short43 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem49 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem49 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem52 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem52 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem53 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem53 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem55 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem55 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem56 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem56 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 40. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L25-L27] double double_Array_0[2] = { 0.97, 32.6 }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {-32, 1107940323}, {4, 200} }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 4, 64 }; [L34] double last_1_double_Array_0_0_ = 0.97; [L35] signed long int last_1_signed_long_int_Array_0_1__0_ = 4; [L102] isInitial = 1 [L103] FCALL initially() [L104] COND TRUE 1 [L105] CALL updateLastVariables() [L94] EXPR double_Array_0[0] [L94] last_1_double_Array_0_0_ = double_Array_0[0] [L95] EXPR signed_long_int_Array_0[1][0] [L95] last_1_signed_long_int_Array_0_1__0_ = signed_long_int_Array_0[1][0] [L105] RET updateLastVariables() [L106] CALL updateVariables() [L75] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L79] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L81] double_Array_0[1] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[1] [L82] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L82] EXPR double_Array_0[1] [L82] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L82] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L82] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L82] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] signed_long_int_Array_0[0][0] = __VERIFIER_nondet_long() [L84] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L84] CALL assume_abort_if_not(signed_long_int_Array_0[0][0] >= -1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L84] RET assume_abort_if_not(signed_long_int_Array_0[0][0] >= -1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L85] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L85] CALL assume_abort_if_not(signed_long_int_Array_0[0][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L85] RET assume_abort_if_not(signed_long_int_Array_0[0][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L86] signed_long_int_Array_0[0][1] = __VERIFIER_nondet_long() [L87] EXPR signed_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L87] CALL assume_abort_if_not(signed_long_int_Array_0[0][1] >= 1073741822) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L87] RET assume_abort_if_not(signed_long_int_Array_0[0][1] >= 1073741822) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L88] EXPR signed_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L88] CALL assume_abort_if_not(signed_long_int_Array_0[0][1] <= 2147483646) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L88] RET assume_abort_if_not(signed_long_int_Array_0[0][1] <= 2147483646) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L90] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L90] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L90] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L91] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L106] RET updateVariables() [L107] CALL step() [L39] EXPR signed_long_int_Array_0[0][1] [L39] EXPR signed_long_int_Array_0[0][0] [L39] COND TRUE ! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_)) [L40] COND FALSE !(((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) [L48] EXPR unsigned_char_Array_0[1] [L48] EXPR unsigned_char_Array_0[1] [L48] COND FALSE !(unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) [L51] EXPR unsigned_char_Array_0[1] [L51] EXPR signed_long_int_Array_0[0][1] [L51] signed_long_int_Array_0[1][0] = (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]) [L53] EXPR unsigned_char_Array_0[1] [L53] EXPR signed_long_int_Array_0[0][1] [L53] EXPR unsigned_char_Array_0[1] [L53] COND FALSE !((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) [L64] EXPR double_Array_0[1] [L64] double_Array_0[0] = double_Array_0[1] [L66] BOOL_unsigned_char_Array_0[1] [L66] COND FALSE !(BOOL_unsigned_char_Array_0[1]) [L69] EXPR BOOL_unsigned_char_Array_0[0] [L69] BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1]) [L69] COND FALSE !(BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) [L107] RET step() [L108] CALL, EXPR property() [L98] EXPR BOOL_unsigned_char_Array_0[1] [L98] EXPR BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1) [L98] EXPR BOOL_unsigned_char_Array_0[0] [L98] EXPR BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1]) [L98] EXPR (BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1 [L98] EXPR BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1) [L98] EXPR (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1])))) [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR (unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))) [L98] EXPR signed_long_int_Array_0[1][0] [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR signed_long_int_Array_0[0][1] [L98] EXPR (unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))) [L98] EXPR (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1])))) [L98] EXPR ((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) [L98] EXPR signed_long_int_Array_0[0][1] [L98] EXPR signed_long_int_Array_0[0][0] [L98] EXPR (! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) [L98] EXPR (((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1 [L98] EXPR (! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) [L98] EXPR ((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) [L98] EXPR (((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) && (((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0] == ((double) 0.8)) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR signed_long_int_Array_0[0][1] [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0] == ((double) 0.8)) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1])) [L98] EXPR double_Array_0[0] [L98] EXPR double_Array_0[1] [L98] EXPR ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0] == ((double) 0.8)) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1])) [L98] EXPR (((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) && (((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0] == ((double) 0.8)) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) [L98-L99] return (((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) && (((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0] == ((double) 0.8)) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) ; [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 1, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 48 NumberOfCodeBlocks, 48 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 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 could not prove your program: unable to determine feasibility of some traces [2023-11-25 00:05:26,513 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/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_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/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 84da415e9ad0a7cbbc07d5b79a769caa1c0599f3ba39b8d5c5504fcb214f076c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-25 00:05:29,425 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-25 00:05:29,589 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2023-11-25 00:05:29,599 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-25 00:05:29,600 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-25 00:05:29,651 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-25 00:05:29,651 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-25 00:05:29,652 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-25 00:05:29,653 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-25 00:05:29,658 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-25 00:05:29,659 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-25 00:05:29,659 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-25 00:05:29,660 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-25 00:05:29,661 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-25 00:05:29,662 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-25 00:05:29,662 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-25 00:05:29,664 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-25 00:05:29,664 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-25 00:05:29,665 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-25 00:05:29,665 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-25 00:05:29,665 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-25 00:05:29,666 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-25 00:05:29,666 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-25 00:05:29,667 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-25 00:05:29,667 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-25 00:05:29,668 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-25 00:05:29,668 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-25 00:05:29,668 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-25 00:05:29,669 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-25 00:05:29,669 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-25 00:05:29,671 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-25 00:05:29,671 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-25 00:05:29,671 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-25 00:05:29,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-25 00:05:29,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:05:29,672 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-25 00:05:29,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-25 00:05:29,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-25 00:05:29,673 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-11-25 00:05:29,674 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-25 00:05:29,675 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-25 00:05:29,675 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-25 00:05:29,675 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-25 00:05:29,675 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-25 00:05:29,676 INFO L153 SettingsManager]: * Logic for external solver=AUFBV 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_845a9f86-ec86-41f2-b708-478c8b021d75/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_845a9f86-ec86-41f2-b708-478c8b021d75/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 -> 84da415e9ad0a7cbbc07d5b79a769caa1c0599f3ba39b8d5c5504fcb214f076c [2023-11-25 00:05:30,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-25 00:05:30,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-25 00:05:30,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-25 00:05:30,183 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-25 00:05:30,184 INFO L274 PluginConnector]: CDTParser initialized [2023-11-25 00:05:30,185 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i [2023-11-25 00:05:33,625 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-25 00:05:33,918 INFO L384 CDTParser]: Found 1 translation units. [2023-11-25 00:05:33,918 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i [2023-11-25 00:05:33,929 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/data/7087f392c/7b40a0dad3a24af7b9df3eee723bbf0d/FLAG6ecbf5f08 [2023-11-25 00:05:33,950 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/data/7087f392c/7b40a0dad3a24af7b9df3eee723bbf0d [2023-11-25 00:05:33,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-25 00:05:33,957 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-25 00:05:33,959 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-25 00:05:33,959 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-25 00:05:33,966 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-25 00:05:33,966 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:05:33" (1/1) ... [2023-11-25 00:05:33,968 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e47e325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:05:33, skipping insertion in model container [2023-11-25 00:05:33,968 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:05:33" (1/1) ... [2023-11-25 00:05:34,013 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-25 00:05:34,231 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_845a9f86-ec86-41f2-b708-478c8b021d75/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i[916,929] [2023-11-25 00:05:34,346 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:05:34,377 INFO L202 MainTranslator]: Completed pre-run [2023-11-25 00:05:34,395 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_845a9f86-ec86-41f2-b708-478c8b021d75/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i[916,929] [2023-11-25 00:05:34,461 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:05:34,485 INFO L206 MainTranslator]: Completed translation [2023-11-25 00:05:34,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:05:34 WrapperNode [2023-11-25 00:05:34,486 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-25 00:05:34,487 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-25 00:05:34,487 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-25 00:05:34,488 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-25 00:05:34,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:05:34" (1/1) ... [2023-11-25 00:05:34,529 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:05:34" (1/1) ... [2023-11-25 00:05:34,595 INFO L138 Inliner]: procedures = 33, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 361 [2023-11-25 00:05:34,596 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-25 00:05:34,598 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-25 00:05:34,598 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-25 00:05:34,598 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-25 00:05:34,610 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:05:34" (1/1) ... [2023-11-25 00:05:34,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:05:34" (1/1) ... [2023-11-25 00:05:34,620 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:05:34" (1/1) ... [2023-11-25 00:05:34,620 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:05:34" (1/1) ... [2023-11-25 00:05:34,650 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:05:34" (1/1) ... [2023-11-25 00:05:34,655 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:05:34" (1/1) ... [2023-11-25 00:05:34,660 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:05:34" (1/1) ... [2023-11-25 00:05:34,664 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:05:34" (1/1) ... [2023-11-25 00:05:34,671 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-25 00:05:34,677 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-25 00:05:34,677 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-25 00:05:34,677 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-25 00:05:34,678 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:05:34" (1/1) ... [2023-11-25 00:05:34,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:05:34,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:05:34,742 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-25 00:05:34,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-25 00:05:34,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-25 00:05:34,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2023-11-25 00:05:34,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2023-11-25 00:05:34,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-25 00:05:34,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-25 00:05:34,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-25 00:05:34,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2023-11-25 00:05:34,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-25 00:05:34,783 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-25 00:05:34,783 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-25 00:05:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-25 00:05:34,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-25 00:05:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-25 00:05:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-25 00:05:34,939 INFO L241 CfgBuilder]: Building ICFG [2023-11-25 00:05:34,942 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-25 00:05:35,792 INFO L282 CfgBuilder]: Performing block encoding [2023-11-25 00:05:35,864 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-25 00:05:35,871 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-25 00:05:35,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:05:35 BoogieIcfgContainer [2023-11-25 00:05:35,872 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-25 00:05:35,875 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-25 00:05:35,876 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-25 00:05:35,879 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-25 00:05:35,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 12:05:33" (1/3) ... [2023-11-25 00:05:35,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69350669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:05:35, skipping insertion in model container [2023-11-25 00:05:35,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:05:34" (2/3) ... [2023-11-25 00:05:35,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69350669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:05:35, skipping insertion in model container [2023-11-25 00:05:35,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:05:35" (3/3) ... [2023-11-25 00:05:35,886 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-31.i [2023-11-25 00:05:35,910 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-25 00:05:35,910 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-25 00:05:35,975 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-25 00:05:35,981 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;@3ef7c21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-25 00:05:35,981 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-25 00:05:35,987 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 66 states have (on average 1.5) internal successors, (99), 67 states have internal predecessors, (99), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-25 00:05:36,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-25 00:05:36,006 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:05:36,008 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 00:05:36,009 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:05:36,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:05:36,017 INFO L85 PathProgramCache]: Analyzing trace with hash 72265026, now seen corresponding path program 1 times [2023-11-25 00:05:36,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-25 00:05:36,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1001169095] [2023-11-25 00:05:36,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:05:36,043 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-25 00:05:36,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/mathsat [2023-11-25 00:05:36,046 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-25 00:05:36,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-25 00:05:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:05:36,448 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-25 00:05:36,463 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:05:36,534 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2023-11-25 00:05:36,536 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-25 00:05:36,537 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-25 00:05:36,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1001169095] [2023-11-25 00:05:36,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1001169095] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:05:36,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:05:36,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-25 00:05:36,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722774086] [2023-11-25 00:05:36,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:05:36,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-25 00:05:36,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-25 00:05:36,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-25 00:05:36,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-25 00:05:36,617 INFO L87 Difference]: Start difference. First operand has 80 states, 66 states have (on average 1.5) internal successors, (99), 67 states have internal predecessors, (99), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-25 00:05:36,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:05:36,709 INFO L93 Difference]: Finished difference Result 154 states and 246 transitions. [2023-11-25 00:05:36,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-25 00:05:36,712 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2023-11-25 00:05:36,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:05:36,726 INFO L225 Difference]: With dead ends: 154 [2023-11-25 00:05:36,726 INFO L226 Difference]: Without dead ends: 75 [2023-11-25 00:05:36,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-25 00:05:36,737 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-25 00:05:36,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-25 00:05:36,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-25 00:05:36,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-11-25 00:05:36,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 62 states have (on average 1.403225806451613) internal successors, (87), 62 states have internal predecessors, (87), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-25 00:05:36,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 109 transitions. [2023-11-25 00:05:36,841 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 109 transitions. Word has length 89 [2023-11-25 00:05:36,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:05:36,842 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 109 transitions. [2023-11-25 00:05:36,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-25 00:05:36,843 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 109 transitions. [2023-11-25 00:05:36,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-25 00:05:36,851 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:05:36,851 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 00:05:36,864 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-25 00:05:37,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-25 00:05:37,059 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:05:37,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:05:37,060 INFO L85 PathProgramCache]: Analyzing trace with hash -944275844, now seen corresponding path program 1 times [2023-11-25 00:05:37,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-25 00:05:37,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279896908] [2023-11-25 00:05:37,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:05:37,062 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-25 00:05:37,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/mathsat [2023-11-25 00:05:37,064 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-25 00:05:37,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-25 00:05:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:05:37,386 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-25 00:05:37,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:05:37,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-11-25 00:05:37,500 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-11-25 00:05:37,500 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-25 00:05:37,501 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-25 00:05:37,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279896908] [2023-11-25 00:05:37,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [279896908] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:05:37,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:05:37,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-25 00:05:37,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819262086] [2023-11-25 00:05:37,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:05:37,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-25 00:05:37,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-25 00:05:37,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-25 00:05:37,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:05:37,506 INFO L87 Difference]: Start difference. First operand 75 states and 109 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-25 00:05:37,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:05:37,583 INFO L93 Difference]: Finished difference Result 149 states and 217 transitions. [2023-11-25 00:05:37,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-25 00:05:37,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 89 [2023-11-25 00:05:37,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:05:37,587 INFO L225 Difference]: With dead ends: 149 [2023-11-25 00:05:37,587 INFO L226 Difference]: Without dead ends: 75 [2023-11-25 00:05:37,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 87 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-25 00:05:37,590 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:05:37,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 204 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:05:37,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-25 00:05:37,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-11-25 00:05:37,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 62 states have internal predecessors, (86), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-25 00:05:37,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 108 transitions. [2023-11-25 00:05:37,604 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 108 transitions. Word has length 89 [2023-11-25 00:05:37,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:05:37,606 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 108 transitions. [2023-11-25 00:05:37,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-25 00:05:37,607 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 108 transitions. [2023-11-25 00:05:37,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-25 00:05:37,609 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:05:37,609 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 00:05:37,624 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-25 00:05:37,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-25 00:05:37,816 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:05:37,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:05:37,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1965344198, now seen corresponding path program 1 times [2023-11-25 00:05:37,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-25 00:05:37,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [949995317] [2023-11-25 00:05:37,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:05:37,818 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-25 00:05:37,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/mathsat [2023-11-25 00:05:37,820 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-25 00:05:37,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-25 00:05:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:05:38,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-25 00:05:38,364 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:05:39,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-25 00:05:39,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-25 00:05:39,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-25 00:05:39,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-25 00:05:39,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2023-11-25 00:05:40,188 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2023-11-25 00:05:40,188 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:05:42,126 WARN L854 $PredicateComparison]: unable to prove that (forall ((|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_69 (_ BitVec 32)) (v_ArrVal_71 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|) (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) v_ArrVal_69)) |c_~#double_Array_0~0.base| v_ArrVal_71)) (.cse3 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (let ((.cse1 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 |c_~#unsigned_char_Array_0~0.base|) .cse3))))))) (= (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_71) |c_~#signed_long_int_Array_0~0.base| (let ((.cse0 (select .cse2 |c_~#signed_long_int_Array_0~0.base|))) (store .cse0 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd (select .cse0 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) .cse1)))) |c_~#unsigned_char_Array_0~0.base|) .cse3))))) .cse1)))) is different from false [2023-11-25 00:05:42,235 WARN L854 $PredicateComparison]: unable to prove that (forall ((|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_68 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_69 (_ BitVec 32)) (v_ArrVal_71 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_68))) (let ((.cse3 (store (store .cse0 |c_~#signed_long_int_Array_0~0.base| (store (select .cse0 |c_~#signed_long_int_Array_0~0.base|) (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) v_ArrVal_69)) |c_~#double_Array_0~0.base| v_ArrVal_71)) (.cse4 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (let ((.cse2 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse3 |c_~#unsigned_char_Array_0~0.base|) .cse4))))))) (= (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store .cse0 |c_~#double_Array_0~0.base| v_ArrVal_71) |c_~#signed_long_int_Array_0~0.base| (let ((.cse1 (select .cse3 |c_~#signed_long_int_Array_0~0.base|))) (store .cse1 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd (select .cse1 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) .cse2)))) |c_~#unsigned_char_Array_0~0.base|) .cse4))))) .cse2))))) is different from false [2023-11-25 00:05:42,369 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-25 00:05:42,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [949995317] [2023-11-25 00:05:42,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [949995317] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:05:42,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [547070441] [2023-11-25 00:05:42,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:05:42,370 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-25 00:05:42,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/cvc4 [2023-11-25 00:05:42,374 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-25 00:05:42,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2023-11-25 00:05:43,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:05:43,629 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-25 00:05:43,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:05:44,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-25 00:05:45,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-25 00:05:45,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-25 00:05:45,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-25 00:05:45,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-25 00:05:45,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-11-25 00:05:46,037 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2023-11-25 00:05:46,038 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:05:46,581 WARN L854 $PredicateComparison]: unable to prove that (forall ((|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_100 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_100)) (.cse3 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (let ((.cse2 (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) .cse3)))) (_ bv2 32)))) (= (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select (store .cse0 |c_~#signed_long_int_Array_0~0.base| (let ((.cse1 (select .cse0 |c_~#signed_long_int_Array_0~0.base|))) (store .cse1 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd (select .cse1 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) .cse2)))) |c_~#unsigned_char_Array_0~0.base|) .cse3))))) .cse2)))) is different from false [2023-11-25 00:05:46,706 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_98 (_ BitVec 32)) (|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_100 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|) (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) v_ArrVal_98)) |c_~#double_Array_0~0.base| v_ArrVal_100)) (.cse3 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (let ((.cse1 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 |c_~#unsigned_char_Array_0~0.base|) .cse3))))))) (= (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_100) |c_~#signed_long_int_Array_0~0.base| (let ((.cse0 (select .cse2 |c_~#signed_long_int_Array_0~0.base|))) (store .cse0 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd .cse1 (select .cse0 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)))))) |c_~#unsigned_char_Array_0~0.base|) .cse3))))) .cse1)))) is different from false [2023-11-25 00:05:46,850 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_98 (_ BitVec 32)) (|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_100 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_97 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_97))) (let ((.cse3 (store (store .cse1 |c_~#signed_long_int_Array_0~0.base| (store (select .cse1 |c_~#signed_long_int_Array_0~0.base|) (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) v_ArrVal_98)) |c_~#double_Array_0~0.base| v_ArrVal_100)) (.cse4 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (let ((.cse0 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse3 |c_~#unsigned_char_Array_0~0.base|) .cse4))))))) (= .cse0 (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store .cse1 |c_~#double_Array_0~0.base| v_ArrVal_100) |c_~#signed_long_int_Array_0~0.base| (let ((.cse2 (select .cse3 |c_~#signed_long_int_Array_0~0.base|))) (store .cse2 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd .cse0 (select .cse2 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)))))) |c_~#unsigned_char_Array_0~0.base|) .cse4)))) (_ bv2 32))))))) is different from false [2023-11-25 00:05:46,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [547070441] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:05:46,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910618152] [2023-11-25 00:05:46,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:05:46,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:05:46,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:05:46,995 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:05:47,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-25 00:05:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:05:47,474 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-25 00:05:47,480 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:05:48,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-25 00:05:48,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-25 00:05:48,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-25 00:05:48,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-25 00:05:48,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-25 00:05:48,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2023-11-25 00:05:48,973 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 36 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-11-25 00:05:48,974 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:05:49,142 WARN L854 $PredicateComparison]: unable to prove that (forall ((|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_129 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_129)) (.cse3 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (let ((.cse0 (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#unsigned_char_Array_0~0.base|) .cse3)))) (_ bv2 32)))) (= .cse0 (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select (store .cse1 |c_~#signed_long_int_Array_0~0.base| (let ((.cse2 (select .cse1 |c_~#signed_long_int_Array_0~0.base|))) (store .cse2 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd .cse0 (select .cse2 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)))))) |c_~#unsigned_char_Array_0~0.base|) .cse3)))) (_ bv2 32)))))) is different from false [2023-11-25 00:05:49,256 WARN L854 $PredicateComparison]: unable to prove that (forall ((|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_127 (_ BitVec 32)) (v_ArrVal_129 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|) (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) v_ArrVal_127)) |c_~#double_Array_0~0.base| v_ArrVal_129)) (.cse3 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (let ((.cse1 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 |c_~#unsigned_char_Array_0~0.base|) .cse3))))))) (= (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_129) |c_~#signed_long_int_Array_0~0.base| (let ((.cse0 (select .cse2 |c_~#signed_long_int_Array_0~0.base|))) (store .cse0 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd .cse1 (select .cse0 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)))))) |c_~#unsigned_char_Array_0~0.base|) .cse3))))) .cse1)))) is different from false [2023-11-25 00:05:49,398 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_127 (_ BitVec 32)) (v_ArrVal_129 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_126))) (let ((.cse3 (store (store .cse1 |c_~#signed_long_int_Array_0~0.base| (store (select .cse1 |c_~#signed_long_int_Array_0~0.base|) (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) v_ArrVal_127)) |c_~#double_Array_0~0.base| v_ArrVal_129)) (.cse4 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (let ((.cse0 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse3 |c_~#unsigned_char_Array_0~0.base|) .cse4))))))) (= .cse0 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store .cse1 |c_~#double_Array_0~0.base| v_ArrVal_129) |c_~#signed_long_int_Array_0~0.base| (let ((.cse2 (select .cse3 |c_~#signed_long_int_Array_0~0.base|))) (store .cse2 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd (select .cse2 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) .cse0)))) |c_~#unsigned_char_Array_0~0.base|) .cse4)))))))))) is different from false [2023-11-25 00:05:49,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910618152] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:05:49,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-25 00:05:49,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 17 [2023-11-25 00:05:49,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887507364] [2023-11-25 00:05:49,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-25 00:05:49,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-25 00:05:49,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-25 00:05:49,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-25 00:05:49,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=425, Unknown=10, NotChecked=408, Total=992 [2023-11-25 00:05:49,531 INFO L87 Difference]: Start difference. First operand 75 states and 108 transitions. Second operand has 18 states, 16 states have (on average 4.8125) internal successors, (77), 17 states have internal predecessors, (77), 6 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (23), 4 states have call predecessors, (23), 6 states have call successors, (23) [2023-11-25 00:05:52,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:05:52,952 INFO L93 Difference]: Finished difference Result 207 states and 293 transitions. [2023-11-25 00:05:52,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-25 00:05:52,954 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 4.8125) internal successors, (77), 17 states have internal predecessors, (77), 6 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (23), 4 states have call predecessors, (23), 6 states have call successors, (23) Word has length 89 [2023-11-25 00:05:52,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:05:52,957 INFO L225 Difference]: With dead ends: 207 [2023-11-25 00:05:52,957 INFO L226 Difference]: Without dead ends: 133 [2023-11-25 00:05:52,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 293 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=308, Invalid=836, Unknown=10, NotChecked=568, Total=1722 [2023-11-25 00:05:52,960 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 295 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-25 00:05:52,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 342 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-11-25 00:05:52,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-25 00:05:52,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 83. [2023-11-25 00:05:52,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 69 states have internal predecessors, (94), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-25 00:05:53,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 116 transitions. [2023-11-25 00:05:53,001 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 116 transitions. Word has length 89 [2023-11-25 00:05:53,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:05:53,002 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 116 transitions. [2023-11-25 00:05:53,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 4.8125) internal successors, (77), 17 states have internal predecessors, (77), 6 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (23), 4 states have call predecessors, (23), 6 states have call successors, (23) [2023-11-25 00:05:53,002 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 116 transitions. [2023-11-25 00:05:53,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-25 00:05:53,004 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:05:53,005 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 00:05:53,014 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-25 00:05:53,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2023-11-25 00:05:53,420 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-25 00:05:53,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/cvc4 --incremental --print-success --lang smt,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:05:53,613 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:05:53,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:05:53,614 INFO L85 PathProgramCache]: Analyzing trace with hash -739749665, now seen corresponding path program 1 times [2023-11-25 00:05:53,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-25 00:05:53,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1550270327] [2023-11-25 00:05:53,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:05:53,616 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-25 00:05:53,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/mathsat [2023-11-25 00:05:53,617 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-25 00:05:53,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-25 00:05:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:05:53,927 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-25 00:05:53,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:05:53,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-11-25 00:05:53,966 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-11-25 00:05:53,967 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-25 00:05:53,967 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-25 00:05:53,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1550270327] [2023-11-25 00:05:53,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1550270327] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:05:53,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:05:53,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-25 00:05:53,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649185598] [2023-11-25 00:05:53,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:05:53,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-25 00:05:53,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-25 00:05:53,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-25 00:05:53,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:05:53,973 INFO L87 Difference]: Start difference. First operand 83 states and 116 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-25 00:05:54,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:05:54,045 INFO L93 Difference]: Finished difference Result 181 states and 254 transitions. [2023-11-25 00:05:54,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-25 00:05:54,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 91 [2023-11-25 00:05:54,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:05:54,048 INFO L225 Difference]: With dead ends: 181 [2023-11-25 00:05:54,048 INFO L226 Difference]: Without dead ends: 99 [2023-11-25 00:05:54,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 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-25 00:05:54,050 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 24 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:05:54,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 201 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:05:54,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-25 00:05:54,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 83. [2023-11-25 00:05:54,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 69 states have (on average 1.3478260869565217) internal successors, (93), 69 states have internal predecessors, (93), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-25 00:05:54,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 115 transitions. [2023-11-25 00:05:54,067 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 115 transitions. Word has length 91 [2023-11-25 00:05:54,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:05:54,068 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 115 transitions. [2023-11-25 00:05:54,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-25 00:05:54,068 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 115 transitions. [2023-11-25 00:05:54,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-25 00:05:54,071 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:05:54,071 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 00:05:54,084 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-25 00:05:54,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-25 00:05:54,279 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:05:54,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:05:54,279 INFO L85 PathProgramCache]: Analyzing trace with hash -59691295, now seen corresponding path program 1 times [2023-11-25 00:05:54,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-25 00:05:54,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2102484235] [2023-11-25 00:05:54,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:05:54,281 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-25 00:05:54,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/mathsat [2023-11-25 00:05:54,282 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-25 00:05:54,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-25 00:05:54,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:05:54,725 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-25 00:05:54,730 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:05:55,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-25 00:05:55,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-25 00:05:55,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-25 00:05:55,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2023-11-25 00:05:56,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2023-11-25 00:05:56,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:05:56,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 55 [2023-11-25 00:05:57,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:05:57,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 152 treesize of output 62 [2023-11-25 00:05:57,317 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2023-11-25 00:05:57,317 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:06:00,381 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_180 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|)) (.cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32))) (.cse4 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|))) (let ((.cse2 (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (let ((.cse6 (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|))) (store .cse6 .cse5 (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) .cse3))) (bvneg (select .cse6 .cse4)))))) |c_~#double_Array_0~0.base| v_ArrVal_180))) (let ((.cse1 (select .cse2 |c_~#signed_long_int_Array_0~0.base|))) (= (let ((.cse0 (select .cse1 .cse4))) (bvadd (bvneg .cse0) ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_180) |c_~#signed_long_int_Array_0~0.base| (store .cse1 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 |c_~#unsigned_char_Array_0~0.base|) .cse3))))) .cse0))) |c_~#unsigned_char_Array_0~0.base|) .cse3))))) (select .cse1 .cse5)))))) is different from false [2023-11-25 00:06:00,462 WARN L854 $PredicateComparison]: unable to prove that (forall ((|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_180 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|)) (.cse4 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) (.cse2 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (let ((.cse1 (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (let ((.cse6 (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|))) (store .cse6 .cse5 (bvadd (bvneg (select .cse6 .cse4)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) .cse2))))))) |c_~#double_Array_0~0.base| v_ArrVal_180))) (let ((.cse0 (select .cse1 |c_~#signed_long_int_Array_0~0.base|))) (= (let ((.cse3 (select .cse0 .cse4))) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_180) |c_~#signed_long_int_Array_0~0.base| (store .cse0 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#unsigned_char_Array_0~0.base|) .cse2))))) .cse3))) |c_~#unsigned_char_Array_0~0.base|) .cse2))) (bvneg .cse3))) (select .cse0 .cse5)))))) is different from false [2023-11-25 00:06:00,574 WARN L854 $PredicateComparison]: unable to prove that (forall ((|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_180 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|)) (.cse6 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) (.cse4 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))) (.cse2 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_177))) (let ((.cse3 (store (store .cse2 |c_~#signed_long_int_Array_0~0.base| (let ((.cse7 (select .cse2 |c_~#signed_long_int_Array_0~0.base|))) (store .cse7 .cse1 (bvadd (bvneg (select .cse7 .cse6)) ((_ zero_extend 24) ((_ extract 7 0) (select v_ArrVal_177 .cse4))))))) |c_~#double_Array_0~0.base| v_ArrVal_180))) (let ((.cse0 (select .cse3 |c_~#signed_long_int_Array_0~0.base|))) (= (select .cse0 .cse1) (let ((.cse5 (select .cse0 .cse6))) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store .cse2 |c_~#double_Array_0~0.base| v_ArrVal_180) |c_~#signed_long_int_Array_0~0.base| (store .cse0 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse3 |c_~#unsigned_char_Array_0~0.base|) .cse4)))) (_ bv2 32)) .cse5))) |c_~#unsigned_char_Array_0~0.base|) .cse4))) (bvneg .cse5)))))))) is different from false [2023-11-25 00:06:00,685 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-25 00:06:00,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2102484235] [2023-11-25 00:06:00,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2102484235] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:06:00,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [570751898] [2023-11-25 00:06:00,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:06:00,686 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-25 00:06:00,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/cvc4 [2023-11-25 00:06:00,687 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-25 00:06:00,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2023-11-25 00:06:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:06:01,573 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-25 00:06:01,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:06:03,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-25 00:06:03,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-25 00:06:04,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-11-25 00:06:04,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2023-11-25 00:06:04,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2023-11-25 00:06:04,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2023-11-25 00:06:05,762 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-11-25 00:06:05,762 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-25 00:06:05,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [570751898] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:06:05,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-25 00:06:05,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 17 [2023-11-25 00:06:05,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230712321] [2023-11-25 00:06:05,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:06:05,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-25 00:06:05,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-25 00:06:05,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-25 00:06:05,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=380, Unknown=16, NotChecked=126, Total=600 [2023-11-25 00:06:05,766 INFO L87 Difference]: Start difference. First operand 83 states and 115 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-25 00:06:11,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:06:11,571 INFO L93 Difference]: Finished difference Result 270 states and 377 transitions. [2023-11-25 00:06:11,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-25 00:06:11,572 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 91 [2023-11-25 00:06:11,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:06:11,575 INFO L225 Difference]: With dead ends: 270 [2023-11-25 00:06:11,575 INFO L226 Difference]: Without dead ends: 188 [2023-11-25 00:06:11,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=231, Invalid=819, Unknown=18, NotChecked=192, Total=1260 [2023-11-25 00:06:11,578 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 277 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-11-25 00:06:11,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 429 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-11-25 00:06:11,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-11-25 00:06:11,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 109. [2023-11-25 00:06:11,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 95 states have internal predecessors, (131), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-25 00:06:11,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 153 transitions. [2023-11-25 00:06:11,597 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 153 transitions. Word has length 91 [2023-11-25 00:06:11,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:06:11,598 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 153 transitions. [2023-11-25 00:06:11,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-25 00:06:11,599 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 153 transitions. [2023-11-25 00:06:11,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-25 00:06:11,601 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:06:11,601 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 00:06:11,613 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-25 00:06:11,814 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2023-11-25 00:06:12,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/cvc4 --incremental --print-success --lang smt [2023-11-25 00:06:12,009 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:06:12,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:06:12,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1355345998, now seen corresponding path program 1 times [2023-11-25 00:06:12,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-25 00:06:12,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [36525461] [2023-11-25 00:06:12,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:06:12,010 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-25 00:06:12,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/mathsat [2023-11-25 00:06:12,013 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-25 00:06:12,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-25 00:06:12,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:06:12,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-25 00:06:12,304 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:06:13,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-25 00:06:13,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-25 00:06:14,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-25 00:06:14,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-25 00:06:14,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-25 00:06:14,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2023-11-25 00:06:14,413 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2023-11-25 00:06:14,413 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:06:14,552 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_step_#t~mem30#1_18| (_ BitVec 8)) (v_ArrVal_239 (Array (_ BitVec 32) (_ BitVec 32)))) (not (bvslt (select (select (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_239) |c_~#signed_long_int_Array_0~0.base|) (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem30#1_18|)))) is different from false [2023-11-25 00:06:14,581 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_step_#t~mem30#1_18| (_ BitVec 8)) (v_ArrVal_237 (_ BitVec 32)) (v_ArrVal_239 (Array (_ BitVec 32) (_ BitVec 32)))) (not (bvslt (select (select (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|) (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) v_ArrVal_237)) |c_~#double_Array_0~0.base| v_ArrVal_239) |c_~#signed_long_int_Array_0~0.base|) (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem30#1_18|)))) is different from false [2023-11-25 00:06:14,614 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_step_#t~mem30#1_18| (_ BitVec 8)) (v_ArrVal_236 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_237 (_ BitVec 32)) (v_ArrVal_239 (Array (_ BitVec 32) (_ BitVec 32)))) (not (bvslt (select (select (store (let ((.cse0 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_236))) (store .cse0 |c_~#signed_long_int_Array_0~0.base| (store (select .cse0 |c_~#signed_long_int_Array_0~0.base|) (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) v_ArrVal_237))) |c_~#double_Array_0~0.base| v_ArrVal_239) |c_~#signed_long_int_Array_0~0.base|) (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem30#1_18|)))) is different from false [2023-11-25 00:06:14,656 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-25 00:06:14,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [36525461] [2023-11-25 00:06:14,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [36525461] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:06:14,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [988825044] [2023-11-25 00:06:14,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:06:14,657 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-25 00:06:14,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/cvc4 [2023-11-25 00:06:14,659 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-25 00:06:14,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845a9f86-ec86-41f2-b708-478c8b021d75/bin/utaipan-verify-SwPr7d2a91/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2023-11-25 00:06:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:06:15,318 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-25 00:06:15,323 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:06:15,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10