./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.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_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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 1c975edcf93ad701ca3189f1eb3683e2db491e10cd89ec62916352d02b9ad719 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-25 00:03:22,926 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-25 00:03:23,052 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-25 00:03:23,060 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-25 00:03:23,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-25 00:03:23,122 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-25 00:03:23,123 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-25 00:03:23,124 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-25 00:03:23,125 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-25 00:03:23,130 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-25 00:03:23,130 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-25 00:03:23,132 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-25 00:03:23,132 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-25 00:03:23,134 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-25 00:03:23,135 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-25 00:03:23,135 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-25 00:03:23,136 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-25 00:03:23,136 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-25 00:03:23,137 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-25 00:03:23,137 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-25 00:03:23,138 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-25 00:03:23,138 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-25 00:03:23,139 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-25 00:03:23,140 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-25 00:03:23,141 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-25 00:03:23,141 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-25 00:03:23,142 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-25 00:03:23,142 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-25 00:03:23,143 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-25 00:03:23,143 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-25 00:03:23,144 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-25 00:03:23,145 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-25 00:03:23,154 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-25 00:03:23,155 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-25 00:03:23,155 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-25 00:03:23,156 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-25 00:03:23,156 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-25 00:03:23,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:03:23,157 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-25 00:03:23,157 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-25 00:03:23,157 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-25 00:03:23,158 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-25 00:03:23,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-25 00:03:23,158 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-25 00:03:23,159 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-25 00:03:23,159 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-25 00:03:23,159 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-25 00:03:23,160 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_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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 -> 1c975edcf93ad701ca3189f1eb3683e2db491e10cd89ec62916352d02b9ad719 [2023-11-25 00:03:23,543 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-25 00:03:23,579 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-25 00:03:23,581 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-25 00:03:23,584 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-25 00:03:23,584 INFO L274 PluginConnector]: CDTParser initialized [2023-11-25 00:03:23,586 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i [2023-11-25 00:03:26,683 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-25 00:03:26,968 INFO L384 CDTParser]: Found 1 translation units. [2023-11-25 00:03:26,969 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i [2023-11-25 00:03:26,980 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/data/340550256/02a39afe9c774b75a3c3d356ed26b023/FLAG48f699d6b [2023-11-25 00:03:27,007 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/data/340550256/02a39afe9c774b75a3c3d356ed26b023 [2023-11-25 00:03:27,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-25 00:03:27,012 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-25 00:03:27,013 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-25 00:03:27,014 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-25 00:03:27,020 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-25 00:03:27,021 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:03:27" (1/1) ... [2023-11-25 00:03:27,022 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17e6341d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:27, skipping insertion in model container [2023-11-25 00:03:27,022 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:03:27" (1/1) ... [2023-11-25 00:03:27,057 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-25 00:03:27,232 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_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i[915,928] [2023-11-25 00:03:27,290 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:03:27,302 INFO L202 MainTranslator]: Completed pre-run [2023-11-25 00:03:27,315 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_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i[915,928] [2023-11-25 00:03:27,355 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:03:27,375 INFO L206 MainTranslator]: Completed translation [2023-11-25 00:03:27,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:27 WrapperNode [2023-11-25 00:03:27,376 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-25 00:03:27,377 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-25 00:03:27,378 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-25 00:03:27,378 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-25 00:03:27,386 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:03:27" (1/1) ... [2023-11-25 00:03:27,400 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:03:27" (1/1) ... [2023-11-25 00:03:27,446 INFO L138 Inliner]: procedures = 29, calls = 107, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 303 [2023-11-25 00:03:27,446 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-25 00:03:27,447 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-25 00:03:27,447 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-25 00:03:27,448 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-25 00:03:27,458 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:27" (1/1) ... [2023-11-25 00:03:27,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:27" (1/1) ... [2023-11-25 00:03:27,465 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:27" (1/1) ... [2023-11-25 00:03:27,465 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:27" (1/1) ... [2023-11-25 00:03:27,486 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:27" (1/1) ... [2023-11-25 00:03:27,490 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:27" (1/1) ... [2023-11-25 00:03:27,493 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:27" (1/1) ... [2023-11-25 00:03:27,496 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:27" (1/1) ... [2023-11-25 00:03:27,501 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-25 00:03:27,502 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-25 00:03:27,503 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-25 00:03:27,503 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-25 00:03:27,504 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:27" (1/1) ... [2023-11-25 00:03:27,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:03:27,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:03:27,551 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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:03:27,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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:03:27,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-25 00:03:27,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-25 00:03:27,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-25 00:03:27,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-25 00:03:27,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-25 00:03:27,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-25 00:03:27,633 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-25 00:03:27,633 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-25 00:03:27,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-25 00:03:27,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-25 00:03:27,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-25 00:03:27,755 INFO L241 CfgBuilder]: Building ICFG [2023-11-25 00:03:27,758 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-25 00:03:28,307 INFO L282 CfgBuilder]: Performing block encoding [2023-11-25 00:03:28,903 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-25 00:03:28,904 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-25 00:03:28,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:03:28 BoogieIcfgContainer [2023-11-25 00:03:28,908 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-25 00:03:28,911 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-25 00:03:28,911 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-25 00:03:28,915 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-25 00:03:28,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 12:03:27" (1/3) ... [2023-11-25 00:03:28,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7918c283 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:03:28, skipping insertion in model container [2023-11-25 00:03:28,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:27" (2/3) ... [2023-11-25 00:03:28,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7918c283 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:03:28, skipping insertion in model container [2023-11-25 00:03:28,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:03:28" (3/3) ... [2023-11-25 00:03:28,925 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-9.i [2023-11-25 00:03:28,948 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-25 00:03:28,948 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-25 00:03:29,017 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-25 00:03:29,026 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;@faf8d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-25 00:03:29,027 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-25 00:03:29,032 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-25 00:03:29,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-25 00:03:29,051 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:03:29,052 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:03:29,053 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:03:29,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:03:29,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1141670329, now seen corresponding path program 1 times [2023-11-25 00:03:29,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:03:29,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644448095] [2023-11-25 00:03:29,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:03:29,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:03:29,275 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-25 00:03:29,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1746817600] [2023-11-25 00:03:29,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:03:29,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:03:29,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:03:29,280 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:03:29,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-25 00:03:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-25 00:03:30,013 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-25 00:03:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-25 00:03:30,421 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-25 00:03:30,424 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-25 00:03:30,425 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-25 00:03:30,441 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-25 00:03:30,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:03:30,639 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-11-25 00:03:30,644 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-25 00:03:30,692 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem28 could not be translated [2023-11-25 00:03:30,694 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem28 could not be translated [2023-11-25 00:03:30,694 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem29 could not be translated [2023-11-25 00:03:30,695 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem29 could not be translated [2023-11-25 00:03:30,696 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem34 could not be translated [2023-11-25 00:03:30,697 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem31 could not be translated [2023-11-25 00:03:30,697 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated [2023-11-25 00:03:30,697 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short37 could not be translated [2023-11-25 00:03:30,697 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short36 could not be translated [2023-11-25 00:03:30,698 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short33 could not be translated [2023-11-25 00:03:30,698 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated [2023-11-25 00:03:30,699 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short36 could not be translated [2023-11-25 00:03:30,699 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated [2023-11-25 00:03:30,699 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short37 could not be translated [2023-11-25 00:03:30,700 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem34 could not be translated [2023-11-25 00:03:30,700 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short33 could not be translated [2023-11-25 00:03:30,700 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated [2023-11-25 00:03:30,700 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem31 could not be translated [2023-11-25 00:03:30,701 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem39 could not be translated [2023-11-25 00:03:30,702 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem39 could not be translated [2023-11-25 00:03:30,703 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem40 could not be translated [2023-11-25 00:03:30,704 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem40 could not be translated [2023-11-25 00:03:30,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 12:03:30 BoogieIcfgContainer [2023-11-25 00:03:30,725 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-25 00:03:30,725 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-25 00:03:30,725 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-25 00:03:30,726 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-25 00:03:30,726 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:03:28" (3/4) ... [2023-11-25 00:03:30,729 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-25 00:03:30,730 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-25 00:03:30,731 INFO L158 Benchmark]: Toolchain (without parser) took 3719.32ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 142.9MB in the beginning and 104.8MB in the end (delta: 38.1MB). Peak memory consumption was 72.4MB. Max. memory is 16.1GB. [2023-11-25 00:03:30,732 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 130.0MB. Free memory is still 102.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-25 00:03:30,732 INFO L158 Benchmark]: CACSL2BoogieTranslator took 363.42ms. Allocated memory is still 172.0MB. Free memory was 142.9MB in the beginning and 129.5MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-25 00:03:30,733 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.21ms. Allocated memory is still 172.0MB. Free memory was 129.5MB in the beginning and 126.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-25 00:03:30,734 INFO L158 Benchmark]: Boogie Preprocessor took 54.39ms. Allocated memory is still 172.0MB. Free memory was 126.1MB in the beginning and 124.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-25 00:03:30,734 INFO L158 Benchmark]: RCFGBuilder took 1405.42ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 123.2MB in the beginning and 159.4MB in the end (delta: -36.1MB). Peak memory consumption was 61.9MB. Max. memory is 16.1GB. [2023-11-25 00:03:30,735 INFO L158 Benchmark]: TraceAbstraction took 1814.10ms. Allocated memory is still 207.6MB. Free memory was 158.3MB in the beginning and 104.8MB in the end (delta: 53.5MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2023-11-25 00:03:30,737 INFO L158 Benchmark]: Witness Printer took 4.67ms. Allocated memory is still 207.6MB. Free memory is still 104.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-25 00:03:30,741 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.28ms. Allocated memory is still 130.0MB. Free memory is still 102.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 363.42ms. Allocated memory is still 172.0MB. Free memory was 142.9MB in the beginning and 129.5MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.21ms. Allocated memory is still 172.0MB. Free memory was 129.5MB in the beginning and 126.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.39ms. Allocated memory is still 172.0MB. Free memory was 126.1MB in the beginning and 124.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1405.42ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 123.2MB in the beginning and 159.4MB in the end (delta: -36.1MB). Peak memory consumption was 61.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1814.10ms. Allocated memory is still 207.6MB. Free memory was 158.3MB in the beginning and 104.8MB in the end (delta: 53.5MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * Witness Printer took 4.67ms. Allocated memory is still 207.6MB. Free memory is still 104.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem28 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem28 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem29 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem29 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem34 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem31 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short37 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short36 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short33 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short36 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short37 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem34 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short33 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem31 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~mem40 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem40 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 44, overapproximation of shiftLeft at line 51. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25-L27] double double_Array_0[2] = { 9.2, 0.975 }; [L28-L30] signed long int signed_long_int_Array_0[1] = { -16 }; [L31-L33] signed short int signed_short_int_Array_0[2] = { 1, 100 }; [L34-L36] unsigned char unsigned_char_Array_0[3] = { 32, 4, 10 }; [L37] double last_1_double_Array_0_0_ = 9.2; [L38] signed long int last_1_signed_long_int_Array_0_0_ = -16; [L39] signed short int last_1_signed_short_int_Array_0_0_ = 1; [L40] unsigned char last_1_unsigned_char_Array_0_2_ = 10; [L91] isInitial = 1 [L92] FCALL initially() [L93] COND TRUE 1 [L94] CALL updateLastVariables() [L81] EXPR double_Array_0[0] [L81] last_1_double_Array_0_0_ = double_Array_0[0] [L82] EXPR signed_long_int_Array_0[0] [L82] last_1_signed_long_int_Array_0_0_ = signed_long_int_Array_0[0] [L83] EXPR signed_short_int_Array_0[0] [L83] last_1_signed_short_int_Array_0_0_ = signed_short_int_Array_0[0] [L84] EXPR unsigned_char_Array_0[2] [L84] last_1_unsigned_char_Array_0_2_ = unsigned_char_Array_0[2] [L94] RET updateLastVariables() [L95] CALL updateVariables() [L71] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L72] 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_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L72] 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_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) [L72] 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_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] 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_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] 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_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) [L73] 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_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] double_Array_0[1] = __VERIFIER_nondet_double() [L75] EXPR double_Array_0[1] [L75] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L75] EXPR double_Array_0[1] [L75] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L75] 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_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] 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_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) [L75] 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_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L77] EXPR 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_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] CALL assume_abort_if_not(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_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) [L77] RET assume_abort_if_not(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_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] EXPR 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_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 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_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) [L78] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] RET updateVariables() [L96] CALL step() [L44] unsigned char stepLocal_0 = last_1_double_Array_0_0_ > last_1_double_Array_0_0_; [L45] COND TRUE ((last_1_signed_short_int_Array_0_0_ + last_1_unsigned_char_Array_0_2_) < 10) || stepLocal_0 [L46] EXPR unsigned_char_Array_0[1] [L46] EXPR ((((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? (((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_) [L46] EXPR unsigned_char_Array_0[1] [L46] EXPR ((((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? (((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_) [L46] signed_short_int_Array_0[0] = ((((((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? (((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_))) [L50] EXPR signed_short_int_Array_0[0] [L50] signed_long_int_Array_0[0] = signed_short_int_Array_0[0] [L51] EXPR signed_short_int_Array_0[0] [L51] EXPR 10 << signed_short_int_Array_0[0] [L51] EXPR unsigned_char_Array_0[1] [L51] EXPR signed_long_int_Array_0[0] [L51] COND FALSE !((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) [L54] unsigned_char_Array_0[0] = 64 [L55] EXPR double_Array_0[1] [L55] double_Array_0[0] = double_Array_0[1] [L56] EXPR signed_short_int_Array_0[0] [L56] COND FALSE !(signed_short_int_Array_0[0] <= 16) [L59] EXPR double_Array_0[0] [L59] EXPR double_Array_0[0] [L59] EXPR ((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]) [L59] EXPR double_Array_0[0] [L59] EXPR ((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]) [L59] EXPR double_Array_0[0] [L59] COND FALSE !(((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) [L66] EXPR unsigned_char_Array_0[1] [L66] unsigned_char_Array_0[2] = unsigned_char_Array_0[1] [L96] RET step() [L97] CALL, EXPR property() [L87] EXPR signed_short_int_Array_0[0] [L87] EXPR (signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) [L87] EXPR double_Array_0[0] [L87] EXPR double_Array_0[0] [L87] EXPR ((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]) [L87] EXPR double_Array_0[0] [L87] EXPR ((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]) [L87] EXPR double_Array_0[0] [L87] EXPR (((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) [L87] EXPR unsigned_char_Array_0[2] [L87] EXPR unsigned_char_Array_0[1] [L87] EXPR (((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) [L87] EXPR (signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) [L87] EXPR ((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1) [L87] EXPR signed_short_int_Array_0[0] [L87] EXPR 10 << signed_short_int_Array_0[0] [L87] EXPR unsigned_char_Array_0[1] [L87] EXPR signed_long_int_Array_0[0] [L87] EXPR ((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1 [L87] EXPR signed_short_int_Array_0[1] [L87] EXPR signed_short_int_Array_0[0] [L87] EXPR signed_long_int_Array_0[0] [L87] EXPR ((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1 [L87] EXPR ((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1) [L87] EXPR (((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64)) [L87] EXPR ((((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64))) && (double_Array_0[0] == ((double) double_Array_0[1])) [L87] EXPR (((((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64))) && (double_Array_0[0] == ((double) double_Array_0[1]))) && ((((last_1_signed_short_int_Array_0_0_ + last_1_unsigned_char_Array_0_2_) < 10) || (last_1_double_Array_0_0_ > last_1_double_Array_0_0_)) ? (signed_short_int_Array_0[0] == ((signed short int) ((((((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? (((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_))))) : (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_))) [L87] EXPR ((((((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64))) && (double_Array_0[0] == ((double) double_Array_0[1]))) && ((((last_1_signed_short_int_Array_0_0_ + last_1_unsigned_char_Array_0_2_) < 10) || (last_1_double_Array_0_0_ > last_1_double_Array_0_0_)) ? (signed_short_int_Array_0[0] == ((signed short int) ((((((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? (((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_))))) : (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_)))) && (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[0])) [L87-L88] return ((((((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64))) && (double_Array_0[0] == ((double) double_Array_0[1]))) && ((((last_1_signed_short_int_Array_0_0_ + last_1_unsigned_char_Array_0_2_) < 10) || (last_1_double_Array_0_0_ > last_1_double_Array_0_0_)) ? (signed_short_int_Array_0[0] == ((signed short int) ((((((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? (((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_))))) : (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_)))) && (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[0])) ; [L97] RET, EXPR property() [L97] 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_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8: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_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 1, TraceHistogramMax: 5, 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=19occurred 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, 24 NumberOfCodeBlocks, 24 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:03:30,779 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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 1c975edcf93ad701ca3189f1eb3683e2db491e10cd89ec62916352d02b9ad719 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-25 00:03:33,423 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-25 00:03:33,514 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2023-11-25 00:03:33,520 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-25 00:03:33,521 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-25 00:03:33,550 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-25 00:03:33,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-25 00:03:33,551 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-25 00:03:33,552 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-25 00:03:33,553 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-25 00:03:33,553 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-25 00:03:33,554 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-25 00:03:33,554 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-25 00:03:33,555 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-25 00:03:33,555 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-25 00:03:33,556 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-25 00:03:33,557 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-25 00:03:33,557 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-25 00:03:33,558 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-25 00:03:33,558 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-25 00:03:33,559 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-25 00:03:33,559 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-25 00:03:33,560 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-25 00:03:33,560 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-25 00:03:33,561 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-25 00:03:33,561 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-25 00:03:33,562 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-25 00:03:33,562 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-25 00:03:33,562 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-25 00:03:33,563 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-25 00:03:33,563 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-25 00:03:33,564 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-25 00:03:33,564 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-25 00:03:33,565 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-25 00:03:33,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:03:33,565 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-25 00:03:33,566 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-25 00:03:33,566 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-25 00:03:33,567 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-11-25 00:03:33,567 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-25 00:03:33,567 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-25 00:03:33,568 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-25 00:03:33,568 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-25 00:03:33,568 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-25 00:03:33,568 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_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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 -> 1c975edcf93ad701ca3189f1eb3683e2db491e10cd89ec62916352d02b9ad719 [2023-11-25 00:03:33,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-25 00:03:33,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-25 00:03:33,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-25 00:03:33,987 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-25 00:03:33,987 INFO L274 PluginConnector]: CDTParser initialized [2023-11-25 00:03:33,989 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i [2023-11-25 00:03:37,460 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-25 00:03:37,718 INFO L384 CDTParser]: Found 1 translation units. [2023-11-25 00:03:37,719 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i [2023-11-25 00:03:37,728 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/data/aebfae5a4/719c40b11b784635841d35373e53f169/FLAGd73e64ddc [2023-11-25 00:03:37,744 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/data/aebfae5a4/719c40b11b784635841d35373e53f169 [2023-11-25 00:03:37,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-25 00:03:37,748 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-25 00:03:37,750 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-25 00:03:37,750 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-25 00:03:37,755 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-25 00:03:37,756 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:03:37" (1/1) ... [2023-11-25 00:03:37,758 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5849087f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:37, skipping insertion in model container [2023-11-25 00:03:37,758 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:03:37" (1/1) ... [2023-11-25 00:03:37,785 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-25 00:03:37,976 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_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i[915,928] [2023-11-25 00:03:38,032 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:03:38,050 INFO L202 MainTranslator]: Completed pre-run [2023-11-25 00:03:38,064 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_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i[915,928] [2023-11-25 00:03:38,103 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:03:38,129 INFO L206 MainTranslator]: Completed translation [2023-11-25 00:03:38,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:38 WrapperNode [2023-11-25 00:03:38,130 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-25 00:03:38,132 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-25 00:03:38,132 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-25 00:03:38,132 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-25 00:03:38,140 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:03:38" (1/1) ... [2023-11-25 00:03:38,159 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:03:38" (1/1) ... [2023-11-25 00:03:38,221 INFO L138 Inliner]: procedures = 36, calls = 107, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 294 [2023-11-25 00:03:38,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-25 00:03:38,223 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-25 00:03:38,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-25 00:03:38,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-25 00:03:38,234 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:38" (1/1) ... [2023-11-25 00:03:38,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:38" (1/1) ... [2023-11-25 00:03:38,256 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:38" (1/1) ... [2023-11-25 00:03:38,271 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:38" (1/1) ... [2023-11-25 00:03:38,309 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:38" (1/1) ... [2023-11-25 00:03:38,347 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:38" (1/1) ... [2023-11-25 00:03:38,351 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:38" (1/1) ... [2023-11-25 00:03:38,354 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:38" (1/1) ... [2023-11-25 00:03:38,361 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-25 00:03:38,372 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-25 00:03:38,373 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-25 00:03:38,373 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-25 00:03:38,374 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:38" (1/1) ... [2023-11-25 00:03:38,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:03:38,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:03:38,423 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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:03:38,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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:03:38,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-25 00:03:38,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2023-11-25 00:03:38,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2023-11-25 00:03:38,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-25 00:03:38,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2023-11-25 00:03:38,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-25 00:03:38,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-25 00:03:38,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2023-11-25 00:03:38,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-25 00:03:38,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2023-11-25 00:03:38,480 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-25 00:03:38,480 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-25 00:03:38,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-25 00:03:38,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-25 00:03:38,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-25 00:03:38,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2023-11-25 00:03:38,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-25 00:03:38,632 INFO L241 CfgBuilder]: Building ICFG [2023-11-25 00:03:38,635 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-25 00:03:39,388 INFO L282 CfgBuilder]: Performing block encoding [2023-11-25 00:03:39,464 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-25 00:03:39,464 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-25 00:03:39,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:03:39 BoogieIcfgContainer [2023-11-25 00:03:39,465 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-25 00:03:39,467 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-25 00:03:39,468 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-25 00:03:39,471 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-25 00:03:39,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 12:03:37" (1/3) ... [2023-11-25 00:03:39,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f60efd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:03:39, skipping insertion in model container [2023-11-25 00:03:39,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:38" (2/3) ... [2023-11-25 00:03:39,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f60efd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:03:39, skipping insertion in model container [2023-11-25 00:03:39,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:03:39" (3/3) ... [2023-11-25 00:03:39,475 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-9.i [2023-11-25 00:03:39,496 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-25 00:03:39,496 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-25 00:03:39,550 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-25 00:03:39,557 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;@49fa89b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-25 00:03:39,557 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-25 00:03:39,562 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-25 00:03:39,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-25 00:03:39,574 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:03:39,575 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:39,575 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:03:39,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:03:39,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1212209025, now seen corresponding path program 1 times [2023-11-25 00:03:39,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-25 00:03:39,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [726318476] [2023-11-25 00:03:39,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:03:39,599 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:03:39,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/mathsat [2023-11-25 00:03:39,604 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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:03:39,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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:03:39,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:03:39,919 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-25 00:03:39,926 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:03:39,963 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-11-25 00:03:39,964 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-25 00:03:39,965 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-25 00:03:39,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [726318476] [2023-11-25 00:03:39,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [726318476] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:03:39,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:03:39,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-25 00:03:39,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910417083] [2023-11-25 00:03:39,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:03:39,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-25 00:03:39,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-25 00:03:40,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-25 00:03:40,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-25 00:03:40,018 INFO L87 Difference]: Start difference. First operand has 63 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-25 00:03:40,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:03:40,104 INFO L93 Difference]: Finished difference Result 123 states and 187 transitions. [2023-11-25 00:03:40,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-25 00:03:40,108 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2023-11-25 00:03:40,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:03:40,118 INFO L225 Difference]: With dead ends: 123 [2023-11-25 00:03:40,118 INFO L226 Difference]: Without dead ends: 61 [2023-11-25 00:03:40,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 54 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:03:40,129 INFO L413 NwaCegarLoop]: 83 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, 83 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:03:40,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-25 00:03:40,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-25 00:03:40,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-11-25 00:03:40,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 54 states have internal predecessors, (77), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-25 00:03:40,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 87 transitions. [2023-11-25 00:03:40,188 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 87 transitions. Word has length 55 [2023-11-25 00:03:40,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:03:40,189 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 87 transitions. [2023-11-25 00:03:40,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-25 00:03:40,190 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 87 transitions. [2023-11-25 00:03:40,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-25 00:03:40,193 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:03:40,193 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:40,198 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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)] Ended with exit code 0 [2023-11-25 00:03:40,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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:03:40,396 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:03:40,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:03:40,397 INFO L85 PathProgramCache]: Analyzing trace with hash -428638785, now seen corresponding path program 1 times [2023-11-25 00:03:40,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-25 00:03:40,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1872045654] [2023-11-25 00:03:40,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:03:40,399 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:03:40,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/mathsat [2023-11-25 00:03:40,401 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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:03:40,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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:03:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:03:40,669 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-25 00:03:40,674 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:03:40,712 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-25 00:03:40,713 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-25 00:03:40,713 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-25 00:03:40,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1872045654] [2023-11-25 00:03:40,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1872045654] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:03:40,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:03:40,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-25 00:03:40,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142077744] [2023-11-25 00:03:40,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:03:40,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-25 00:03:40,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-25 00:03:40,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-25 00:03:40,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-25 00:03:40,718 INFO L87 Difference]: Start difference. First operand 61 states and 87 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-25 00:03:40,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:03:40,846 INFO L93 Difference]: Finished difference Result 127 states and 182 transitions. [2023-11-25 00:03:40,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-25 00:03:40,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2023-11-25 00:03:40,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:03:40,849 INFO L225 Difference]: With dead ends: 127 [2023-11-25 00:03:40,849 INFO L226 Difference]: Without dead ends: 67 [2023-11-25 00:03:40,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-25 00:03:40,852 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 10 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:03:40,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 238 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:03:40,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-25 00:03:40,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2023-11-25 00:03:40,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 56 states have internal predecessors, (79), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-25 00:03:40,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 89 transitions. [2023-11-25 00:03:40,863 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 89 transitions. Word has length 55 [2023-11-25 00:03:40,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:03:40,863 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 89 transitions. [2023-11-25 00:03:40,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-25 00:03:40,864 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 89 transitions. [2023-11-25 00:03:40,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-25 00:03:40,866 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:03:40,866 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:40,880 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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:03:41,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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:03:41,072 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:03:41,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:03:41,073 INFO L85 PathProgramCache]: Analyzing trace with hash -852285507, now seen corresponding path program 1 times [2023-11-25 00:03:41,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-25 00:03:41,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [907535878] [2023-11-25 00:03:41,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:03:41,074 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:03:41,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/mathsat [2023-11-25 00:03:41,078 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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:03:41,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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:03:41,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:03:41,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-25 00:03:41,338 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:03:41,389 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-25 00:03:41,391 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-25 00:03:41,392 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-25 00:03:41,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [907535878] [2023-11-25 00:03:41,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [907535878] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:03:41,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:03:41,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-25 00:03:41,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363079710] [2023-11-25 00:03:41,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:03:41,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-25 00:03:41,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-25 00:03:41,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-25 00:03:41,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-25 00:03:41,399 INFO L87 Difference]: Start difference. First operand 63 states and 89 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-25 00:03:41,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:03:41,499 INFO L93 Difference]: Finished difference Result 149 states and 212 transitions. [2023-11-25 00:03:41,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-25 00:03:41,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55 [2023-11-25 00:03:41,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:03:41,502 INFO L225 Difference]: With dead ends: 149 [2023-11-25 00:03:41,503 INFO L226 Difference]: Without dead ends: 87 [2023-11-25 00:03:41,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-25 00:03:41,507 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 48 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:03:41,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 249 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:03:41,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-25 00:03:41,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 65. [2023-11-25 00:03:41,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 58 states have (on average 1.396551724137931) internal successors, (81), 58 states have internal predecessors, (81), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-25 00:03:41,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 91 transitions. [2023-11-25 00:03:41,529 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 91 transitions. Word has length 55 [2023-11-25 00:03:41,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:03:41,530 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 91 transitions. [2023-11-25 00:03:41,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-25 00:03:41,531 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 91 transitions. [2023-11-25 00:03:41,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-25 00:03:41,539 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:03:41,540 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:41,553 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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:03:41,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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:03:41,746 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:03:41,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:03:41,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1245312517, now seen corresponding path program 1 times [2023-11-25 00:03:41,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-25 00:03:41,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844741951] [2023-11-25 00:03:41,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:03:41,747 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:03:41,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/mathsat [2023-11-25 00:03:41,756 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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:03:41,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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)] Waiting until timeout for monitored process [2023-11-25 00:03:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:03:41,996 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-25 00:03:41,999 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:03:42,035 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-25 00:03:42,036 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-25 00:03:42,036 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-25 00:03:42,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844741951] [2023-11-25 00:03:42,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [844741951] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:03:42,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:03:42,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-25 00:03:42,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123578186] [2023-11-25 00:03:42,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:03:42,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-25 00:03:42,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-25 00:03:42,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-25 00:03:42,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-25 00:03:42,039 INFO L87 Difference]: Start difference. First operand 65 states and 91 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-25 00:03:42,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:03:42,161 INFO L93 Difference]: Finished difference Result 160 states and 226 transitions. [2023-11-25 00:03:42,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-25 00:03:42,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55 [2023-11-25 00:03:42,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:03:42,164 INFO L225 Difference]: With dead ends: 160 [2023-11-25 00:03:42,164 INFO L226 Difference]: Without dead ends: 96 [2023-11-25 00:03:42,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-25 00:03:42,166 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 69 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:03:42,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 342 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:03:42,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-25 00:03:42,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 67. [2023-11-25 00:03:42,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 60 states have internal predecessors, (83), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-25 00:03:42,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 93 transitions. [2023-11-25 00:03:42,176 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 93 transitions. Word has length 55 [2023-11-25 00:03:42,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:03:42,176 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 93 transitions. [2023-11-25 00:03:42,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-25 00:03:42,177 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2023-11-25 00:03:42,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-25 00:03:42,178 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:03:42,178 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:42,188 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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)] Forceful destruction successful, exit code 0 [2023-11-25 00:03:42,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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:03:42,384 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:03:42,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:03:42,385 INFO L85 PathProgramCache]: Analyzing trace with hash -2054659143, now seen corresponding path program 1 times [2023-11-25 00:03:42,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-25 00:03:42,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1585769162] [2023-11-25 00:03:42,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:03:42,386 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:03:42,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/mathsat [2023-11-25 00:03:42,388 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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:03:42,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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 (6)] Waiting until timeout for monitored process [2023-11-25 00:03:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:03:42,610 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-25 00:03:42,614 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:03:42,654 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-25 00:03:42,654 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-25 00:03:42,654 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-25 00:03:42,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1585769162] [2023-11-25 00:03:42,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1585769162] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:03:42,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:03:42,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-25 00:03:42,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859032100] [2023-11-25 00:03:42,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:03:42,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-25 00:03:42,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-25 00:03:42,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-25 00:03:42,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-25 00:03:42,658 INFO L87 Difference]: Start difference. First operand 67 states and 93 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-25 00:03:42,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:03:42,915 INFO L93 Difference]: Finished difference Result 154 states and 213 transitions. [2023-11-25 00:03:42,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-25 00:03:42,916 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55 [2023-11-25 00:03:42,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:03:42,918 INFO L225 Difference]: With dead ends: 154 [2023-11-25 00:03:42,918 INFO L226 Difference]: Without dead ends: 88 [2023-11-25 00:03:42,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2023-11-25 00:03:42,920 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 34 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:03:42,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 446 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-25 00:03:42,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-25 00:03:42,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 71. [2023-11-25 00:03:42,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 64 states have (on average 1.359375) internal successors, (87), 64 states have internal predecessors, (87), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-25 00:03:42,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 97 transitions. [2023-11-25 00:03:42,935 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 97 transitions. Word has length 55 [2023-11-25 00:03:42,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:03:42,937 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 97 transitions. [2023-11-25 00:03:42,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-25 00:03:42,938 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 97 transitions. [2023-11-25 00:03:42,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-25 00:03:42,940 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:03:42,941 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:42,952 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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 (6)] Forceful destruction successful, exit code 0 [2023-11-25 00:03:43,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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:03:43,147 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:03:43,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:03:43,147 INFO L85 PathProgramCache]: Analyzing trace with hash -2054599561, now seen corresponding path program 1 times [2023-11-25 00:03:43,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-25 00:03:43,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997595877] [2023-11-25 00:03:43,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:03:43,149 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:03:43,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/mathsat [2023-11-25 00:03:43,150 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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:03:43,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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:03:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:03:43,425 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-25 00:03:43,430 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:03:43,486 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 21 treesize of output 21 [2023-11-25 00:03:43,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:03:43,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 30 [2023-11-25 00:03:43,584 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-25 00:03:43,584 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-25 00:03:43,585 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-25 00:03:43,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997595877] [2023-11-25 00:03:43,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997595877] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:03:43,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:03:43,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-25 00:03:43,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978719340] [2023-11-25 00:03:43,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:03:43,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-25 00:03:43,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-25 00:03:43,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-25 00:03:43,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-25 00:03:43,588 INFO L87 Difference]: Start difference. First operand 71 states and 97 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-25 00:03:44,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:03:44,228 INFO L93 Difference]: Finished difference Result 165 states and 225 transitions. [2023-11-25 00:03:44,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-25 00:03:44,229 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55 [2023-11-25 00:03:44,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:03:44,230 INFO L225 Difference]: With dead ends: 165 [2023-11-25 00:03:44,231 INFO L226 Difference]: Without dead ends: 95 [2023-11-25 00:03:44,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-25 00:03:44,232 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 92 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-25 00:03:44,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 207 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-25 00:03:44,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-25 00:03:44,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 73. [2023-11-25 00:03:44,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 66 states have internal predecessors, (89), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-25 00:03:44,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 99 transitions. [2023-11-25 00:03:44,240 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 99 transitions. Word has length 55 [2023-11-25 00:03:44,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:03:44,241 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 99 transitions. [2023-11-25 00:03:44,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-25 00:03:44,242 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 99 transitions. [2023-11-25 00:03:44,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-25 00:03:44,243 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:03:44,243 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:44,261 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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:03:44,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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:03:44,462 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:03:44,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:03:44,462 INFO L85 PathProgramCache]: Analyzing trace with hash 757046272, now seen corresponding path program 1 times [2023-11-25 00:03:44,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-25 00:03:44,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1808777307] [2023-11-25 00:03:44,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:03:44,463 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:03:44,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/mathsat [2023-11-25 00:03:44,465 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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:03:44,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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:03:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:03:44,866 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-25 00:03:44,875 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:03:45,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2023-11-25 00:03:46,480 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 131 treesize of output 102 [2023-11-25 00:03:47,223 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 131 treesize of output 102 [2023-11-25 00:03:47,292 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 131 treesize of output 102 [2023-11-25 00:03:47,439 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 131 treesize of output 102 [2023-11-25 00:03:47,571 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 203 treesize of output 157 [2023-11-25 00:03:47,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:03:47,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 102 [2023-11-25 00:03:47,831 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 161 treesize of output 134 [2023-11-25 00:03:48,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:03:48,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 346 treesize of output 144 [2023-11-25 00:03:48,752 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-25 00:03:48,752 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:03:49,408 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_153 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_149 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64))) (let ((.cse4 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse6 (select (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_149) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse6 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_153) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (let ((.cse7 (concat (select .cse6 .cse4) (select .cse6 .cse5)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|))))))) is different from false [2023-11-25 00:03:49,458 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_153 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_149 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64))) (let ((.cse6 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_148))) (let ((.cse4 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse7 (select (store .cse6 |c_~#unsigned_char_Array_0~0.base| v_ArrVal_149) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store .cse6 |c_~#double_Array_0~0.base| (store (store .cse7 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_153) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (let ((.cse8 (concat (select .cse7 .cse4) (select .cse7 .cse5)))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))))))) is different from false [2023-11-25 00:03:49,515 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_147 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_153 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_149 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64))) (let ((.cse8 (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_147) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_148))) (let ((.cse2 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select (store .cse8 |c_~#unsigned_char_Array_0~0.base| v_ArrVal_149) |c_~#double_Array_0~0.base|))) (or (not (= (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store .cse8 |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_153) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))))) is different from false [2023-11-25 00:03:49,634 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-25 00:03:49,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1808777307] [2023-11-25 00:03:49,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1808777307] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:03:49,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [800503658] [2023-11-25 00:03:49,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:03:49,635 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-25 00:03:49,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/cvc4 [2023-11-25 00:03:49,637 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-25 00:03:49,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2023-11-25 00:03:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:03:50,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-25 00:03:50,826 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:03:51,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-11-25 00:03:52,851 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 113 treesize of output 82 [2023-11-25 00:03:53,626 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 113 treesize of output 82 [2023-11-25 00:03:53,671 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 113 treesize of output 82 [2023-11-25 00:03:53,892 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 113 treesize of output 82 [2023-11-25 00:03:54,069 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 171 treesize of output 123 [2023-11-25 00:03:54,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 100 [2023-11-25 00:03:54,390 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 174 treesize of output 127 [2023-11-25 00:03:55,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 323 treesize of output 139 [2023-11-25 00:03:55,232 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-25 00:03:55,233 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:03:55,524 WARN L854 $PredicateComparison]: unable to prove that (forall ((|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_153 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_38| (_ BitVec 64)) (v_ArrVal_180 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (not (= (let ((.cse0 (let ((.cse1 (select (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_180) |c_~#double_Array_0~0.base|))) (concat (select .cse1 .cse2) (select .cse1 .cse3))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_38|)))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store (select (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) |~#unsigned_char_Array_0~0.offset| ((_ sign_extend 24) (_ bv64 8)))) |c_~#double_Array_0~0.base|) |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_38|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_38|))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_153) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))))))) is different from false [2023-11-25 00:03:56,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [800503658] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:03:56,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889290926] [2023-11-25 00:03:56,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:03:56,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:03:56,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:03:56,318 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:03:56,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-25 00:03:56,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:03:56,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-25 00:03:56,744 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:03:57,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2023-11-25 00:04:01,091 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 131 treesize of output 102 [2023-11-25 00:04:01,690 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 131 treesize of output 102 [2023-11-25 00:04:01,736 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 131 treesize of output 102 [2023-11-25 00:04:01,769 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 131 treesize of output 102 [2023-11-25 00:04:01,807 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 172 [2023-11-25 00:04:01,813 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 207 treesize of output 169 [2023-11-25 00:04:01,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 8 [2023-11-25 00:04:01,831 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:04:01,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 102 [2023-11-25 00:04:02,118 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 169 treesize of output 140 [2023-11-25 00:04:02,735 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:04:02,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 346 treesize of output 144 [2023-11-25 00:04:02,765 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-25 00:04:02,766 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-25 00:04:02,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889290926] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:04:02,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-25 00:04:02,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12, 12] total 26 [2023-11-25 00:04:02,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245907177] [2023-11-25 00:04:02,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:04:02,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-25 00:04:02,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-25 00:04:02,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-25 00:04:02,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=769, Unknown=35, NotChecked=244, Total=1190 [2023-11-25 00:04:02,769 INFO L87 Difference]: Start difference. First operand 73 states and 99 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-25 00:04:15,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:04:15,207 INFO L93 Difference]: Finished difference Result 211 states and 286 transitions. [2023-11-25 00:04:15,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-25 00:04:15,208 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2023-11-25 00:04:15,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:04:15,210 INFO L225 Difference]: With dead ends: 211 [2023-11-25 00:04:15,210 INFO L226 Difference]: Without dead ends: 139 [2023-11-25 00:04:15,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 180 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=221, Invalid=1159, Unknown=42, NotChecked=300, Total=1722 [2023-11-25 00:04:15,213 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 258 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 16 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:04:15,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 351 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 615 Invalid, 15 Unknown, 0 Unchecked, 8.2s Time] [2023-11-25 00:04:15,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-11-25 00:04:15,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 114. [2023-11-25 00:04:15,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 103 states have (on average 1.3689320388349515) internal successors, (141), 103 states have internal predecessors, (141), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-25 00:04:15,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 157 transitions. [2023-11-25 00:04:15,240 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 157 transitions. Word has length 57 [2023-11-25 00:04:15,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:04:15,240 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 157 transitions. [2023-11-25 00:04:15,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-25 00:04:15,241 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 157 transitions. [2023-11-25 00:04:15,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-25 00:04:15,242 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:04:15,242 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:15,252 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-25 00:04:15,458 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2023-11-25 00:04:15,657 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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:04:15,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/cvc4 --incremental --print-success --lang smt,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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:04:15,852 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:04:15,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:04:15,853 INFO L85 PathProgramCache]: Analyzing trace with hash -52300354, now seen corresponding path program 1 times [2023-11-25 00:04:15,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-25 00:04:15,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [345411353] [2023-11-25 00:04:15,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:04:15,854 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:04:15,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/mathsat [2023-11-25 00:04:15,855 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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:04:15,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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 (11)] Waiting until timeout for monitored process [2023-11-25 00:04:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:04:16,143 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-25 00:04:16,152 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:04:16,364 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-11-25 00:04:16,368 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 12 [2023-11-25 00:04:16,394 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 28 treesize of output 12 [2023-11-25 00:04:16,454 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 34 treesize of output 22 [2023-11-25 00:04:16,477 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-25 00:04:16,477 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-25 00:04:16,477 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-25 00:04:16,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [345411353] [2023-11-25 00:04:16,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [345411353] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:04:16,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:04:16,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-25 00:04:16,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953998640] [2023-11-25 00:04:16,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:04:16,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-25 00:04:16,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-25 00:04:16,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-25 00:04:16,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-25 00:04:16,479 INFO L87 Difference]: Start difference. First operand 114 states and 157 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-25 00:04:17,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:04:17,176 INFO L93 Difference]: Finished difference Result 231 states and 317 transitions. [2023-11-25 00:04:17,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-25 00:04:17,177 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2023-11-25 00:04:17,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:04:17,179 INFO L225 Difference]: With dead ends: 231 [2023-11-25 00:04:17,179 INFO L226 Difference]: Without dead ends: 118 [2023-11-25 00:04:17,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-25 00:04:17,180 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 118 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-25 00:04:17,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 143 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-25 00:04:17,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-25 00:04:17,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2023-11-25 00:04:17,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 103 states have (on average 1.3495145631067962) internal successors, (139), 103 states have internal predecessors, (139), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-25 00:04:17,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 155 transitions. [2023-11-25 00:04:17,194 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 155 transitions. Word has length 57 [2023-11-25 00:04:17,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:04:17,194 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 155 transitions. [2023-11-25 00:04:17,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-25 00:04:17,195 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 155 transitions. [2023-11-25 00:04:17,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-25 00:04:17,196 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:04:17,196 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:17,206 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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 (11)] Ended with exit code 0 [2023-11-25 00:04:17,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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:04:17,402 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:04:17,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:04:17,403 INFO L85 PathProgramCache]: Analyzing trace with hash -445327364, now seen corresponding path program 1 times [2023-11-25 00:04:17,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-25 00:04:17,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1685726022] [2023-11-25 00:04:17,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:04:17,404 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:04:17,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/bin/utaipan-verify-SwPr7d2a91/mathsat [2023-11-25 00:04:17,406 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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:04:17,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e669b-bb0b-4b13-bdf0-4c9b6965cbeb/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 (12)] Waiting until timeout for monitored process [2023-11-25 00:04:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:04:17,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-25 00:04:17,722 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:04:17,774 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 17 treesize of output 9 [2023-11-25 00:04:18,364 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 [2023-11-25 00:04:18,394 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 26 treesize of output 21 [2023-11-25 00:04:18,443 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 49 treesize of output 39 [2023-11-25 00:04:18,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 43 [2023-11-25 00:04:18,659 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 53 treesize of output 43 [2023-11-25 00:04:18,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:04:18,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 105 treesize of output 51 [2023-11-25 00:04:18,960 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-25 00:04:18,960 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-25 00:04:18,960 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-25 00:04:18,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1685726022] [2023-11-25 00:04:18,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1685726022] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:04:18,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:04:18,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-25 00:04:18,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941907267] [2023-11-25 00:04:18,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:04:18,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-25 00:04:18,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-25 00:04:18,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-25 00:04:18,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-25 00:04:18,962 INFO L87 Difference]: Start difference. First operand 114 states and 155 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5)