./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-49.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-49.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E --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 8b91f1f51b5e066a8b0d7e6d03754d28953e63e6dd17294fbe476ba36b896c8f --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 04:19:44,926 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 04:19:45,016 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 04:19:45,024 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 04:19:45,024 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 04:19:45,055 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 04:19:45,055 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 04:19:45,055 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 04:19:45,056 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 04:19:45,056 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 04:19:45,056 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 04:19:45,056 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 04:19:45,056 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 04:19:45,057 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 04:19:45,057 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 04:19:45,057 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 04:19:45,057 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 04:19:45,057 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 04:19:45,057 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 04:19:45,057 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 04:19:45,057 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 04:19:45,058 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 04:19:45,058 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 04:19:45,058 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 04:19:45,058 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 04:19:45,058 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 04:19:45,058 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 04:19:45,059 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 04:19:45,059 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 04:19:45,059 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 04:19:45,059 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 04:19:45,059 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 04:19:45,059 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 04:19:45,059 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 04:19:45,059 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 04:19:45,060 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 04:19:45,060 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 04:19:45,060 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 04:19:45,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:19:45,060 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 04:19:45,060 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 04:19:45,060 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 04:19:45,060 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 04:19:45,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 04:19:45,063 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 04:19:45,063 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 04:19:45,063 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 04:19:45,063 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E 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 -> 8b91f1f51b5e066a8b0d7e6d03754d28953e63e6dd17294fbe476ba36b896c8f [2024-11-14 04:19:45,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 04:19:45,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 04:19:45,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 04:19:45,492 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 04:19:45,492 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 04:19:45,495 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-49.i Unable to find full path for "g++" [2024-11-14 04:19:47,529 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 04:19:47,847 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 04:19:47,852 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-49.i [2024-11-14 04:19:47,865 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/data/7a1b3c26d/e315497311dd4beea82d04c8243b99b4/FLAG16648c7c8 [2024-11-14 04:19:47,887 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/data/7a1b3c26d/e315497311dd4beea82d04c8243b99b4 [2024-11-14 04:19:47,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 04:19:47,893 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 04:19:47,895 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 04:19:47,897 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 04:19:47,903 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 04:19:47,904 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:19:47" (1/1) ... [2024-11-14 04:19:47,905 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fb46f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:19:47, skipping insertion in model container [2024-11-14 04:19:47,907 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:19:47" (1/1) ... [2024-11-14 04:19:47,939 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 04:19:48,113 WARN L250 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_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-49.i[917,930] [2024-11-14 04:19:48,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:19:48,231 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 04:19:48,243 WARN L250 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_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-49.i[917,930] [2024-11-14 04:19:48,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:19:48,314 INFO L204 MainTranslator]: Completed translation [2024-11-14 04:19:48,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:19:48 WrapperNode [2024-11-14 04:19:48,315 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 04:19:48,316 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 04:19:48,316 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 04:19:48,317 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 04:19:48,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:19:48" (1/1) ... [2024-11-14 04:19:48,337 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:19:48" (1/1) ... [2024-11-14 04:19:48,393 INFO L138 Inliner]: procedures = 29, calls = 195, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 673 [2024-11-14 04:19:48,393 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 04:19:48,394 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 04:19:48,394 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 04:19:48,394 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 04:19:48,402 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:19:48" (1/1) ... [2024-11-14 04:19:48,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:19:48" (1/1) ... [2024-11-14 04:19:48,410 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:19:48" (1/1) ... [2024-11-14 04:19:48,410 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:19:48" (1/1) ... [2024-11-14 04:19:48,427 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:19:48" (1/1) ... [2024-11-14 04:19:48,432 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:19:48" (1/1) ... [2024-11-14 04:19:48,436 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:19:48" (1/1) ... [2024-11-14 04:19:48,438 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:19:48" (1/1) ... [2024-11-14 04:19:48,444 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 04:19:48,445 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 04:19:48,445 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 04:19:48,445 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 04:19:48,446 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:19:48" (1/1) ... [2024-11-14 04:19:48,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:19:48,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:19:48,495 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 04:19:48,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 04:19:48,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 04:19:48,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-14 04:19:48,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 04:19:48,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-14 04:19:48,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 04:19:48,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2024-11-14 04:19:48,525 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-14 04:19:48,525 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-14 04:19:48,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 04:19:48,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 04:19:48,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 04:19:48,681 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 04:19:48,682 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 04:19:49,414 INFO L? ?]: Removed 216 outVars from TransFormulas that were not future-live. [2024-11-14 04:19:49,414 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 04:19:50,522 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 04:19:50,523 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 04:19:50,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:19:50 BoogieIcfgContainer [2024-11-14 04:19:50,524 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 04:19:50,528 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 04:19:50,529 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 04:19:50,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 04:19:50,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:19:47" (1/3) ... [2024-11-14 04:19:50,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41263777 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:19:50, skipping insertion in model container [2024-11-14 04:19:50,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:19:48" (2/3) ... [2024-11-14 04:19:50,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41263777 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:19:50, skipping insertion in model container [2024-11-14 04:19:50,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:19:50" (3/3) ... [2024-11-14 04:19:50,539 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-49.i [2024-11-14 04:19:50,558 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 04:19:50,561 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-49.i that has 2 procedures, 37 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-14 04:19:50,644 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 04:19:50,662 INFO L333 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, 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;@43bf37a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:19:50,663 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 04:19:50,668 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-14 04:19:50,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-14 04:19:50,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:19:50,679 INFO L215 NwaCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:19:50,680 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:19:50,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:19:50,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1602503252, now seen corresponding path program 1 times [2024-11-14 04:19:50,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:19:50,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424161950] [2024-11-14 04:19:50,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:19:50,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:19:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 04:19:54,334 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 04:19:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 04:19:56,304 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 04:19:56,306 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 04:19:56,308 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-14 04:19:56,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 04:19:56,317 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-14 04:19:56,429 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 04:19:56,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 04:19:56 BoogieIcfgContainer [2024-11-14 04:19:56,433 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 04:19:56,434 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 04:19:56,434 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 04:19:56,434 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 04:19:56,435 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:19:50" (3/4) ... [2024-11-14 04:19:56,438 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-14 04:19:56,438 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 04:19:56,440 INFO L158 Benchmark]: Toolchain (without parser) took 8546.66ms. Allocated memory was 142.6MB in the beginning and 637.5MB in the end (delta: 494.9MB). Free memory was 118.3MB in the beginning and 543.0MB in the end (delta: -424.7MB). Peak memory consumption was 73.5MB. Max. memory is 16.1GB. [2024-11-14 04:19:56,440 INFO L158 Benchmark]: CDTParser took 0.78ms. Allocated memory is still 167.8MB. Free memory is still 104.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:19:56,441 INFO L158 Benchmark]: CACSL2BoogieTranslator took 421.15ms. Allocated memory is still 142.6MB. Free memory was 118.3MB in the beginning and 100.8MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 04:19:56,441 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.04ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 96.1MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 04:19:56,441 INFO L158 Benchmark]: Boogie Preprocessor took 50.62ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 93.1MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:19:56,442 INFO L158 Benchmark]: RCFGBuilder took 2078.79ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 93.1MB in the beginning and 310.6MB in the end (delta: -217.5MB). Peak memory consumption was 63.1MB. Max. memory is 16.1GB. [2024-11-14 04:19:56,442 INFO L158 Benchmark]: TraceAbstraction took 5905.66ms. Allocated memory was 411.0MB in the beginning and 637.5MB in the end (delta: 226.5MB). Free memory was 309.8MB in the beginning and 543.0MB in the end (delta: -233.3MB). Peak memory consumption was 304.4MB. Max. memory is 16.1GB. [2024-11-14 04:19:56,443 INFO L158 Benchmark]: Witness Printer took 4.77ms. Allocated memory is still 637.5MB. Free memory was 543.0MB in the beginning and 543.0MB in the end (delta: 83.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 04:19:56,445 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.78ms. Allocated memory is still 167.8MB. Free memory is still 104.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 421.15ms. Allocated memory is still 142.6MB. Free memory was 118.3MB in the beginning and 100.8MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.04ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 96.1MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.62ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 93.1MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 2078.79ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 93.1MB in the beginning and 310.6MB in the end (delta: -217.5MB). Peak memory consumption was 63.1MB. Max. memory is 16.1GB. * TraceAbstraction took 5905.66ms. Allocated memory was 411.0MB in the beginning and 637.5MB in the end (delta: 226.5MB). Free memory was 309.8MB in the beginning and 543.0MB in the end (delta: -233.3MB). Peak memory consumption was 304.4MB. Max. memory is 16.1GB. * Witness Printer took 4.77ms. Allocated memory is still 637.5MB. Free memory was 543.0MB in the beginning and 543.0MB in the end (delta: 83.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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 shiftRight at line 50, overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryFLOATComparisonOperation at line 62, overapproximation of someBinaryFLOATComparisonOperation at line 84. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 0} }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0][0]); [L26] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer = &(BOOL_unsigned_char_Array_0[1][0]); [L27] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer = &(BOOL_unsigned_char_Array_0[0][1]); [L28] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer = &(BOOL_unsigned_char_Array_0[1][1]); [L29-L31] float float_Array_0[2] = { 1000.2, 1000000000000000.4 }; [L32] float* float_Array_0_arrayfloat_Array_0arrayVar0_Pointer = &(float_Array_0[0]); [L33] float* float_Array_0_arrayfloat_Array_0arrayVar1_Pointer = &(float_Array_0[1]); [L34-L36] signed short int signed_short_int_Array_0[2] = { -2, 128 }; [L37] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer = &(signed_short_int_Array_0[0]); [L38] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer = &(signed_short_int_Array_0[1]); [L39-L41] unsigned short int unsigned_short_int_Array_0[2][2] = { {10, 256}, {4, 4} }; [L42] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer = &(unsigned_short_int_Array_0[0][0]); [L43] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer = &(unsigned_short_int_Array_0[1][0]); [L44] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer = &(unsigned_short_int_Array_0[0][1]); [L45] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer = &(unsigned_short_int_Array_0[1][1]); [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] FCALL updateLastVariables() [L111] CALL updateVariables() [L77] BOOL_unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L78] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L78] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L20] COND FALSE !(!cond) [L78] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L79] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L20] COND FALSE !(!cond) [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L80] BOOL_unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L81] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L81] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L20] COND FALSE !(!cond) [L81] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L82] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L82] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L20] COND FALSE !(!cond) [L82] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L83] float_Array_0[0] = __VERIFIER_nondet_float() [L84] EXPR float_Array_0[0] [L84] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L84] EXPR float_Array_0[0] [L84] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L84] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L84] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L20] COND FALSE !(!cond) [L84] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L85] float_Array_0[1] = __VERIFIER_nondet_float() [L86] EXPR float_Array_0[1] [L86] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F [L86] EXPR float_Array_0[1] [L86] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F [L86] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L86] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L20] COND FALSE !(!cond) [L86] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L87] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L88] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L88] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -32766) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L20] COND FALSE !(!cond) [L88] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -32766) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L89] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L89] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L20] COND FALSE !(!cond) [L89] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L90] unsigned_short_int_Array_0[0][0] = __VERIFIER_nondet_ushort() [L91] EXPR unsigned_short_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L91] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L20] COND FALSE !(!cond) [L91] RET assume_abort_if_not(unsigned_short_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L92] EXPR unsigned_short_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L92] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L20] COND FALSE !(!cond) [L92] RET assume_abort_if_not(unsigned_short_int_Array_0[0][0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L93] unsigned_short_int_Array_0[1][0] = __VERIFIER_nondet_ushort() [L94] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L94] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L20] COND FALSE !(!cond) [L94] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L95] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L95] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L20] COND FALSE !(!cond) [L95] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L96] unsigned_short_int_Array_0[0][1] = __VERIFIER_nondet_ushort() [L97] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L97] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L20] COND FALSE !(!cond) [L97] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L98] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L98] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L20] COND FALSE !(!cond) [L98] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L111] RET updateVariables() [L112] CALL step() [L49] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L49] EXPR (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) [L49] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L49] EXPR (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) [L49] (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) = (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) [L50] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer) [L50] EXPR 50 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) [L50] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L50] COND FALSE !((50 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) <= (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) [L53] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer) [L53] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) = (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))) [L55] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) [L55] COND TRUE ! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) [L56] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer) [L56] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L56] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L56] EXPR (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) [L56] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L56] EXPR (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) [L56] COND FALSE !((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) >= (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))))) [L59] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer) [L59] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) = (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) [L62] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) [L62] COND FALSE !((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= 64.5f) [L73] (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) = 50 [L112] RET step() [L113] CALL, EXPR property() [L103] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) [L103] EXPR ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= 64.5f) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) 50)) [L103] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) [L103] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) [L103] EXPR ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) [L103] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) [L103] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) [L103] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer) [L103] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L103] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) [L103] EXPR ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) [L103] EXPR ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= 64.5f) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) 50)) [L103] EXPR (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= 64.5f) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) 50))) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))))) [L103] EXPR ((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= 64.5f) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) 50))) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))))))) && (((50 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) <= (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) ((! (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)))))) [L103] EXPR (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= 64.5f) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) 50))) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))))))) && (((50 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) <= (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) ((! (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))))))) && ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) >= (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))))) : 1) [L103-L104] return (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= 64.5f) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) 50))) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))))))) && (((50 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) <= (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) ((! (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))))))) && ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) >= (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))))) : 1) ; [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 1, TraceHistogramMax: 14, 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=37occurred 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.0s SsaConstructionTime, 3.5s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 60 NumberOfCodeBlocks, 60 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 [2024-11-14 04:19:56,484 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-49.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E --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 8b91f1f51b5e066a8b0d7e6d03754d28953e63e6dd17294fbe476ba36b896c8f --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 04:19:59,462 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 04:19:59,624 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-14 04:19:59,639 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 04:19:59,639 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 04:19:59,682 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 04:19:59,682 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 04:19:59,682 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 04:19:59,683 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 04:19:59,683 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 04:19:59,684 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 04:19:59,685 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 04:19:59,685 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 04:19:59,685 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 04:19:59,686 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 04:19:59,686 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 04:19:59,687 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 04:19:59,688 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 04:19:59,688 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 04:19:59,688 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 04:19:59,688 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 04:19:59,688 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 04:19:59,689 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 04:19:59,689 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 04:19:59,689 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 04:19:59,689 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-14 04:19:59,689 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 04:19:59,689 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-14 04:19:59,689 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 04:19:59,690 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 04:19:59,690 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 04:19:59,690 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 04:19:59,690 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 04:19:59,690 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 04:19:59,691 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 04:19:59,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:19:59,692 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 04:19:59,692 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 04:19:59,692 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 04:19:59,692 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-14 04:19:59,692 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-14 04:19:59,692 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 04:19:59,693 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 04:19:59,693 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E 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 -> 8b91f1f51b5e066a8b0d7e6d03754d28953e63e6dd17294fbe476ba36b896c8f [2024-11-14 04:20:00,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 04:20:00,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 04:20:00,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 04:20:00,102 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 04:20:00,102 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 04:20:00,104 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-49.i Unable to find full path for "g++" [2024-11-14 04:20:02,245 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 04:20:02,534 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 04:20:02,538 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-49.i [2024-11-14 04:20:02,549 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/data/efd5b34f4/8b042346dc454616854ff1e839f1ac58/FLAGd7222d34e [2024-11-14 04:20:02,574 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/data/efd5b34f4/8b042346dc454616854ff1e839f1ac58 [2024-11-14 04:20:02,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 04:20:02,580 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 04:20:02,582 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 04:20:02,582 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 04:20:02,588 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 04:20:02,589 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:20:02" (1/1) ... [2024-11-14 04:20:02,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c64e366 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:20:02, skipping insertion in model container [2024-11-14 04:20:02,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:20:02" (1/1) ... [2024-11-14 04:20:02,622 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 04:20:02,811 WARN L250 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_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-49.i[917,930] [2024-11-14 04:20:02,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:20:02,929 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 04:20:02,940 WARN L250 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_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-49.i[917,930] [2024-11-14 04:20:03,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:20:03,031 INFO L204 MainTranslator]: Completed translation [2024-11-14 04:20:03,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:20:03 WrapperNode [2024-11-14 04:20:03,032 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 04:20:03,033 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 04:20:03,033 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 04:20:03,033 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 04:20:03,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:20:03" (1/1) ... [2024-11-14 04:20:03,057 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:20:03" (1/1) ... [2024-11-14 04:20:03,103 INFO L138 Inliner]: procedures = 33, calls = 195, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 658 [2024-11-14 04:20:03,103 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 04:20:03,104 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 04:20:03,104 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 04:20:03,105 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 04:20:03,113 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:20:03" (1/1) ... [2024-11-14 04:20:03,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:20:03" (1/1) ... [2024-11-14 04:20:03,121 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:20:03" (1/1) ... [2024-11-14 04:20:03,121 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:20:03" (1/1) ... [2024-11-14 04:20:03,143 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:20:03" (1/1) ... [2024-11-14 04:20:03,149 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:20:03" (1/1) ... [2024-11-14 04:20:03,153 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:20:03" (1/1) ... [2024-11-14 04:20:03,156 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:20:03" (1/1) ... [2024-11-14 04:20:03,161 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 04:20:03,162 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 04:20:03,163 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 04:20:03,163 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 04:20:03,164 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:20:03" (1/1) ... [2024-11-14 04:20:03,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:20:03,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:20:03,206 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 04:20:03,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 04:20:03,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 04:20:03,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2024-11-14 04:20:03,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2024-11-14 04:20:03,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-14 04:20:03,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2024-11-14 04:20:03,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2024-11-14 04:20:03,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2024-11-14 04:20:03,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2024-11-14 04:20:03,250 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-14 04:20:03,250 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-14 04:20:03,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 04:20:03,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 04:20:03,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2024-11-14 04:20:03,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2024-11-14 04:20:03,471 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 04:20:03,474 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 04:20:04,645 INFO L? ?]: Removed 212 outVars from TransFormulas that were not future-live. [2024-11-14 04:20:04,645 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 04:20:04,663 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 04:20:04,663 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 04:20:04,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:20:04 BoogieIcfgContainer [2024-11-14 04:20:04,666 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 04:20:04,670 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 04:20:04,670 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 04:20:04,676 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 04:20:04,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:20:02" (1/3) ... [2024-11-14 04:20:04,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c0dc997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:20:04, skipping insertion in model container [2024-11-14 04:20:04,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:20:03" (2/3) ... [2024-11-14 04:20:04,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c0dc997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:20:04, skipping insertion in model container [2024-11-14 04:20:04,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:20:04" (3/3) ... [2024-11-14 04:20:04,681 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-49.i [2024-11-14 04:20:04,697 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 04:20:04,699 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-49.i that has 2 procedures, 130 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-14 04:20:04,785 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 04:20:04,803 INFO L333 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, 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;@5a977cc2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:20:04,803 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 04:20:04,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 113 states have (on average 1.4778761061946903) internal successors, (167), 114 states have internal predecessors, (167), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-14 04:20:04,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-14 04:20:04,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:20:04,829 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:20:04,829 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:20:04,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:20:04,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1201015710, now seen corresponding path program 1 times [2024-11-14 04:20:04,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:20:04,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [914935516] [2024-11-14 04:20:04,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:20:04,858 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 [2024-11-14 04:20:04,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:20:04,863 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 04:20:04,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:20:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:20:05,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-14 04:20:05,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:20:05,410 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-11-14 04:20:05,410 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:20:05,411 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:20:05,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [914935516] [2024-11-14 04:20:05,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [914935516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:20:05,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:20:05,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:20:05,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828604392] [2024-11-14 04:20:05,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:20:05,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 04:20:05,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:20:05,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 04:20:05,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 04:20:05,443 INFO L87 Difference]: Start difference. First operand has 130 states, 113 states have (on average 1.4778761061946903) internal successors, (167), 114 states have internal predecessors, (167), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-14 04:20:05,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:20:05,477 INFO L93 Difference]: Finished difference Result 253 states and 398 transitions. [2024-11-14 04:20:05,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:20:05,479 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 115 [2024-11-14 04:20:05,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:20:05,487 INFO L225 Difference]: With dead ends: 253 [2024-11-14 04:20:05,487 INFO L226 Difference]: Without dead ends: 126 [2024-11-14 04:20:05,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 04:20:05,494 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 04:20:05,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 04:20:05,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-14 04:20:05,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-14 04:20:05,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 110 states have (on average 1.4545454545454546) internal successors, (160), 110 states have internal predecessors, (160), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-14 04:20:05,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2024-11-14 04:20:05,554 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 115 [2024-11-14 04:20:05,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:20:05,555 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2024-11-14 04:20:05,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-14 04:20:05,556 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2024-11-14 04:20:05,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-14 04:20:05,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:20:05,563 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:20:05,570 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:20:05,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:20:05,764 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:20:05,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:20:05,766 INFO L85 PathProgramCache]: Analyzing trace with hash -772027578, now seen corresponding path program 1 times [2024-11-14 04:20:05,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:20:05,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631898466] [2024-11-14 04:20:05,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:20:05,770 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 [2024-11-14 04:20:05,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:20:05,773 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 04:20:05,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:20:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:20:06,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 04:20:06,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:20:06,243 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-14 04:20:06,243 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:20:06,243 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:20:06,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1631898466] [2024-11-14 04:20:06,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1631898466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:20:06,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:20:06,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 04:20:06,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092474397] [2024-11-14 04:20:06,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:20:06,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:20:06,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:20:06,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:20:06,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:20:06,252 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-14 04:20:06,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:20:06,331 INFO L93 Difference]: Finished difference Result 251 states and 376 transitions. [2024-11-14 04:20:06,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:20:06,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 115 [2024-11-14 04:20:06,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:20:06,335 INFO L225 Difference]: With dead ends: 251 [2024-11-14 04:20:06,335 INFO L226 Difference]: Without dead ends: 128 [2024-11-14 04:20:06,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:20:06,337 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 0 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 04:20:06,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 547 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 04:20:06,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-14 04:20:06,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-14 04:20:06,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 112 states have (on average 1.4464285714285714) internal successors, (162), 112 states have internal predecessors, (162), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-14 04:20:06,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 190 transitions. [2024-11-14 04:20:06,359 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 190 transitions. Word has length 115 [2024-11-14 04:20:06,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:20:06,364 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 190 transitions. [2024-11-14 04:20:06,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-14 04:20:06,365 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 190 transitions. [2024-11-14 04:20:06,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-14 04:20:06,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:20:06,367 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:20:06,377 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:20:06,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:20:06,567 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:20:06,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:20:06,568 INFO L85 PathProgramCache]: Analyzing trace with hash -799093180, now seen corresponding path program 1 times [2024-11-14 04:20:06,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:20:06,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1055035822] [2024-11-14 04:20:06,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:20:06,569 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 [2024-11-14 04:20:06,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:20:06,573 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 04:20:06,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:20:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:20:06,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 04:20:06,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:20:07,006 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 12 treesize of output 8 [2024-11-14 04:20:07,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2024-11-14 04:20:07,111 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-14 04:20:07,114 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:20:07,114 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:20:07,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1055035822] [2024-11-14 04:20:07,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1055035822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:20:07,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:20:07,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 04:20:07,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404497438] [2024-11-14 04:20:07,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:20:07,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 04:20:07,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:20:07,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 04:20:07,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:20:07,117 INFO L87 Difference]: Start difference. First operand 128 states and 190 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-14 04:20:07,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:20:07,856 INFO L93 Difference]: Finished difference Result 304 states and 452 transitions. [2024-11-14 04:20:07,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 04:20:07,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2024-11-14 04:20:07,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:20:07,859 INFO L225 Difference]: With dead ends: 304 [2024-11-14 04:20:07,859 INFO L226 Difference]: Without dead ends: 179 [2024-11-14 04:20:07,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-14 04:20:07,861 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 72 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 04:20:07,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 517 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 04:20:07,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-14 04:20:07,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 132. [2024-11-14 04:20:07,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 116 states have (on average 1.4396551724137931) internal successors, (167), 116 states have internal predecessors, (167), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-14 04:20:07,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 195 transitions. [2024-11-14 04:20:07,874 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 195 transitions. Word has length 115 [2024-11-14 04:20:07,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:20:07,875 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 195 transitions. [2024-11-14 04:20:07,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-14 04:20:07,875 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 195 transitions. [2024-11-14 04:20:07,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-14 04:20:07,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:20:07,877 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:20:07,885 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:20:08,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:20:08,078 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:20:08,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:20:08,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1025288383, now seen corresponding path program 1 times [2024-11-14 04:20:08,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:20:08,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [599385327] [2024-11-14 04:20:08,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:20:08,080 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 [2024-11-14 04:20:08,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:20:08,083 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 04:20:08,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:20:08,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:20:08,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-14 04:20:08,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:20:09,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:20:10,304 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 25 treesize of output 13 [2024-11-14 04:20:11,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:20:11,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:20:12,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:20:12,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:20:12,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:20:13,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:20:13,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:20:13,843 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 25 treesize of output 13 [2024-11-14 04:20:13,891 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 18 treesize of output 10 [2024-11-14 04:20:13,952 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 3 proven. 284 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-14 04:20:13,953 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:20:14,215 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_99 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_100 (_ BitVec 32))) (= (_ bv0 8) ((_ extract 7 0) (select (select (let ((.cse0 (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_99))) (store .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base (store (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset v_ArrVal_100))) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset)))) is different from false [2024-11-14 04:20:14,275 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:20:14,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [599385327] [2024-11-14 04:20:14,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [599385327] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:20:14,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1227950871] [2024-11-14 04:20:14,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:20:14,276 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:20:14,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:20:14,281 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:20:14,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-14 04:20:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:20:15,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-14 04:20:15,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:20:15,630 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 12 treesize of output 8 [2024-11-14 04:20:16,876 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 33 treesize of output 17 [2024-11-14 04:20:17,530 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 [2024-11-14 04:20:17,990 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 [2024-11-14 04:20:18,501 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 [2024-11-14 04:20:19,008 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 [2024-11-14 04:20:19,398 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 [2024-11-14 04:20:19,771 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 [2024-11-14 04:20:20,216 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 [2024-11-14 04:20:20,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-14 04:20:20,397 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 [2024-11-14 04:20:20,429 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 3 proven. 284 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-14 04:20:20,430 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:20:20,533 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_133 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_100 (_ BitVec 32))) (= (_ bv0 8) ((_ extract 7 0) (select (select (let ((.cse0 (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_133))) (store .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base (store (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset v_ArrVal_100))) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset)))) is different from false [2024-11-14 04:20:20,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1227950871] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:20:20,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435092283] [2024-11-14 04:20:20,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:20:20,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:20:20,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:20:20,580 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:20:20,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 04:20:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:20:20,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-14 04:20:20,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:20:22,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 04:20:23,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:20:24,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:20:24,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:20:25,094 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 39 treesize of output 30 [2024-11-14 04:20:25,272 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 56 treesize of output 43 [2024-11-14 04:20:25,602 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 56 treesize of output 43 [2024-11-14 04:20:26,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 66 treesize of output 38 [2024-11-14 04:20:26,539 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 5 proven. 255 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-14 04:20:26,539 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:20:26,974 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_165 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_165))) (let ((.cse0 ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse1 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset))))) (or (= ((_ sign_extend 16) ((_ extract 15 0) (bvneg .cse0))) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse1 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset)))) (not (bvslt .cse0 (_ bv0 32))))))) is different from false [2024-11-14 04:20:27,067 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((|ULTIMATE.start_step_#t~mem8#1| (_ BitVec 16))) (bvsle (bvashr (_ bv50 32) ((_ zero_extend 16) |ULTIMATE.start_step_#t~mem8#1|)) ((_ sign_extend 16) |c_ULTIMATE.start_step_#t~mem9#1|))) (forall ((v_ArrVal_164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_165 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base v_ArrVal_164) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_165))) (let ((.cse0 ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse1 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset))))) (or (not (bvslt .cse0 (_ bv0 32))) (= ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse1 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset))) ((_ sign_extend 16) ((_ extract 15 0) (bvneg .cse0))))))))) is different from false [2024-11-14 04:20:28,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435092283] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:20:28,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:20:28,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 17] total 41 [2024-11-14 04:20:28,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161865367] [2024-11-14 04:20:28,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:20:28,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-14 04:20:28,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:20:28,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-14 04:20:28,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=2152, Unknown=58, NotChecked=396, Total=2862 [2024-11-14 04:20:28,345 INFO L87 Difference]: Start difference. First operand 132 states and 195 transitions. Second operand has 42 states, 39 states have (on average 4.17948717948718) internal successors, (163), 38 states have internal predecessors, (163), 16 states have call successors, (42), 14 states have call predecessors, (42), 16 states have return successors, (42), 15 states have call predecessors, (42), 16 states have call successors, (42) [2024-11-14 04:20:40,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:20:40,654 INFO L93 Difference]: Finished difference Result 283 states and 412 transitions. [2024-11-14 04:20:40,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-14 04:20:40,656 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 39 states have (on average 4.17948717948718) internal successors, (163), 38 states have internal predecessors, (163), 16 states have call successors, (42), 14 states have call predecessors, (42), 16 states have return successors, (42), 15 states have call predecessors, (42), 16 states have call successors, (42) Word has length 117 [2024-11-14 04:20:40,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:20:40,657 INFO L225 Difference]: With dead ends: 283 [2024-11-14 04:20:40,658 INFO L226 Difference]: Without dead ends: 154 [2024-11-14 04:20:40,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 366 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 1468 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=824, Invalid=4085, Unknown=77, NotChecked=564, Total=5550 [2024-11-14 04:20:40,662 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 943 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 2907 mSolverCounterSat, 312 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 943 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 3219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Valid, 2907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2024-11-14 04:20:40,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [943 Valid, 1203 Invalid, 3219 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [312 Valid, 2907 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2024-11-14 04:20:40,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-14 04:20:40,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 140. [2024-11-14 04:20:40,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 122 states have (on average 1.4098360655737705) internal successors, (172), 122 states have internal predecessors, (172), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-14 04:20:40,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 200 transitions. [2024-11-14 04:20:40,693 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 200 transitions. Word has length 117 [2024-11-14 04:20:40,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:20:40,693 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 200 transitions. [2024-11-14 04:20:40,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 39 states have (on average 4.17948717948718) internal successors, (163), 38 states have internal predecessors, (163), 16 states have call successors, (42), 14 states have call predecessors, (42), 16 states have return successors, (42), 15 states have call predecessors, (42), 16 states have call successors, (42) [2024-11-14 04:20:40,694 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 200 transitions. [2024-11-14 04:20:40,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-14 04:20:40,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:20:40,696 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:20:40,709 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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)] Ended with exit code 0 [2024-11-14 04:20:40,903 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-14 04:20:41,116 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-14 04:20:41,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:20:41,297 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:20:41,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:20:41,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1511680407, now seen corresponding path program 1 times [2024-11-14 04:20:41,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:20:41,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1769668614] [2024-11-14 04:20:41,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:20:41,299 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 [2024-11-14 04:20:41,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:20:41,301 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 04:20:41,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:20:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:20:41,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-14 04:20:41,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:20:43,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 04:20:44,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:20:44,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:20:45,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:20:45,649 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 30 treesize of output 25 [2024-11-14 04:20:45,765 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 47 treesize of output 36 [2024-11-14 04:20:46,118 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 58 treesize of output 45 [2024-11-14 04:20:46,277 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 49 treesize of output 38 [2024-11-14 04:20:46,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 59 treesize of output 35 [2024-11-14 04:20:46,826 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-14 04:20:46,826 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:20:47,042 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_198 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_198))) (= ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset))) ((_ sign_extend 16) ((_ extract 15 0) (bvneg ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset))))))))) is different from false [2024-11-14 04:20:47,387 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((|ULTIMATE.start_step_#t~mem8#1| (_ BitVec 16))) (bvsle (bvashr (_ bv50 32) ((_ zero_extend 16) |ULTIMATE.start_step_#t~mem8#1|)) ((_ sign_extend 16) |c_ULTIMATE.start_step_#t~mem9#1|))) (forall ((v_ArrVal_196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_198 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_step_#t~mem20#1| (_ BitVec 16))) (let ((.cse0 (store |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base v_ArrVal_196))) (or (bvsge ((_ zero_extend 16) |ULTIMATE.start_step_#t~mem20#1|) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset)))) (let ((.cse1 (store (store .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base v_ArrVal_197) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_198))) (= ((_ sign_extend 16) ((_ extract 15 0) (bvneg ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse1 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset)))))) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse1 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset))))))))) is different from false [2024-11-14 04:20:47,435 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 16) ((_ extract 15 0) |c_ULTIMATE.start_step_#t~ite7#1|)))) (or (forall ((|ULTIMATE.start_step_#t~mem8#1| (_ BitVec 16))) (bvsle (bvashr (_ bv50 32) ((_ zero_extend 16) |ULTIMATE.start_step_#t~mem8#1|)) ((_ sign_extend 16) ((_ extract 15 0) .cse0)))) (forall ((v_ArrVal_196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_198 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_step_#t~mem20#1| (_ BitVec 16))) (let ((.cse2 (store (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base (store (select |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset .cse0)) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base v_ArrVal_196))) (or (let ((.cse1 (store (store .cse2 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base v_ArrVal_197) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_198))) (= ((_ sign_extend 16) ((_ extract 15 0) (bvneg ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse1 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset)))))) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse1 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset))))) (bvsge ((_ zero_extend 16) |ULTIMATE.start_step_#t~mem20#1|) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse2 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset))))))))) is different from false [2024-11-14 04:20:48,104 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:20:48,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1769668614] [2024-11-14 04:20:48,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1769668614] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:20:48,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1415086334] [2024-11-14 04:20:48,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:20:48,105 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:20:48,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:20:48,107 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:20:48,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-14 04:20:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:20:49,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-14 04:20:49,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:20:51,461 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 12 treesize of output 8 [2024-11-14 04:20:52,685 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 19 [2024-11-14 04:20:53,288 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 19 [2024-11-14 04:20:53,857 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 19 [2024-11-14 04:20:54,922 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 47 treesize of output 34 [2024-11-14 04:20:55,146 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 64 treesize of output 49 [2024-11-14 04:20:55,773 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 75 treesize of output 58 [2024-11-14 04:20:56,047 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 57 treesize of output 44 [2024-11-14 04:20:56,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 76 treesize of output 44 [2024-11-14 04:20:56,780 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 5 proven. 255 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-14 04:20:56,780 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:20:57,079 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_230 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_230))) (let ((.cse1 ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset))))) (or (= ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset))) ((_ sign_extend 16) ((_ extract 15 0) (bvneg .cse1)))) (not (bvslt .cse1 (_ bv0 32))))))) is different from false [2024-11-14 04:20:57,698 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((|ULTIMATE.start_step_#t~mem8#1| (_ BitVec 16))) (bvsle (bvashr (_ bv50 32) ((_ zero_extend 16) |ULTIMATE.start_step_#t~mem8#1|)) ((_ sign_extend 16) |c_ULTIMATE.start_step_#t~mem9#1|))) (forall ((v_ArrVal_230 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_228 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_step_#t~mem20#1| (_ BitVec 16)) (v_ArrVal_229 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base v_ArrVal_228))) (let ((.cse1 (store (store .cse2 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base v_ArrVal_229) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_230))) (let ((.cse0 ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse1 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset))))) (or (= ((_ sign_extend 16) ((_ extract 15 0) (bvneg .cse0))) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse1 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset)))) (bvsge ((_ zero_extend 16) |ULTIMATE.start_step_#t~mem20#1|) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse2 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset)))) (not (bvslt .cse0 (_ bv0 32))))))))) is different from false [2024-11-14 04:20:57,795 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ sign_extend 16) ((_ extract 15 0) |c_ULTIMATE.start_step_#t~ite7#1|)))) (or (forall ((v_ArrVal_230 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_228 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_step_#t~mem20#1| (_ BitVec 16)) (v_ArrVal_229 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base (store (select |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset .cse3)) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base v_ArrVal_228))) (let ((.cse0 (store (store .cse2 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base v_ArrVal_229) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_230))) (let ((.cse1 ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset))))) (or (= ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset))) ((_ sign_extend 16) ((_ extract 15 0) (bvneg .cse1)))) (not (bvslt .cse1 (_ bv0 32))) (bvsge ((_ zero_extend 16) |ULTIMATE.start_step_#t~mem20#1|) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse2 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset))))))))) (forall ((|ULTIMATE.start_step_#t~mem8#1| (_ BitVec 16))) (bvsle (bvashr (_ bv50 32) ((_ zero_extend 16) |ULTIMATE.start_step_#t~mem8#1|)) ((_ sign_extend 16) ((_ extract 15 0) .cse3)))))) is different from false [2024-11-14 04:20:58,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1415086334] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:20:58,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269665848] [2024-11-14 04:20:58,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:20:58,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:20:58,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:20:58,782 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:20:58,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 04:20:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:20:59,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-14 04:20:59,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:21:01,167 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 12 treesize of output 8 [2024-11-14 04:21:01,982 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 [2024-11-14 04:21:02,464 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 [2024-11-14 04:21:02,902 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 [2024-11-14 04:21:03,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2024-11-14 04:21:04,145 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 43 treesize of output 34 [2024-11-14 04:21:04,774 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 54 treesize of output 43 [2024-11-14 04:21:05,018 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 57 treesize of output 44 [2024-11-14 04:21:05,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 76 treesize of output 44 [2024-11-14 04:21:05,440 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 24 proven. 236 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-14 04:21:05,440 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:21:05,518 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_262 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_262))) (let ((.cse0 ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse1 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset))))) (or (= ((_ sign_extend 16) ((_ extract 15 0) (bvneg .cse0))) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse1 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset)))) (not (bvslt .cse0 (_ bv0 32))))))) is different from false [2024-11-14 04:21:06,747 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ sign_extend 16) ((_ extract 15 0) |c_ULTIMATE.start_step_#t~ite7#1|)))) (or (forall ((v_ArrVal_230 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_260 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_step_#t~mem20#1| (_ BitVec 16)) (v_ArrVal_229 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base (store (select |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset .cse3)) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base v_ArrVal_260))) (let ((.cse2 (store (store .cse1 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base v_ArrVal_229) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_230))) (let ((.cse0 ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse2 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset))))) (or (not (bvslt .cse0 (_ bv0 32))) (bvsge ((_ zero_extend 16) |ULTIMATE.start_step_#t~mem20#1|) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse1 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset)))) (= ((_ sign_extend 16) ((_ extract 15 0) (bvneg .cse0))) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse2 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset))))))))) (forall ((|ULTIMATE.start_step_#t~mem8#1| (_ BitVec 16))) (bvsle (bvashr (_ bv50 32) ((_ zero_extend 16) |ULTIMATE.start_step_#t~mem8#1|)) ((_ sign_extend 16) ((_ extract 15 0) .cse3)))))) is different from false [2024-11-14 04:21:08,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269665848] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:21:08,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:21:08,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 16] total 36 [2024-11-14 04:21:08,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747341486] [2024-11-14 04:21:08,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:21:08,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-14 04:21:08,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:21:08,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-14 04:21:08,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=2313, Unknown=78, NotChecked=872, Total=3660 [2024-11-14 04:21:08,204 INFO L87 Difference]: Start difference. First operand 140 states and 200 transitions. Second operand has 37 states, 36 states have (on average 3.25) internal successors, (117), 36 states have internal predecessors, (117), 9 states have call successors, (30), 8 states have call predecessors, (30), 9 states have return successors, (30), 8 states have call predecessors, (30), 9 states have call successors, (30) [2024-11-14 04:21:20,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:21:20,205 INFO L93 Difference]: Finished difference Result 369 states and 531 transitions. [2024-11-14 04:21:20,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 04:21:20,207 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 3.25) internal successors, (117), 36 states have internal predecessors, (117), 9 states have call successors, (30), 8 states have call predecessors, (30), 9 states have return successors, (30), 8 states have call predecessors, (30), 9 states have call successors, (30) Word has length 119 [2024-11-14 04:21:20,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:21:20,209 INFO L225 Difference]: With dead ends: 369 [2024-11-14 04:21:20,209 INFO L226 Difference]: Without dead ends: 232 [2024-11-14 04:21:20,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 368 SyntacticMatches, 5 SemanticMatches, 76 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1683 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=810, Invalid=3974, Unknown=78, NotChecked=1144, Total=6006 [2024-11-14 04:21:20,214 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 900 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 2424 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 2536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:21:20,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 1016 Invalid, 2536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2424 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2024-11-14 04:21:20,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-14 04:21:20,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 204. [2024-11-14 04:21:20,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 185 states have (on average 1.4432432432432432) internal successors, (267), 185 states have internal predecessors, (267), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-14 04:21:20,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 295 transitions. [2024-11-14 04:21:20,254 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 295 transitions. Word has length 119 [2024-11-14 04:21:20,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:21:20,255 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 295 transitions. [2024-11-14 04:21:20,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 3.25) internal successors, (117), 36 states have internal predecessors, (117), 9 states have call successors, (30), 8 states have call predecessors, (30), 9 states have return successors, (30), 8 states have call predecessors, (30), 9 states have call successors, (30) [2024-11-14 04:21:20,255 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 295 transitions. [2024-11-14 04:21:20,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-14 04:21:20,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:21:20,258 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:21:20,278 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-14 04:21:20,465 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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)] Ended with exit code 0 [2024-11-14 04:21:20,665 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2024-11-14 04:21:20,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 04:21:20,859 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:21:20,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:21:20,860 INFO L85 PathProgramCache]: Analyzing trace with hash -23204048, now seen corresponding path program 1 times [2024-11-14 04:21:20,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:21:20,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [525395574] [2024-11-14 04:21:20,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:21:20,860 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 [2024-11-14 04:21:20,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:21:20,863 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 04:21:20,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:21:21,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:21:21,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-14 04:21:21,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:21:22,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:21:23,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:21:23,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:21:23,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:21:24,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:21:24,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:21:24,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:21:25,018 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 25 treesize of output 13 [2024-11-14 04:21:25,119 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2024-11-14 04:21:25,120 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 1 case distinctions, treesize of input 27 treesize of output 30 [2024-11-14 04:21:25,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:21:25,255 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 31 treesize of output 27 [2024-11-14 04:21:25,328 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 1 proven. 287 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-14 04:21:25,329 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:21:25,789 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:21:25,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [525395574] [2024-11-14 04:21:25,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [525395574] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:21:25,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1049786054] [2024-11-14 04:21:25,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:21:25,790 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:21:25,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:21:25,794 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:21:25,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-11-14 04:21:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:21:27,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 04:21:27,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:21:27,782 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 32 treesize of output 23 [2024-11-14 04:21:27,858 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 45 treesize of output 21 [2024-11-14 04:21:27,953 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-14 04:21:27,953 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:21:27,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1049786054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:21:27,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:21:27,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 19 [2024-11-14 04:21:27,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523494876] [2024-11-14 04:21:27,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:21:27,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 04:21:27,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:21:27,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 04:21:27,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=499, Unknown=12, NotChecked=0, Total=600 [2024-11-14 04:21:27,956 INFO L87 Difference]: Start difference. First operand 204 states and 295 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-14 04:21:29,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:21:29,485 INFO L93 Difference]: Finished difference Result 478 states and 695 transitions. [2024-11-14 04:21:29,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:21:29,486 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2024-11-14 04:21:29,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:21:29,488 INFO L225 Difference]: With dead ends: 478 [2024-11-14 04:21:29,488 INFO L226 Difference]: Without dead ends: 277 [2024-11-14 04:21:29,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=95, Invalid=543, Unknown=12, NotChecked=0, Total=650 [2024-11-14 04:21:29,490 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 316 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-14 04:21:29,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 477 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-14 04:21:29,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-14 04:21:29,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 204. [2024-11-14 04:21:29,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 185 states have (on average 1.4324324324324325) internal successors, (265), 185 states have internal predecessors, (265), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-14 04:21:29,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 293 transitions. [2024-11-14 04:21:29,565 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 293 transitions. Word has length 119 [2024-11-14 04:21:29,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:21:29,566 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 293 transitions. [2024-11-14 04:21:29,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-14 04:21:29,567 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 293 transitions. [2024-11-14 04:21:29,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-14 04:21:29,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:21:29,574 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:21:29,596 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2024-11-14 04:21:29,780 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:21:29,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:21:29,975 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:21:29,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:21:29,976 INFO L85 PathProgramCache]: Analyzing trace with hash -293757927, now seen corresponding path program 1 times [2024-11-14 04:21:29,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:21:29,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2054941822] [2024-11-14 04:21:29,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:21:29,977 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 [2024-11-14 04:21:29,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:21:29,980 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 04:21:29,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 (13)] Waiting until timeout for monitored process [2024-11-14 04:21:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:21:30,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-14 04:21:30,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:21:32,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 04:21:33,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:21:33,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:21:33,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:21:34,285 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 24 treesize of output 23 [2024-11-14 04:21:34,372 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 28 treesize of output 21 [2024-11-14 04:21:34,543 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 28 treesize of output 21 [2024-11-14 04:21:34,633 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 28 treesize of output 21 [2024-11-14 04:21:34,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 28 treesize of output 16 [2024-11-14 04:21:34,767 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-14 04:21:34,767 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:21:38,926 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_353 (Array (_ BitVec 32) (_ BitVec 32)))) (not (bvslt ((_ sign_extend 16) ((_ extract 15 0) (select (select (store (store |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base v_ArrVal_353) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_354) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset))) (_ bv0 32)))) is different from false [2024-11-14 04:21:41,037 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_352 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_353 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_step_#t~ite7#1| (_ BitVec 32))) (not (bvslt ((_ sign_extend 16) ((_ extract 15 0) (select (select (store (store (store (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base (store (select |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) |ULTIMATE.start_step_#t~ite7#1|)))) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base v_ArrVal_352) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base v_ArrVal_353) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_354) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset))) (_ bv0 32)))) is different from false [2024-11-14 04:21:41,236 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:21:41,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2054941822] [2024-11-14 04:21:41,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2054941822] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:21:41,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1852801860] [2024-11-14 04:21:41,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:21:41,237 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:21:41,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:21:41,239 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:21:41,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-11-14 04:21:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:21:42,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-14 04:21:42,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:21:44,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 04:21:45,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:21:45,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:21:46,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:21:46,662 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 24 treesize of output 23 [2024-11-14 04:21:46,727 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 28 treesize of output 21 [2024-11-14 04:21:46,829 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 28 treesize of output 21 [2024-11-14 04:21:46,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2024-11-14 04:21:46,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 28 treesize of output 16 [2024-11-14 04:21:47,402 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-14 04:21:47,403 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:21:49,515 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32)))) (not (bvslt ((_ sign_extend 16) ((_ extract 15 0) (select (select (store (store |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base v_ArrVal_386) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_354) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset))) (_ bv0 32)))) is different from false [2024-11-14 04:21:51,714 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_385 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_step_#t~ite7#1| (_ BitVec 32))) (not (bvslt ((_ sign_extend 16) ((_ extract 15 0) (select (select (store (store (store (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base (store (select |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) |ULTIMATE.start_step_#t~ite7#1|)))) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base v_ArrVal_385) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base v_ArrVal_386) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_354) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset))) (_ bv0 32)))) is different from false [2024-11-14 04:21:52,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1852801860] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:21:52,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967444738] [2024-11-14 04:21:52,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:21:52,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:21:52,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:21:52,545 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:21:52,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-14 04:21:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:21:52,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-14 04:21:52,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:21:56,043 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 24 treesize of output 23 [2024-11-14 04:21:56,103 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 28 treesize of output 21 [2024-11-14 04:21:56,213 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 28 treesize of output 21 [2024-11-14 04:21:56,261 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 28 treesize of output 21 [2024-11-14 04:21:56,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 28 treesize of output 16 [2024-11-14 04:21:56,640 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-14 04:21:56,640 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:21:56,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967444738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:21:56,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 04:21:56,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 11] total 12 [2024-11-14 04:21:56,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518016500] [2024-11-14 04:21:56,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:21:56,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 04:21:56,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:21:56,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 04:21:56,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=275, Unknown=41, NotChecked=156, Total=552 [2024-11-14 04:21:56,643 INFO L87 Difference]: Start difference. First operand 204 states and 293 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-14 04:22:00,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:22:00,138 INFO L93 Difference]: Finished difference Result 486 states and 704 transitions. [2024-11-14 04:22:00,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:22:00,139 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2024-11-14 04:22:00,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:22:00,141 INFO L225 Difference]: With dead ends: 486 [2024-11-14 04:22:00,142 INFO L226 Difference]: Without dead ends: 285 [2024-11-14 04:22:00,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 378 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=113, Invalid=323, Unknown=42, NotChecked=172, Total=650 [2024-11-14 04:22:00,143 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 580 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-14 04:22:00,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 584 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-14 04:22:00,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-14 04:22:00,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 261. [2024-11-14 04:22:00,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 242 states have (on average 1.4586776859504131) internal successors, (353), 242 states have internal predecessors, (353), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-14 04:22:00,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 381 transitions. [2024-11-14 04:22:00,175 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 381 transitions. Word has length 119 [2024-11-14 04:22:00,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:22:00,175 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 381 transitions. [2024-11-14 04:22:00,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-14 04:22:00,175 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 381 transitions. [2024-11-14 04:22:00,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-14 04:22:00,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:22:00,178 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:22:00,188 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 (13)] Ended with exit code 0 [2024-11-14 04:22:00,384 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2024-11-14 04:22:00,596 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-14 04:22:00,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:22:00,779 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:22:00,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:22:00,780 INFO L85 PathProgramCache]: Analyzing trace with hash -686784937, now seen corresponding path program 1 times [2024-11-14 04:22:00,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:22:00,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [783948738] [2024-11-14 04:22:00,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:22:00,781 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 [2024-11-14 04:22:00,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:22:00,785 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 04:22:00,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 (16)] Waiting until timeout for monitored process [2024-11-14 04:22:01,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:22:01,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-14 04:22:01,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:22:03,787 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 12 treesize of output 8 [2024-11-14 04:22:04,396 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 [2024-11-14 04:22:04,930 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 [2024-11-14 04:22:05,542 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 [2024-11-14 04:22:06,330 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 38 treesize of output 29 [2024-11-14 04:22:06,475 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 55 treesize of output 42 [2024-11-14 04:22:06,785 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 55 treesize of output 42 [2024-11-14 04:22:06,974 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 55 treesize of output 42 [2024-11-14 04:22:07,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 64 treesize of output 36 [2024-11-14 04:22:07,560 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-14 04:22:07,560 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:22:08,967 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:22:08,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [783948738] [2024-11-14 04:22:08,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [783948738] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:22:08,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [236467415] [2024-11-14 04:22:08,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:22:08,968 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:22:08,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:22:08,970 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:22:08,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2024-11-14 04:22:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:22:10,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-14 04:22:10,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:22:12,783 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 12 treesize of output 8 [2024-11-14 04:22:13,330 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 [2024-11-14 04:22:13,881 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 [2024-11-14 04:22:14,428 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 [2024-11-14 04:22:15,035 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 38 treesize of output 29 [2024-11-14 04:22:15,096 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 55 treesize of output 42 [2024-11-14 04:22:15,347 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 55 treesize of output 42 [2024-11-14 04:22:15,453 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 55 treesize of output 42 [2024-11-14 04:22:15,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 64 treesize of output 36 [2024-11-14 04:22:15,810 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-14 04:22:15,810 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:22:18,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [236467415] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:22:18,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125221052] [2024-11-14 04:22:18,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:22:18,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:22:18,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:22:18,357 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:22:18,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-14 04:22:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:22:18,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-14 04:22:18,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:22:22,421 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 30 treesize of output 25 [2024-11-14 04:22:22,669 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 47 treesize of output 36 [2024-11-14 04:22:23,033 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 47 treesize of output 36 [2024-11-14 04:22:23,282 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 47 treesize of output 36 [2024-11-14 04:22:23,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 56 treesize of output 32 [2024-11-14 04:22:23,930 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-14 04:22:23,930 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:22:23,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125221052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:22:23,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 04:22:23,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [14, 14] total 23 [2024-11-14 04:22:23,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792590579] [2024-11-14 04:22:23,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:22:23,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 04:22:23,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:22:23,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 04:22:23,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1371, Unknown=65, NotChecked=0, Total=1640 [2024-11-14 04:22:23,933 INFO L87 Difference]: Start difference. First operand 261 states and 381 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-14 04:22:29,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:22:29,202 INFO L93 Difference]: Finished difference Result 600 states and 879 transitions. [2024-11-14 04:22:29,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 04:22:29,203 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2024-11-14 04:22:29,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:22:29,205 INFO L225 Difference]: With dead ends: 600 [2024-11-14 04:22:29,205 INFO L226 Difference]: Without dead ends: 342 [2024-11-14 04:22:29,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 364 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=305, Invalid=1700, Unknown=65, NotChecked=0, Total=2070 [2024-11-14 04:22:29,208 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 339 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 1611 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 1622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-14 04:22:29,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 1180 Invalid, 1622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1611 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-14 04:22:29,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-11-14 04:22:29,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 316. [2024-11-14 04:22:29,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 297 states have (on average 1.4747474747474747) internal successors, (438), 297 states have internal predecessors, (438), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-14 04:22:29,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 466 transitions. [2024-11-14 04:22:29,240 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 466 transitions. Word has length 119 [2024-11-14 04:22:29,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:22:29,240 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 466 transitions. [2024-11-14 04:22:29,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-14 04:22:29,241 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 466 transitions. [2024-11-14 04:22:29,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-14 04:22:29,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:22:29,243 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:22:29,252 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2024-11-14 04:22:29,473 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-14 04:22:29,656 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 (16)] Forceful destruction successful, exit code 0 [2024-11-14 04:22:29,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:22:29,846 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:22:29,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:22:29,847 INFO L85 PathProgramCache]: Analyzing trace with hash 321985007, now seen corresponding path program 1 times [2024-11-14 04:22:29,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:22:29,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [661055937] [2024-11-14 04:22:29,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:22:29,847 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 [2024-11-14 04:22:29,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:22:29,850 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 04:22:29,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 (19)] Waiting until timeout for monitored process [2024-11-14 04:22:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:22:30,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-14 04:22:30,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:22:32,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:22:33,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:22:33,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:22:34,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:22:34,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:22:35,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:22:36,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:22:36,235 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 25 treesize of output 13 [2024-11-14 04:22:36,412 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-11-14 04:22:36,412 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 1 case distinctions, treesize of input 27 treesize of output 26 [2024-11-14 04:22:36,535 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 31 treesize of output 22 [2024-11-14 04:22:36,646 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:22:36,646 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 31 treesize of output 23 [2024-11-14 04:22:36,711 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 1 proven. 287 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-14 04:22:36,711 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:22:36,821 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_542 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_542) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset)) (_ bv0 8))) is different from false [2024-11-14 04:22:39,196 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_539 (_ BitVec 32)) (v_ArrVal_538 (Array (_ BitVec 32) (_ BitVec 32))) (~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset (_ BitVec 32))) (= (_ bv0 8) ((_ extract 7 0) (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_538))) (store .cse1 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base (store (select .cse1 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset v_ArrVal_539))))) (store .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_542) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset)))) is different from false [2024-11-14 04:22:39,273 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:22:39,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [661055937] [2024-11-14 04:22:39,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [661055937] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:22:39,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [393589966] [2024-11-14 04:22:39,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:22:39,274 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:22:39,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:22:39,276 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:22:39,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2024-11-14 04:22:40,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:22:40,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-14 04:22:40,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:22:41,517 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 33 treesize of output 24 [2024-11-14 04:22:41,627 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 46 treesize of output 22 [2024-11-14 04:22:41,754 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-14 04:22:41,754 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:22:41,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [393589966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:22:41,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:22:41,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-11-14 04:22:41,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261972741] [2024-11-14 04:22:41,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:22:41,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:22:41,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:22:41,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:22:41,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=471, Unknown=2, NotChecked=90, Total=650 [2024-11-14 04:22:41,757 INFO L87 Difference]: Start difference. First operand 316 states and 466 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-14 04:22:43,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:22:43,250 INFO L93 Difference]: Finished difference Result 676 states and 987 transitions. [2024-11-14 04:22:43,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:22:43,251 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2024-11-14 04:22:43,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:22:43,254 INFO L225 Difference]: With dead ends: 676 [2024-11-14 04:22:43,254 INFO L226 Difference]: Without dead ends: 363 [2024-11-14 04:22:43,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=97, Invalid=559, Unknown=2, NotChecked=98, Total=756 [2024-11-14 04:22:43,256 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 199 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:22:43,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 437 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-14 04:22:43,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-14 04:22:43,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 360. [2024-11-14 04:22:43,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 335 states have (on average 1.4388059701492537) internal successors, (482), 336 states have internal predecessors, (482), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-14 04:22:43,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 518 transitions. [2024-11-14 04:22:43,299 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 518 transitions. Word has length 121 [2024-11-14 04:22:43,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:22:43,299 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 518 transitions. [2024-11-14 04:22:43,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-14 04:22:43,300 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 518 transitions. [2024-11-14 04:22:43,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-14 04:22:43,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:22:43,302 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:22:43,314 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 (19)] Ended with exit code 0 [2024-11-14 04:22:43,510 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2024-11-14 04:22:43,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 04:22:43,703 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:22:43,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:22:43,704 INFO L85 PathProgramCache]: Analyzing trace with hash -554123095, now seen corresponding path program 1 times [2024-11-14 04:22:43,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:22:43,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1950253116] [2024-11-14 04:22:43,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:22:43,704 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 [2024-11-14 04:22:43,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:22:43,706 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 04:22:43,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 (21)] Waiting until timeout for monitored process [2024-11-14 04:22:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:22:44,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-14 04:22:44,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:22:45,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:22:46,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:22:47,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:22:48,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:22:48,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:22:49,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:22:50,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:22:51,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:22:51,155 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 61 treesize of output 41 [2024-11-14 04:22:51,501 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 35 treesize of output 33 [2024-11-14 04:22:51,659 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 39 treesize of output 28 [2024-11-14 04:22:52,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 97 [2024-11-14 04:22:52,251 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 1 proven. 287 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-14 04:22:52,251 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:22:52,704 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_603 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_603))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset))) (_ bv0 32)) (= (_ bv0 8) ((_ extract 7 0) (select (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))))) (forall ((v_ArrVal_603 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 ((_ zero_extend 24) ((_ extract 7 0) (select (select (store |c_#memory_int| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_603) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset))))) (or (= .cse1 (_ bv0 32)) (= .cse1 (_ bv1 32))))) (forall ((v_ArrVal_603 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_603))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset))) (_ bv0 32))) (not (= (_ bv0 8) ((_ extract 7 0) (select (select .cse2 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))))))) is different from false [2024-11-14 04:22:52,827 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store (select |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))))))) (and (forall ((v_ArrVal_603 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store .cse1 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_603))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset))) (_ bv0 32)) (= ((_ extract 7 0) (select (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (_ bv0 8))))) (forall ((v_ArrVal_603 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select (store .cse1 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_603) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset))))) (or (= .cse2 (_ bv1 32)) (= .cse2 (_ bv0 32))))) (forall ((v_ArrVal_603 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store .cse1 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_603))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse3 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset))) (_ bv0 32))) (not (= ((_ extract 7 0) (select (select .cse3 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (_ bv0 8)))))))) is different from false [2024-11-14 04:22:57,768 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 ((_ sign_extend 24) (_ bv1 8))) (.cse3 ((_ sign_extend 24) (_ bv0 8)))) (and (forall ((v_ArrVal_599 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_599))) (or (forall ((v_ArrVal_603 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (let ((.cse1 (store .cse2 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base (store (select .cse2 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset .cse3)))) (store .cse1 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store (select .cse1 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_603) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset))))) (or (= (_ bv1 32) .cse0) (= (_ bv0 32) .cse0)))) (= (_ bv0 8) ((_ extract 7 0) (select (select .cse2 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))))) (forall ((v_ArrVal_599 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_599))) (or (not (= (_ bv0 8) ((_ extract 7 0) (select (select .cse4 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))) (forall ((v_ArrVal_603 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store (let ((.cse6 (store .cse4 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base (store (select .cse4 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset .cse7)))) (store .cse6 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store (select .cse6 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse6 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_603))) (or (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse5 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset)))) (= (_ bv0 8) ((_ extract 7 0) (select (select .cse5 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))))))))) (forall ((v_ArrVal_599 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_599))) (or (not (= (_ bv0 8) ((_ extract 7 0) (select (select .cse8 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))) (forall ((v_ArrVal_603 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (let ((.cse10 (store .cse8 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base (store (select .cse8 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset .cse7)))) (store .cse10 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store (select .cse10 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse10 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_603) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset))))) (or (= (_ bv1 32) .cse9) (= (_ bv0 32) .cse9))))))) (forall ((v_ArrVal_599 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_599))) (or (forall ((v_ArrVal_603 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store (let ((.cse12 (store .cse13 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base (store (select .cse13 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset .cse3)))) (store .cse12 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store (select .cse12 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse12 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_603))) (or (not (= ((_ extract 7 0) (select (select .cse11 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (_ bv0 8))) (not (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse11 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset)))))))) (= (_ bv0 8) ((_ extract 7 0) (select (select .cse13 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))))) (forall ((v_ArrVal_599 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_599))) (or (forall ((v_ArrVal_603 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store (let ((.cse15 (store .cse16 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base (store (select .cse16 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset .cse7)))) (store .cse15 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store (select .cse15 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse15 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_603))) (or (not (= (_ bv0 8) ((_ extract 7 0) (select (select .cse14 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))) (not (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse14 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset)))))))) (not (= (_ bv0 8) ((_ extract 7 0) (select (select .cse16 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))))))) (forall ((v_ArrVal_599 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_599))) (or (forall ((v_ArrVal_603 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store (let ((.cse18 (store .cse19 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base (store (select .cse19 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset .cse3)))) (store .cse18 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store (select .cse18 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse18 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_603))) (or (= ((_ extract 7 0) (select (select .cse17 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (_ bv0 8)) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse17 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset))))))) (= (_ bv0 8) ((_ extract 7 0) (select (select .cse19 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))))))) is different from false [2024-11-14 04:23:02,812 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:23:02,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1950253116] [2024-11-14 04:23:02,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1950253116] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:23:02,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1141158752] [2024-11-14 04:23:02,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:23:02,813 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:23:02,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:23:02,815 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:23:02,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2024-11-14 04:23:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:23:04,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-14 04:23:04,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:23:05,746 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 12 treesize of output 8 [2024-11-14 04:23:07,943 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 19 [2024-11-14 04:23:08,776 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 19 [2024-11-14 04:23:09,783 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 19 [2024-11-14 04:23:10,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 26 treesize of output 19 [2024-11-14 04:23:11,709 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 19 [2024-11-14 04:23:12,604 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 19 [2024-11-14 04:23:13,709 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 19 [2024-11-14 04:23:13,921 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 69 treesize of output 45 [2024-11-14 04:23:14,373 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 43 treesize of output 37 [2024-11-14 04:23:14,647 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 35 treesize of output 26 [2024-11-14 04:23:15,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 97 [2024-11-14 04:23:15,264 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 287 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-14 04:23:15,264 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:23:15,668 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_639 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_639))) (or (not (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset))))) (not (= (_ bv0 8) ((_ extract 7 0) (select (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))))))) (forall ((v_ArrVal_639 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 ((_ zero_extend 24) ((_ extract 7 0) (select (select (store |c_#memory_int| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_639) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset))))) (or (= (_ bv0 32) .cse1) (= (_ bv1 32) .cse1)))) (forall ((v_ArrVal_639 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_639))) (or (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset)))) (= (_ bv0 8) ((_ extract 7 0) (select (select .cse2 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))))))) is different from false [2024-11-14 04:23:15,833 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store (select |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))))))) (and (forall ((v_ArrVal_639 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store .cse1 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_639))) (or (not (= (_ bv0 8) ((_ extract 7 0) (select (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))) (not (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset)))))))) (forall ((v_ArrVal_639 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store .cse1 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_639))) (or (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset)))) (= (_ bv0 8) ((_ extract 7 0) (select (select .cse2 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))))) (forall ((v_ArrVal_639 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 ((_ zero_extend 24) ((_ extract 7 0) (select (select (store .cse1 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_639) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset))))) (or (= (_ bv0 32) .cse3) (= (_ bv1 32) .cse3)))))) is different from false [2024-11-14 04:23:16,450 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base)) (.cse0 (= (_ bv0 8) ((_ extract 7 0) (select (select |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))))) (and (or (not .cse0) (let ((.cse2 (let ((.cse5 (store |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base (store .cse6 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset ((_ sign_extend 24) (_ bv1 8)))))) (store .cse5 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store (select .cse5 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse5 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))))))) (and (forall ((v_ArrVal_639 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store .cse2 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_639))) (or (not (= (_ bv0 8) ((_ extract 7 0) (select (select .cse1 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))) (not (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset)))))))) (forall ((v_ArrVal_639 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 ((_ zero_extend 24) ((_ extract 7 0) (select (select (store .cse2 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_639) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset))))) (or (= (_ bv1 32) .cse3) (= (_ bv0 32) .cse3)))) (forall ((v_ArrVal_639 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store .cse2 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_639))) (or (= (_ bv0 8) ((_ extract 7 0) (select (select .cse4 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse4 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset)))))))))) (or (let ((.cse8 (let ((.cse11 (store |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base (store .cse6 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset ((_ sign_extend 24) (_ bv0 8)))))) (store .cse11 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store (select .cse11 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse11 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))))))) (and (forall ((v_ArrVal_639 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store .cse8 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_639))) (or (not (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse7 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset))))) (not (= (_ bv0 8) ((_ extract 7 0) (select (select .cse7 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))))))) (forall ((v_ArrVal_639 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 ((_ zero_extend 24) ((_ extract 7 0) (select (select (store .cse8 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_639) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset))))) (or (= (_ bv0 32) .cse9) (= (_ bv1 32) .cse9)))) (forall ((v_ArrVal_639 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store .cse8 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_639))) (or (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse10 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset)))) (= (_ bv0 8) ((_ extract 7 0) (select (select .cse10 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))))))) .cse0))) is different from false [2024-11-14 04:23:19,495 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ sign_extend 24) (_ bv0 8))) (.cse13 ((_ sign_extend 24) (_ bv1 8)))) (and (forall ((v_ArrVal_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_635))) (or (forall ((v_ArrVal_639 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (let ((.cse1 (store .cse2 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base (store (select .cse2 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset .cse3)))) (store .cse1 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store (select .cse1 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_639))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset))) (_ bv0 32)) (= (_ bv0 8) ((_ extract 7 0) (select (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))))) (= ((_ extract 7 0) (select (select .cse2 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (_ bv0 8))))) (forall ((v_ArrVal_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_635))) (or (= ((_ extract 7 0) (select (select .cse4 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (_ bv0 8)) (forall ((v_ArrVal_639 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store (let ((.cse6 (store .cse4 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base (store (select .cse4 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset .cse3)))) (store .cse6 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store (select .cse6 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse6 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_639))) (or (not (= (_ bv0 8) ((_ extract 7 0) (select (select .cse5 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse5 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset))) (_ bv0 32))))))))) (forall ((v_ArrVal_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_635))) (or (= ((_ extract 7 0) (select (select .cse7 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (_ bv0 8)) (forall ((v_ArrVal_639 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (let ((.cse9 (store .cse7 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base (store (select .cse7 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset .cse3)))) (store .cse9 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store (select .cse9 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse9 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_639) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset))))) (or (= .cse8 (_ bv0 32)) (= .cse8 (_ bv1 32)))))))) (forall ((v_ArrVal_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_635))) (or (not (= ((_ extract 7 0) (select (select .cse10 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (_ bv0 8))) (forall ((v_ArrVal_639 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store (let ((.cse12 (store .cse10 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base (store (select .cse10 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset .cse13)))) (store .cse12 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store (select .cse12 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse12 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_639))) (or (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse11 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset)))) (= (_ bv0 8) ((_ extract 7 0) (select (select .cse11 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))))))))) (forall ((v_ArrVal_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_635))) (or (not (= ((_ extract 7 0) (select (select .cse14 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (_ bv0 8))) (forall ((v_ArrVal_639 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (let ((.cse16 (store .cse14 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base (store (select .cse14 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset .cse13)))) (store .cse16 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store (select .cse16 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse16 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_639) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset))))) (or (= (_ bv0 32) .cse15) (= (_ bv1 32) .cse15))))))) (forall ((v_ArrVal_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_635))) (or (forall ((v_ArrVal_639 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store (let ((.cse18 (store .cse19 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base (store (select .cse19 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset .cse13)))) (store .cse18 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store (select .cse18 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse18 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_639))) (or (not (= (_ bv0 8) ((_ extract 7 0) (select (select .cse17 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))) (not (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse17 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset)))))))) (not (= ((_ extract 7 0) (select (select .cse19 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (_ bv0 8)))))))) is different from false [2024-11-14 04:23:25,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1141158752] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:23:25,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094813711] [2024-11-14 04:23:25,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:23:25,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:23:25,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:23:25,020 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:23:25,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-14 04:23:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:23:25,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-14 04:23:25,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:23:30,247 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 52 treesize of output 36 [2024-11-14 04:23:30,777 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 54 treesize of output 44 [2024-11-14 04:23:31,155 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 58 treesize of output 43 [2024-11-14 04:23:31,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 78 [2024-11-14 04:23:31,944 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-14 04:23:31,944 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:23:32,412 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_667))) (or (not (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset))))) (not (= (_ bv0 8) ((_ extract 7 0) (select (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))))))) (forall ((v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_667))) (or (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset)))) (= (_ bv0 8) ((_ extract 7 0) (select (select .cse1 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))))) (forall ((v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select (store |c_#memory_int| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_667) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset))))) (or (= (_ bv0 32) .cse2) (= (_ bv1 32) .cse2))))) is different from false [2024-11-14 04:23:32,545 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store (select |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))))))) (and (forall ((v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) (select (select (store .cse1 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_667) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset))))) (or (= (_ bv0 32) .cse0) (= (_ bv1 32) .cse0)))) (forall ((v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store .cse1 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_667))) (or (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset)))) (= (_ bv0 8) ((_ extract 7 0) (select (select .cse2 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))))) (forall ((v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store .cse1 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_667))) (or (not (= (_ bv0 8) ((_ extract 7 0) (select (select .cse3 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))) (not (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse3 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset)))))))))) is different from false [2024-11-14 04:23:33,749 INFO L349 Elim1Store]: treesize reduction 126, result has 44.5 percent of original size [2024-11-14 04:23:33,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 619 treesize of output 389 [2024-11-14 04:23:33,993 INFO L349 Elim1Store]: treesize reduction 11, result has 67.6 percent of original size [2024-11-14 04:23:33,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1416 treesize of output 1362 [2024-11-14 04:23:34,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:23:34,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 716 treesize of output 709 [2024-11-14 04:23:34,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 700 treesize of output 688 [2024-11-14 04:23:34,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:23:34,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 688 treesize of output 681 [2024-11-14 04:23:39,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:23:39,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 49 treesize of output 51 [2024-11-14 04:23:39,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 65 treesize of output 59 [2024-11-14 04:23:39,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 5 [2024-11-14 04:23:39,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 5 [2024-11-14 04:23:40,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:23:40,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 284 treesize of output 288 [2024-11-14 04:23:43,787 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-14 04:23:43,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094813711] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-14 04:23:43,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:23:43,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [17, 18, 10] total 42 [2024-11-14 04:23:43,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465436908] [2024-11-14 04:23:43,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:23:43,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 04:23:43,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:23:43,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 04:23:43,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=1389, Unknown=25, NotChecked=774, Total=2450 [2024-11-14 04:23:43,790 INFO L87 Difference]: Start difference. First operand 360 states and 518 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-14 04:23:47,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:23:47,175 INFO L93 Difference]: Finished difference Result 871 states and 1257 transitions. [2024-11-14 04:23:47,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:23:47,177 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2024-11-14 04:23:47,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:23:47,183 INFO L225 Difference]: With dead ends: 871 [2024-11-14 04:23:47,184 INFO L226 Difference]: Without dead ends: 514 [2024-11-14 04:23:47,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 486 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 825 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=291, Invalid=1700, Unknown=25, NotChecked=846, Total=2862 [2024-11-14 04:23:47,186 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 351 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 602 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-14 04:23:47,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 490 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 487 Invalid, 0 Unknown, 602 Unchecked, 2.5s Time] [2024-11-14 04:23:47,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-11-14 04:23:47,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 476. [2024-11-14 04:23:47,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 451 states have (on average 1.4478935698447895) internal successors, (653), 452 states have internal predecessors, (653), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-14 04:23:47,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 689 transitions. [2024-11-14 04:23:47,230 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 689 transitions. Word has length 121 [2024-11-14 04:23:47,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:23:47,231 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 689 transitions. [2024-11-14 04:23:47,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-14 04:23:47,231 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 689 transitions. [2024-11-14 04:23:47,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-14 04:23:47,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:23:47,234 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:23:47,245 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 (21)] Ended with exit code 0 [2024-11-14 04:23:47,441 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2024-11-14 04:23:47,652 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-11-14 04:23:47,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:23:47,835 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:23:47,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:23:47,836 INFO L85 PathProgramCache]: Analyzing trace with hash 847304690, now seen corresponding path program 1 times [2024-11-14 04:23:47,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:23:47,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1145492227] [2024-11-14 04:23:47,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:23:47,836 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 [2024-11-14 04:23:47,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:23:47,838 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 04:23:47,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 (24)] Waiting until timeout for monitored process [2024-11-14 04:23:48,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:23:48,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-14 04:23:48,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:23:50,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:23:50,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:23:50,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:23:51,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:23:51,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:23:51,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:23:52,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:23:52,066 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 33 treesize of output 21 [2024-11-14 04:23:52,115 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 1 proven. 287 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-14 04:23:52,115 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:23:52,393 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:23:52,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1145492227] [2024-11-14 04:23:52,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1145492227] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:23:52,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [72086982] [2024-11-14 04:23:52,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:23:52,393 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:23:52,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:23:52,396 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:23:52,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2024-11-14 04:23:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:23:53,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-14 04:23:53,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:23:54,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 04:23:55,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:23:55,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:23:55,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:23:56,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:23:56,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:23:56,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:23:56,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 18 treesize of output 13 [2024-11-14 04:23:56,869 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 33 treesize of output 21 [2024-11-14 04:23:56,879 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 1 proven. 287 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-14 04:23:56,880 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:23:56,900 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_731 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 8) ((_ extract 7 0) (select (select (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_731) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))) is different from false [2024-11-14 04:23:56,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [72086982] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:23:56,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258054410] [2024-11-14 04:23:56,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:23:56,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:23:56,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:23:56,941 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:23:56,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-14 04:23:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:23:57,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-14 04:23:57,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:23:58,088 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 [2024-11-14 04:23:59,425 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 19 [2024-11-14 04:23:59,916 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 19 [2024-11-14 04:24:00,379 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 19 [2024-11-14 04:24:00,857 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 19 [2024-11-14 04:24:01,288 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 19 [2024-11-14 04:24:01,668 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 19 [2024-11-14 04:24:02,130 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 19 [2024-11-14 04:24:02,260 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 41 treesize of output 25 [2024-11-14 04:24:02,274 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 287 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-14 04:24:02,274 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:24:02,296 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 8) ((_ extract 7 0) (select (select (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_763) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))) is different from false [2024-11-14 04:24:02,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258054410] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:24:02,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:24:02,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 22 [2024-11-14 04:24:02,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678775603] [2024-11-14 04:24:02,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:24:02,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-14 04:24:02,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:24:02,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-14 04:24:02,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=470, Unknown=14, NotChecked=94, Total=702 [2024-11-14 04:24:02,336 INFO L87 Difference]: Start difference. First operand 476 states and 689 transitions. Second operand has 23 states, 21 states have (on average 5.238095238095238) internal successors, (110), 20 states have internal predecessors, (110), 12 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 10 states have call predecessors, (26), 12 states have call successors, (26) [2024-11-14 04:24:08,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:24:08,479 INFO L93 Difference]: Finished difference Result 977 states and 1402 transitions. [2024-11-14 04:24:08,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 04:24:08,480 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 5.238095238095238) internal successors, (110), 20 states have internal predecessors, (110), 12 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 10 states have call predecessors, (26), 12 states have call successors, (26) Word has length 121 [2024-11-14 04:24:08,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:24:08,483 INFO L225 Difference]: With dead ends: 977 [2024-11-14 04:24:08,484 INFO L226 Difference]: Without dead ends: 504 [2024-11-14 04:24:08,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=320, Invalid=1077, Unknown=17, NotChecked=146, Total=1560 [2024-11-14 04:24:08,486 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 492 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-14 04:24:08,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 571 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-14 04:24:08,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2024-11-14 04:24:08,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 427. [2024-11-14 04:24:08,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 407 states have (on average 1.4643734643734643) internal successors, (596), 407 states have internal predecessors, (596), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-14 04:24:08,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 624 transitions. [2024-11-14 04:24:08,542 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 624 transitions. Word has length 121 [2024-11-14 04:24:08,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:24:08,543 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 624 transitions. [2024-11-14 04:24:08,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 5.238095238095238) internal successors, (110), 20 states have internal predecessors, (110), 12 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 10 states have call predecessors, (26), 12 states have call successors, (26) [2024-11-14 04:24:08,543 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 624 transitions. [2024-11-14 04:24:08,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-14 04:24:08,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:24:08,546 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:24:08,572 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-11-14 04:24:08,757 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2024-11-14 04:24:08,953 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 (24)] Ended with exit code 0 [2024-11-14 04:24:09,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:24:09,147 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:24:09,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:24:09,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1066159408, now seen corresponding path program 1 times [2024-11-14 04:24:09,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:24:09,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453761255] [2024-11-14 04:24:09,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:09,148 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 [2024-11-14 04:24:09,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:24:09,150 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 04:24:09,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 (27)] Waiting until timeout for monitored process [2024-11-14 04:24:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:09,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-14 04:24:09,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:24:13,063 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 12 treesize of output 8 [2024-11-14 04:24:13,866 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 [2024-11-14 04:24:14,639 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 [2024-11-14 04:24:15,373 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 [2024-11-14 04:24:16,317 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 29 treesize of output 24 [2024-11-14 04:24:16,795 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 42 treesize of output 33 [2024-11-14 04:24:17,148 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 42 treesize of output 33 [2024-11-14 04:24:17,374 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 42 treesize of output 33 [2024-11-14 04:24:17,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 52 treesize of output 32 [2024-11-14 04:24:18,071 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-14 04:24:18,072 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:24:18,399 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_795))) (= ((_ sign_extend 16) ((_ extract 15 0) (bvneg ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset)))))) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset)))))) is different from false [2024-11-14 04:24:19,475 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 16) ((_ extract 15 0) (bvneg ((_ sign_extend 16) ((_ extract 15 0) (select (select |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset)))))))) (or (forall ((|ULTIMATE.start_step_#t~mem8#1| (_ BitVec 16))) (not (bvsle (bvashr (_ bv50 32) ((_ zero_extend 16) |ULTIMATE.start_step_#t~mem8#1|)) ((_ sign_extend 16) ((_ extract 15 0) .cse0))))) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store (store (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base (store (select |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset .cse0)) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base v_ArrVal_793) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base v_ArrVal_794) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_795))) (= ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse1 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset))) ((_ sign_extend 16) ((_ extract 15 0) (bvneg ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse1 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset))))))))))) is different from false [2024-11-14 04:24:19,550 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:24:19,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [453761255] [2024-11-14 04:24:19,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [453761255] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:24:19,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1974746844] [2024-11-14 04:24:19,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:19,551 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:24:19,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:24:19,554 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:24:19,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2024-11-14 04:24:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:20,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-14 04:24:20,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:24:24,192 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 12 treesize of output 8 [2024-11-14 04:24:26,037 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 34 treesize of output 25 [2024-11-14 04:24:26,981 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 34 treesize of output 25 [2024-11-14 04:24:27,973 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 34 treesize of output 25 [2024-11-14 04:24:29,875 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 55 treesize of output 38 [2024-11-14 04:24:30,870 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 42 treesize of output 33 [2024-11-14 04:24:31,491 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 42 treesize of output 33 [2024-11-14 04:24:31,897 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 42 treesize of output 33 [2024-11-14 04:24:32,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 61 treesize of output 37 [2024-11-14 04:24:33,109 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 5 proven. 255 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-14 04:24:33,110 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:24:33,588 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_827 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_827))) (let ((.cse0 ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse1 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset))))) (or (= ((_ sign_extend 16) ((_ extract 15 0) (bvneg .cse0))) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse1 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset)))) (not (bvslt .cse0 (_ bv0 32))))))) is different from false [2024-11-14 04:24:34,117 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_825 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_826 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_827 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store (store |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base v_ArrVal_825) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base v_ArrVal_826) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_827))) (let ((.cse0 ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse1 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset))))) (or (not (bvslt .cse0 (_ bv0 32))) (= ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse1 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset))) ((_ sign_extend 16) ((_ extract 15 0) (bvneg .cse0)))))))) is different from false [2024-11-14 04:24:36,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1974746844] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:24:36,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072001672] [2024-11-14 04:24:36,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:36,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:24:36,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:24:36,484 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:24:36,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-11-14 04:24:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:36,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-14 04:24:36,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:24:40,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 04:24:40,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:24:41,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:24:41,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:24:43,310 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 30 treesize of output 25 [2024-11-14 04:24:44,114 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 46 treesize of output 35 [2024-11-14 04:24:44,952 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 57 treesize of output 44 [2024-11-14 04:24:45,428 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 48 treesize of output 37 [2024-11-14 04:24:46,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 67 treesize of output 39 [2024-11-14 04:24:48,772 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-14 04:24:48,772 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:24:48,872 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_860 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_860))) (let ((.cse0 ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse1 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset))))) (or (= ((_ sign_extend 16) ((_ extract 15 0) (bvneg .cse0))) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse1 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset)))) (not (bvslt .cse0 (_ bv0 32))))))) is different from false [2024-11-14 04:24:50,138 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_860 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_859 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_step_#t~mem20#1| (_ BitVec 16))) (let ((.cse0 (store |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base v_ArrVal_858))) (let ((.cse1 (store (store .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base v_ArrVal_859) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_860))) (let ((.cse2 ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse1 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset))))) (or (bvsge ((_ zero_extend 16) |ULTIMATE.start_step_#t~mem20#1|) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset)))) (= ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse1 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset))) ((_ sign_extend 16) ((_ extract 15 0) (bvneg .cse2)))) (not (bvslt .cse2 (_ bv0 32)))))))) is different from false [2024-11-14 04:24:51,994 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ sign_extend 16) ((_ extract 15 0) |c_ULTIMATE.start_step_#t~ite7#1|)))) (or (forall ((v_ArrVal_860 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_859 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_step_#t~mem20#1| (_ BitVec 16))) (let ((.cse1 (store (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base (store (select |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset .cse3)) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base v_ArrVal_858))) (let ((.cse2 (store (store .cse1 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base v_ArrVal_859) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_860))) (let ((.cse0 ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse2 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset))))) (or (not (bvslt .cse0 (_ bv0 32))) (bvsge ((_ zero_extend 16) |ULTIMATE.start_step_#t~mem20#1|) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse1 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset)))) (= ((_ sign_extend 16) ((_ extract 15 0) (bvneg .cse0))) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse2 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset))))))))) (forall ((|ULTIMATE.start_step_#t~mem8#1| (_ BitVec 16))) (not (bvsle (bvashr (_ bv50 32) ((_ zero_extend 16) |ULTIMATE.start_step_#t~mem8#1|)) ((_ sign_extend 16) ((_ extract 15 0) .cse3))))))) is different from false [2024-11-14 04:24:53,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072001672] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:24:53,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:24:53,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19, 16] total 40 [2024-11-14 04:24:53,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800220918] [2024-11-14 04:24:53,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:24:53,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-14 04:24:53,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:24:53,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-14 04:24:53,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=2917, Unknown=200, NotChecked=854, Total=4422 [2024-11-14 04:24:53,542 INFO L87 Difference]: Start difference. First operand 427 states and 624 transitions. Second operand has 41 states, 40 states have (on average 3.225) internal successors, (129), 40 states have internal predecessors, (129), 8 states have call successors, (30), 7 states have call predecessors, (30), 8 states have return successors, (30), 7 states have call predecessors, (30), 8 states have call successors, (30) [2024-11-14 04:25:12,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:25:12,942 INFO L93 Difference]: Finished difference Result 897 states and 1304 transitions. [2024-11-14 04:25:12,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 04:25:12,943 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 3.225) internal successors, (129), 40 states have internal predecessors, (129), 8 states have call successors, (30), 7 states have call predecessors, (30), 8 states have return successors, (30), 7 states have call predecessors, (30), 8 states have call successors, (30) Word has length 121 [2024-11-14 04:25:12,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:25:12,946 INFO L225 Difference]: With dead ends: 897 [2024-11-14 04:25:12,946 INFO L226 Difference]: Without dead ends: 473 [2024-11-14 04:25:12,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 378 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1865 ImplicationChecksByTransitivity, 23.4s TimeCoverageRelationStatistics Valid=907, Invalid=4915, Unknown=212, NotChecked=1106, Total=7140 [2024-11-14 04:25:12,950 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 924 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 2745 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 2824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:25:12,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 1198 Invalid, 2824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 2745 Invalid, 0 Unknown, 0 Unchecked, 14.2s Time] [2024-11-14 04:25:12,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-11-14 04:25:12,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 376. [2024-11-14 04:25:12,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 356 states have (on average 1.452247191011236) internal successors, (517), 356 states have internal predecessors, (517), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-14 04:25:12,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 545 transitions. [2024-11-14 04:25:12,999 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 545 transitions. Word has length 121 [2024-11-14 04:25:12,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:25:13,000 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 545 transitions. [2024-11-14 04:25:13,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.225) internal successors, (129), 40 states have internal predecessors, (129), 8 states have call successors, (30), 7 states have call predecessors, (30), 8 states have return successors, (30), 7 states have call predecessors, (30), 8 states have call successors, (30) [2024-11-14 04:25:13,000 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 545 transitions. [2024-11-14 04:25:13,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-14 04:25:13,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:25:13,002 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:25:13,011 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2024-11-14 04:25:13,212 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 (27)] Ended with exit code 0 [2024-11-14 04:25:13,418 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2024-11-14 04:25:13,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:25:13,603 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:25:13,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:25:13,604 INFO L85 PathProgramCache]: Analyzing trace with hash 813681008, now seen corresponding path program 1 times [2024-11-14 04:25:13,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:25:13,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1052925484] [2024-11-14 04:25:13,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:25:13,604 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 [2024-11-14 04:25:13,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:25:13,606 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 04:25:13,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 (30)] Waiting until timeout for monitored process [2024-11-14 04:25:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:25:14,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-14 04:25:14,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:25:17,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:25:17,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:25:18,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:25:19,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:25:20,007 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 30 treesize of output 25 [2024-11-14 04:25:20,290 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 34 treesize of output 25 [2024-11-14 04:25:20,567 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 34 treesize of output 25 [2024-11-14 04:25:20,729 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 34 treesize of output 25 [2024-11-14 04:25:21,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 43 treesize of output 23 [2024-11-14 04:25:21,260 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-14 04:25:21,260 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:25:22,853 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:25:22,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1052925484] [2024-11-14 04:25:22,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1052925484] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:25:22,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1258104521] [2024-11-14 04:25:22,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:25:22,853 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:25:22,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:25:22,855 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:25:22,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2024-11-14 04:25:24,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:25:24,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-14 04:25:24,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:25:27,198 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 12 treesize of output 8 [2024-11-14 04:25:28,071 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 [2024-11-14 04:25:28,780 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 [2024-11-14 04:25:29,458 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 [2024-11-14 04:25:30,729 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 38 treesize of output 29 [2024-11-14 04:25:31,125 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 29 treesize of output 22 [2024-11-14 04:25:31,646 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 29 treesize of output 22 [2024-11-14 04:25:31,971 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 29 treesize of output 22 [2024-11-14 04:25:32,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 48 treesize of output 28 [2024-11-14 04:25:32,714 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-14 04:25:32,714 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:25:36,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1258104521] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:25:36,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996518255] [2024-11-14 04:25:36,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:25:36,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:25:36,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:25:36,023 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:25:36,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-11-14 04:25:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:25:36,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-14 04:25:36,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:25:40,488 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 30 treesize of output 25 [2024-11-14 04:25:40,668 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 34 treesize of output 25 [2024-11-14 04:25:40,870 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 34 treesize of output 25 [2024-11-14 04:25:40,972 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 34 treesize of output 25 [2024-11-14 04:25:41,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 43 treesize of output 23 [2024-11-14 04:25:41,405 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-14 04:25:41,405 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:25:41,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996518255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:25:41,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 04:25:41,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [14, 14] total 24 [2024-11-14 04:25:41,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864985244] [2024-11-14 04:25:41,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:25:41,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 04:25:41,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:25:41,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 04:25:41,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1427, Unknown=71, NotChecked=0, Total=1722 [2024-11-14 04:25:41,408 INFO L87 Difference]: Start difference. First operand 376 states and 545 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-14 04:25:46,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:25:46,763 INFO L93 Difference]: Finished difference Result 786 states and 1135 transitions. [2024-11-14 04:25:46,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 04:25:46,764 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2024-11-14 04:25:46,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:25:46,766 INFO L225 Difference]: With dead ends: 786 [2024-11-14 04:25:46,766 INFO L226 Difference]: Without dead ends: 413 [2024-11-14 04:25:46,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 374 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=308, Invalid=1691, Unknown=71, NotChecked=0, Total=2070 [2024-11-14 04:25:46,768 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 339 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-14 04:25:46,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 1084 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1404 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-14 04:25:46,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-14 04:25:46,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 324. [2024-11-14 04:25:46,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 304 states have (on average 1.4407894736842106) internal successors, (438), 304 states have internal predecessors, (438), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-14 04:25:46,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 466 transitions. [2024-11-14 04:25:46,830 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 466 transitions. Word has length 121 [2024-11-14 04:25:46,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:25:46,830 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 466 transitions. [2024-11-14 04:25:46,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-14 04:25:46,830 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 466 transitions. [2024-11-14 04:25:46,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-14 04:25:46,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:25:46,834 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:25:46,843 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2024-11-14 04:25:47,040 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 (30)] Ended with exit code 0 [2024-11-14 04:25:47,250 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2024-11-14 04:25:47,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:25:47,435 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:25:47,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:25:47,435 INFO L85 PathProgramCache]: Analyzing trace with hash 608039076, now seen corresponding path program 1 times [2024-11-14 04:25:47,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:25:47,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [669098851] [2024-11-14 04:25:47,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:25:47,436 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 [2024-11-14 04:25:47,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:25:47,438 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 04:25:47,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 (33)] Waiting until timeout for monitored process [2024-11-14 04:25:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:25:47,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-14 04:25:47,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:25:49,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:25:51,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:25:52,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:25:53,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:25:54,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:25:54,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:25:55,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:25:56,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:25:56,992 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 61 treesize of output 41 [2024-11-14 04:25:57,425 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 33 treesize of output 24 [2024-11-14 04:25:57,594 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 19 [2024-11-14 04:25:57,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 94 treesize of output 62 [2024-11-14 04:25:58,195 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 1 proven. 287 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-14 04:25:58,196 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:25:58,666 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_989 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_989))) (or (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset)))) (= (_ bv0 8) ((_ extract 7 0) (select (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))))) (forall ((v_ArrVal_989 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_989))) (or (= (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset)))) (not (= (_ bv0 8) ((_ extract 7 0) (select (select .cse1 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))))))) is different from false [2024-11-14 04:25:58,757 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base))) (and (forall ((v_ArrVal_987 (_ BitVec 32)) (v_ArrVal_989 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store .cse1 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset v_ArrVal_987)) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_989))) (or (not (= (_ bv0 8) ((_ extract 7 0) (select (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))) (= (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset))))))) (forall ((v_ArrVal_987 (_ BitVec 32)) (v_ArrVal_989 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store (store |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store .cse1 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset v_ArrVal_987)) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_989))) (or (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset)))) (= (_ bv0 8) ((_ extract 7 0) (select (select .cse2 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))))))) is different from false [2024-11-14 04:25:59,156 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base)) (.cse0 (= (_ bv0 8) ((_ extract 7 0) (select (select |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))))) (and (or (not .cse0) (let ((.cse2 (store |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base (store .cse5 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset ((_ sign_extend 24) (_ bv1 8)))))) (let ((.cse3 (select .cse2 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base))) (and (forall ((v_ArrVal_987 (_ BitVec 32)) (v_ArrVal_989 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store .cse2 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store .cse3 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset v_ArrVal_987)) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_989))) (or (= (_ bv0 8) ((_ extract 7 0) (select (select .cse1 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset))))))) (forall ((v_ArrVal_987 (_ BitVec 32)) (v_ArrVal_989 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store (store .cse2 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store .cse3 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset v_ArrVal_987)) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_989))) (or (= (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse4 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset)))) (not (= (_ bv0 8) ((_ extract 7 0) (select (select .cse4 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))))))))))) (or (let ((.cse7 (store |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base (store .cse5 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset ((_ sign_extend 24) (_ bv0 8)))))) (let ((.cse8 (select .cse7 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base))) (and (forall ((v_ArrVal_987 (_ BitVec 32)) (v_ArrVal_989 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store (store .cse7 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store .cse8 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset v_ArrVal_987)) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_989))) (or (not (= ((_ extract 7 0) (select (select .cse6 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (_ bv0 8))) (= (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse6 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset))))))) (forall ((v_ArrVal_987 (_ BitVec 32)) (v_ArrVal_989 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store (store .cse7 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store .cse8 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset v_ArrVal_987)) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_989))) (or (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse9 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset)))) (= ((_ extract 7 0) (select (select .cse9 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (_ bv0 8)))))))) .cse0))) is different from false [2024-11-14 04:25:59,918 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ sign_extend 24) (_ bv0 8))) (.cse10 ((_ sign_extend 24) (_ bv1 8)))) (and (forall ((v_ArrVal_984 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_984))) (or (forall ((v_ArrVal_987 (_ BitVec 32)) (v_ArrVal_989 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (let ((.cse1 (store .cse2 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base (store (select .cse2 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset .cse3)))) (store .cse1 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store (select .cse1 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset v_ArrVal_987))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_989))) (or (= (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset)))) (not (= (_ bv0 8) ((_ extract 7 0) (select (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))))))) (= ((_ extract 7 0) (select (select .cse2 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (_ bv0 8))))) (forall ((v_ArrVal_984 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_984))) (or (forall ((v_ArrVal_987 (_ BitVec 32)) (v_ArrVal_989 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store (let ((.cse5 (store .cse6 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base (store (select .cse6 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset .cse3)))) (store .cse5 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store (select .cse5 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset v_ArrVal_987))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_989))) (or (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse4 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset)))) (= (_ bv0 8) ((_ extract 7 0) (select (select .cse4 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))))) (= ((_ extract 7 0) (select (select .cse6 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (_ bv0 8))))) (forall ((v_ArrVal_984 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_984))) (or (forall ((v_ArrVal_987 (_ BitVec 32)) (v_ArrVal_989 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store (let ((.cse8 (store .cse9 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base (store (select .cse9 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset .cse10)))) (store .cse8 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store (select .cse8 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset v_ArrVal_987))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_989))) (or (= (_ bv0 8) ((_ extract 7 0) (select (select .cse7 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))) (= ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse7 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset))) (_ bv0 32))))) (not (= ((_ extract 7 0) (select (select .cse9 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (_ bv0 8)))))) (forall ((v_ArrVal_984 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_984))) (or (not (= ((_ extract 7 0) (select (select .cse11 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (_ bv0 8))) (forall ((v_ArrVal_987 (_ BitVec 32)) (v_ArrVal_989 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store (let ((.cse13 (store .cse11 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base (store (select .cse11 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset .cse10)))) (store .cse13 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store (select .cse13 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset v_ArrVal_987))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_989))) (or (not (= (_ bv0 8) ((_ extract 7 0) (select (select .cse12 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))) (= ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse12 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset))) (_ bv1 32)))))))))) is different from false [2024-11-14 04:26:01,767 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:26:01,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [669098851] [2024-11-14 04:26:01,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [669098851] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:26:01,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [200621246] [2024-11-14 04:26:01,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:26:01,768 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:26:01,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:26:01,770 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:26:01,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2024-11-14 04:26:03,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:26:03,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-14 04:26:03,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:26:04,817 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 12 treesize of output 8 [2024-11-14 04:26:07,167 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 19 [2024-11-14 04:26:08,130 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 19 [2024-11-14 04:26:09,166 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 19 [2024-11-14 04:26:10,541 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 19 [2024-11-14 04:26:11,632 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 19 [2024-11-14 04:26:12,475 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 19 [2024-11-14 04:26:13,634 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 19 [2024-11-14 04:26:13,916 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 69 treesize of output 45 [2024-11-14 04:26:14,472 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 32 treesize of output 23 [2024-11-14 04:26:14,755 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 25 treesize of output 18 [2024-11-14 04:26:15,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 93 treesize of output 61 [2024-11-14 04:26:15,324 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 287 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-14 04:26:15,324 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:26:15,617 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1026 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_1026))) (or (= (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset)))) (not (= (_ bv0 8) ((_ extract 7 0) (select (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))))))) (forall ((v_ArrVal_1026 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_1026))) (or (= (_ bv0 8) ((_ extract 7 0) (select (select .cse1 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset)))))))) is different from false [2024-11-14 04:26:15,706 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base))) (and (forall ((v_ArrVal_1025 (_ BitVec 32)) (v_ArrVal_1026 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store .cse1 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset v_ArrVal_1025)) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_1026))) (or (= (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset)))) (not (= (_ bv0 8) ((_ extract 7 0) (select (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))))))) (forall ((v_ArrVal_1025 (_ BitVec 32)) (v_ArrVal_1026 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store (store |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store .cse1 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset v_ArrVal_1025)) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_1026))) (or (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset)))) (= (_ bv0 8) ((_ extract 7 0) (select (select .cse2 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))))))) is different from false [2024-11-14 04:26:16,102 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (= (_ bv0 8) ((_ extract 7 0) (select (select |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))) (.cse4 (select |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base))) (and (or (let ((.cse1 (store |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base (store .cse4 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset ((_ sign_extend 24) (_ bv1 8)))))) (let ((.cse2 (select .cse1 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base))) (and (forall ((v_ArrVal_1025 (_ BitVec 32)) (v_ArrVal_1026 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store .cse1 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store .cse2 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset v_ArrVal_1025)) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_1026))) (or (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset)))) (= (_ bv0 8) ((_ extract 7 0) (select (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))))) (forall ((v_ArrVal_1025 (_ BitVec 32)) (v_ArrVal_1026 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store (store .cse1 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store .cse2 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset v_ArrVal_1025)) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_1026))) (or (= (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse3 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset)))) (not (= (_ bv0 8) ((_ extract 7 0) (select (select .cse3 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))))))))) (not .cse5)) (or .cse5 (let ((.cse7 (store |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base (store .cse4 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset ((_ sign_extend 24) (_ bv0 8)))))) (let ((.cse8 (select .cse7 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base))) (and (forall ((v_ArrVal_1025 (_ BitVec 32)) (v_ArrVal_1026 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store (store .cse7 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store .cse8 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset v_ArrVal_1025)) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_1026))) (or (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse6 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset)))) (= (_ bv0 8) ((_ extract 7 0) (select (select .cse6 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))))) (forall ((v_ArrVal_1025 (_ BitVec 32)) (v_ArrVal_1026 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store (store .cse7 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store .cse8 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset v_ArrVal_1025)) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_1026))) (or (not (= (_ bv0 8) ((_ extract 7 0) (select (select .cse9 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))) (= (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse9 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset))))))))))))) is different from false [2024-11-14 04:26:16,658 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ sign_extend 24) (_ bv0 8))) (.cse10 ((_ sign_extend 24) (_ bv1 8)))) (and (forall ((v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_1021))) (or (= (_ bv0 8) ((_ extract 7 0) (select (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))) (forall ((v_ArrVal_1025 (_ BitVec 32)) (v_ArrVal_1026 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (let ((.cse2 (store .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base (store (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset .cse3)))) (store .cse2 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store (select .cse2 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset v_ArrVal_1025))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_1026))) (or (= (_ bv0 8) ((_ extract 7 0) (select (select .cse1 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))) (= ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset))) (_ bv0 32)))))))) (forall ((v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_1021))) (or (= (_ bv0 8) ((_ extract 7 0) (select (select .cse4 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))) (forall ((v_ArrVal_1025 (_ BitVec 32)) (v_ArrVal_1026 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store (let ((.cse6 (store .cse4 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base (store (select .cse4 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset .cse3)))) (store .cse6 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store (select .cse6 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset v_ArrVal_1025))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_1026))) (or (not (= (_ bv0 8) ((_ extract 7 0) (select (select .cse5 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))) (= ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse5 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset))) (_ bv1 32)))))))) (forall ((v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_1021))) (or (not (= (_ bv0 8) ((_ extract 7 0) (select (select .cse7 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))) (forall ((v_ArrVal_1025 (_ BitVec 32)) (v_ArrVal_1026 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store (let ((.cse9 (store .cse7 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base (store (select .cse7 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset .cse10)))) (store .cse9 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store (select .cse9 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset v_ArrVal_1025))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_1026))) (or (not (= ((_ extract 7 0) (select (select .cse8 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (_ bv0 8))) (= (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse8 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset)))))))))) (forall ((v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_1021))) (or (forall ((v_ArrVal_1025 (_ BitVec 32)) (v_ArrVal_1026 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store (let ((.cse12 (store .cse13 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base (store (select .cse13 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset .cse10)))) (store .cse12 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store (select .cse12 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset v_ArrVal_1025))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_1026))) (or (= ((_ extract 7 0) (select (select .cse11 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (_ bv0 8)) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse11 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset))))))) (not (= (_ bv0 8) ((_ extract 7 0) (select (select .cse13 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))))))))) is different from false [2024-11-14 04:26:19,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [200621246] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:26:19,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859946495] [2024-11-14 04:26:19,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:26:19,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:26:19,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:26:19,203 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:26:19,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-11-14 04:26:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:26:19,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-14 04:26:19,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:26:24,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 52 treesize of output 36 [2024-11-14 04:26:25,406 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 33 treesize of output 24 [2024-11-14 04:26:25,521 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 19 [2024-11-14 04:26:25,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 94 treesize of output 62 [2024-11-14 04:26:25,875 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-14 04:26:25,875 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:26:26,145 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1055 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_1055))) (or (= (_ bv0 8) ((_ extract 7 0) (select (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset))))))) (forall ((v_ArrVal_1055 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_1055))) (or (= (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset)))) (not (= (_ bv0 8) ((_ extract 7 0) (select (select .cse1 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))))))) is different from false [2024-11-14 04:26:26,229 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base))) (and (forall ((v_ArrVal_1055 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1053 (_ BitVec 32))) (let ((.cse0 (store (store |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store .cse1 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset v_ArrVal_1053)) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_1055))) (or (not (= (_ bv0 8) ((_ extract 7 0) (select (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))) (= (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset))))))) (forall ((v_ArrVal_1055 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1053 (_ BitVec 32))) (let ((.cse2 (store (store |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store .cse1 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset v_ArrVal_1053)) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_1055))) (or (= (_ bv0 8) ((_ extract 7 0) (select (select .cse2 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset))))))))) is different from false [2024-11-14 04:26:27,789 INFO L349 Elim1Store]: treesize reduction 108, result has 49.8 percent of original size [2024-11-14 04:26:27,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 177 treesize of output 193 [2024-11-14 04:26:28,036 INFO L349 Elim1Store]: treesize reduction 40, result has 37.5 percent of original size [2024-11-14 04:26:28,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 4 case distinctions, treesize of input 135 treesize of output 136 [2024-11-14 04:26:28,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:26:28,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 71 treesize of output 76 [2024-11-14 04:26:28,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:26:28,134 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 155 treesize of output 153 [2024-11-14 04:26:28,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:26:28,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 90 treesize of output 95 [2024-11-14 04:26:28,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 139 treesize of output 135 [2024-11-14 04:26:29,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 5 [2024-11-14 04:26:29,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 123 treesize of output 117 [2024-11-14 04:26:29,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:26:29,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 292 treesize of output 288 [2024-11-14 04:26:31,726 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 04:26:31,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 143 treesize of output 1 [2024-11-14 04:26:31,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:26:31,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 334 treesize of output 328 [2024-11-14 04:26:36,353 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-14 04:26:36,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859946495] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-14 04:26:36,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:26:36,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 18, 12] total 43 [2024-11-14 04:26:36,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866312195] [2024-11-14 04:26:36,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:26:36,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 04:26:36,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:26:36,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 04:26:36,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1424, Unknown=10, NotChecked=870, Total=2550 [2024-11-14 04:26:36,356 INFO L87 Difference]: Start difference. First operand 324 states and 466 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-14 04:26:43,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:26:43,222 INFO L93 Difference]: Finished difference Result 780 states and 1127 transitions. [2024-11-14 04:26:43,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 04:26:43,223 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-14 04:26:43,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:26:43,225 INFO L225 Difference]: With dead ends: 780 [2024-11-14 04:26:43,225 INFO L226 Difference]: Without dead ends: 459 [2024-11-14 04:26:43,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 498 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 873 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=304, Invalid=1888, Unknown=10, NotChecked=990, Total=3192 [2024-11-14 04:26:43,227 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 579 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 610 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:26:43,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 558 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 751 Invalid, 0 Unknown, 610 Unchecked, 5.3s Time] [2024-11-14 04:26:43,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-11-14 04:26:43,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 328. [2024-11-14 04:26:43,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 308 states have (on average 1.4415584415584415) internal successors, (444), 308 states have internal predecessors, (444), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-14 04:26:43,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 472 transitions. [2024-11-14 04:26:43,275 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 472 transitions. Word has length 123 [2024-11-14 04:26:43,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:26:43,276 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 472 transitions. [2024-11-14 04:26:43,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-14 04:26:43,276 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 472 transitions. [2024-11-14 04:26:43,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-14 04:26:43,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:26:43,278 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:26:43,288 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (34)] Ended with exit code 0 [2024-11-14 04:26:43,517 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2024-11-14 04:26:43,685 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 (33)] Forceful destruction successful, exit code 0 [2024-11-14 04:26:43,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:26:43,880 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:26:43,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:26:43,880 INFO L85 PathProgramCache]: Analyzing trace with hash -513163410, now seen corresponding path program 1 times [2024-11-14 04:26:43,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:26:43,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [139613812] [2024-11-14 04:26:43,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:26:43,881 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 [2024-11-14 04:26:43,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:26:43,883 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 04:26:43,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 (36)] Waiting until timeout for monitored process [2024-11-14 04:26:44,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:26:44,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-14 04:26:44,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:26:46,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:26:48,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:26:49,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:26:50,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:26:51,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:26:52,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:26:53,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:26:54,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:26:54,551 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 25 treesize of output 13 [2024-11-14 04:26:54,774 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 27 treesize of output 22 [2024-11-14 04:26:54,898 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 31 treesize of output 22 [2024-11-14 04:26:55,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 46 treesize of output 26 [2024-11-14 04:26:55,190 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 1 proven. 287 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-14 04:26:55,190 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:26:55,318 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1091 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_1091) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (_ bv0 8))) is different from false [2024-11-14 04:26:55,342 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1091 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store (store |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store (select |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_1091) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (_ bv0 8))) is different from false [2024-11-14 04:26:56,517 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:26:56,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [139613812] [2024-11-14 04:26:56,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [139613812] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:26:56,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [437302906] [2024-11-14 04:26:56,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:26:56,517 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:26:56,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:26:56,519 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:26:56,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2024-11-14 04:26:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:26:57,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-14 04:26:57,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:26:59,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 04:27:00,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:27:01,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:27:02,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:27:02,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:27:03,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:27:04,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:27:05,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 18 treesize of output 13 [2024-11-14 04:27:05,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 25 treesize of output 13 [2024-11-14 04:27:05,913 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 27 treesize of output 22 [2024-11-14 04:27:05,980 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 31 treesize of output 22 [2024-11-14 04:27:06,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 46 treesize of output 26 [2024-11-14 04:27:06,287 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 1 proven. 287 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-14 04:27:06,287 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:27:06,377 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1128 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_1128) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (_ bv0 8))) is different from false [2024-11-14 04:27:06,413 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1128 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 8) ((_ extract 7 0) (select (select (store (store |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store (select |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_1128) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))) is different from false [2024-11-14 04:27:08,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [437302906] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:27:08,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797073797] [2024-11-14 04:27:08,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:27:08,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:27:08,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:27:08,378 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:27:08,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2024-11-14 04:27:08,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:27:08,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-14 04:27:08,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:27:13,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 04:27:14,618 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 13 treesize of output 9 [2024-11-14 04:27:14,829 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 36 treesize of output 32 [2024-11-14 04:27:15,707 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 52 treesize of output 44 [2024-11-14 04:27:15,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 46 [2024-11-14 04:27:16,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 36 [2024-11-14 04:27:16,822 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-14 04:27:16,822 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:27:24,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797073797] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:27:24,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:27:24,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 10] total 24 [2024-11-14 04:27:24,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517397164] [2024-11-14 04:27:24,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:27:24,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-14 04:27:24,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:27:24,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-14 04:27:24,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1182, Unknown=80, NotChecked=300, Total=1722 [2024-11-14 04:27:24,282 INFO L87 Difference]: Start difference. First operand 328 states and 472 transitions. Second operand has 25 states, 24 states have (on average 5.083333333333333) internal successors, (122), 23 states have internal predecessors, (122), 8 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 7 states have call predecessors, (28), 8 states have call successors, (28) [2024-11-14 04:27:51,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:27:51,544 INFO L93 Difference]: Finished difference Result 1220 states and 1729 transitions. [2024-11-14 04:27:51,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-11-14 04:27:51,545 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 5.083333333333333) internal successors, (122), 23 states have internal predecessors, (122), 8 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 7 states have call predecessors, (28), 8 states have call successors, (28) Word has length 123 [2024-11-14 04:27:51,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:27:51,548 INFO L225 Difference]: With dead ends: 1220 [2024-11-14 04:27:51,548 INFO L226 Difference]: Without dead ends: 895 [2024-11-14 04:27:51,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 416 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2382 ImplicationChecksByTransitivity, 29.9s TimeCoverageRelationStatistics Valid=2083, Invalid=7950, Unknown=83, NotChecked=804, Total=10920 [2024-11-14 04:27:51,552 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 2909 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 1950 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2909 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 2224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2024-11-14 04:27:51,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2909 Valid, 801 Invalid, 2224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1950 Invalid, 0 Unknown, 0 Unchecked, 9.7s Time] [2024-11-14 04:27:51,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2024-11-14 04:27:51,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 434. [2024-11-14 04:27:51,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 414 states have (on average 1.458937198067633) internal successors, (604), 414 states have internal predecessors, (604), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-14 04:27:51,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 632 transitions. [2024-11-14 04:27:51,615 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 632 transitions. Word has length 123 [2024-11-14 04:27:51,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:27:51,615 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 632 transitions. [2024-11-14 04:27:51,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 5.083333333333333) internal successors, (122), 23 states have internal predecessors, (122), 8 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 7 states have call predecessors, (28), 8 states have call successors, (28) [2024-11-14 04:27:51,615 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 632 transitions. [2024-11-14 04:27:51,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-14 04:27:51,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:27:51,617 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:27:51,627 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 0 [2024-11-14 04:27:51,824 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 (36)] Ended with exit code 0 [2024-11-14 04:27:52,059 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2024-11-14 04:27:52,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:27:52,218 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:27:52,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:27:52,219 INFO L85 PathProgramCache]: Analyzing trace with hash -81610322, now seen corresponding path program 1 times [2024-11-14 04:27:52,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:27:52,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1475308154] [2024-11-14 04:27:52,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:27:52,219 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 [2024-11-14 04:27:52,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:27:52,222 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 04:27:52,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 (39)] Waiting until timeout for monitored process [2024-11-14 04:27:52,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:27:52,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 04:27:52,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:27:52,662 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-14 04:27:52,662 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:27:52,662 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:27:52,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1475308154] [2024-11-14 04:27:52,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1475308154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:27:52,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:27:52,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 04:27:52,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749612830] [2024-11-14 04:27:52,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:27:52,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:27:52,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:27:52,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:27:52,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:27:52,664 INFO L87 Difference]: Start difference. First operand 434 states and 632 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-14 04:27:52,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:27:52,783 INFO L93 Difference]: Finished difference Result 440 states and 638 transitions. [2024-11-14 04:27:52,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:27:52,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-14 04:27:52,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:27:52,786 INFO L225 Difference]: With dead ends: 440 [2024-11-14 04:27:52,786 INFO L226 Difference]: Without dead ends: 438 [2024-11-14 04:27:52,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:27:52,787 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:27:52,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 895 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:27:52,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-14 04:27:52,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2024-11-14 04:27:52,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 418 states have (on average 1.4545454545454546) internal successors, (608), 418 states have internal predecessors, (608), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-14 04:27:52,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 636 transitions. [2024-11-14 04:27:52,849 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 636 transitions. Word has length 123 [2024-11-14 04:27:52,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:27:52,849 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 636 transitions. [2024-11-14 04:27:52,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-14 04:27:52,850 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 636 transitions. [2024-11-14 04:27:52,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-14 04:27:52,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:27:52,851 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:27:52,859 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 (39)] Ended with exit code 0 [2024-11-14 04:27:53,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:27:53,052 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:27:53,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:27:53,053 INFO L85 PathProgramCache]: Analyzing trace with hash 88930819, now seen corresponding path program 1 times [2024-11-14 04:27:53,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:27:53,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1415181758] [2024-11-14 04:27:53,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:27:53,054 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 [2024-11-14 04:27:53,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:27:53,055 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 04:27:53,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 (40)] Waiting until timeout for monitored process [2024-11-14 04:27:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:27:53,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-14 04:27:53,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:27:55,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:27:56,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:27:56,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:27:57,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:27:57,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:27:58,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:27:58,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:27:58,911 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 25 treesize of output 13 [2024-11-14 04:27:59,082 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2024-11-14 04:27:59,082 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 1 case distinctions, treesize of input 27 treesize of output 30 [2024-11-14 04:27:59,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:27:59,229 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 31 treesize of output 27 [2024-11-14 04:27:59,307 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 1 proven. 287 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-14 04:27:59,307 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:28:00,136 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:28:00,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1415181758] [2024-11-14 04:28:00,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1415181758] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:28:00,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1222547744] [2024-11-14 04:28:00,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:28:00,136 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:28:00,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:28:00,138 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:28:00,140 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2024-11-14 04:28:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:28:01,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-14 04:28:01,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:28:02,569 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 12 treesize of output 8 [2024-11-14 04:28:04,148 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 19 [2024-11-14 04:28:04,723 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 19 [2024-11-14 04:28:05,322 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 19 [2024-11-14 04:28:06,045 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 19 [2024-11-14 04:28:06,597 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 19 [2024-11-14 04:28:07,179 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 19 [2024-11-14 04:28:07,912 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 19 [2024-11-14 04:28:08,044 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 33 treesize of output 17 [2024-11-14 04:28:08,280 INFO L349 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2024-11-14 04:28:08,281 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 1 case distinctions, treesize of input 26 treesize of output 21 [2024-11-14 04:28:08,456 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 04:28:08,456 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 27 treesize of output 15 [2024-11-14 04:28:08,521 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 287 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-14 04:28:08,521 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:28:09,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1222547744] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:28:09,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615185385] [2024-11-14 04:28:09,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:28:09,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:28:09,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:28:09,099 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:28:09,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2024-11-14 04:28:09,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:28:09,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-14 04:28:09,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:28:11,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2024-11-14 04:28:11,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:28:11,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 30 [2024-11-14 04:28:12,282 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-14 04:28:12,283 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:28:12,809 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 35 treesize of output 27 [2024-11-14 04:28:12,942 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-14 04:28:12,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615185385] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-14 04:28:12,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:28:12,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14, 15, 9] total 40 [2024-11-14 04:28:12,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046588587] [2024-11-14 04:28:12,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:28:12,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 04:28:12,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:28:12,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 04:28:12,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1678, Unknown=15, NotChecked=0, Total=1892 [2024-11-14 04:28:12,944 INFO L87 Difference]: Start difference. First operand 438 states and 636 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-14 04:28:14,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:28:14,389 INFO L93 Difference]: Finished difference Result 1092 states and 1582 transitions. [2024-11-14 04:28:14,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:28:14,390 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-14 04:28:14,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:28:14,392 INFO L225 Difference]: With dead ends: 1092 [2024-11-14 04:28:14,392 INFO L226 Difference]: Without dead ends: 657 [2024-11-14 04:28:14,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 503 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=215, Invalid=2026, Unknown=15, NotChecked=0, Total=2256 [2024-11-14 04:28:14,394 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 72 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:28:14,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 902 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-14 04:28:14,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2024-11-14 04:28:14,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 474. [2024-11-14 04:28:14,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 454 states have (on average 1.4449339207048457) internal successors, (656), 454 states have internal predecessors, (656), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-14 04:28:14,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 684 transitions. [2024-11-14 04:28:14,453 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 684 transitions. Word has length 123 [2024-11-14 04:28:14,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:28:14,453 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 684 transitions. [2024-11-14 04:28:14,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-14 04:28:14,453 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 684 transitions. [2024-11-14 04:28:14,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-14 04:28:14,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:28:14,455 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:28:14,466 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (41)] Ended with exit code 0 [2024-11-14 04:28:14,675 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2024-11-14 04:28:14,861 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 (40)] Ended with exit code 0 [2024-11-14 04:28:15,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:28:15,056 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:28:15,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:28:15,056 INFO L85 PathProgramCache]: Analyzing trace with hash -497875195, now seen corresponding path program 1 times [2024-11-14 04:28:15,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:28:15,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1153748899] [2024-11-14 04:28:15,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:28:15,056 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 [2024-11-14 04:28:15,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:28:15,060 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 04:28:15,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 (43)] Waiting until timeout for monitored process [2024-11-14 04:28:15,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:28:15,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-14 04:28:15,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:28:16,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:28:17,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:28:18,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:28:18,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:28:19,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:28:19,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:28:20,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:28:20,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:28:20,730 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 25 treesize of output 13 [2024-11-14 04:28:20,907 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2024-11-14 04:28:20,907 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 1 case distinctions, treesize of input 27 treesize of output 30 [2024-11-14 04:28:21,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:28:21,052 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 31 treesize of output 27 [2024-11-14 04:28:21,133 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 1 proven. 287 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-14 04:28:21,133 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:28:21,930 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:28:21,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1153748899] [2024-11-14 04:28:21,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1153748899] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:28:21,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [970881416] [2024-11-14 04:28:21,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:28:21,930 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:28:21,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:28:21,932 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:28:21,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (44)] Waiting until timeout for monitored process [2024-11-14 04:28:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:28:22,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-14 04:28:22,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:28:23,887 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2024-11-14 04:28:23,887 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 1 case distinctions, treesize of input 17 treesize of output 25 [2024-11-14 04:28:24,139 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 27 treesize of output 20 [2024-11-14 04:28:24,278 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 27 treesize of output 15 [2024-11-14 04:28:24,375 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-14 04:28:24,375 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:28:24,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [970881416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:28:24,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:28:24,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 19 [2024-11-14 04:28:24,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640740468] [2024-11-14 04:28:24,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:28:24,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 04:28:24,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:28:24,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 04:28:24,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=498, Unknown=13, NotChecked=0, Total=600 [2024-11-14 04:28:24,377 INFO L87 Difference]: Start difference. First operand 474 states and 684 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-14 04:28:31,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:28:31,812 INFO L93 Difference]: Finished difference Result 1122 states and 1618 transitions. [2024-11-14 04:28:31,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:28:31,813 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-14 04:28:31,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:28:31,815 INFO L225 Difference]: With dead ends: 1122 [2024-11-14 04:28:31,815 INFO L226 Difference]: Without dead ends: 651 [2024-11-14 04:28:31,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=101, Invalid=588, Unknown=13, NotChecked=0, Total=702 [2024-11-14 04:28:31,816 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 230 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:28:31,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 389 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2024-11-14 04:28:31,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2024-11-14 04:28:31,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 474. [2024-11-14 04:28:31,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 454 states have (on average 1.4317180616740088) internal successors, (650), 454 states have internal predecessors, (650), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-14 04:28:31,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 678 transitions. [2024-11-14 04:28:31,875 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 678 transitions. Word has length 123 [2024-11-14 04:28:31,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:28:31,875 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 678 transitions. [2024-11-14 04:28:31,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-14 04:28:31,875 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 678 transitions. [2024-11-14 04:28:31,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-14 04:28:31,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:28:31,877 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:28:31,891 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 (43)] Forceful destruction successful, exit code 0 [2024-11-14 04:28:32,083 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (44)] Ended with exit code 0 [2024-11-14 04:28:32,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 04:28:32,277 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:28:32,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:28:32,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1499417083, now seen corresponding path program 1 times [2024-11-14 04:28:32,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:28:32,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1489928078] [2024-11-14 04:28:32,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:28:32,278 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 [2024-11-14 04:28:32,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:28:32,280 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 04:28:32,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 (45)] Waiting until timeout for monitored process [2024-11-14 04:28:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:28:32,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-14 04:28:32,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:28:35,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:28:36,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:28:36,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:28:37,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:28:38,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:28:38,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:28:39,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:28:39,587 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 25 treesize of output 13 [2024-11-14 04:28:39,872 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-11-14 04:28:39,872 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 1 case distinctions, treesize of input 27 treesize of output 26 [2024-11-14 04:28:40,039 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 31 treesize of output 22 [2024-11-14 04:28:40,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:28:40,158 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 31 treesize of output 23 [2024-11-14 04:28:40,245 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 1 proven. 287 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-14 04:28:40,245 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:28:40,999 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1372 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1369 (_ BitVec 32)) (v_ArrVal_1368 (Array (_ BitVec 32) (_ BitVec 32))) (~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset (_ BitVec 32))) (= (_ bv0 8) ((_ extract 7 0) (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_1368))) (store .cse1 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base (store (select .cse1 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset v_ArrVal_1369))))) (store .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base (store (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)))))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base v_ArrVal_1372) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset)))) is different from false [2024-11-14 04:28:41,097 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:28:41,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1489928078] [2024-11-14 04:28:41,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1489928078] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:28:41,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [186123331] [2024-11-14 04:28:41,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:28:41,098 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:28:41,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:28:41,100 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:28:41,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (46)] Waiting until timeout for monitored process [2024-11-14 04:28:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:28:42,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-14 04:28:42,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:28:43,187 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2024-11-14 04:28:43,187 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 1 case distinctions, treesize of input 17 treesize of output 25 [2024-11-14 04:28:43,445 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 19 [2024-11-14 04:28:43,590 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-14 04:28:43,590 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:28:43,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [186123331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:28:43,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:28:43,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 20 [2024-11-14 04:28:43,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430403566] [2024-11-14 04:28:43,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:28:43,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 04:28:43,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:28:43,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 04:28:43,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=480, Unknown=18, NotChecked=46, Total=650 [2024-11-14 04:28:43,592 INFO L87 Difference]: Start difference. First operand 474 states and 678 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-14 04:28:45,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:28:45,653 INFO L93 Difference]: Finished difference Result 1140 states and 1636 transitions. [2024-11-14 04:28:45,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:28:45,654 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-14 04:28:45,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:28:45,656 INFO L225 Difference]: With dead ends: 1140 [2024-11-14 04:28:45,656 INFO L226 Difference]: Without dead ends: 669 [2024-11-14 04:28:45,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=124, Invalid=564, Unknown=18, NotChecked=50, Total=756 [2024-11-14 04:28:45,657 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 201 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-14 04:28:45,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 391 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-14 04:28:45,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2024-11-14 04:28:45,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 498. [2024-11-14 04:28:45,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 478 states have (on average 1.4225941422594142) internal successors, (680), 478 states have internal predecessors, (680), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-14 04:28:45,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 708 transitions. [2024-11-14 04:28:45,716 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 708 transitions. Word has length 123 [2024-11-14 04:28:45,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:28:45,716 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 708 transitions. [2024-11-14 04:28:45,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-14 04:28:45,716 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 708 transitions. [2024-11-14 04:28:45,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-14 04:28:45,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:28:45,718 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:28:45,737 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 (45)] Ended with exit code 0 [2024-11-14 04:28:45,924 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (46)] Ended with exit code 0 [2024-11-14 04:28:46,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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,46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 04:28:46,119 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:28:46,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:28:46,119 INFO L85 PathProgramCache]: Analyzing trace with hash -2086223097, now seen corresponding path program 1 times [2024-11-14 04:28:46,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:28:46,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601251184] [2024-11-14 04:28:46,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:28:46,120 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 [2024-11-14 04:28:46,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:28:46,122 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 04:28:46,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 (47)] Waiting until timeout for monitored process [2024-11-14 04:28:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:28:46,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-14 04:28:46,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:28:49,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:28:49,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:28:49,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2024-11-14 04:28:49,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 54 treesize of output 30 [2024-11-14 04:28:49,750 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-14 04:28:49,750 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:28:49,750 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:28:49,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601251184] [2024-11-14 04:28:49,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [601251184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:28:49,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:28:49,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 04:28:49,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234208503] [2024-11-14 04:28:49,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:28:49,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 04:28:49,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:28:49,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 04:28:49,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-14 04:28:49,751 INFO L87 Difference]: Start difference. First operand 498 states and 708 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-14 04:28:51,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:28:51,699 INFO L93 Difference]: Finished difference Result 1182 states and 1684 transitions. [2024-11-14 04:28:51,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 04:28:51,700 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-14 04:28:51,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:28:51,701 INFO L225 Difference]: With dead ends: 1182 [2024-11-14 04:28:51,701 INFO L226 Difference]: Without dead ends: 687 [2024-11-14 04:28:51,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-11-14 04:28:51,702 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 191 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-14 04:28:51,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 866 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-14 04:28:51,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-11-14 04:28:51,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 498. [2024-11-14 04:28:51,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 478 states have (on average 1.4225941422594142) internal successors, (680), 478 states have internal predecessors, (680), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-14 04:28:51,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 708 transitions. [2024-11-14 04:28:51,760 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 708 transitions. Word has length 123 [2024-11-14 04:28:51,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:28:51,760 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 708 transitions. [2024-11-14 04:28:51,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-14 04:28:51,760 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 708 transitions. [2024-11-14 04:28:51,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-14 04:28:51,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:28:51,762 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:28:51,771 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 (47)] Ended with exit code 0 [2024-11-14 04:28:51,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:28:51,963 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:28:51,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:28:51,963 INFO L85 PathProgramCache]: Analyzing trace with hash -51959758, now seen corresponding path program 1 times [2024-11-14 04:28:51,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:28:51,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [121241475] [2024-11-14 04:28:51,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:28:51,964 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 [2024-11-14 04:28:51,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:28:51,965 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 04:28:51,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 (48)] Waiting until timeout for monitored process [2024-11-14 04:28:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:28:52,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-14 04:28:52,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:28:57,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:28:58,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:28:58,544 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 27 treesize of output 25 [2024-11-14 04:28:59,067 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 58 treesize of output 48 [2024-11-14 04:28:59,314 INFO L349 Elim1Store]: treesize reduction 22, result has 33.3 percent of original size [2024-11-14 04:28:59,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 59 [2024-11-14 04:28:59,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 38 [2024-11-14 04:28:59,914 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-14 04:28:59,914 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:29:01,221 WARN L851 $PredicateComparison]: unable to prove that (forall ((~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_1452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1453 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1451 (Array (_ BitVec 32) (_ BitVec 32))) (~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset (_ BitVec 32))) (let ((.cse0 (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_1451))) (let ((.cse2 (store .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base v_ArrVal_1452))) (let ((.cse1 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse2 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))))) (or (bvsle (bvashr (_ bv50 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.offset)))) ((_ sign_extend 16) ((_ extract 15 0) (select v_ArrVal_1451 ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset)))) (not (bvslt .cse1 ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse2 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset))))) (not (let ((.cse3 (let ((.cse4 (store .cse2 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base v_ArrVal_1453))) (store .cse4 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base (store (select .cse4 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.offset ((_ sign_extend 16) (_ bv50 16))))))) (bvsle (bvashr (_ bv50 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse3 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.offset)))) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse3 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset)))))) (bvsge ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse2 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.offset))) .cse1)))))) is different from false [2024-11-14 04:29:01,567 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:29:01,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [121241475] [2024-11-14 04:29:01,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [121241475] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:29:01,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [922358976] [2024-11-14 04:29:01,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:29:01,567 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:29:01,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:29:01,569 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:29:01,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (49)] Waiting until timeout for monitored process [2024-11-14 04:29:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:29:02,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-14 04:29:02,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:29:08,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 04:29:08,796 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 13 treesize of output 9 [2024-11-14 04:29:09,040 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 36 treesize of output 32 [2024-11-14 04:29:09,829 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 67 treesize of output 55 [2024-11-14 04:29:10,223 INFO L349 Elim1Store]: treesize reduction 22, result has 33.3 percent of original size [2024-11-14 04:29:10,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 64 [2024-11-14 04:29:10,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 38 [2024-11-14 04:29:10,956 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-14 04:29:10,956 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:29:11,703 WARN L851 $PredicateComparison]: unable to prove that (forall ((~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset (_ BitVec 32)) (|ULTIMATE.start_step_#t~ite7#1| (_ BitVec 32))) (let ((.cse5 ((_ sign_extend 16) ((_ extract 15 0) |ULTIMATE.start_step_#t~ite7#1|)))) (let ((.cse4 (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base (store (select |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset .cse5)))) (or (forall ((~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_1452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1453 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store .cse4 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base v_ArrVal_1452))) (let ((.cse3 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse2 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))))) (or (not (let ((.cse0 (let ((.cse1 (store .cse2 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base v_ArrVal_1453))) (store .cse1 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base (store (select .cse1 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.offset ((_ sign_extend 16) (_ bv50 16))))))) (bvsle (bvashr (_ bv50 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.offset)))) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset)))))) (bvsge ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse2 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.offset))) .cse3) (not (bvslt .cse3 ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse2 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset))))))))) (bvsle (bvashr (_ bv50 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse4 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.offset)))) ((_ sign_extend 16) ((_ extract 15 0) .cse5))))))) is different from false [2024-11-14 04:29:12,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [922358976] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:29:12,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450564719] [2024-11-14 04:29:12,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:29:12,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:29:12,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:29:12,114 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:29:12,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2024-11-14 04:29:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:29:12,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-14 04:29:12,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:29:17,122 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 13 treesize of output 9 [2024-11-14 04:29:17,299 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 36 treesize of output 32 [2024-11-14 04:29:17,598 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 67 treesize of output 55 [2024-11-14 04:29:17,780 INFO L349 Elim1Store]: treesize reduction 22, result has 33.3 percent of original size [2024-11-14 04:29:17,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 64 [2024-11-14 04:29:18,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 38 [2024-11-14 04:29:18,532 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-14 04:29:18,532 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:29:18,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450564719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:29:18,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 04:29:18,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 10] total 16 [2024-11-14 04:29:18,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511705500] [2024-11-14 04:29:18,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:29:18,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 04:29:18,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:29:18,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 04:29:18,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=451, Unknown=8, NotChecked=90, Total=650 [2024-11-14 04:29:18,534 INFO L87 Difference]: Start difference. First operand 498 states and 708 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-14 04:29:25,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:29:25,246 INFO L93 Difference]: Finished difference Result 1093 states and 1549 transitions. [2024-11-14 04:29:25,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 04:29:25,247 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-14 04:29:25,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:29:25,249 INFO L225 Difference]: With dead ends: 1093 [2024-11-14 04:29:25,249 INFO L226 Difference]: Without dead ends: 598 [2024-11-14 04:29:25,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 396 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=8, NotChecked=114, Total=992 [2024-11-14 04:29:25,251 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 390 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 1251 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-11-14 04:29:25,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 670 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1251 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-11-14 04:29:25,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2024-11-14 04:29:25,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 502. [2024-11-14 04:29:25,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 482 states have (on average 1.4232365145228216) internal successors, (686), 482 states have internal predecessors, (686), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-14 04:29:25,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 714 transitions. [2024-11-14 04:29:25,311 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 714 transitions. Word has length 123 [2024-11-14 04:29:25,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:29:25,311 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 714 transitions. [2024-11-14 04:29:25,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-14 04:29:25,311 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 714 transitions. [2024-11-14 04:29:25,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-14 04:29:25,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:29:25,313 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:29:25,323 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 (48)] Ended with exit code 0 [2024-11-14 04:29:25,527 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2024-11-14 04:29:25,720 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (49)] Forceful destruction successful, exit code 0 [2024-11-14 04:29:25,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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,50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 04:29:25,914 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:29:25,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:29:25,914 INFO L85 PathProgramCache]: Analyzing trace with hash 796926466, now seen corresponding path program 1 times [2024-11-14 04:29:25,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:29:25,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [886616614] [2024-11-14 04:29:25,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:29:25,915 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 [2024-11-14 04:29:25,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:29:25,916 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 04:29:25,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 (51)] Waiting until timeout for monitored process [2024-11-14 04:29:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:29:26,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-14 04:29:26,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:29:31,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:29:31,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:29:32,196 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 26 treesize of output 24 [2024-11-14 04:29:32,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2024-11-14 04:29:32,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2024-11-14 04:29:33,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 30 [2024-11-14 04:29:33,352 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-14 04:29:33,352 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:29:34,702 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1539 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1540 (Array (_ BitVec 32) (_ BitVec 32))) (~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_1538 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_1538))) (let ((.cse2 (store .cse3 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base v_ArrVal_1539))) (or (let ((.cse0 (let ((.cse1 (store .cse2 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base v_ArrVal_1540))) (store .cse1 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base (store (select .cse1 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.offset ((_ sign_extend 16) (_ bv50 16))))))) (bvsle (bvashr (_ bv50 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.offset)))) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset))))) (bvsge ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse2 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.offset))) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse2 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset)))) (not (bvsle (bvashr (_ bv50 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse3 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.offset)))) ((_ sign_extend 16) ((_ extract 15 0) (select v_ArrVal_1538 ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset))))))))) is different from false [2024-11-14 04:29:34,975 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:29:34,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [886616614] [2024-11-14 04:29:34,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [886616614] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:29:34,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [642219374] [2024-11-14 04:29:34,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:29:34,975 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:29:34,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:29:34,977 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:29:34,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (52)] Waiting until timeout for monitored process [2024-11-14 04:29:36,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:29:36,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-14 04:29:36,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:29:40,738 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 12 treesize of output 8 [2024-11-14 04:29:41,696 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 22 treesize of output 21 [2024-11-14 04:29:42,241 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 43 treesize of output 37 [2024-11-14 04:29:42,999 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 59 treesize of output 49 [2024-11-14 04:29:43,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 49 [2024-11-14 04:29:43,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 41 [2024-11-14 04:29:43,954 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-14 04:29:43,954 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:29:44,661 WARN L851 $PredicateComparison]: unable to prove that (forall ((~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset (_ BitVec 32)) (|ULTIMATE.start_step_#t~ite7#1| (_ BitVec 32))) (let ((.cse1 ((_ sign_extend 16) ((_ extract 15 0) |ULTIMATE.start_step_#t~ite7#1|)))) (let ((.cse0 (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base (store (select |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset .cse1)))) (or (not (bvsle (bvashr (_ bv50 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.offset)))) ((_ sign_extend 16) ((_ extract 15 0) .cse1)))) (forall ((v_ArrVal_1539 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1540 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base v_ArrVal_1539))) (or (bvsge ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse2 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.offset))) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse2 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset)))) (let ((.cse3 (let ((.cse4 (store .cse2 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base v_ArrVal_1540))) (store .cse4 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base (store (select .cse4 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.offset ((_ sign_extend 16) (_ bv50 16))))))) (bvsle (bvashr (_ bv50 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse3 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.offset)))) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse3 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset)))))))))))) is different from false [2024-11-14 04:29:44,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [642219374] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:29:44,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703842788] [2024-11-14 04:29:44,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:29:44,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:29:44,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:29:44,940 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:29:44,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2024-11-14 04:29:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:29:45,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-14 04:29:45,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:29:49,253 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 13 treesize of output 9 [2024-11-14 04:29:49,916 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 35 treesize of output 31 [2024-11-14 04:29:50,731 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 51 treesize of output 43 [2024-11-14 04:29:51,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 45 [2024-11-14 04:29:52,835 INFO L349 Elim1Store]: treesize reduction 9, result has 75.7 percent of original size [2024-11-14 04:29:52,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 72 [2024-11-14 04:29:55,227 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-14 04:29:55,227 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:29:55,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703842788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:29:55,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 04:29:55,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [11, 11] total 31 [2024-11-14 04:29:55,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465674061] [2024-11-14 04:29:55,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:29:55,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 04:29:55,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:29:55,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 04:29:55,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1323, Unknown=7, NotChecked=154, Total=1722 [2024-11-14 04:29:55,229 INFO L87 Difference]: Start difference. First operand 502 states and 714 transitions. Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-14 04:30:05,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:30:09,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:30:09,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:30:09,790 INFO L93 Difference]: Finished difference Result 1213 states and 1714 transitions. [2024-11-14 04:30:09,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 04:30:09,791 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-14 04:30:09,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:30:09,794 INFO L225 Difference]: With dead ends: 1213 [2024-11-14 04:30:09,795 INFO L226 Difference]: Without dead ends: 714 [2024-11-14 04:30:09,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 383 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=415, Invalid=1938, Unknown=7, NotChecked=190, Total=2550 [2024-11-14 04:30:09,797 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 663 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 1950 mSolverCounterSat, 29 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 1981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1950 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2024-11-14 04:30:09,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 1070 Invalid, 1981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1950 Invalid, 2 Unknown, 0 Unchecked, 12.9s Time] [2024-11-14 04:30:09,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2024-11-14 04:30:09,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 514. [2024-11-14 04:30:09,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 494 states have (on average 1.417004048582996) internal successors, (700), 494 states have internal predecessors, (700), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-14 04:30:09,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 728 transitions. [2024-11-14 04:30:09,865 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 728 transitions. Word has length 123 [2024-11-14 04:30:09,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:30:09,865 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 728 transitions. [2024-11-14 04:30:09,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-14 04:30:09,865 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 728 transitions. [2024-11-14 04:30:09,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-14 04:30:09,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:30:09,867 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:30:09,876 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 (51)] Ended with exit code 0 [2024-11-14 04:30:10,074 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (52)] Ended with exit code 0 [2024-11-14 04:30:10,309 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2024-11-14 04:30:10,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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,52 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,53 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:30:10,468 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:30:10,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:30:10,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1614574916, now seen corresponding path program 1 times [2024-11-14 04:30:10,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:30:10,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [485141469] [2024-11-14 04:30:10,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:30:10,469 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 [2024-11-14 04:30:10,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:30:10,470 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 04:30:10,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 (54)] Waiting until timeout for monitored process [2024-11-14 04:30:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:30:11,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-14 04:30:11,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:30:15,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:30:16,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:30:16,722 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 26 treesize of output 24 [2024-11-14 04:30:17,237 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-11-14 04:30:17,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 56 [2024-11-14 04:30:17,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 28 treesize of output 24 [2024-11-14 04:30:17,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2024-11-14 04:30:17,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 37 [2024-11-14 04:30:18,035 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-14 04:30:18,035 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:30:19,597 WARN L851 $PredicateComparison]: unable to prove that (forall ((~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset (_ BitVec 32)) (~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base (_ BitVec 32)) (~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_1625 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1626 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1624 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_1624))) (let ((.cse2 (store .cse4 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base v_ArrVal_1625))) (let ((.cse3 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse2 ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))))) (or (let ((.cse0 (let ((.cse1 (store .cse2 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base v_ArrVal_1626))) (store .cse1 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base (store (select .cse1 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.offset ((_ sign_extend 16) (_ bv50 16))))))) (bvsle (bvashr (_ bv50 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.offset)))) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset))))) (bvsge ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse2 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.offset))) .cse3) (not (bvsle (bvashr (_ bv50 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse4 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.offset)))) ((_ sign_extend 16) ((_ extract 15 0) (select v_ArrVal_1624 ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset))))) (not (bvslt .cse3 ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse2 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset)))))))))) is different from false [2024-11-14 04:30:19,949 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:30:19,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [485141469] [2024-11-14 04:30:19,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [485141469] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:30:19,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [148166542] [2024-11-14 04:30:19,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:30:19,950 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:30:19,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:30:19,951 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:30:19,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (55)] Waiting until timeout for monitored process [2024-11-14 04:30:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:30:21,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-14 04:30:21,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:30:27,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 04:30:27,938 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 13 treesize of output 9 [2024-11-14 04:30:28,504 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 35 treesize of output 31 [2024-11-14 04:30:29,370 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 66 treesize of output 54 [2024-11-14 04:30:29,699 INFO L349 Elim1Store]: treesize reduction 22, result has 33.3 percent of original size [2024-11-14 04:30:29,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 63 [2024-11-14 04:30:30,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 42 [2024-11-14 04:30:30,427 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-14 04:30:30,427 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:30:32,352 WARN L851 $PredicateComparison]: unable to prove that (forall ((~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset (_ BitVec 32)) (|ULTIMATE.start_step_#t~ite7#1| (_ BitVec 32))) (let ((.cse5 ((_ sign_extend 16) ((_ extract 15 0) |ULTIMATE.start_step_#t~ite7#1|)))) (let ((.cse4 (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base (store (select |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset .cse5)))) (or (forall ((~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_1655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1626 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store .cse4 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base v_ArrVal_1655))) (let ((.cse1 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))))) (or (bvsge ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.offset))) .cse1) (not (bvslt .cse1 ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset))))) (let ((.cse2 (let ((.cse3 (store .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base v_ArrVal_1626))) (store .cse3 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base (store (select .cse3 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.offset ((_ sign_extend 16) (_ bv50 16))))))) (bvsle (bvashr (_ bv50 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse2 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.offset)))) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse2 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset))))))))) (not (bvsle (bvashr (_ bv50 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse4 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.offset)))) ((_ sign_extend 16) ((_ extract 15 0) .cse5)))))))) is different from false [2024-11-14 04:30:32,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [148166542] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:30:32,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258821842] [2024-11-14 04:30:32,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:30:32,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:30:32,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:30:32,879 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:30:32,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2024-11-14 04:30:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:30:33,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-14 04:30:33,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:30:38,274 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 13 treesize of output 9 [2024-11-14 04:30:38,627 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 35 treesize of output 31 [2024-11-14 04:30:38,960 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 66 treesize of output 54 [2024-11-14 04:30:39,156 INFO L349 Elim1Store]: treesize reduction 22, result has 33.3 percent of original size [2024-11-14 04:30:39,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 63 [2024-11-14 04:30:41,307 INFO L349 Elim1Store]: treesize reduction 9, result has 75.7 percent of original size [2024-11-14 04:30:41,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 79 [2024-11-14 04:30:43,663 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-14 04:30:43,663 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:30:43,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258821842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:30:43,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 04:30:43,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [11, 11] total 25 [2024-11-14 04:30:43,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602566159] [2024-11-14 04:30:43,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:30:43,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 04:30:43,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:30:43,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 04:30:43,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1132, Unknown=13, NotChecked=142, Total=1482 [2024-11-14 04:30:43,665 INFO L87 Difference]: Start difference. First operand 514 states and 728 transitions. Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-14 04:30:48,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:30:51,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:31:01,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:31:03,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:31:03,438 INFO L93 Difference]: Finished difference Result 1132 states and 1599 transitions. [2024-11-14 04:31:03,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 04:31:03,439 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-14 04:31:03,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:31:03,442 INFO L225 Difference]: With dead ends: 1132 [2024-11-14 04:31:03,442 INFO L226 Difference]: Without dead ends: 621 [2024-11-14 04:31:03,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 385 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=393, Invalid=1672, Unknown=13, NotChecked=178, Total=2256 [2024-11-14 04:31:03,443 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 401 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 2460 mSolverCounterSat, 15 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 2479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2460 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.9s IncrementalHoareTripleChecker+Time [2024-11-14 04:31:03,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 1145 Invalid, 2479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2460 Invalid, 4 Unknown, 0 Unchecked, 17.9s Time] [2024-11-14 04:31:03,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2024-11-14 04:31:03,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 513. [2024-11-14 04:31:03,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 493 states have (on average 1.4158215010141988) internal successors, (698), 493 states have internal predecessors, (698), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-14 04:31:03,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 726 transitions. [2024-11-14 04:31:03,507 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 726 transitions. Word has length 123 [2024-11-14 04:31:03,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:31:03,507 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 726 transitions. [2024-11-14 04:31:03,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-14 04:31:03,507 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 726 transitions. [2024-11-14 04:31:03,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-14 04:31:03,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:31:03,511 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:31:03,522 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 (54)] Ended with exit code 0 [2024-11-14 04:31:03,719 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (55)] Forceful destruction successful, exit code 0 [2024-11-14 04:31:03,925 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2024-11-14 04:31:04,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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,55 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,56 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:31:04,112 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:31:04,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:31:04,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1316647358, now seen corresponding path program 1 times [2024-11-14 04:31:04,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:31:04,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2040253781] [2024-11-14 04:31:04,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:31:04,113 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 [2024-11-14 04:31:04,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:31:04,114 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 04:31:04,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 (57)] Waiting until timeout for monitored process [2024-11-14 04:31:04,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:31:04,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-14 04:31:04,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:31:10,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:31:11,722 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-14 04:31:11,722 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 1 case distinctions, treesize of input 30 treesize of output 29 [2024-11-14 04:31:12,208 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 37 treesize of output 33 [2024-11-14 04:31:12,794 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 45 [2024-11-14 04:31:13,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 47 [2024-11-14 04:31:13,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 45 [2024-11-14 04:31:13,792 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-14 04:31:13,793 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:31:21,610 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:31:21,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2040253781] [2024-11-14 04:31:21,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2040253781] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:31:21,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1595245965] [2024-11-14 04:31:21,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:31:21,610 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:31:21,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:31:21,614 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:31:21,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (58)] Waiting until timeout for monitored process [2024-11-14 04:31:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:31:22,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-14 04:31:22,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:31:28,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 04:31:29,273 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 13 treesize of output 9 [2024-11-14 04:31:29,948 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 35 treesize of output 31 [2024-11-14 04:31:30,865 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 51 treesize of output 43 [2024-11-14 04:31:31,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 45 [2024-11-14 04:31:33,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:31:33,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 52 [2024-11-14 04:31:33,333 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-14 04:31:33,333 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:31:52,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1595245965] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:31:52,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493951933] [2024-11-14 04:31:52,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:31:52,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:31:52,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:31:52,883 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:31:52,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2024-11-14 04:31:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:31:53,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-14 04:31:53,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:31:58,661 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 13 treesize of output 9 [2024-11-14 04:31:59,318 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 37 treesize of output 33 [2024-11-14 04:31:59,679 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 45 [2024-11-14 04:31:59,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 47 [2024-11-14 04:32:01,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 45 [2024-11-14 04:32:01,753 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-14 04:32:01,754 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:32:01,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493951933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:32:01,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 04:32:01,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13, 15] total 28 [2024-11-14 04:32:01,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754570664] [2024-11-14 04:32:01,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:32:01,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 04:32:01,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:32:01,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 04:32:01,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=2205, Unknown=39, NotChecked=0, Total=2652 [2024-11-14 04:32:01,756 INFO L87 Difference]: Start difference. First operand 513 states and 726 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-14 04:32:14,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:32:14,355 INFO L93 Difference]: Finished difference Result 1235 states and 1737 transitions. [2024-11-14 04:32:14,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 04:32:14,356 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-14 04:32:14,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:32:14,358 INFO L225 Difference]: With dead ends: 1235 [2024-11-14 04:32:14,358 INFO L226 Difference]: Without dead ends: 725 [2024-11-14 04:32:14,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 371 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1293 ImplicationChecksByTransitivity, 32.7s TimeCoverageRelationStatistics Valid=653, Invalid=2848, Unknown=39, NotChecked=0, Total=3540 [2024-11-14 04:32:14,360 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 467 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 1855 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 1873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2024-11-14 04:32:14,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1028 Invalid, 1873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1855 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2024-11-14 04:32:14,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2024-11-14 04:32:14,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 630. [2024-11-14 04:32:14,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 610 states have (on average 1.4327868852459016) internal successors, (874), 610 states have internal predecessors, (874), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-14 04:32:14,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 902 transitions. [2024-11-14 04:32:14,419 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 902 transitions. Word has length 123 [2024-11-14 04:32:14,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:32:14,420 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 902 transitions. [2024-11-14 04:32:14,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-14 04:32:14,420 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 902 transitions. [2024-11-14 04:32:14,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-14 04:32:14,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:32:14,422 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:32:14,431 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 (57)] Ended with exit code 0 [2024-11-14 04:32:14,636 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2024-11-14 04:32:14,830 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (58)] Ended with exit code 0 [2024-11-14 04:32:15,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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,59 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,58 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 04:32:15,023 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:32:15,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:32:15,023 INFO L85 PathProgramCache]: Analyzing trace with hash -498998908, now seen corresponding path program 1 times [2024-11-14 04:32:15,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:32:15,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [231369540] [2024-11-14 04:32:15,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:32:15,023 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 [2024-11-14 04:32:15,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:32:15,025 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 04:32:15,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/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 (60)] Waiting until timeout for monitored process [2024-11-14 04:32:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:32:15,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-14 04:32:15,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:32:22,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:32:23,928 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-14 04:32:23,928 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 1 case distinctions, treesize of input 30 treesize of output 29 [2024-11-14 04:32:24,397 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 37 treesize of output 33 [2024-11-14 04:32:25,225 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-11-14 04:32:25,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 65 [2024-11-14 04:32:25,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 28 treesize of output 24 [2024-11-14 04:32:25,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2024-11-14 04:32:26,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 44 [2024-11-14 04:32:26,655 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-14 04:32:26,655 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:32:33,636 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:32:33,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [231369540] [2024-11-14 04:32:33,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [231369540] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:32:33,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1896802187] [2024-11-14 04:32:33,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:32:33,636 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:32:33,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:32:33,638 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:32:33,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (61)] Waiting until timeout for monitored process [2024-11-14 04:32:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:32:34,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-14 04:32:34,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:32:43,719 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 12 treesize of output 8 [2024-11-14 04:32:45,320 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 22 treesize of output 21 [2024-11-14 04:32:46,299 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 43 treesize of output 37 [2024-11-14 04:32:47,950 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 74 treesize of output 60 [2024-11-14 04:32:48,591 INFO L349 Elim1Store]: treesize reduction 22, result has 33.3 percent of original size [2024-11-14 04:32:48,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 67 [2024-11-14 04:32:52,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:32:52,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 39 [2024-11-14 04:32:52,261 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-14 04:32:52,261 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:33:17,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1896802187] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:33:17,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070138176] [2024-11-14 04:33:17,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:33:17,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:33:17,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:33:17,174 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:33:17,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a50517d3-5973-4ec2-9b68-12d65e0ae6dc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2024-11-14 04:33:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:33:17,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-14 04:33:17,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:33:25,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 04:33:26,899 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 13 treesize of output 9 [2024-11-14 04:33:28,210 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 35 treesize of output 31 [2024-11-14 04:33:30,314 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 66 treesize of output 54 [2024-11-14 04:33:31,053 INFO L349 Elim1Store]: treesize reduction 22, result has 33.3 percent of original size [2024-11-14 04:33:31,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 63 [2024-11-14 04:33:33,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 44 [2024-11-14 04:33:33,584 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-14 04:33:33,584 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:33:57,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070138176] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:33:57,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:33:57,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 13] total 36 [2024-11-14 04:33:57,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301991305] [2024-11-14 04:33:57,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:33:57,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-14 04:33:57,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:33:57,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-14 04:33:57,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=665, Invalid=3824, Unknown=67, NotChecked=0, Total=4556 [2024-11-14 04:33:57,799 INFO L87 Difference]: Start difference. First operand 630 states and 902 transitions. Second operand has 37 states, 37 states have (on average 4.216216216216216) internal successors, (156), 36 states have internal predecessors, (156), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 6 states have call predecessors, (42), 6 states have call successors, (42) [2024-11-14 04:33:59,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:34:01,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]