./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-61.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-61.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9d4c4ba5fceaa6bfb2098951964c33b59994f146ab7abe517b65f1a8d594c6fc --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:49:11,929 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:49:11,993 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 04:49:11,997 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:49:11,998 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:49:12,022 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:49:12,022 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:49:12,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:49:12,024 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:49:12,024 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:49:12,025 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:49:12,025 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:49:12,026 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:49:12,026 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:49:12,027 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:49:12,028 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:49:12,028 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:49:12,029 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:49:12,029 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:49:12,030 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:49:12,030 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:49:12,035 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:49:12,035 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:49:12,035 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:49:12,036 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:49:12,036 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:49:12,036 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:49:12,037 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:49:12,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:49:12,037 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:49:12,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:49:12,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:49:12,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:49:12,039 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:49:12,039 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:49:12,039 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:49:12,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:49:12,039 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:49:12,040 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:49:12,040 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:49:12,040 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:49:12,040 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:49:12,040 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya 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 -> Automizer 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 -> 9d4c4ba5fceaa6bfb2098951964c33b59994f146ab7abe517b65f1a8d594c6fc [2023-11-29 04:49:12,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:49:12,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:49:12,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:49:12,282 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:49:12,282 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:49:12,284 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-61.i [2023-11-29 04:49:15,041 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:49:15,268 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:49:15,268 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-61.i [2023-11-29 04:49:15,278 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/data/af75a2714/77841a82e87643dfb2d833efd75c19ea/FLAGda7fe8746 [2023-11-29 04:49:15,293 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/data/af75a2714/77841a82e87643dfb2d833efd75c19ea [2023-11-29 04:49:15,295 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:49:15,296 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:49:15,297 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:49:15,298 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:49:15,303 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:49:15,304 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:49:15" (1/1) ... [2023-11-29 04:49:15,305 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c791d7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:49:15, skipping insertion in model container [2023-11-29 04:49:15,305 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:49:15" (1/1) ... [2023-11-29 04:49:15,339 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:49:15,491 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-61.i[916,929] [2023-11-29 04:49:15,560 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:49:15,573 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:49:15,586 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-61.i[916,929] [2023-11-29 04:49:15,623 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:49:15,644 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:49:15,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:49:15 WrapperNode [2023-11-29 04:49:15,645 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:49:15,646 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:49:15,646 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:49:15,646 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:49:15,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:49:15" (1/1) ... [2023-11-29 04:49:15,671 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:49:15" (1/1) ... [2023-11-29 04:49:15,716 INFO L138 Inliner]: procedures = 29, calls = 189, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 454 [2023-11-29 04:49:15,717 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:49:15,718 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:49:15,718 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:49:15,718 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:49:15,730 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:49:15" (1/1) ... [2023-11-29 04:49:15,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:49:15" (1/1) ... [2023-11-29 04:49:15,737 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:49:15" (1/1) ... [2023-11-29 04:49:15,761 INFO L175 MemorySlicer]: Split 147 memory accesses to 7 slices as follows [2, 35, 5, 27, 3, 72, 3]. 49 percent of accesses are in the largest equivalence class. The 22 initializations are split as follows [2, 4, 1, 2, 1, 11, 1]. The 23 writes are split as follows [0, 6, 1, 2, 1, 12, 1]. [2023-11-29 04:49:15,762 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:49:15" (1/1) ... [2023-11-29 04:49:15,762 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:49:15" (1/1) ... [2023-11-29 04:49:15,786 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:49:15" (1/1) ... [2023-11-29 04:49:15,791 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:49:15" (1/1) ... [2023-11-29 04:49:15,795 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:49:15" (1/1) ... [2023-11-29 04:49:15,798 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:49:15" (1/1) ... [2023-11-29 04:49:15,805 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:49:15,806 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:49:15,806 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:49:15,806 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:49:15,807 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:49:15" (1/1) ... [2023-11-29 04:49:15,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:49:15,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:49:15,837 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:49:15,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:49:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:49:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-11-29 04:49:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-11-29 04:49:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-11-29 04:49:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-11-29 04:49:15,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-11-29 04:49:15,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-11-29 04:49:15,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2023-11-29 04:49:15,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 04:49:15,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 04:49:15,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 04:49:15,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 04:49:15,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 04:49:15,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-29 04:49:15,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-11-29 04:49:15,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-11-29 04:49:15,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-11-29 04:49:15,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-11-29 04:49:15,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-11-29 04:49:15,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-11-29 04:49:15,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-11-29 04:49:15,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2023-11-29 04:49:15,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 04:49:15,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 04:49:15,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 04:49:15,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 04:49:15,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 04:49:15,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-29 04:49:15,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-11-29 04:49:15,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-11-29 04:49:15,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-11-29 04:49:15,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-11-29 04:49:15,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-11-29 04:49:15,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-11-29 04:49:15,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-11-29 04:49:15,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2023-11-29 04:49:15,877 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 04:49:15,877 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 04:49:15,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:49:15,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 04:49:15,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 04:49:15,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 04:49:15,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 04:49:15,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-29 04:49:15,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-11-29 04:49:15,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:49:15,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:49:16,021 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:49:16,023 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:49:16,489 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:49:16,527 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:49:16,527 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 04:49:16,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:49:16 BoogieIcfgContainer [2023-11-29 04:49:16,528 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:49:16,531 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:49:16,532 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:49:16,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:49:16,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:49:15" (1/3) ... [2023-11-29 04:49:16,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b63f472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:49:16, skipping insertion in model container [2023-11-29 04:49:16,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:49:15" (2/3) ... [2023-11-29 04:49:16,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b63f472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:49:16, skipping insertion in model container [2023-11-29 04:49:16,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:49:16" (3/3) ... [2023-11-29 04:49:16,538 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-61.i [2023-11-29 04:49:16,557 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:49:16,558 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 04:49:16,609 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:49:16,616 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@66e8eefe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:49:16,617 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 04:49:16,621 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 85 states have (on average 1.388235294117647) internal successors, (118), 86 states have internal predecessors, (118), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 04:49:16,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-11-29 04:49:16,639 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:49:16,640 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:49:16,641 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:49:16,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:49:16,646 INFO L85 PathProgramCache]: Analyzing trace with hash 2119270199, now seen corresponding path program 1 times [2023-11-29 04:49:16,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:49:16,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313451735] [2023-11-29 04:49:16,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:49:16,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:49:16,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:16,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:49:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:16,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:49:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:16,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 04:49:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:49:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 04:49:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 04:49:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 04:49:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 04:49:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:49:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:49:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 04:49:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 04:49:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 04:49:17,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 04:49:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 04:49:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 04:49:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 04:49:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 04:49:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 04:49:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 04:49:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 04:49:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 04:49:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 04:49:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-29 04:49:17,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-11-29 04:49:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-29 04:49:17,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:49:17,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313451735] [2023-11-29 04:49:17,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313451735] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:49:17,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:49:17,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:49:17,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142445083] [2023-11-29 04:49:17,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:49:17,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 04:49:17,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:49:17,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 04:49:17,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:49:17,152 INFO L87 Difference]: Start difference. First operand has 113 states, 85 states have (on average 1.388235294117647) internal successors, (118), 86 states have internal predecessors, (118), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-29 04:49:17,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:49:17,202 INFO L93 Difference]: Finished difference Result 223 states and 359 transitions. [2023-11-29 04:49:17,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 04:49:17,205 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 185 [2023-11-29 04:49:17,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:49:17,213 INFO L225 Difference]: With dead ends: 223 [2023-11-29 04:49:17,214 INFO L226 Difference]: Without dead ends: 111 [2023-11-29 04:49:17,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:49:17,221 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:49:17,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:49:17,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-29 04:49:17,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-11-29 04:49:17,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 84 states have internal predecessors, (113), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 04:49:17,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2023-11-29 04:49:17,267 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 185 [2023-11-29 04:49:17,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:49:17,267 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2023-11-29 04:49:17,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-29 04:49:17,268 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2023-11-29 04:49:17,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-11-29 04:49:17,273 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:49:17,273 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:49:17,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:49:17,274 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:49:17,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:49:17,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1896348451, now seen corresponding path program 1 times [2023-11-29 04:49:17,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:49:17,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306151343] [2023-11-29 04:49:17,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:49:17,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:49:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:49:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:49:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 04:49:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:49:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 04:49:17,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 04:49:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 04:49:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 04:49:17,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:49:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:49:17,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 04:49:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 04:49:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 04:49:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 04:49:17,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 04:49:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 04:49:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 04:49:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 04:49:17,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 04:49:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 04:49:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 04:49:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 04:49:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 04:49:17,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-29 04:49:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-11-29 04:49:17,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:17,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-29 04:49:17,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:49:17,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306151343] [2023-11-29 04:49:17,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306151343] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:49:17,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:49:17,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:49:17,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667632550] [2023-11-29 04:49:17,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:49:17,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:49:17,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:49:17,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:49:17,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:49:17,708 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:49:17,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:49:17,780 INFO L93 Difference]: Finished difference Result 233 states and 342 transitions. [2023-11-29 04:49:17,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:49:17,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 185 [2023-11-29 04:49:17,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:49:17,785 INFO L225 Difference]: With dead ends: 233 [2023-11-29 04:49:17,785 INFO L226 Difference]: Without dead ends: 123 [2023-11-29 04:49:17,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:49:17,789 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 21 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:49:17,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 468 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:49:17,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-29 04:49:17,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 113. [2023-11-29 04:49:17,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 04:49:17,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2023-11-29 04:49:17,808 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 165 transitions. Word has length 185 [2023-11-29 04:49:17,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:49:17,810 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 165 transitions. [2023-11-29 04:49:17,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:49:17,811 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 165 transitions. [2023-11-29 04:49:17,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-11-29 04:49:17,815 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:49:17,816 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:49:17,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:49:17,816 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:49:17,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:49:17,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1589272219, now seen corresponding path program 1 times [2023-11-29 04:49:17,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:49:17,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967626662] [2023-11-29 04:49:17,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:49:17,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:49:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:49:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:49:18,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 04:49:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:49:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 04:49:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 04:49:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 04:49:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 04:49:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:49:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:49:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 04:49:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 04:49:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 04:49:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 04:49:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 04:49:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 04:49:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 04:49:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 04:49:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 04:49:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 04:49:18,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 04:49:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 04:49:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 04:49:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-29 04:49:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-11-29 04:49:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-29 04:49:18,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:49:18,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967626662] [2023-11-29 04:49:18,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967626662] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:49:18,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:49:18,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:49:18,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106304637] [2023-11-29 04:49:18,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:49:18,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:49:18,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:49:18,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:49:18,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:49:18,080 INFO L87 Difference]: Start difference. First operand 113 states and 165 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:49:18,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:49:18,122 INFO L93 Difference]: Finished difference Result 229 states and 334 transitions. [2023-11-29 04:49:18,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:49:18,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 185 [2023-11-29 04:49:18,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:49:18,126 INFO L225 Difference]: With dead ends: 229 [2023-11-29 04:49:18,126 INFO L226 Difference]: Without dead ends: 117 [2023-11-29 04:49:18,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:49:18,129 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 3 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:49:18,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 466 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:49:18,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-29 04:49:18,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2023-11-29 04:49:18,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 04:49:18,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 167 transitions. [2023-11-29 04:49:18,143 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 167 transitions. Word has length 185 [2023-11-29 04:49:18,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:49:18,144 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 167 transitions. [2023-11-29 04:49:18,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:49:18,144 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 167 transitions. [2023-11-29 04:49:18,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-11-29 04:49:18,147 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:49:18,147 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:49:18,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 04:49:18,147 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:49:18,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:49:18,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1589331801, now seen corresponding path program 1 times [2023-11-29 04:49:18,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:49:18,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752379363] [2023-11-29 04:49:18,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:49:18,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:49:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:49:18,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:49:18,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 04:49:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:49:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 04:49:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 04:49:18,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 04:49:18,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 04:49:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:49:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:49:18,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 04:49:18,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 04:49:18,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 04:49:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 04:49:18,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 04:49:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 04:49:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 04:49:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 04:49:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 04:49:18,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 04:49:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 04:49:18,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 04:49:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 04:49:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-29 04:49:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-11-29 04:49:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:18,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-29 04:49:18,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:49:18,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752379363] [2023-11-29 04:49:18,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752379363] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:49:18,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:49:18,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:49:18,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886639325] [2023-11-29 04:49:18,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:49:18,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:49:18,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:49:18,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:49:18,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:49:18,699 INFO L87 Difference]: Start difference. First operand 115 states and 167 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:49:18,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:49:18,869 INFO L93 Difference]: Finished difference Result 281 states and 408 transitions. [2023-11-29 04:49:18,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:49:18,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 185 [2023-11-29 04:49:18,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:49:18,872 INFO L225 Difference]: With dead ends: 281 [2023-11-29 04:49:18,872 INFO L226 Difference]: Without dead ends: 167 [2023-11-29 04:49:18,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:49:18,875 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 66 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:49:18,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 551 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:49:18,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-11-29 04:49:18,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 117. [2023-11-29 04:49:18,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 90 states have internal predecessors, (119), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 04:49:18,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 169 transitions. [2023-11-29 04:49:18,889 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 169 transitions. Word has length 185 [2023-11-29 04:49:18,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:49:18,890 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 169 transitions. [2023-11-29 04:49:18,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:49:18,890 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 169 transitions. [2023-11-29 04:49:18,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-11-29 04:49:18,893 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:49:18,893 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:49:18,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 04:49:18,894 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:49:18,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:49:18,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1079858711, now seen corresponding path program 1 times [2023-11-29 04:49:18,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:49:18,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150334030] [2023-11-29 04:49:18,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:49:18,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:49:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:20,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:49:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:20,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:49:20,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:20,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 04:49:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:20,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:49:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:20,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 04:49:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:20,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 04:49:20,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:20,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 04:49:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:20,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 04:49:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:20,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:49:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:20,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:49:20,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:20,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 04:49:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:20,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 04:49:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:20,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 04:49:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:20,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 04:49:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:20,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 04:49:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:20,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 04:49:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:20,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 04:49:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:20,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 04:49:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:20,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 04:49:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:20,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 04:49:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:20,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 04:49:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:20,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 04:49:20,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:20,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 04:49:20,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:20,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-29 04:49:20,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:20,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-11-29 04:49:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:20,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-29 04:49:20,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:49:20,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150334030] [2023-11-29 04:49:20,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150334030] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:49:20,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:49:20,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:49:20,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229652665] [2023-11-29 04:49:20,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:49:20,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:49:20,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:49:20,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:49:20,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:49:20,807 INFO L87 Difference]: Start difference. First operand 117 states and 169 transitions. Second operand has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-29 04:49:21,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:49:21,182 INFO L93 Difference]: Finished difference Result 314 states and 450 transitions. [2023-11-29 04:49:21,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:49:21,183 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 185 [2023-11-29 04:49:21,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:49:21,185 INFO L225 Difference]: With dead ends: 314 [2023-11-29 04:49:21,185 INFO L226 Difference]: Without dead ends: 198 [2023-11-29 04:49:21,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:49:21,187 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 153 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:49:21,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 1050 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:49:21,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2023-11-29 04:49:21,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 168. [2023-11-29 04:49:21,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 138 states have (on average 1.3478260869565217) internal successors, (186), 139 states have internal predecessors, (186), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-29 04:49:21,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 240 transitions. [2023-11-29 04:49:21,206 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 240 transitions. Word has length 185 [2023-11-29 04:49:21,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:49:21,206 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 240 transitions. [2023-11-29 04:49:21,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-29 04:49:21,207 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 240 transitions. [2023-11-29 04:49:21,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-11-29 04:49:21,209 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:49:21,210 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:49:21,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 04:49:21,210 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:49:21,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:49:21,210 INFO L85 PathProgramCache]: Analyzing trace with hash -508489191, now seen corresponding path program 1 times [2023-11-29 04:49:21,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:49:21,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684686105] [2023-11-29 04:49:21,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:49:21,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:49:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:22,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:49:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:22,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:49:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:22,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 04:49:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:22,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:49:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:22,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 04:49:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:22,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 04:49:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:22,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 04:49:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:22,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 04:49:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:22,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:49:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:22,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:49:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:22,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 04:49:22,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:22,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 04:49:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:22,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 04:49:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:22,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 04:49:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:22,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 04:49:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:22,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 04:49:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:22,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 04:49:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:22,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 04:49:22,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:22,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 04:49:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:22,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 04:49:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:22,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 04:49:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:22,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 04:49:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:22,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 04:49:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:22,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-29 04:49:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:22,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-11-29 04:49:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:22,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 21 proven. 117 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2023-11-29 04:49:22,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:49:22,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684686105] [2023-11-29 04:49:22,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684686105] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:49:22,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022195655] [2023-11-29 04:49:22,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:49:22,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:49:22,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:49:22,603 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:49:22,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 04:49:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:22,897 INFO L262 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 04:49:22,913 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:49:23,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-29 04:49:23,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-29 04:49:23,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 24 proven. 72 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-11-29 04:49:23,392 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:49:23,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2023-11-29 04:49:23,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022195655] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:49:23,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:49:23,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 16 [2023-11-29 04:49:23,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422167816] [2023-11-29 04:49:23,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:49:23,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 04:49:23,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:49:23,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 04:49:23,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2023-11-29 04:49:23,787 INFO L87 Difference]: Start difference. First operand 168 states and 240 transitions. Second operand has 16 states, 12 states have (on average 8.916666666666666) internal successors, (107), 16 states have internal predecessors, (107), 8 states have call successors, (75), 2 states have call predecessors, (75), 4 states have return successors, (75), 4 states have call predecessors, (75), 8 states have call successors, (75) [2023-11-29 04:49:24,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:49:24,842 INFO L93 Difference]: Finished difference Result 358 states and 498 transitions. [2023-11-29 04:49:24,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 04:49:24,843 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 8.916666666666666) internal successors, (107), 16 states have internal predecessors, (107), 8 states have call successors, (75), 2 states have call predecessors, (75), 4 states have return successors, (75), 4 states have call predecessors, (75), 8 states have call successors, (75) Word has length 185 [2023-11-29 04:49:24,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:49:24,846 INFO L225 Difference]: With dead ends: 358 [2023-11-29 04:49:24,846 INFO L226 Difference]: Without dead ends: 189 [2023-11-29 04:49:24,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 415 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=246, Invalid=1014, Unknown=0, NotChecked=0, Total=1260 [2023-11-29 04:49:24,848 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 393 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 04:49:24,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 855 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 04:49:24,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2023-11-29 04:49:24,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 182. [2023-11-29 04:49:24,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 148 states have (on average 1.3108108108108107) internal successors, (194), 149 states have internal predecessors, (194), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-29 04:49:24,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 248 transitions. [2023-11-29 04:49:24,874 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 248 transitions. Word has length 185 [2023-11-29 04:49:24,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:49:24,875 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 248 transitions. [2023-11-29 04:49:24,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 8.916666666666666) internal successors, (107), 16 states have internal predecessors, (107), 8 states have call successors, (75), 2 states have call predecessors, (75), 4 states have return successors, (75), 4 states have call predecessors, (75), 8 states have call successors, (75) [2023-11-29 04:49:24,875 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 248 transitions. [2023-11-29 04:49:24,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2023-11-29 04:49:24,878 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:49:24,878 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:49:24,888 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 04:49:25,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-29 04:49:25,079 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:49:25,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:49:25,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1594146464, now seen corresponding path program 1 times [2023-11-29 04:49:25,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:49:25,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716558277] [2023-11-29 04:49:25,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:49:25,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:49:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:49:25,240 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:49:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:49:25,426 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:49:25,426 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 04:49:25,427 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 04:49:25,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 04:49:25,433 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:49:25,437 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:49:25,505 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem41 could not be translated [2023-11-29 04:49:25,507 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem42 could not be translated [2023-11-29 04:49:25,508 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem44 could not be translated [2023-11-29 04:49:25,509 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem45 could not be translated [2023-11-29 04:49:25,511 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem47 could not be translated [2023-11-29 04:49:25,512 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem48 could not be translated [2023-11-29 04:49:25,512 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated [2023-11-29 04:49:25,513 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated [2023-11-29 04:49:25,513 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem51 could not be translated [2023-11-29 04:49:25,513 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem51 could not be translated [2023-11-29 04:49:25,514 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated [2023-11-29 04:49:25,514 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short56 could not be translated [2023-11-29 04:49:25,514 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short52 could not be translated [2023-11-29 04:49:25,515 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short52 could not be translated [2023-11-29 04:49:25,515 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated [2023-11-29 04:49:25,516 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short56 could not be translated [2023-11-29 04:49:25,516 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem51 could not be translated [2023-11-29 04:49:25,517 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem58 could not be translated [2023-11-29 04:49:25,518 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem59 could not be translated [2023-11-29 04:49:25,519 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem61 could not be translated [2023-11-29 04:49:25,520 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem62 could not be translated [2023-11-29 04:49:25,521 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem64 could not be translated [2023-11-29 04:49:25,522 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem65 could not be translated [2023-11-29 04:49:25,523 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated [2023-11-29 04:49:25,524 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem68 could not be translated [2023-11-29 04:49:25,525 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem70 could not be translated [2023-11-29 04:49:25,526 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem71 could not be translated [2023-11-29 04:49:25,526 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated [2023-11-29 04:49:25,527 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem74 could not be translated [2023-11-29 04:49:25,528 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem76 could not be translated [2023-11-29 04:49:25,529 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem77 could not be translated [2023-11-29 04:49:25,529 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem79 could not be translated [2023-11-29 04:49:25,530 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem80 could not be translated [2023-11-29 04:49:25,530 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem82 could not be translated [2023-11-29 04:49:25,531 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-29 04:49:25,531 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite9 could not be translated [2023-11-29 04:49:25,532 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem7 could not be translated [2023-11-29 04:49:25,532 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem6 could not be translated [2023-11-29 04:49:25,532 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem10 could not be translated [2023-11-29 04:49:25,532 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem5 could not be translated [2023-11-29 04:49:25,532 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-29 04:49:25,533 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated [2023-11-29 04:49:25,533 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem34 could not be translated [2023-11-29 04:49:25,534 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem33 could not be translated [2023-11-29 04:49:25,534 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated [2023-11-29 04:49:25,534 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem37 could not be translated [2023-11-29 04:49:25,534 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite36 could not be translated [2023-11-29 04:49:25,535 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-29 04:49:25,535 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 04:49:25,535 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem91 could not be translated [2023-11-29 04:49:25,535 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated [2023-11-29 04:49:25,535 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated [2023-11-29 04:49:25,536 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated [2023-11-29 04:49:25,536 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-29 04:49:25,536 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-29 04:49:25,536 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite97 could not be translated [2023-11-29 04:49:25,536 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated [2023-11-29 04:49:25,537 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 04:49:25,537 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-29 04:49:25,537 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated [2023-11-29 04:49:25,537 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated [2023-11-29 04:49:25,537 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem91 could not be translated [2023-11-29 04:49:25,537 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated [2023-11-29 04:49:25,538 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short108 could not be translated [2023-11-29 04:49:25,538 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-29 04:49:25,538 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated [2023-11-29 04:49:25,538 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-29 04:49:25,538 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem91 could not be translated [2023-11-29 04:49:25,538 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite97 could not be translated [2023-11-29 04:49:25,539 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated [2023-11-29 04:49:25,539 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 04:49:25,539 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-29 04:49:25,539 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated [2023-11-29 04:49:25,539 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem91 could not be translated [2023-11-29 04:49:25,539 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short108 could not be translated [2023-11-29 04:49:25,540 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated [2023-11-29 04:49:25,540 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short124 could not be translated [2023-11-29 04:49:25,540 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated [2023-11-29 04:49:25,540 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 04:49:25,540 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-29 04:49:25,540 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite97 could not be translated [2023-11-29 04:49:25,541 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short108 could not be translated [2023-11-29 04:49:25,541 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated [2023-11-29 04:49:25,541 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short133 could not be translated [2023-11-29 04:49:25,541 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short124 could not be translated [2023-11-29 04:49:25,541 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem91 could not be translated [2023-11-29 04:49:25,542 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-29 04:49:25,542 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated [2023-11-29 04:49:25,542 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 04:49:25,542 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-29 04:49:25,542 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated [2023-11-29 04:49:25,542 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite97 could not be translated [2023-11-29 04:49:25,543 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 04:49:25,543 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-29 04:49:25,543 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short108 could not be translated [2023-11-29 04:49:25,543 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short136 could not be translated [2023-11-29 04:49:25,543 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-29 04:49:25,543 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short124 could not be translated [2023-11-29 04:49:25,544 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite97 could not be translated [2023-11-29 04:49:25,544 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short133 could not be translated [2023-11-29 04:49:25,544 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem91 could not be translated [2023-11-29 04:49:25,544 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated [2023-11-29 04:49:25,544 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated [2023-11-29 04:49:25,544 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated [2023-11-29 04:49:25,545 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short133 could not be translated [2023-11-29 04:49:25,545 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated [2023-11-29 04:49:25,545 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite97 could not be translated [2023-11-29 04:49:25,545 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short136 could not be translated [2023-11-29 04:49:25,545 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short124 could not be translated [2023-11-29 04:49:25,545 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-29 04:49:25,546 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 04:49:25,546 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short139 could not be translated [2023-11-29 04:49:25,546 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short108 could not be translated [2023-11-29 04:49:25,546 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem91 could not be translated [2023-11-29 04:49:25,546 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated [2023-11-29 04:49:25,546 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated [2023-11-29 04:49:25,546 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-29 04:49:25,547 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short124 could not be translated [2023-11-29 04:49:25,547 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-29 04:49:25,547 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short136 could not be translated [2023-11-29 04:49:25,547 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated [2023-11-29 04:49:25,548 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-29 04:49:25,548 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short141 could not be translated [2023-11-29 04:49:25,548 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem91 could not be translated [2023-11-29 04:49:25,548 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated [2023-11-29 04:49:25,548 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short108 could not be translated [2023-11-29 04:49:25,549 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 04:49:25,549 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite97 could not be translated [2023-11-29 04:49:25,549 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated [2023-11-29 04:49:25,549 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short139 could not be translated [2023-11-29 04:49:25,549 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short133 could not be translated [2023-11-29 04:49:25,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 04:49:25 BoogieIcfgContainer [2023-11-29 04:49:25,577 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 04:49:25,577 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:49:25,577 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:49:25,577 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:49:25,578 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:49:16" (3/4) ... [2023-11-29 04:49:25,580 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 04:49:25,581 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:49:25,582 INFO L158 Benchmark]: Toolchain (without parser) took 10285.53ms. Allocated memory was 136.3MB in the beginning and 310.4MB in the end (delta: 174.1MB). Free memory was 101.3MB in the beginning and 252.9MB in the end (delta: -151.6MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. [2023-11-29 04:49:25,582 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 136.3MB. Free memory is still 107.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:49:25,583 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.76ms. Allocated memory is still 136.3MB. Free memory was 100.9MB in the beginning and 85.6MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 04:49:25,583 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.16ms. Allocated memory is still 136.3MB. Free memory was 85.6MB in the beginning and 80.8MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 04:49:25,584 INFO L158 Benchmark]: Boogie Preprocessor took 87.45ms. Allocated memory is still 136.3MB. Free memory was 80.8MB in the beginning and 74.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 04:49:25,584 INFO L158 Benchmark]: RCFGBuilder took 722.44ms. Allocated memory was 136.3MB in the beginning and 165.7MB in the end (delta: 29.4MB). Free memory was 74.5MB in the beginning and 123.9MB in the end (delta: -49.4MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. [2023-11-29 04:49:25,585 INFO L158 Benchmark]: TraceAbstraction took 9045.23ms. Allocated memory was 165.7MB in the beginning and 310.4MB in the end (delta: 144.7MB). Free memory was 122.8MB in the beginning and 254.0MB in the end (delta: -131.2MB). Peak memory consumption was 135.1MB. Max. memory is 16.1GB. [2023-11-29 04:49:25,585 INFO L158 Benchmark]: Witness Printer took 4.26ms. Allocated memory is still 310.4MB. Free memory was 254.0MB in the beginning and 252.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:49:25,587 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.18ms. Allocated memory is still 136.3MB. Free memory is still 107.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 347.76ms. Allocated memory is still 136.3MB. Free memory was 100.9MB in the beginning and 85.6MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.16ms. Allocated memory is still 136.3MB. Free memory was 85.6MB in the beginning and 80.8MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.45ms. Allocated memory is still 136.3MB. Free memory was 80.8MB in the beginning and 74.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 722.44ms. Allocated memory was 136.3MB in the beginning and 165.7MB in the end (delta: 29.4MB). Free memory was 74.5MB in the beginning and 123.9MB in the end (delta: -49.4MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9045.23ms. Allocated memory was 165.7MB in the beginning and 310.4MB in the end (delta: 144.7MB). Free memory was 122.8MB in the beginning and 254.0MB in the end (delta: -131.2MB). Peak memory consumption was 135.1MB. Max. memory is 16.1GB. * Witness Printer took 4.26ms. Allocated memory is still 310.4MB. Free memory was 254.0MB in the beginning and 252.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem41 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem42 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem44 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem45 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem47 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem48 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem51 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem51 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short56 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short52 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short52 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short56 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem51 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem58 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem59 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem61 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem62 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem64 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem65 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem68 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem70 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem71 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem74 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem76 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem77 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem79 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem80 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem82 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem34 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem33 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem37 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite36 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem91 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem91 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short108 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem91 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem91 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short108 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short124 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short108 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short133 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short124 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem91 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short108 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short136 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short124 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short133 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem91 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short133 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short136 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short124 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short139 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short108 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem91 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short124 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short136 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short141 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem91 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short108 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short139 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short133 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someBinaryDOUBLEComparisonOperation at line 64. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {0, 0} }; [L25-L27] double double_Array_0[1] = { 32.5 }; [L25-L27] double double_Array_0[1] = { 32.5 }; [L28-L30] float float_Array_0[2] = { 255.5, 255.5 }; [L28-L30] float float_Array_0[2] = { 255.5, 255.5 }; [L28-L30] float float_Array_0[2] = { 255.5, 255.5 }; [L31-L33] signed char signed_char_Array_0[1] = { 0 }; [L31-L33] signed char signed_char_Array_0[1] = { 0 }; [L34-L36] unsigned char unsigned_char_Array_0[11] = { 5, 100, 128, 64, 100, 8, 50, 8, 32, 64, 0 }; [L34-L36] unsigned char unsigned_char_Array_0[11] = { 5, 100, 128, 64, 100, 8, 50, 8, 32, 64, 0 }; [L34-L36] unsigned char unsigned_char_Array_0[11] = { 5, 100, 128, 64, 100, 8, 50, 8, 32, 64, 0 }; [L34-L36] unsigned char unsigned_char_Array_0[11] = { 5, 100, 128, 64, 100, 8, 50, 8, 32, 64, 0 }; [L34-L36] unsigned char unsigned_char_Array_0[11] = { 5, 100, 128, 64, 100, 8, 50, 8, 32, 64, 0 }; [L34-L36] unsigned char unsigned_char_Array_0[11] = { 5, 100, 128, 64, 100, 8, 50, 8, 32, 64, 0 }; [L34-L36] unsigned char unsigned_char_Array_0[11] = { 5, 100, 128, 64, 100, 8, 50, 8, 32, 64, 0 }; [L34-L36] unsigned char unsigned_char_Array_0[11] = { 5, 100, 128, 64, 100, 8, 50, 8, 32, 64, 0 }; [L34-L36] unsigned char unsigned_char_Array_0[11] = { 5, 100, 128, 64, 100, 8, 50, 8, 32, 64, 0 }; [L34-L36] unsigned char unsigned_char_Array_0[11] = { 5, 100, 128, 64, 100, 8, 50, 8, 32, 64, 0 }; [L34-L36] unsigned char unsigned_char_Array_0[11] = { 5, 100, 128, 64, 100, 8, 50, 8, 32, 64, 0 }; [L34-L36] unsigned char unsigned_char_Array_0[11] = { 5, 100, 128, 64, 100, 8, 50, 8, 32, 64, 0 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[1] = { 64 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[1] = { 64 }; [L115] isInitial = 1 [L116] FCALL initially() [L117] COND TRUE 1 [L118] FCALL updateLastVariables() [L119] CALL updateVariables() [L69] BOOL_unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L70] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L73] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] float_Array_0[1] = __VERIFIER_nondet_float() [L79] EXPR float_Array_0[1] [L79] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L79] EXPR float_Array_0[1] [L79] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L81] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L84] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L87] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] CALL assume_abort_if_not(unsigned_char_Array_0[2] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] RET assume_abort_if_not(unsigned_char_Array_0[2] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] CALL assume_abort_if_not(unsigned_char_Array_0[2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] RET assume_abort_if_not(unsigned_char_Array_0[2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] unsigned_char_Array_0[3] = __VERIFIER_nondet_uchar() [L90] EXPR unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] CALL assume_abort_if_not(unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] RET assume_abort_if_not(unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] EXPR unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] CALL assume_abort_if_not(unsigned_char_Array_0[3] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] RET assume_abort_if_not(unsigned_char_Array_0[3] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] unsigned_char_Array_0[6] = __VERIFIER_nondet_uchar() [L93] EXPR unsigned_char_Array_0[6] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L93] CALL assume_abort_if_not(unsigned_char_Array_0[6] >= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L93] RET assume_abort_if_not(unsigned_char_Array_0[6] >= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L94] EXPR unsigned_char_Array_0[6] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L94] CALL assume_abort_if_not(unsigned_char_Array_0[6] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L94] RET assume_abort_if_not(unsigned_char_Array_0[6] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] unsigned_char_Array_0[7] = __VERIFIER_nondet_uchar() [L96] EXPR unsigned_char_Array_0[7] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] CALL assume_abort_if_not(unsigned_char_Array_0[7] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] RET assume_abort_if_not(unsigned_char_Array_0[7] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR unsigned_char_Array_0[7] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] CALL assume_abort_if_not(unsigned_char_Array_0[7] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] RET assume_abort_if_not(unsigned_char_Array_0[7] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L98] unsigned_char_Array_0[8] = __VERIFIER_nondet_uchar() [L99] EXPR unsigned_char_Array_0[8] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L99] CALL assume_abort_if_not(unsigned_char_Array_0[8] >= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L99] RET assume_abort_if_not(unsigned_char_Array_0[8] >= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR unsigned_char_Array_0[8] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] CALL assume_abort_if_not(unsigned_char_Array_0[8] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] RET assume_abort_if_not(unsigned_char_Array_0[8] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] unsigned_char_Array_0[9] = __VERIFIER_nondet_uchar() [L102] EXPR unsigned_char_Array_0[9] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L102] CALL assume_abort_if_not(unsigned_char_Array_0[9] >= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L102] RET assume_abort_if_not(unsigned_char_Array_0[9] >= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L103] EXPR unsigned_char_Array_0[9] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L103] CALL assume_abort_if_not(unsigned_char_Array_0[9] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L103] RET assume_abort_if_not(unsigned_char_Array_0[9] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L104] unsigned_char_Array_0[10] = __VERIFIER_nondet_uchar() [L105] EXPR unsigned_char_Array_0[10] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L105] CALL assume_abort_if_not(unsigned_char_Array_0[10] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L105] RET assume_abort_if_not(unsigned_char_Array_0[10] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L106] EXPR unsigned_char_Array_0[10] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L106] CALL assume_abort_if_not(unsigned_char_Array_0[10] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L106] RET assume_abort_if_not(unsigned_char_Array_0[10] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L119] RET updateVariables() [L120] CALL step() [L43] BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L43] COND TRUE BOOL_unsigned_char_Array_0[0][0] [L44] EXPR unsigned_char_Array_0[3] [L44] EXPR unsigned_char_Array_0[0] [L44] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L44] EXPR ((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1]) [L44] EXPR unsigned_char_Array_0[0] [L44] EXPR ((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L44] unsigned_char_Array_0[4] = (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))) [L48] EXPR BOOL_unsigned_char_Array_0[0][0] [L48] EXPR BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L48] EXPR BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L48] unsigned char stepLocal_0 = BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1]; [L49] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L49] COND TRUE BOOL_unsigned_char_Array_0[1][0] || stepLocal_0 [L50] EXPR unsigned_char_Array_0[9] [L50] signed_char_Array_0[0] = unsigned_char_Array_0[9] [L52] EXPR float_Array_0[1] [L52] float_Array_0[0] = float_Array_0[1] [L53] EXPR unsigned_char_Array_0[10] [L53] unsigned_short_int_Array_0[0] = unsigned_char_Array_0[10] [L54] double_Array_0[0] = 0.010000000000000009 [L55] EXPR float_Array_0[0] [L55] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L55] COND FALSE !(float_Array_0[0] < float_Array_0[0]) [L58] EXPR float_Array_0[0] [L58] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L58] COND TRUE float_Array_0[0] >= float_Array_0[0] [L59] EXPR BOOL_unsigned_char_Array_0[1][0] [L59] BOOL_unsigned_char_Array_0[1][1] = BOOL_unsigned_char_Array_0[1][0] [L64] EXPR double_Array_0[0] [L64] EXPR float_Array_0[0] [L64] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L64] EXPR ((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0]) [L64] EXPR float_Array_0[0] [L64] EXPR ((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, stepLocal_0=1, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L64] COND TRUE double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0]))) [L65] EXPR unsigned_char_Array_0[2] [L65] EXPR unsigned_char_Array_0[3] [L65] unsigned_char_Array_0[5] = (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]) [L120] RET step() [L121] CALL, EXPR property() [L111] EXPR float_Array_0[0] [L111] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR (float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0]))) [L111] EXPR float_Array_0[0] [L111] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR (float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])) [L111] EXPR BOOL_unsigned_char_Array_0[1][1] [L111] EXPR BOOL_unsigned_char_Array_0[0][0] [L111] EXPR (float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR (float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR ((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR ((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR (((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR (((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR ((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR ((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR (((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR (((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR ((((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[10])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR ((((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[10])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR (((((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[10]))) && (double_Array_0[0] == ((double) 0.010000000000000009)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR (((((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[10]))) && (double_Array_0[0] == ((double) 0.010000000000000009)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111-L112] return (((((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[10]))) && (double_Array_0[0] == ((double) 0.010000000000000009)) ; [L121] RET, EXPR property() [L121] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.8s, OverallIterations: 7, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 637 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 636 mSDsluCounter, 3549 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2655 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1013 IncrementalHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 894 mSDtfsCounter, 1013 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 761 GetRequests, 704 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=182occurred in iteration=6, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 99 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1482 NumberOfCodeBlocks, 1482 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1472 ConstructedInterpolants, 0 QuantifiedInterpolants, 5525 SizeOfPredicates, 6 NumberOfNonLiveVariables, 632 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 9339/9600 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 04:49:25,618 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-61.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9d4c4ba5fceaa6bfb2098951964c33b59994f146ab7abe517b65f1a8d594c6fc --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:49:27,579 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:49:27,655 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 04:49:27,661 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:49:27,662 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:49:27,689 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:49:27,690 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:49:27,691 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:49:27,691 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:49:27,692 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:49:27,692 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:49:27,693 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:49:27,694 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:49:27,694 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:49:27,695 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:49:27,696 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:49:27,696 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:49:27,697 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:49:27,697 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:49:27,698 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:49:27,698 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:49:27,699 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:49:27,699 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:49:27,700 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:49:27,700 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 04:49:27,701 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 04:49:27,701 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:49:27,702 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:49:27,702 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:49:27,703 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:49:27,703 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:49:27,703 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:49:27,704 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:49:27,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:49:27,704 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:49:27,704 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:49:27,705 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:49:27,705 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 04:49:27,705 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 04:49:27,705 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:49:27,705 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:49:27,706 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:49:27,706 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:49:27,706 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:49:27,706 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 04:49:27,706 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya 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 -> Automizer 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 -> 9d4c4ba5fceaa6bfb2098951964c33b59994f146ab7abe517b65f1a8d594c6fc [2023-11-29 04:49:27,984 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:49:28,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:49:28,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:49:28,009 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:49:28,009 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:49:28,010 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-61.i [2023-11-29 04:49:30,807 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:49:30,996 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:49:30,997 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-61.i [2023-11-29 04:49:31,008 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/data/eac931b42/ecf9d8fa9dda47bb86128719792be548/FLAGe8eec7a1b [2023-11-29 04:49:31,024 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/data/eac931b42/ecf9d8fa9dda47bb86128719792be548 [2023-11-29 04:49:31,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:49:31,029 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:49:31,030 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:49:31,030 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:49:31,036 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:49:31,037 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:49:31" (1/1) ... [2023-11-29 04:49:31,038 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d4262c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:49:31, skipping insertion in model container [2023-11-29 04:49:31,038 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:49:31" (1/1) ... [2023-11-29 04:49:31,071 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:49:31,221 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-61.i[916,929] [2023-11-29 04:49:31,311 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:49:31,328 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:49:31,339 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-61.i[916,929] [2023-11-29 04:49:31,385 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:49:31,409 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:49:31,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:49:31 WrapperNode [2023-11-29 04:49:31,410 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:49:31,411 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:49:31,411 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:49:31,411 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:49:31,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:49:31" (1/1) ... [2023-11-29 04:49:31,438 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:49:31" (1/1) ... [2023-11-29 04:49:31,479 INFO L138 Inliner]: procedures = 36, calls = 189, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 454 [2023-11-29 04:49:31,480 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:49:31,480 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:49:31,481 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:49:31,481 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:49:31,493 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:49:31" (1/1) ... [2023-11-29 04:49:31,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:49:31" (1/1) ... [2023-11-29 04:49:31,504 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:49:31" (1/1) ... [2023-11-29 04:49:31,529 INFO L175 MemorySlicer]: Split 147 memory accesses to 7 slices as follows [2, 35, 5, 27, 3, 72, 3]. 49 percent of accesses are in the largest equivalence class. The 22 initializations are split as follows [2, 4, 1, 2, 1, 11, 1]. The 23 writes are split as follows [0, 6, 1, 2, 1, 12, 1]. [2023-11-29 04:49:31,529 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:49:31" (1/1) ... [2023-11-29 04:49:31,529 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:49:31" (1/1) ... [2023-11-29 04:49:31,561 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:49:31" (1/1) ... [2023-11-29 04:49:31,567 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:49:31" (1/1) ... [2023-11-29 04:49:31,573 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:49:31" (1/1) ... [2023-11-29 04:49:31,578 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:49:31" (1/1) ... [2023-11-29 04:49:31,586 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:49:31,587 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:49:31,588 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:49:31,588 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:49:31,589 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:49:31" (1/1) ... [2023-11-29 04:49:31,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:49:31,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:49:31,629 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:49:31,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:49:31,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:49:31,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2023-11-29 04:49:31,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2023-11-29 04:49:31,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2023-11-29 04:49:31,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2023-11-29 04:49:31,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2023-11-29 04:49:31,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2023-11-29 04:49:31,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2023-11-29 04:49:31,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2023-11-29 04:49:31,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2023-11-29 04:49:31,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2023-11-29 04:49:31,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2023-11-29 04:49:31,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2023-11-29 04:49:31,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2023-11-29 04:49:31,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2023-11-29 04:49:31,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 04:49:31,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 04:49:31,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 04:49:31,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-29 04:49:31,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-11-29 04:49:31,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2023-11-29 04:49:31,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2023-11-29 04:49:31,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2023-11-29 04:49:31,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2023-11-29 04:49:31,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2023-11-29 04:49:31,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2023-11-29 04:49:31,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2023-11-29 04:49:31,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2023-11-29 04:49:31,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2023-11-29 04:49:31,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 04:49:31,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 04:49:31,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 04:49:31,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 04:49:31,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-11-29 04:49:31,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2023-11-29 04:49:31,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2023-11-29 04:49:31,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2023-11-29 04:49:31,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2023-11-29 04:49:31,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2023-11-29 04:49:31,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2023-11-29 04:49:31,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2023-11-29 04:49:31,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2023-11-29 04:49:31,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2023-11-29 04:49:31,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2023-11-29 04:49:31,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2023-11-29 04:49:31,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2023-11-29 04:49:31,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2023-11-29 04:49:31,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2023-11-29 04:49:31,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2023-11-29 04:49:31,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2023-11-29 04:49:31,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2023-11-29 04:49:31,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2023-11-29 04:49:31,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2023-11-29 04:49:31,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2023-11-29 04:49:31,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2023-11-29 04:49:31,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2023-11-29 04:49:31,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2023-11-29 04:49:31,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2023-11-29 04:49:31,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2023-11-29 04:49:31,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2023-11-29 04:49:31,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2023-11-29 04:49:31,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2023-11-29 04:49:31,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2023-11-29 04:49:31,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2023-11-29 04:49:31,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2023-11-29 04:49:31,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2023-11-29 04:49:31,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2023-11-29 04:49:31,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2023-11-29 04:49:31,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2023-11-29 04:49:31,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2023-11-29 04:49:31,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2023-11-29 04:49:31,684 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 04:49:31,684 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 04:49:31,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:49:31,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:49:31,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-11-29 04:49:31,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-11-29 04:49:31,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-11-29 04:49:31,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2023-11-29 04:49:31,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2023-11-29 04:49:31,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2023-11-29 04:49:31,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2023-11-29 04:49:31,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2023-11-29 04:49:31,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2023-11-29 04:49:31,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2023-11-29 04:49:31,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2023-11-29 04:49:31,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2023-11-29 04:49:31,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2023-11-29 04:49:31,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2023-11-29 04:49:31,863 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:49:31,865 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:49:32,845 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:49:32,891 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:49:32,891 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 04:49:32,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:49:32 BoogieIcfgContainer [2023-11-29 04:49:32,892 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:49:32,894 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:49:32,894 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:49:32,897 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:49:32,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:49:31" (1/3) ... [2023-11-29 04:49:32,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e43cd8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:49:32, skipping insertion in model container [2023-11-29 04:49:32,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:49:31" (2/3) ... [2023-11-29 04:49:32,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e43cd8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:49:32, skipping insertion in model container [2023-11-29 04:49:32,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:49:32" (3/3) ... [2023-11-29 04:49:32,901 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-61.i [2023-11-29 04:49:32,920 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:49:32,920 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 04:49:32,967 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:49:32,973 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@13b5c017, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:49:32,974 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 04:49:32,978 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 85 states have (on average 1.388235294117647) internal successors, (118), 86 states have internal predecessors, (118), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 04:49:32,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-11-29 04:49:32,996 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:49:32,997 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:49:32,998 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:49:33,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:49:33,003 INFO L85 PathProgramCache]: Analyzing trace with hash 2119270199, now seen corresponding path program 1 times [2023-11-29 04:49:33,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:49:33,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1250299224] [2023-11-29 04:49:33,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:49:33,021 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:49:33,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:49:33,023 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:49:33,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 04:49:33,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:33,433 INFO L262 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 04:49:33,446 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:49:33,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 560 proven. 0 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2023-11-29 04:49:33,496 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:49:33,497 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:49:33,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1250299224] [2023-11-29 04:49:33,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1250299224] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:49:33,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:49:33,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:49:33,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817268304] [2023-11-29 04:49:33,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:49:33,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 04:49:33,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:49:33,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 04:49:33,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:49:33,541 INFO L87 Difference]: Start difference. First operand has 113 states, 85 states have (on average 1.388235294117647) internal successors, (118), 86 states have internal predecessors, (118), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-29 04:49:33,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:49:33,594 INFO L93 Difference]: Finished difference Result 223 states and 359 transitions. [2023-11-29 04:49:33,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 04:49:33,596 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 185 [2023-11-29 04:49:33,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:49:33,605 INFO L225 Difference]: With dead ends: 223 [2023-11-29 04:49:33,606 INFO L226 Difference]: Without dead ends: 111 [2023-11-29 04:49:33,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:49:33,614 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:49:33,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:49:33,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-29 04:49:33,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-11-29 04:49:33,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 84 states have internal predecessors, (113), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 04:49:33,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2023-11-29 04:49:33,668 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 185 [2023-11-29 04:49:33,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:49:33,669 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2023-11-29 04:49:33,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-29 04:49:33,670 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2023-11-29 04:49:33,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-11-29 04:49:33,675 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:49:33,675 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:49:33,683 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 04:49:33,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:49:33,876 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:49:33,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:49:33,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1896348451, now seen corresponding path program 1 times [2023-11-29 04:49:33,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:49:33,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2002886902] [2023-11-29 04:49:33,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:49:33,879 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:49:33,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:49:33,880 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:49:33,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 04:49:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:34,254 INFO L262 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:49:34,264 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:49:34,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-29 04:49:34,347 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:49:34,347 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:49:34,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2002886902] [2023-11-29 04:49:34,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2002886902] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:49:34,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:49:34,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:49:34,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195424877] [2023-11-29 04:49:34,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:49:34,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:49:34,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:49:34,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:49:34,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:49:34,352 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:49:34,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:49:34,656 INFO L93 Difference]: Finished difference Result 269 states and 396 transitions. [2023-11-29 04:49:34,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:49:34,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 185 [2023-11-29 04:49:34,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:49:34,661 INFO L225 Difference]: With dead ends: 269 [2023-11-29 04:49:34,661 INFO L226 Difference]: Without dead ends: 159 [2023-11-29 04:49:34,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:49:34,664 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 66 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:49:34,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 551 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:49:34,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-11-29 04:49:34,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 113. [2023-11-29 04:49:34,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 04:49:34,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2023-11-29 04:49:34,685 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 165 transitions. Word has length 185 [2023-11-29 04:49:34,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:49:34,687 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 165 transitions. [2023-11-29 04:49:34,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:49:34,688 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 165 transitions. [2023-11-29 04:49:34,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-11-29 04:49:34,692 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:49:34,692 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:49:34,699 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 04:49:34,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:49:34,895 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:49:34,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:49:34,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1889145755, now seen corresponding path program 1 times [2023-11-29 04:49:34,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:49:34,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2099160415] [2023-11-29 04:49:34,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:49:34,898 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:49:34,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:49:34,899 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:49:34,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 04:49:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:35,253 INFO L262 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:49:35,260 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:49:35,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-29 04:49:35,309 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:49:35,309 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:49:35,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2099160415] [2023-11-29 04:49:35,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2099160415] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:49:35,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:49:35,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:49:35,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585998] [2023-11-29 04:49:35,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:49:35,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:49:35,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:49:35,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:49:35,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:49:35,313 INFO L87 Difference]: Start difference. First operand 113 states and 165 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:49:35,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:49:35,461 INFO L93 Difference]: Finished difference Result 257 states and 375 transitions. [2023-11-29 04:49:35,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:49:35,461 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 185 [2023-11-29 04:49:35,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:49:35,465 INFO L225 Difference]: With dead ends: 257 [2023-11-29 04:49:35,465 INFO L226 Difference]: Without dead ends: 145 [2023-11-29 04:49:35,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:49:35,468 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 83 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:49:35,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 756 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:49:35,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-11-29 04:49:35,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 119. [2023-11-29 04:49:35,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 92 states have (on average 1.315217391304348) internal successors, (121), 92 states have internal predecessors, (121), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 04:49:35,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 171 transitions. [2023-11-29 04:49:35,483 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 171 transitions. Word has length 185 [2023-11-29 04:49:35,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:49:35,484 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 171 transitions. [2023-11-29 04:49:35,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:49:35,485 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 171 transitions. [2023-11-29 04:49:35,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-11-29 04:49:35,488 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:49:35,488 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:49:35,494 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 04:49:35,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:49:35,689 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:49:35,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:49:35,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1079799129, now seen corresponding path program 1 times [2023-11-29 04:49:35,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:49:35,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [675943944] [2023-11-29 04:49:35,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:49:35,691 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:49:35,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:49:35,692 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:49:35,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 04:49:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:36,012 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 04:49:36,018 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:49:36,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-29 04:49:36,071 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:49:36,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:49:36,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [675943944] [2023-11-29 04:49:36,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [675943944] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:49:36,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:49:36,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:49:36,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117787186] [2023-11-29 04:49:36,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:49:36,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:49:36,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:49:36,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:49:36,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:49:36,075 INFO L87 Difference]: Start difference. First operand 119 states and 171 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:49:36,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:49:36,371 INFO L93 Difference]: Finished difference Result 267 states and 380 transitions. [2023-11-29 04:49:36,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 04:49:36,372 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 185 [2023-11-29 04:49:36,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:49:36,375 INFO L225 Difference]: With dead ends: 267 [2023-11-29 04:49:36,375 INFO L226 Difference]: Without dead ends: 149 [2023-11-29 04:49:36,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2023-11-29 04:49:36,378 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 72 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:49:36,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1033 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:49:36,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-11-29 04:49:36,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 123. [2023-11-29 04:49:36,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 96 states have (on average 1.3020833333333333) internal successors, (125), 96 states have internal predecessors, (125), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 04:49:36,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 175 transitions. [2023-11-29 04:49:36,393 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 175 transitions. Word has length 185 [2023-11-29 04:49:36,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:49:36,395 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 175 transitions. [2023-11-29 04:49:36,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:49:36,395 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 175 transitions. [2023-11-29 04:49:36,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-11-29 04:49:36,397 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:49:36,398 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:49:36,404 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 04:49:36,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:49:36,603 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:49:36,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:49:36,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1079858711, now seen corresponding path program 1 times [2023-11-29 04:49:36,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:49:36,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1790749306] [2023-11-29 04:49:36,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:49:36,605 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:49:36,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:49:36,606 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:49:36,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 04:49:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:36,889 INFO L262 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 04:49:36,895 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:49:39,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 61 [2023-11-29 04:49:39,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:49:39,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2023-11-29 04:49:39,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:49:39,511 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 64 treesize of output 24 [2023-11-29 04:49:39,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:49:39,676 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 127 treesize of output 49 [2023-11-29 04:49:39,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2023-11-29 04:49:39,814 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:49:39,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:49:39,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1790749306] [2023-11-29 04:49:39,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1790749306] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:49:39,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:49:39,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 04:49:39,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248144500] [2023-11-29 04:49:39,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:49:39,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:49:39,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:49:39,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:49:39,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:49:39,817 INFO L87 Difference]: Start difference. First operand 123 states and 175 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 9 states have internal predecessors, (66), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-29 04:49:42,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:49:42,858 INFO L93 Difference]: Finished difference Result 372 states and 527 transitions. [2023-11-29 04:49:42,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:49:42,860 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 9 states have internal predecessors, (66), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 185 [2023-11-29 04:49:42,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:49:42,863 INFO L225 Difference]: With dead ends: 372 [2023-11-29 04:49:42,863 INFO L226 Difference]: Without dead ends: 250 [2023-11-29 04:49:42,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-11-29 04:49:42,864 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 256 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:49:42,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 831 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-11-29 04:49:42,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2023-11-29 04:49:42,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 243. [2023-11-29 04:49:42,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 189 states have (on average 1.291005291005291) internal successors, (244), 190 states have internal predecessors, (244), 50 states have call successors, (50), 3 states have call predecessors, (50), 3 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-29 04:49:42,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 344 transitions. [2023-11-29 04:49:42,896 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 344 transitions. Word has length 185 [2023-11-29 04:49:42,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:49:42,897 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 344 transitions. [2023-11-29 04:49:42,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 9 states have internal predecessors, (66), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-29 04:49:42,897 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 344 transitions. [2023-11-29 04:49:42,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-11-29 04:49:42,899 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:49:42,900 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:49:42,905 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 04:49:43,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:49:43,103 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:49:43,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:49:43,104 INFO L85 PathProgramCache]: Analyzing trace with hash 262210261, now seen corresponding path program 1 times [2023-11-29 04:49:43,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:49:43,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [847635344] [2023-11-29 04:49:43,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:49:43,104 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:49:43,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:49:43,123 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:49:43,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 04:49:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:43,373 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:49:43,378 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:49:43,390 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 43 treesize of output 19 [2023-11-29 04:49:43,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-29 04:49:43,412 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:49:43,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:49:43,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [847635344] [2023-11-29 04:49:43,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [847635344] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:49:43,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:49:43,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:49:43,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107447480] [2023-11-29 04:49:43,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:49:43,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:49:43,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:49:43,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:49:43,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:49:43,415 INFO L87 Difference]: Start difference. First operand 243 states and 344 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:49:43,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:49:43,741 INFO L93 Difference]: Finished difference Result 485 states and 687 transitions. [2023-11-29 04:49:43,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:49:43,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 185 [2023-11-29 04:49:43,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:49:43,751 INFO L225 Difference]: With dead ends: 485 [2023-11-29 04:49:43,751 INFO L226 Difference]: Without dead ends: 243 [2023-11-29 04:49:43,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:49:43,753 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:49:43,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 310 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 04:49:43,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-11-29 04:49:43,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2023-11-29 04:49:43,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 189 states have (on average 1.2804232804232805) internal successors, (242), 190 states have internal predecessors, (242), 50 states have call successors, (50), 3 states have call predecessors, (50), 3 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-29 04:49:43,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 342 transitions. [2023-11-29 04:49:43,776 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 342 transitions. Word has length 185 [2023-11-29 04:49:43,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:49:43,777 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 342 transitions. [2023-11-29 04:49:43,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:49:43,778 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 342 transitions. [2023-11-29 04:49:43,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-11-29 04:49:43,780 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:49:43,781 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:49:43,788 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-29 04:49:43,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:49:43,981 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:49:43,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:49:43,982 INFO L85 PathProgramCache]: Analyzing trace with hash 684912087, now seen corresponding path program 1 times [2023-11-29 04:49:43,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:49:43,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [65619959] [2023-11-29 04:49:43,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:49:43,982 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:49:43,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:49:43,983 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:49:43,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 04:49:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:44,308 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 04:49:44,314 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:49:44,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:49:44,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2023-11-29 04:49:44,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2023-11-29 04:49:45,124 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 [2023-11-29 04:49:45,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 50 proven. 138 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 04:49:45,161 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:49:45,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2023-11-29 04:49:45,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:49:45,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [65619959] [2023-11-29 04:49:45,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [65619959] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:49:45,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:49:45,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2023-11-29 04:49:45,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136264910] [2023-11-29 04:49:45,669 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:49:45,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 04:49:45,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:49:45,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 04:49:45,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2023-11-29 04:49:45,671 INFO L87 Difference]: Start difference. First operand 243 states and 342 transitions. Second operand has 16 states, 12 states have (on average 8.75) internal successors, (105), 16 states have internal predecessors, (105), 6 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (50), 2 states have call predecessors, (50), 6 states have call successors, (50) [2023-11-29 04:49:46,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:49:46,481 INFO L93 Difference]: Finished difference Result 504 states and 698 transitions. [2023-11-29 04:49:46,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 04:49:46,482 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 8.75) internal successors, (105), 16 states have internal predecessors, (105), 6 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (50), 2 states have call predecessors, (50), 6 states have call successors, (50) Word has length 185 [2023-11-29 04:49:46,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:49:46,485 INFO L225 Difference]: With dead ends: 504 [2023-11-29 04:49:46,485 INFO L226 Difference]: Without dead ends: 262 [2023-11-29 04:49:46,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 353 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2023-11-29 04:49:46,487 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 234 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 04:49:46,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 645 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 04:49:46,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2023-11-29 04:49:46,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 255. [2023-11-29 04:49:46,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 197 states have (on average 1.2588832487309645) internal successors, (248), 198 states have internal predecessors, (248), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-29 04:49:46,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 348 transitions. [2023-11-29 04:49:46,513 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 348 transitions. Word has length 185 [2023-11-29 04:49:46,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:49:46,514 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 348 transitions. [2023-11-29 04:49:46,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 8.75) internal successors, (105), 16 states have internal predecessors, (105), 6 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (50), 2 states have call predecessors, (50), 6 states have call successors, (50) [2023-11-29 04:49:46,514 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 348 transitions. [2023-11-29 04:49:46,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2023-11-29 04:49:46,516 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:49:46,516 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:49:46,524 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 04:49:46,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:49:46,717 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:49:46,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:49:46,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1507419554, now seen corresponding path program 1 times [2023-11-29 04:49:46,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:49:46,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1402772992] [2023-11-29 04:49:46,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:49:46,718 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:49:46,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:49:46,719 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:49:46,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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)] Waiting until timeout for monitored process [2023-11-29 04:49:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:47,095 INFO L262 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 04:49:47,100 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:49:47,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 04:49:47,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2023-11-29 04:49:48,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:49:48,380 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 1 case distinctions, treesize of input 43 treesize of output 39 [2023-11-29 04:49:48,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:49:48,526 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 87 treesize of output 39 [2023-11-29 04:49:48,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 282 proven. 63 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2023-11-29 04:49:48,597 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:49:48,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-29 04:49:48,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:49:48,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1402772992] [2023-11-29 04:49:48,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1402772992] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 04:49:48,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:49:48,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 14 [2023-11-29 04:49:48,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225308220] [2023-11-29 04:49:48,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:49:48,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:49:48,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:49:48,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:49:48,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-11-29 04:49:48,788 INFO L87 Difference]: Start difference. First operand 255 states and 348 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:49:49,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:49:49,202 INFO L93 Difference]: Finished difference Result 697 states and 943 transitions. [2023-11-29 04:49:49,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:49:49,203 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 187 [2023-11-29 04:49:49,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:49:49,207 INFO L225 Difference]: With dead ends: 697 [2023-11-29 04:49:49,207 INFO L226 Difference]: Without dead ends: 443 [2023-11-29 04:49:49,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2023-11-29 04:49:49,209 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 171 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:49:49,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 723 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:49:49,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2023-11-29 04:49:49,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 273. [2023-11-29 04:49:49,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 215 states have (on average 1.2604651162790699) internal successors, (271), 216 states have internal predecessors, (271), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-29 04:49:49,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 371 transitions. [2023-11-29 04:49:49,235 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 371 transitions. Word has length 187 [2023-11-29 04:49:49,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:49:49,236 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 371 transitions. [2023-11-29 04:49:49,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:49:49,236 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 371 transitions. [2023-11-29 04:49:49,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2023-11-29 04:49:49,238 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:49:49,238 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:49:49,245 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 04:49:49,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:49:49,439 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:49:49,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:49:49,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1199199840, now seen corresponding path program 1 times [2023-11-29 04:49:49,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:49:49,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477293083] [2023-11-29 04:49:49,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:49:49,440 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:49:49,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:49:49,441 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:49:49,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 04:49:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:49,688 INFO L262 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 04:49:49,693 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:49:50,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 61 [2023-11-29 04:49:51,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:49:51,226 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 148 treesize of output 58 [2023-11-29 04:49:51,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 456 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2023-11-29 04:49:51,305 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:49:51,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-29 04:49:51,552 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:49:51,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477293083] [2023-11-29 04:49:51,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1477293083] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 04:49:51,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:49:51,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2023-11-29 04:49:51,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314953676] [2023-11-29 04:49:51,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:49:51,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:49:51,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:49:51,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:49:51,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-11-29 04:49:51,554 INFO L87 Difference]: Start difference. First operand 273 states and 371 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:49:52,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:49:52,093 INFO L93 Difference]: Finished difference Result 911 states and 1239 transitions. [2023-11-29 04:49:52,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:49:52,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 187 [2023-11-29 04:49:52,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:49:52,098 INFO L225 Difference]: With dead ends: 911 [2023-11-29 04:49:52,098 INFO L226 Difference]: Without dead ends: 639 [2023-11-29 04:49:52,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 360 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-11-29 04:49:52,100 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 360 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:49:52,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 443 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 04:49:52,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2023-11-29 04:49:52,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 273. [2023-11-29 04:49:52,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 215 states have (on average 1.2511627906976743) internal successors, (269), 216 states have internal predecessors, (269), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-29 04:49:52,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 369 transitions. [2023-11-29 04:49:52,137 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 369 transitions. Word has length 187 [2023-11-29 04:49:52,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:49:52,137 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 369 transitions. [2023-11-29 04:49:52,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:49:52,137 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 369 transitions. [2023-11-29 04:49:52,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2023-11-29 04:49:52,139 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:49:52,139 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:49:52,146 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-29 04:49:52,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:49:52,340 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:49:52,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:49:52,341 INFO L85 PathProgramCache]: Analyzing trace with hash -118748057, now seen corresponding path program 1 times [2023-11-29 04:49:52,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:49:52,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [413650290] [2023-11-29 04:49:52,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:49:52,341 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:49:52,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:49:52,342 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:49:52,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 04:49:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:52,656 INFO L262 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:49:52,661 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:49:52,669 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 43 treesize of output 19 [2023-11-29 04:49:52,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-29 04:49:52,689 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:49:52,689 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:49:52,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [413650290] [2023-11-29 04:49:52,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [413650290] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:49:52,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:49:52,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:49:52,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823317025] [2023-11-29 04:49:52,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:49:52,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:49:52,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:49:52,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:49:52,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:49:52,691 INFO L87 Difference]: Start difference. First operand 273 states and 369 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:49:52,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:49:52,750 INFO L93 Difference]: Finished difference Result 541 states and 731 transitions. [2023-11-29 04:49:52,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:49:52,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 187 [2023-11-29 04:49:52,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:49:52,753 INFO L225 Difference]: With dead ends: 541 [2023-11-29 04:49:52,753 INFO L226 Difference]: Without dead ends: 269 [2023-11-29 04:49:52,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:49:52,755 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 41 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:49:52,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 263 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:49:52,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2023-11-29 04:49:52,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2023-11-29 04:49:52,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 211 states have (on average 1.2274881516587677) internal successors, (259), 212 states have internal predecessors, (259), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-29 04:49:52,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 359 transitions. [2023-11-29 04:49:52,789 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 359 transitions. Word has length 187 [2023-11-29 04:49:52,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:49:52,789 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 359 transitions. [2023-11-29 04:49:52,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:49:52,789 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 359 transitions. [2023-11-29 04:49:52,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2023-11-29 04:49:52,791 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:49:52,791 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:49:52,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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)] Forceful destruction successful, exit code 0 [2023-11-29 04:49:52,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:49:52,992 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:49:52,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:49:52,993 INFO L85 PathProgramCache]: Analyzing trace with hash 982109408, now seen corresponding path program 1 times [2023-11-29 04:49:52,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:49:52,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [362318430] [2023-11-29 04:49:52,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:49:52,994 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:49:52,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:49:52,995 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:49:52,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 04:49:53,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:53,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 04:49:53,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:49:54,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 61 [2023-11-29 04:49:54,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 456 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2023-11-29 04:49:54,512 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:49:55,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-29 04:49:55,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:49:55,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [362318430] [2023-11-29 04:49:55,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [362318430] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 04:49:55,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:49:55,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2023-11-29 04:49:55,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202599078] [2023-11-29 04:49:55,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:49:55,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:49:55,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:49:55,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:49:55,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:49:55,088 INFO L87 Difference]: Start difference. First operand 269 states and 359 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:49:58,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:49:58,221 INFO L93 Difference]: Finished difference Result 779 states and 1042 transitions. [2023-11-29 04:49:58,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:49:58,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 187 [2023-11-29 04:49:58,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:49:58,226 INFO L225 Difference]: With dead ends: 779 [2023-11-29 04:49:58,226 INFO L226 Difference]: Without dead ends: 511 [2023-11-29 04:49:58,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-11-29 04:49:58,228 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 273 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-29 04:49:58,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 643 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-11-29 04:49:58,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2023-11-29 04:49:58,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 281. [2023-11-29 04:49:58,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 223 states have (on average 1.2197309417040358) internal successors, (272), 224 states have internal predecessors, (272), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-29 04:49:58,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 372 transitions. [2023-11-29 04:49:58,253 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 372 transitions. Word has length 187 [2023-11-29 04:49:58,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:49:58,253 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 372 transitions. [2023-11-29 04:49:58,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:49:58,253 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 372 transitions. [2023-11-29 04:49:58,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2023-11-29 04:49:58,254 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:49:58,255 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:49:58,260 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-29 04:49:58,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:49:58,455 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:49:58,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:49:58,456 INFO L85 PathProgramCache]: Analyzing trace with hash -606238494, now seen corresponding path program 1 times [2023-11-29 04:49:58,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:49:58,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [177365911] [2023-11-29 04:49:58,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:49:58,456 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:49:58,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:49:58,457 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:49:58,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 04:49:58,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:58,693 INFO L262 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 04:49:58,698 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:49:59,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 61 [2023-11-29 04:49:59,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:49:59,788 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 148 treesize of output 58 [2023-11-29 04:49:59,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 456 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2023-11-29 04:49:59,868 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:50:00,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:50:00,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [177365911] [2023-11-29 04:50:00,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [177365911] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:50:00,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [567644736] [2023-11-29 04:50:00,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:50:00,067 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:50:00,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:50:00,068 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:50:00,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2023-11-29 04:50:01,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:50:01,116 INFO L262 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 04:50:01,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:50:02,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 61 [2023-11-29 04:50:02,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:50:02,182 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 148 treesize of output 58 [2023-11-29 04:50:02,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 456 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2023-11-29 04:50:02,290 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:50:02,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [567644736] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:50:02,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:50:02,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2023-11-29 04:50:02,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003939573] [2023-11-29 04:50:02,530 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:50:02,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:50:02,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:50:02,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:50:02,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-11-29 04:50:02,532 INFO L87 Difference]: Start difference. First operand 281 states and 372 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 9 states have internal predecessors, (76), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-29 04:50:04,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:50:04,938 INFO L93 Difference]: Finished difference Result 562 states and 745 transitions. [2023-11-29 04:50:04,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:50:04,940 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 9 states have internal predecessors, (76), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 187 [2023-11-29 04:50:04,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:50:04,941 INFO L225 Difference]: With dead ends: 562 [2023-11-29 04:50:04,941 INFO L226 Difference]: Without dead ends: 282 [2023-11-29 04:50:04,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 427 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2023-11-29 04:50:04,943 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 400 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:50:04,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 919 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-29 04:50:04,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2023-11-29 04:50:04,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 275. [2023-11-29 04:50:04,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 217 states have (on average 1.2165898617511521) internal successors, (264), 218 states have internal predecessors, (264), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-29 04:50:04,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 364 transitions. [2023-11-29 04:50:04,972 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 364 transitions. Word has length 187 [2023-11-29 04:50:04,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:50:04,972 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 364 transitions. [2023-11-29 04:50:04,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 9 states have internal predecessors, (76), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-29 04:50:04,973 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 364 transitions. [2023-11-29 04:50:04,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2023-11-29 04:50:04,975 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:50:04,975 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:50:04,982 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2023-11-29 04:50:05,181 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 04:50:05,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:50:05,377 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:50:05,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:50:05,377 INFO L85 PathProgramCache]: Analyzing trace with hash 597272358, now seen corresponding path program 1 times [2023-11-29 04:50:05,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:50:05,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24063536] [2023-11-29 04:50:05,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:50:05,377 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:50:05,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:50:05,378 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:50:05,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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 (15)] Waiting until timeout for monitored process [2023-11-29 04:50:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:50:05,589 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:50:05,591 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:50:05,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2023-11-29 04:50:05,603 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:50:05,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:50:05,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24063536] [2023-11-29 04:50:05,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [24063536] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:50:05,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:50:05,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:50:05,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076576823] [2023-11-29 04:50:05,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:50:05,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:50:05,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:50:05,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:50:05,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:50:05,605 INFO L87 Difference]: Start difference. First operand 275 states and 364 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-29 04:50:05,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:50:05,658 INFO L93 Difference]: Finished difference Result 553 states and 733 transitions. [2023-11-29 04:50:05,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:50:05,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 187 [2023-11-29 04:50:05,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:50:05,660 INFO L225 Difference]: With dead ends: 553 [2023-11-29 04:50:05,660 INFO L226 Difference]: Without dead ends: 279 [2023-11-29 04:50:05,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:50:05,661 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 7 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:50:05,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 456 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:50:05,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2023-11-29 04:50:05,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 275. [2023-11-29 04:50:05,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 217 states have (on average 1.2119815668202765) internal successors, (263), 218 states have internal predecessors, (263), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-29 04:50:05,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 363 transitions. [2023-11-29 04:50:05,680 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 363 transitions. Word has length 187 [2023-11-29 04:50:05,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:50:05,680 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 363 transitions. [2023-11-29 04:50:05,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-29 04:50:05,680 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 363 transitions. [2023-11-29 04:50:05,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2023-11-29 04:50:05,682 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:50:05,682 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:50:05,687 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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 (15)] Ended with exit code 0 [2023-11-29 04:50:05,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:50:05,882 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:50:05,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:50:05,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1101229323, now seen corresponding path program 1 times [2023-11-29 04:50:05,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:50:05,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [850662837] [2023-11-29 04:50:05,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:50:05,883 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:50:05,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:50:05,884 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:50:05,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 04:50:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:50:06,117 INFO L262 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 04:50:06,121 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:50:06,584 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 39 treesize of output 21 [2023-11-29 04:50:06,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 414 proven. 57 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2023-11-29 04:50:06,599 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:50:06,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 15 proven. 57 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2023-11-29 04:50:06,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:50:06,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [850662837] [2023-11-29 04:50:06,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [850662837] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:50:06,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:50:06,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2023-11-29 04:50:06,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077028246] [2023-11-29 04:50:06,918 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:50:06,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:50:06,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:50:06,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:50:06,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:50:06,920 INFO L87 Difference]: Start difference. First operand 275 states and 363 transitions. Second operand has 10 states, 8 states have (on average 9.5) internal successors, (76), 10 states have internal predecessors, (76), 4 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (45), 2 states have call predecessors, (45), 4 states have call successors, (45) [2023-11-29 04:50:07,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:50:07,480 INFO L93 Difference]: Finished difference Result 567 states and 741 transitions. [2023-11-29 04:50:07,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:50:07,481 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 9.5) internal successors, (76), 10 states have internal predecessors, (76), 4 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (45), 2 states have call predecessors, (45), 4 states have call successors, (45) Word has length 188 [2023-11-29 04:50:07,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:50:07,483 INFO L225 Difference]: With dead ends: 567 [2023-11-29 04:50:07,483 INFO L226 Difference]: Without dead ends: 293 [2023-11-29 04:50:07,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 365 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2023-11-29 04:50:07,485 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 267 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:50:07,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 459 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 04:50:07,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2023-11-29 04:50:07,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 275. [2023-11-29 04:50:07,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 218 states have (on average 1.201834862385321) internal successors, (262), 219 states have internal predecessors, (262), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-29 04:50:07,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 358 transitions. [2023-11-29 04:50:07,506 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 358 transitions. Word has length 188 [2023-11-29 04:50:07,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:50:07,507 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 358 transitions. [2023-11-29 04:50:07,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 9.5) internal successors, (76), 10 states have internal predecessors, (76), 4 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (45), 2 states have call predecessors, (45), 4 states have call successors, (45) [2023-11-29 04:50:07,507 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 358 transitions. [2023-11-29 04:50:07,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2023-11-29 04:50:07,508 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:50:07,508 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:50:07,513 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 04:50:07,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:50:07,709 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:50:07,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:50:07,709 INFO L85 PathProgramCache]: Analyzing trace with hash 967215817, now seen corresponding path program 1 times [2023-11-29 04:50:07,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:50:07,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [882202813] [2023-11-29 04:50:07,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:50:07,710 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:50:07,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:50:07,711 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:50:07,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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 (17)] Waiting until timeout for monitored process [2023-11-29 04:50:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:50:07,950 INFO L262 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:50:07,954 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:50:07,962 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 43 treesize of output 19 [2023-11-29 04:50:07,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-29 04:50:07,982 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:50:07,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:50:07,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [882202813] [2023-11-29 04:50:07,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [882202813] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:50:07,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:50:07,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:50:07,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284328178] [2023-11-29 04:50:07,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:50:07,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:50:07,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:50:07,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:50:07,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:50:07,983 INFO L87 Difference]: Start difference. First operand 275 states and 358 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:50:08,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:50:08,049 INFO L93 Difference]: Finished difference Result 528 states and 691 transitions. [2023-11-29 04:50:08,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:50:08,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 188 [2023-11-29 04:50:08,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:50:08,051 INFO L225 Difference]: With dead ends: 528 [2023-11-29 04:50:08,052 INFO L226 Difference]: Without dead ends: 254 [2023-11-29 04:50:08,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:50:08,053 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:50:08,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 294 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:50:08,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-11-29 04:50:08,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2023-11-29 04:50:08,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 197 states have (on average 1.1979695431472082) internal successors, (236), 198 states have internal predecessors, (236), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-29 04:50:08,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 332 transitions. [2023-11-29 04:50:08,072 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 332 transitions. Word has length 188 [2023-11-29 04:50:08,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:50:08,073 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 332 transitions. [2023-11-29 04:50:08,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:50:08,073 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 332 transitions. [2023-11-29 04:50:08,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2023-11-29 04:50:08,074 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:50:08,074 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:50:08,080 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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 (17)] Ended with exit code 0 [2023-11-29 04:50:08,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:50:08,275 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:50:08,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:50:08,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1054288682, now seen corresponding path program 1 times [2023-11-29 04:50:08,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:50:08,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [867876641] [2023-11-29 04:50:08,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:50:08,276 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:50:08,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:50:08,276 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:50:08,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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 (18)] Waiting until timeout for monitored process [2023-11-29 04:50:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:50:08,553 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 04:50:08,558 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:50:08,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:50:08,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2023-11-29 04:50:08,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:50:08,989 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 64 treesize of output 24 [2023-11-29 04:50:09,048 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 62 treesize of output 26 [2023-11-29 04:50:09,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-29 04:50:09,121 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:50:09,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:50:09,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [867876641] [2023-11-29 04:50:09,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [867876641] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:50:09,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:50:09,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:50:09,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168312890] [2023-11-29 04:50:09,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:50:09,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:50:09,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:50:09,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:50:09,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:50:09,123 INFO L87 Difference]: Start difference. First operand 254 states and 332 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:50:13,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:50:13,154 INFO L93 Difference]: Finished difference Result 806 states and 1070 transitions. [2023-11-29 04:50:13,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:50:13,155 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 189 [2023-11-29 04:50:13,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:50:13,158 INFO L225 Difference]: With dead ends: 806 [2023-11-29 04:50:13,158 INFO L226 Difference]: Without dead ends: 553 [2023-11-29 04:50:13,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:50:13,160 INFO L413 NwaCegarLoop]: 351 mSDtfsCounter, 349 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-11-29 04:50:13,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 1096 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-11-29 04:50:13,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2023-11-29 04:50:13,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 254. [2023-11-29 04:50:13,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 197 states have (on average 1.1928934010152283) internal successors, (235), 198 states have internal predecessors, (235), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-29 04:50:13,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 331 transitions. [2023-11-29 04:50:13,191 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 331 transitions. Word has length 189 [2023-11-29 04:50:13,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:50:13,191 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 331 transitions. [2023-11-29 04:50:13,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:50:13,192 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 331 transitions. [2023-11-29 04:50:13,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2023-11-29 04:50:13,193 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:50:13,193 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:50:13,198 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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 (18)] Ended with exit code 0 [2023-11-29 04:50:13,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:50:13,393 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:50:13,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:50:13,394 INFO L85 PathProgramCache]: Analyzing trace with hash 236640232, now seen corresponding path program 1 times [2023-11-29 04:50:13,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:50:13,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1752904237] [2023-11-29 04:50:13,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:50:13,395 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:50:13,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:50:13,395 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:50:13,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 04:50:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:50:13,666 INFO L262 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 04:50:13,669 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:50:14,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 59 [2023-11-29 04:50:14,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:50:14,888 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 146 treesize of output 56 [2023-11-29 04:50:14,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 18 proven. 510 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2023-11-29 04:50:14,976 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:50:15,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:50:15,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1752904237] [2023-11-29 04:50:15,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1752904237] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:50:15,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1157788363] [2023-11-29 04:50:15,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:50:15,206 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:50:15,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:50:15,206 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:50:15,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2023-11-29 04:50:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:50:16,303 INFO L262 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-29 04:50:16,307 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:50:17,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 59 [2023-11-29 04:50:17,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:50:17,485 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 146 treesize of output 56 [2023-11-29 04:50:17,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 18 proven. 510 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2023-11-29 04:50:17,592 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:50:17,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1157788363] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:50:17,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:50:17,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2023-11-29 04:50:17,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133212517] [2023-11-29 04:50:17,809 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:50:17,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 04:50:17,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:50:17,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 04:50:17,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2023-11-29 04:50:17,811 INFO L87 Difference]: Start difference. First operand 254 states and 331 transitions. Second operand has 13 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 3 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2023-11-29 04:50:21,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:50:21,457 INFO L93 Difference]: Finished difference Result 643 states and 833 transitions. [2023-11-29 04:50:21,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 04:50:21,458 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 3 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) Word has length 189 [2023-11-29 04:50:21,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:50:21,460 INFO L225 Difference]: With dead ends: 643 [2023-11-29 04:50:21,460 INFO L226 Difference]: Without dead ends: 390 [2023-11-29 04:50:21,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 427 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=222, Invalid=834, Unknown=0, NotChecked=0, Total=1056 [2023-11-29 04:50:21,462 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 316 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-29 04:50:21,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 917 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-11-29 04:50:21,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2023-11-29 04:50:21,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 314. [2023-11-29 04:50:21,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 236 states have (on average 1.1779661016949152) internal successors, (278), 237 states have internal predecessors, (278), 67 states have call successors, (67), 10 states have call predecessors, (67), 10 states have return successors, (67), 66 states have call predecessors, (67), 67 states have call successors, (67) [2023-11-29 04:50:21,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 412 transitions. [2023-11-29 04:50:21,506 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 412 transitions. Word has length 189 [2023-11-29 04:50:21,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:50:21,507 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 412 transitions. [2023-11-29 04:50:21,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 3 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2023-11-29 04:50:21,507 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 412 transitions. [2023-11-29 04:50:21,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2023-11-29 04:50:21,509 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:50:21,509 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:50:21,517 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2023-11-29 04:50:21,715 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 04:50:21,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:50:21,910 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:50:21,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:50:21,910 INFO L85 PathProgramCache]: Analyzing trace with hash -28007258, now seen corresponding path program 1 times [2023-11-29 04:50:21,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:50:21,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [853022777] [2023-11-29 04:50:21,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:50:21,911 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:50:21,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:50:21,912 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:50:21,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 04:50:22,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:50:22,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:50:22,151 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:50:22,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 522 proven. 0 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2023-11-29 04:50:22,174 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:50:22,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:50:22,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [853022777] [2023-11-29 04:50:22,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [853022777] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:50:22,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:50:22,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:50:22,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961234082] [2023-11-29 04:50:22,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:50:22,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:50:22,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:50:22,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:50:22,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:50:22,176 INFO L87 Difference]: Start difference. First operand 314 states and 412 transitions. Second operand has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2023-11-29 04:50:22,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:50:22,391 INFO L93 Difference]: Finished difference Result 519 states and 676 transitions. [2023-11-29 04:50:22,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:50:22,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) Word has length 189 [2023-11-29 04:50:22,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:50:22,392 INFO L225 Difference]: With dead ends: 519 [2023-11-29 04:50:22,392 INFO L226 Difference]: Without dead ends: 200 [2023-11-29 04:50:22,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:50:22,393 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 6 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:50:22,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 537 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:50:22,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-11-29 04:50:22,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 192. [2023-11-29 04:50:22,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 140 states have (on average 1.1571428571428573) internal successors, (162), 140 states have internal predecessors, (162), 44 states have call successors, (44), 7 states have call predecessors, (44), 7 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-29 04:50:22,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 250 transitions. [2023-11-29 04:50:22,416 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 250 transitions. Word has length 189 [2023-11-29 04:50:22,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:50:22,416 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 250 transitions. [2023-11-29 04:50:22,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2023-11-29 04:50:22,417 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 250 transitions. [2023-11-29 04:50:22,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-29 04:50:22,418 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:50:22,418 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:50:22,424 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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)] Forceful destruction successful, exit code 0 [2023-11-29 04:50:22,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:50:22,618 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:50:22,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:50:22,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1481143, now seen corresponding path program 1 times [2023-11-29 04:50:22,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:50:22,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1258061246] [2023-11-29 04:50:22,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:50:22,620 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:50:22,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:50:22,620 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:50:22,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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)] Waiting until timeout for monitored process [2023-11-29 04:50:22,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:50:22,877 INFO L262 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 04:50:22,882 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:50:24,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:50:24,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2023-11-29 04:50:24,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 61 [2023-11-29 04:50:25,409 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:50:25,409 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 64 treesize of output 24 [2023-11-29 04:50:25,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:50:25,524 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 127 treesize of output 49 [2023-11-29 04:50:25,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2023-11-29 04:50:25,646 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:50:25,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:50:25,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1258061246] [2023-11-29 04:50:25,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1258061246] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:50:25,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:50:25,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 04:50:25,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434418961] [2023-11-29 04:50:25,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:50:25,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:50:25,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:50:25,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:50:25,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:50:25,647 INFO L87 Difference]: Start difference. First operand 192 states and 250 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 9 states have internal predecessors, (71), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-29 04:50:29,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:50:29,291 INFO L93 Difference]: Finished difference Result 457 states and 588 transitions. [2023-11-29 04:50:29,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:50:29,292 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 9 states have internal predecessors, (71), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 190 [2023-11-29 04:50:29,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:50:29,293 INFO L225 Difference]: With dead ends: 457 [2023-11-29 04:50:29,293 INFO L226 Difference]: Without dead ends: 266 [2023-11-29 04:50:29,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-11-29 04:50:29,294 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 268 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:50:29,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 1114 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-11-29 04:50:29,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2023-11-29 04:50:29,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 200. [2023-11-29 04:50:29,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 148 states have (on average 1.1554054054054055) internal successors, (171), 148 states have internal predecessors, (171), 44 states have call successors, (44), 7 states have call predecessors, (44), 7 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-29 04:50:29,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 259 transitions. [2023-11-29 04:50:29,333 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 259 transitions. Word has length 190 [2023-11-29 04:50:29,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:50:29,333 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 259 transitions. [2023-11-29 04:50:29,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 9 states have internal predecessors, (71), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-29 04:50:29,334 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 259 transitions. [2023-11-29 04:50:29,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-29 04:50:29,335 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:50:29,335 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:50:29,340 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 04:50:29,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:50:29,535 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:50:29,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:50:29,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1281344821, now seen corresponding path program 1 times [2023-11-29 04:50:29,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:50:29,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1076017461] [2023-11-29 04:50:29,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:50:29,536 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:50:29,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:50:29,537 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:50:29,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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 (23)] Waiting until timeout for monitored process [2023-11-29 04:50:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:50:29,783 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:50:29,786 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:50:29,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-29 04:50:29,803 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:50:29,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:50:29,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1076017461] [2023-11-29 04:50:29,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1076017461] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:50:29,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:50:29,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:50:29,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566360350] [2023-11-29 04:50:29,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:50:29,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:50:29,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:50:29,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:50:29,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:50:29,805 INFO L87 Difference]: Start difference. First operand 200 states and 259 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:50:29,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:50:29,986 INFO L93 Difference]: Finished difference Result 426 states and 554 transitions. [2023-11-29 04:50:29,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:50:29,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2023-11-29 04:50:29,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:50:29,988 INFO L225 Difference]: With dead ends: 426 [2023-11-29 04:50:29,988 INFO L226 Difference]: Without dead ends: 227 [2023-11-29 04:50:29,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:50:29,989 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 66 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:50:29,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 601 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:50:29,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-11-29 04:50:30,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 203. [2023-11-29 04:50:30,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 151 states have (on average 1.1523178807947019) internal successors, (174), 151 states have internal predecessors, (174), 44 states have call successors, (44), 7 states have call predecessors, (44), 7 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-29 04:50:30,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 262 transitions. [2023-11-29 04:50:30,013 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 262 transitions. Word has length 190 [2023-11-29 04:50:30,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:50:30,013 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 262 transitions. [2023-11-29 04:50:30,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:50:30,014 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 262 transitions. [2023-11-29 04:50:30,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2023-11-29 04:50:30,015 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:50:30,015 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:50:30,020 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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 (23)] Forceful destruction successful, exit code 0 [2023-11-29 04:50:30,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:50:30,215 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:50:30,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:50:30,216 INFO L85 PathProgramCache]: Analyzing trace with hash -290644679, now seen corresponding path program 1 times [2023-11-29 04:50:30,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:50:30,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [406362148] [2023-11-29 04:50:30,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:50:30,217 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:50:30,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:50:30,218 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:50:30,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 04:50:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:50:30,504 INFO L262 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:50:30,507 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:50:30,513 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 43 treesize of output 19 [2023-11-29 04:50:30,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-29 04:50:30,528 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:50:30,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:50:30,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [406362148] [2023-11-29 04:50:30,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [406362148] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:50:30,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:50:30,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:50:30,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207115003] [2023-11-29 04:50:30,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:50:30,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:50:30,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:50:30,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:50:30,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:50:30,530 INFO L87 Difference]: Start difference. First operand 203 states and 262 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:50:30,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:50:30,585 INFO L93 Difference]: Finished difference Result 405 states and 523 transitions. [2023-11-29 04:50:30,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:50:30,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 192 [2023-11-29 04:50:30,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:50:30,587 INFO L225 Difference]: With dead ends: 405 [2023-11-29 04:50:30,587 INFO L226 Difference]: Without dead ends: 203 [2023-11-29 04:50:30,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:50:30,588 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 33 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:50:30,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 252 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:50:30,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-11-29 04:50:30,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2023-11-29 04:50:30,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 151 states have (on average 1.1390728476821192) internal successors, (172), 151 states have internal predecessors, (172), 44 states have call successors, (44), 7 states have call predecessors, (44), 7 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-29 04:50:30,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 260 transitions. [2023-11-29 04:50:30,613 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 260 transitions. Word has length 192 [2023-11-29 04:50:30,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:50:30,613 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 260 transitions. [2023-11-29 04:50:30,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:50:30,613 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 260 transitions. [2023-11-29 04:50:30,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2023-11-29 04:50:30,615 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:50:30,615 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:50:30,621 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 04:50:30,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:50:30,815 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:50:30,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:50:30,816 INFO L85 PathProgramCache]: Analyzing trace with hash 2010177911, now seen corresponding path program 1 times [2023-11-29 04:50:30,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:50:30,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1749941718] [2023-11-29 04:50:30,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:50:30,817 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:50:30,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:50:30,818 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:50:30,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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 (25)] Waiting until timeout for monitored process [2023-11-29 04:50:31,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:50:31,288 INFO L262 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 04:50:31,293 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:50:31,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:50:31,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2023-11-29 04:50:31,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2023-11-29 04:50:32,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2023-11-29 04:50:32,186 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 [2023-11-29 04:50:32,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 50 proven. 138 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 04:50:32,219 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:50:32,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2023-11-29 04:50:32,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:50:32,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1749941718] [2023-11-29 04:50:32,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1749941718] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:50:32,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:50:32,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2023-11-29 04:50:32,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079295284] [2023-11-29 04:50:32,626 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:50:32,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 04:50:32,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:50:32,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 04:50:32,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2023-11-29 04:50:32,628 INFO L87 Difference]: Start difference. First operand 203 states and 260 transitions. Second operand has 16 states, 12 states have (on average 11.333333333333334) internal successors, (136), 16 states have internal predecessors, (136), 6 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (50), 2 states have call predecessors, (50), 6 states have call successors, (50) [2023-11-29 04:50:33,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:50:33,438 INFO L93 Difference]: Finished difference Result 421 states and 535 transitions. [2023-11-29 04:50:33,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 04:50:33,439 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 11.333333333333334) internal successors, (136), 16 states have internal predecessors, (136), 6 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (50), 2 states have call predecessors, (50), 6 states have call successors, (50) Word has length 192 [2023-11-29 04:50:33,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:50:33,440 INFO L225 Difference]: With dead ends: 421 [2023-11-29 04:50:33,440 INFO L226 Difference]: Without dead ends: 219 [2023-11-29 04:50:33,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 367 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2023-11-29 04:50:33,441 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 71 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 04:50:33,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 810 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 04:50:33,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-11-29 04:50:33,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 203. [2023-11-29 04:50:33,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 151 states have (on average 1.1324503311258278) internal successors, (171), 151 states have internal predecessors, (171), 44 states have call successors, (44), 7 states have call predecessors, (44), 7 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-29 04:50:33,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 259 transitions. [2023-11-29 04:50:33,466 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 259 transitions. Word has length 192 [2023-11-29 04:50:33,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:50:33,467 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 259 transitions. [2023-11-29 04:50:33,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 11.333333333333334) internal successors, (136), 16 states have internal predecessors, (136), 6 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (50), 2 states have call predecessors, (50), 6 states have call successors, (50) [2023-11-29 04:50:33,467 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 259 transitions. [2023-11-29 04:50:33,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2023-11-29 04:50:33,468 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:50:33,469 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:50:33,475 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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 (25)] Forceful destruction successful, exit code 0 [2023-11-29 04:50:33,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:50:33,669 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:50:33,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:50:33,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1690764609, now seen corresponding path program 1 times [2023-11-29 04:50:33,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:50:33,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1242006251] [2023-11-29 04:50:33,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:50:33,670 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:50:33,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:50:33,671 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:50:33,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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 (26)] Waiting until timeout for monitored process [2023-11-29 04:50:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:50:34,103 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-29 04:50:34,108 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:50:34,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 04:50:34,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 14 treesize of output 10 [2023-11-29 04:50:34,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-11-29 04:50:34,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-11-29 04:50:34,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:50:34,337 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 1 case distinctions, treesize of input 35 treesize of output 37 [2023-11-29 04:50:34,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:50:34,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 45 treesize of output 50 [2023-11-29 04:50:34,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:50:34,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 53 [2023-11-29 04:50:34,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:50:34,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 67 [2023-11-29 04:50:35,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:50:35,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 89 treesize of output 97 [2023-11-29 04:50:35,518 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:50:35,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 154 treesize of output 76 [2023-11-29 04:50:35,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 832 proven. 0 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2023-11-29 04:50:35,599 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:50:35,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:50:35,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1242006251] [2023-11-29 04:50:35,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1242006251] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:50:35,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:50:35,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 04:50:35,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108137169] [2023-11-29 04:50:35,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:50:35,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 04:50:35,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:50:35,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 04:50:35,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:50:35,601 INFO L87 Difference]: Start difference. First operand 203 states and 259 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 5 states have call successors, (25), 5 states have call predecessors, (25), 5 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2023-11-29 04:50:38,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:50:38,491 INFO L93 Difference]: Finished difference Result 539 states and 680 transitions. [2023-11-29 04:50:38,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:50:38,492 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 5 states have call successors, (25), 5 states have call predecessors, (25), 5 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) Word has length 192 [2023-11-29 04:50:38,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:50:38,494 INFO L225 Difference]: With dead ends: 539 [2023-11-29 04:50:38,494 INFO L226 Difference]: Without dead ends: 337 [2023-11-29 04:50:38,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2023-11-29 04:50:38,496 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 528 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:50:38,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 692 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-11-29 04:50:38,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2023-11-29 04:50:38,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 306. [2023-11-29 04:50:38,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 231 states have (on average 1.1385281385281385) internal successors, (263), 233 states have internal predecessors, (263), 60 states have call successors, (60), 14 states have call predecessors, (60), 14 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2023-11-29 04:50:38,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 383 transitions. [2023-11-29 04:50:38,561 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 383 transitions. Word has length 192 [2023-11-29 04:50:38,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:50:38,562 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 383 transitions. [2023-11-29 04:50:38,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 5 states have call successors, (25), 5 states have call predecessors, (25), 5 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2023-11-29 04:50:38,562 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 383 transitions. [2023-11-29 04:50:38,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2023-11-29 04:50:38,564 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:50:38,564 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:50:38,572 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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 (26)] Ended with exit code 0 [2023-11-29 04:50:38,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:50:38,765 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:50:38,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:50:38,765 INFO L85 PathProgramCache]: Analyzing trace with hash 798764353, now seen corresponding path program 1 times [2023-11-29 04:50:38,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:50:38,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [76079631] [2023-11-29 04:50:38,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:50:38,766 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:50:38,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:50:38,766 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:50:38,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 04:50:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:50:39,061 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-29 04:50:39,066 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:50:41,120 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 21 treesize of output 10 [2023-11-29 04:50:41,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 59 [2023-11-29 04:50:47,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:50:47,204 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 122 treesize of output 56 [2023-11-29 04:50:49,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:50:49,067 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 135 treesize of output 63 [2023-11-29 04:50:50,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 474 proven. 54 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2023-11-29 04:50:50,980 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:51:07,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-29 04:51:07,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:51:07,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [76079631] [2023-11-29 04:51:07,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [76079631] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 04:51:07,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:51:07,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 21 [2023-11-29 04:51:07,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427103568] [2023-11-29 04:51:07,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:51:07,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:51:07,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:51:07,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:51:07,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2023-11-29 04:51:07,004 INFO L87 Difference]: Start difference. First operand 306 states and 383 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:51:35,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 04:51:49,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:51:49,413 INFO L93 Difference]: Finished difference Result 775 states and 980 transitions. [2023-11-29 04:51:49,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:51:49,424 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 192 [2023-11-29 04:51:49,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:51:49,426 INFO L225 Difference]: With dead ends: 775 [2023-11-29 04:51:49,426 INFO L226 Difference]: Without dead ends: 470 [2023-11-29 04:51:49,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2023-11-29 04:51:49,427 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 352 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:51:49,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 961 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 36.7s Time] [2023-11-29 04:51:49,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2023-11-29 04:51:49,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 293. [2023-11-29 04:51:49,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 218 states have (on average 1.1376146788990826) internal successors, (248), 220 states have internal predecessors, (248), 60 states have call successors, (60), 14 states have call predecessors, (60), 14 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2023-11-29 04:51:49,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 368 transitions. [2023-11-29 04:51:49,491 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 368 transitions. Word has length 192 [2023-11-29 04:51:49,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:51:49,491 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 368 transitions. [2023-11-29 04:51:49,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:51:49,491 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 368 transitions. [2023-11-29 04:51:49,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2023-11-29 04:51:49,495 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:51:49,495 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:51:49,502 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 04:51:49,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:51:49,695 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:51:49,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:51:49,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1921010834, now seen corresponding path program 1 times [2023-11-29 04:51:49,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:51:49,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [822750352] [2023-11-29 04:51:49,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:51:49,697 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:51:49,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:51:49,697 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:51:49,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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 (28)] Waiting until timeout for monitored process [2023-11-29 04:51:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:51:50,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-29 04:51:50,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:51:50,147 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 [2023-11-29 04:51:50,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2023-11-29 04:51:50,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:51:50,451 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 1 case distinctions, treesize of input 38 treesize of output 25 [2023-11-29 04:51:50,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:51:50,604 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 1 case distinctions, treesize of input 38 treesize of output 25 [2023-11-29 04:51:51,003 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:51:51,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 44 treesize of output 49 [2023-11-29 04:51:51,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:51:51,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 62 [2023-11-29 04:51:51,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:51:51,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 75 [2023-11-29 04:51:52,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:51:52,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 74 treesize of output 88 [2023-11-29 04:51:52,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:51:52,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 84 treesize of output 101 [2023-11-29 04:51:54,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:51:54,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 111 treesize of output 121 [2023-11-29 04:51:56,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:51:56,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 136 treesize of output 58 [2023-11-29 04:51:56,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 975 proven. 75 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-11-29 04:51:56,634 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:51:57,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-29 04:51:57,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:51:57,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [822750352] [2023-11-29 04:51:57,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [822750352] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 04:51:57,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:51:57,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [25] total 31 [2023-11-29 04:51:57,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925199032] [2023-11-29 04:51:57,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:51:57,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:51:57,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:51:57,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:51:57,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=775, Unknown=0, NotChecked=0, Total=930 [2023-11-29 04:51:57,476 INFO L87 Difference]: Start difference. First operand 293 states and 368 transitions. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:51:59,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:51:59,198 INFO L93 Difference]: Finished difference Result 819 states and 1014 transitions. [2023-11-29 04:51:59,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 04:51:59,200 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 194 [2023-11-29 04:51:59,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:51:59,202 INFO L225 Difference]: With dead ends: 819 [2023-11-29 04:51:59,202 INFO L226 Difference]: Without dead ends: 527 [2023-11-29 04:51:59,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=216, Invalid=1266, Unknown=0, NotChecked=0, Total=1482 [2023-11-29 04:51:59,204 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 211 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:51:59,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 1274 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 04:51:59,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2023-11-29 04:51:59,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 471. [2023-11-29 04:51:59,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 372 states have (on average 1.1559139784946237) internal successors, (430), 376 states have internal predecessors, (430), 74 states have call successors, (74), 24 states have call predecessors, (74), 24 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) [2023-11-29 04:51:59,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 578 transitions. [2023-11-29 04:51:59,298 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 578 transitions. Word has length 194 [2023-11-29 04:51:59,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:51:59,298 INFO L495 AbstractCegarLoop]: Abstraction has 471 states and 578 transitions. [2023-11-29 04:51:59,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:51:59,299 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 578 transitions. [2023-11-29 04:51:59,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2023-11-29 04:51:59,301 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:51:59,301 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:51:59,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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 (28)] Forceful destruction successful, exit code 0 [2023-11-29 04:51:59,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:51:59,501 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:51:59,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:51:59,502 INFO L85 PathProgramCache]: Analyzing trace with hash 909893584, now seen corresponding path program 1 times [2023-11-29 04:51:59,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:51:59,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1713056780] [2023-11-29 04:51:59,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:51:59,503 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:51:59,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:51:59,503 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:51:59,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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)] Waiting until timeout for monitored process [2023-11-29 04:51:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:51:59,997 INFO L262 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-29 04:52:00,002 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:52:00,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:52:00,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-29 04:52:00,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:52:00,209 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 1 case distinctions, treesize of input 35 treesize of output 37 [2023-11-29 04:52:00,397 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:52:00,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 50 treesize of output 40 [2023-11-29 04:52:00,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:52:00,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 50 treesize of output 40 [2023-11-29 04:52:00,710 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:52:00,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 50 treesize of output 40 [2023-11-29 04:52:00,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:52:00,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 50 treesize of output 40 [2023-11-29 04:52:01,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:52:01,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 50 treesize of output 40 [2023-11-29 04:52:01,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:52:01,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 50 treesize of output 40 [2023-11-29 04:52:01,488 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:52:01,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 55 treesize of output 56 [2023-11-29 04:52:02,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:52:02,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 33 [2023-11-29 04:52:02,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 628 proven. 87 refuted. 0 times theorem prover too weak. 485 trivial. 0 not checked. [2023-11-29 04:52:02,066 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:52:02,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-29 04:52:02,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:52:02,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1713056780] [2023-11-29 04:52:02,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1713056780] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 04:52:02,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:52:02,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 18 [2023-11-29 04:52:02,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281443796] [2023-11-29 04:52:02,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:52:02,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:52:02,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:52:02,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:52:02,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2023-11-29 04:52:02,342 INFO L87 Difference]: Start difference. First operand 471 states and 578 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:52:02,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:52:02,931 INFO L93 Difference]: Finished difference Result 997 states and 1222 transitions. [2023-11-29 04:52:02,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:52:02,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 194 [2023-11-29 04:52:02,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:52:02,934 INFO L225 Difference]: With dead ends: 997 [2023-11-29 04:52:02,934 INFO L226 Difference]: Without dead ends: 527 [2023-11-29 04:52:02,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2023-11-29 04:52:02,935 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 149 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:52:02,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 446 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 04:52:02,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2023-11-29 04:52:03,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 459. [2023-11-29 04:52:03,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 360 states have (on average 1.15) internal successors, (414), 364 states have internal predecessors, (414), 74 states have call successors, (74), 24 states have call predecessors, (74), 24 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) [2023-11-29 04:52:03,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 562 transitions. [2023-11-29 04:52:03,026 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 562 transitions. Word has length 194 [2023-11-29 04:52:03,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:52:03,026 INFO L495 AbstractCegarLoop]: Abstraction has 459 states and 562 transitions. [2023-11-29 04:52:03,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:52:03,027 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 562 transitions. [2023-11-29 04:52:03,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2023-11-29 04:52:03,028 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:52:03,028 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:52:03,035 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 04:52:03,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:52:03,228 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:52:03,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:52:03,229 INFO L85 PathProgramCache]: Analyzing trace with hash 891651536, now seen corresponding path program 1 times [2023-11-29 04:52:03,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:52:03,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [79311848] [2023-11-29 04:52:03,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:52:03,229 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:52:03,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:52:03,230 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:52:03,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 04:52:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:52:03,669 INFO L262 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-29 04:52:03,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:52:03,679 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 [2023-11-29 04:52:03,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2023-11-29 04:52:04,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:52:04,227 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 1 case distinctions, treesize of input 58 treesize of output 35 [2023-11-29 04:52:04,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:52:04,483 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 1 case distinctions, treesize of input 53 treesize of output 45 [2023-11-29 04:52:04,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:52:04,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 68 treesize of output 48 [2023-11-29 04:52:05,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:52:05,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 63 treesize of output 58 [2023-11-29 04:52:05,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:52:05,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 66 [2023-11-29 04:52:05,898 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:52:05,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 72 treesize of output 79 [2023-11-29 04:52:06,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:52:06,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 73 treesize of output 87 [2023-11-29 04:52:07,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:52:07,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 105 treesize of output 112 [2023-11-29 04:52:08,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:52:08,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 114 treesize of output 54 [2023-11-29 04:52:08,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 983 proven. 87 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2023-11-29 04:52:08,794 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:52:09,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-29 04:52:09,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:52:09,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [79311848] [2023-11-29 04:52:09,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [79311848] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 04:52:09,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:52:09,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [21] total 24 [2023-11-29 04:52:09,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595564362] [2023-11-29 04:52:09,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:52:09,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:52:09,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:52:09,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:52:09,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2023-11-29 04:52:09,155 INFO L87 Difference]: Start difference. First operand 459 states and 562 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:52:09,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:52:09,663 INFO L93 Difference]: Finished difference Result 949 states and 1152 transitions. [2023-11-29 04:52:09,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:52:09,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 194 [2023-11-29 04:52:09,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:52:09,672 INFO L225 Difference]: With dead ends: 949 [2023-11-29 04:52:09,672 INFO L226 Difference]: Without dead ends: 491 [2023-11-29 04:52:09,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 363 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2023-11-29 04:52:09,674 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 136 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:52:09,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 433 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 04:52:09,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2023-11-29 04:52:09,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 357. [2023-11-29 04:52:09,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 280 states have (on average 1.1214285714285714) internal successors, (314), 282 states have internal predecessors, (314), 60 states have call successors, (60), 16 states have call predecessors, (60), 16 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2023-11-29 04:52:09,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 434 transitions. [2023-11-29 04:52:09,776 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 434 transitions. Word has length 194 [2023-11-29 04:52:09,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:52:09,776 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 434 transitions. [2023-11-29 04:52:09,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:52:09,776 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 434 transitions. [2023-11-29 04:52:09,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2023-11-29 04:52:09,777 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:52:09,777 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:52:09,784 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 04:52:09,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:52:09,978 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:52:09,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:52:09,978 INFO L85 PathProgramCache]: Analyzing trace with hash -119465714, now seen corresponding path program 1 times [2023-11-29 04:52:09,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:52:09,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2054792679] [2023-11-29 04:52:09,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:52:09,979 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:52:09,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:52:09,979 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:52:09,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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 (31)] Waiting until timeout for monitored process [2023-11-29 04:52:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:52:10,444 INFO L262 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-29 04:52:10,449 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:52:10,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 04:52:10,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 04:52:10,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-11-29 04:52:10,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-11-29 04:52:10,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:52:10,669 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 1 case distinctions, treesize of input 40 treesize of output 27 [2023-11-29 04:52:10,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:52:10,779 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 1 case distinctions, treesize of input 40 treesize of output 27 [2023-11-29 04:52:10,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:52:10,885 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 1 case distinctions, treesize of input 40 treesize of output 27 [2023-11-29 04:52:10,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:52:10,999 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 1 case distinctions, treesize of input 40 treesize of output 27 [2023-11-29 04:52:11,221 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:52:11,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 54 treesize of output 53 [2023-11-29 04:52:11,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:52:11,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 33 [2023-11-29 04:52:11,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 704 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-11-29 04:52:11,913 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:52:11,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:52:11,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2054792679] [2023-11-29 04:52:11,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2054792679] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:52:11,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:52:11,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 04:52:11,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249370677] [2023-11-29 04:52:11,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:52:11,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 04:52:11,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:52:11,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 04:52:11,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:52:11,915 INFO L87 Difference]: Start difference. First operand 357 states and 434 transitions. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 3 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2023-11-29 04:52:14,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:52:14,905 INFO L93 Difference]: Finished difference Result 875 states and 1054 transitions. [2023-11-29 04:52:14,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 04:52:14,906 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 3 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 194 [2023-11-29 04:52:14,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:52:14,908 INFO L225 Difference]: With dead ends: 875 [2023-11-29 04:52:14,908 INFO L226 Difference]: Without dead ends: 519 [2023-11-29 04:52:14,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2023-11-29 04:52:14,909 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 239 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:52:14,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 1111 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-29 04:52:14,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2023-11-29 04:52:15,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 513. [2023-11-29 04:52:15,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 396 states have (on average 1.1262626262626263) internal successors, (446), 402 states have internal predecessors, (446), 84 states have call successors, (84), 32 states have call predecessors, (84), 32 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2023-11-29 04:52:15,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 614 transitions. [2023-11-29 04:52:15,027 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 614 transitions. Word has length 194 [2023-11-29 04:52:15,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:52:15,027 INFO L495 AbstractCegarLoop]: Abstraction has 513 states and 614 transitions. [2023-11-29 04:52:15,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 3 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2023-11-29 04:52:15,028 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 614 transitions. [2023-11-29 04:52:15,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2023-11-29 04:52:15,028 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:52:15,029 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:52:15,036 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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 (31)] Ended with exit code 0 [2023-11-29 04:52:15,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:52:15,229 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:52:15,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:52:15,230 INFO L85 PathProgramCache]: Analyzing trace with hash 19329183, now seen corresponding path program 1 times [2023-11-29 04:52:15,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:52:15,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321964490] [2023-11-29 04:52:15,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:52:15,230 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:52:15,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:52:15,231 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:52:15,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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)] Waiting until timeout for monitored process [2023-11-29 04:52:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:52:15,684 INFO L262 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 04:52:15,687 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:52:15,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 04:52:15,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-11-29 04:52:16,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-11-29 04:52:16,319 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 39 treesize of output 21 [2023-11-29 04:52:16,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 282 proven. 63 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2023-11-29 04:52:16,336 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:52:16,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 9 proven. 63 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2023-11-29 04:52:16,781 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:52:16,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [321964490] [2023-11-29 04:52:16,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [321964490] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:52:16,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:52:16,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2023-11-29 04:52:16,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119056199] [2023-11-29 04:52:16,781 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:52:16,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:52:16,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:52:16,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:52:16,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:52:16,783 INFO L87 Difference]: Start difference. First operand 513 states and 614 transitions. Second operand has 10 states, 8 states have (on average 10.625) internal successors, (85), 10 states have internal predecessors, (85), 4 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (47), 2 states have call predecessors, (47), 4 states have call successors, (47) [2023-11-29 04:52:17,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:52:17,514 INFO L93 Difference]: Finished difference Result 1105 states and 1319 transitions. [2023-11-29 04:52:17,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:52:17,515 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 10.625) internal successors, (85), 10 states have internal predecessors, (85), 4 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (47), 2 states have call predecessors, (47), 4 states have call successors, (47) Word has length 197 [2023-11-29 04:52:17,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:52:17,518 INFO L225 Difference]: With dead ends: 1105 [2023-11-29 04:52:17,518 INFO L226 Difference]: Without dead ends: 593 [2023-11-29 04:52:17,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 383 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2023-11-29 04:52:17,519 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 88 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:52:17,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 463 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 04:52:17,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2023-11-29 04:52:17,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 513. [2023-11-29 04:52:17,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 396 states have (on average 1.1161616161616161) internal successors, (442), 402 states have internal predecessors, (442), 84 states have call successors, (84), 32 states have call predecessors, (84), 32 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2023-11-29 04:52:17,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 610 transitions. [2023-11-29 04:52:17,646 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 610 transitions. Word has length 197 [2023-11-29 04:52:17,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:52:17,647 INFO L495 AbstractCegarLoop]: Abstraction has 513 states and 610 transitions. [2023-11-29 04:52:17,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 10.625) internal successors, (85), 10 states have internal predecessors, (85), 4 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (47), 2 states have call predecessors, (47), 4 states have call successors, (47) [2023-11-29 04:52:17,647 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 610 transitions. [2023-11-29 04:52:17,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-11-29 04:52:17,648 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:52:17,648 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:52:17,654 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 04:52:17,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:52:17,849 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:52:17,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:52:17,849 INFO L85 PathProgramCache]: Analyzing trace with hash -658945639, now seen corresponding path program 1 times [2023-11-29 04:52:17,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:52:17,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2142534560] [2023-11-29 04:52:17,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:52:17,850 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:52:17,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:52:17,851 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:52:17,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 04:52:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:52:18,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 04:52:18,345 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:52:18,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 04:52:19,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 61 [2023-11-29 04:52:20,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:52:20,099 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 203 treesize of output 77 [2023-11-29 04:52:20,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 456 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2023-11-29 04:52:20,165 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:52:20,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:52:20,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2142534560] [2023-11-29 04:52:20,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2142534560] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:52:20,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1563794396] [2023-11-29 04:52:20,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:52:20,454 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:52:20,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:52:20,455 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:52:20,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2023-11-29 04:52:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:52:22,005 INFO L262 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 04:52:22,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:52:22,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 15 treesize of output 1 [2023-11-29 04:52:24,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 59 [2023-11-29 04:52:24,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:52:24,867 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 173 treesize of output 77 [2023-11-29 04:52:24,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 456 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2023-11-29 04:52:24,886 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:52:25,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-29 04:52:25,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1563794396] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 04:52:25,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:52:25,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 10] total 20 [2023-11-29 04:52:25,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095247783] [2023-11-29 04:52:25,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:52:25,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:52:25,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:52:25,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:52:25,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2023-11-29 04:52:25,238 INFO L87 Difference]: Start difference. First operand 513 states and 610 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:52:25,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:52:25,701 INFO L93 Difference]: Finished difference Result 1029 states and 1223 transitions. [2023-11-29 04:52:25,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:52:25,702 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 199 [2023-11-29 04:52:25,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:52:25,704 INFO L225 Difference]: With dead ends: 1029 [2023-11-29 04:52:25,704 INFO L226 Difference]: Without dead ends: 517 [2023-11-29 04:52:25,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 643 GetRequests, 621 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2023-11-29 04:52:25,705 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 111 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:52:25,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 525 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:52:25,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2023-11-29 04:52:25,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 513. [2023-11-29 04:52:25,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 396 states have (on average 1.106060606060606) internal successors, (438), 402 states have internal predecessors, (438), 84 states have call successors, (84), 32 states have call predecessors, (84), 32 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2023-11-29 04:52:25,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 606 transitions. [2023-11-29 04:52:25,822 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 606 transitions. Word has length 199 [2023-11-29 04:52:25,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:52:25,822 INFO L495 AbstractCegarLoop]: Abstraction has 513 states and 606 transitions. [2023-11-29 04:52:25,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:52:25,822 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 606 transitions. [2023-11-29 04:52:25,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-11-29 04:52:25,823 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:52:25,823 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:52:25,830 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 04:52:26,030 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (34)] Ended with exit code 0 [2023-11-29 04:52:26,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 04:52:26,224 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:52:26,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:52:26,224 INFO L85 PathProgramCache]: Analyzing trace with hash -716263523, now seen corresponding path program 1 times [2023-11-29 04:52:26,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:52:26,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480402834] [2023-11-29 04:52:26,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:52:26,225 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:52:26,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:52:26,226 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:52:26,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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 (35)] Waiting until timeout for monitored process [2023-11-29 04:52:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:52:26,692 INFO L262 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 04:52:26,695 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:52:26,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:52:26,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2023-11-29 04:52:27,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:52:27,566 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 120 treesize of output 50 [2023-11-29 04:52:27,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-29 04:52:27,593 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:52:27,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:52:27,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [480402834] [2023-11-29 04:52:27,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [480402834] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:52:27,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:52:27,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:52:27,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582493067] [2023-11-29 04:52:27,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:52:27,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:52:27,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:52:27,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:52:27,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:52:27,595 INFO L87 Difference]: Start difference. First operand 513 states and 606 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:52:28,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:52:28,570 INFO L93 Difference]: Finished difference Result 683 states and 827 transitions. [2023-11-29 04:52:28,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:52:28,572 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 199 [2023-11-29 04:52:28,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:52:28,576 INFO L225 Difference]: With dead ends: 683 [2023-11-29 04:52:28,576 INFO L226 Difference]: Without dead ends: 681 [2023-11-29 04:52:28,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:52:28,577 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 138 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:52:28,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 686 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 04:52:28,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2023-11-29 04:52:28,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 521. [2023-11-29 04:52:28,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 404 states have (on average 1.103960396039604) internal successors, (446), 410 states have internal predecessors, (446), 84 states have call successors, (84), 32 states have call predecessors, (84), 32 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2023-11-29 04:52:28,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 614 transitions. [2023-11-29 04:52:28,719 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 614 transitions. Word has length 199 [2023-11-29 04:52:28,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:52:28,720 INFO L495 AbstractCegarLoop]: Abstraction has 521 states and 614 transitions. [2023-11-29 04:52:28,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:52:28,720 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 614 transitions. [2023-11-29 04:52:28,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-11-29 04:52:28,721 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:52:28,721 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:52:28,727 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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 (35)] Ended with exit code 0 [2023-11-29 04:52:28,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:52:28,922 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:52:28,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:52:28,922 INFO L85 PathProgramCache]: Analyzing trace with hash -716203941, now seen corresponding path program 1 times [2023-11-29 04:52:28,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:52:28,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1513109120] [2023-11-29 04:52:28,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:52:28,923 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:52:28,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:52:28,923 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:52:28,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 04:52:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:52:29,236 INFO L262 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 04:52:29,239 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:52:29,245 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 20 treesize of output 16 [2023-11-29 04:52:29,392 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 60 treesize of output 48 [2023-11-29 04:52:29,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-29 04:52:29,411 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:52:29,411 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:52:29,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1513109120] [2023-11-29 04:52:29,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1513109120] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:52:29,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:52:29,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:52:29,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040185409] [2023-11-29 04:52:29,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:52:29,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:52:29,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:52:29,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:52:29,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:52:29,413 INFO L87 Difference]: Start difference. First operand 521 states and 614 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:52:30,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:52:30,192 INFO L93 Difference]: Finished difference Result 1161 states and 1381 transitions. [2023-11-29 04:52:30,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:52:30,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 199 [2023-11-29 04:52:30,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:52:30,195 INFO L225 Difference]: With dead ends: 1161 [2023-11-29 04:52:30,195 INFO L226 Difference]: Without dead ends: 641 [2023-11-29 04:52:30,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:52:30,196 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 90 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:52:30,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 645 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 04:52:30,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2023-11-29 04:52:30,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 639. [2023-11-29 04:52:30,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 474 states have (on average 1.0843881856540085) internal successors, (514), 482 states have internal predecessors, (514), 124 states have call successors, (124), 40 states have call predecessors, (124), 40 states have return successors, (124), 116 states have call predecessors, (124), 124 states have call successors, (124) [2023-11-29 04:52:30,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 762 transitions. [2023-11-29 04:52:30,389 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 762 transitions. Word has length 199 [2023-11-29 04:52:30,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:52:30,389 INFO L495 AbstractCegarLoop]: Abstraction has 639 states and 762 transitions. [2023-11-29 04:52:30,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:52:30,390 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 762 transitions. [2023-11-29 04:52:30,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-11-29 04:52:30,391 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:52:30,391 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:52:30,397 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 04:52:30,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:52:30,592 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:52:30,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:52:30,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1468292265, now seen corresponding path program 1 times [2023-11-29 04:52:30,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:52:30,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1107942183] [2023-11-29 04:52:30,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:52:30,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:52:30,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:52:30,594 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:52:30,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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 (37)] Waiting until timeout for monitored process [2023-11-29 04:52:30,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:52:30,882 INFO L262 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 04:52:30,884 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:52:30,890 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 15 [2023-11-29 04:52:31,020 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 60 treesize of output 48 [2023-11-29 04:52:31,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-29 04:52:31,053 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:52:31,054 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:52:31,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1107942183] [2023-11-29 04:52:31,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1107942183] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:52:31,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:52:31,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:52:31,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193290198] [2023-11-29 04:52:31,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:52:31,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:52:31,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:52:31,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:52:31,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:52:31,055 INFO L87 Difference]: Start difference. First operand 639 states and 762 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:52:32,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:52:32,119 INFO L93 Difference]: Finished difference Result 1653 states and 1935 transitions. [2023-11-29 04:52:32,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:52:32,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 199 [2023-11-29 04:52:32,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:52:32,126 INFO L225 Difference]: With dead ends: 1653 [2023-11-29 04:52:32,126 INFO L226 Difference]: Without dead ends: 1125 [2023-11-29 04:52:32,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:52:32,127 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 119 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:52:32,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 852 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 04:52:32,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2023-11-29 04:52:32,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1103. [2023-11-29 04:52:32,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1103 states, 830 states have (on average 1.072289156626506) internal successors, (890), 846 states have internal predecessors, (890), 200 states have call successors, (200), 72 states have call predecessors, (200), 72 states have return successors, (200), 184 states have call predecessors, (200), 200 states have call successors, (200) [2023-11-29 04:52:32,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1290 transitions. [2023-11-29 04:52:32,488 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1290 transitions. Word has length 199 [2023-11-29 04:52:32,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:52:32,489 INFO L495 AbstractCegarLoop]: Abstraction has 1103 states and 1290 transitions. [2023-11-29 04:52:32,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:52:32,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1290 transitions. [2023-11-29 04:52:32,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-11-29 04:52:32,491 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:52:32,491 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:52:32,496 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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 (37)] Ended with exit code 0 [2023-11-29 04:52:32,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:52:32,691 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:52:32,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:52:32,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1797315733, now seen corresponding path program 1 times [2023-11-29 04:52:32,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:52:32,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [559594195] [2023-11-29 04:52:32,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:52:32,692 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:52:32,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:52:32,693 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:52:32,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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)] Waiting until timeout for monitored process [2023-11-29 04:52:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:52:32,999 INFO L262 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:52:33,002 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:52:33,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-29 04:52:33,044 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:52:33,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:52:33,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [559594195] [2023-11-29 04:52:33,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [559594195] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:52:33,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:52:33,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:52:33,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809362413] [2023-11-29 04:52:33,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:52:33,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:52:33,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:52:33,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:52:33,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:52:33,046 INFO L87 Difference]: Start difference. First operand 1103 states and 1290 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:52:33,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:52:33,392 INFO L93 Difference]: Finished difference Result 1613 states and 1878 transitions. [2023-11-29 04:52:33,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:52:33,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 199 [2023-11-29 04:52:33,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:52:33,393 INFO L225 Difference]: With dead ends: 1613 [2023-11-29 04:52:33,393 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 04:52:33,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:52:33,396 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 54 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:52:33,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 553 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:52:33,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 04:52:33,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 04:52:33,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:33,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 04:52:33,398 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 199 [2023-11-29 04:52:33,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:52:33,398 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 04:52:33,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 04:52:33,398 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 04:52:33,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 04:52:33,401 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 04:52:33,407 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 04:52:33,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:52:33,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 04:52:41,757 WARN L293 SmtUtils]: Spent 5.97s on a formula simplification. DAG size of input: 314 DAG size of output: 336 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 04:53:44,409 WARN L293 SmtUtils]: Spent 6.98s on a formula simplification. DAG size of input: 336 DAG size of output: 152 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-29 04:55:05,883 WARN L293 SmtUtils]: Spent 41.28s on a formula simplification. DAG size of input: 914 DAG size of output: 1 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-29 04:55:15,998 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-29 04:55:15,999 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-29 04:55:15,999 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-29 04:55:15,999 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-29 04:55:15,999 INFO L895 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse16 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse16 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse5 (bvsge .cse17 (_ bv1 32))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse13 (select .cse16 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse7 (bvsle .cse17 (_ bv1 32))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse16 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse9 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= (select .cse16 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse10 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (let ((.cse15 (select (select |#memory_int#3| |~#float_Array_0~0.base|) (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse11 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (fp.leq .cse3 (fp.neg .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (fp.geq .cse3 (fp.neg .cse12)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse13))) (and .cse0 .cse1 .cse2 .cse5 (fp.leq .cse3 .cse12) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) .cse6 .cse7 .cse8 .cse9 .cse10 (fp.geq .cse3 .cse4) .cse11))))) [2023-11-29 04:55:15,999 INFO L899 garLoopResultBuilder]: For program point L85-1(line 85) no Hoare annotation was computed. [2023-11-29 04:55:15,999 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-29 04:55:16,000 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-29 04:55:16,000 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-29 04:55:16,000 INFO L895 garLoopResultBuilder]: At program point L102(line 102) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse16 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse16 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse5 (bvsge .cse17 (_ bv1 32))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse13 (select .cse16 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse7 (bvsle .cse17 (_ bv1 32))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse16 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse9 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= (select .cse16 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse10 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (let ((.cse15 (select (select |#memory_int#3| |~#float_Array_0~0.base|) (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse11 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (fp.leq .cse3 (fp.neg .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (fp.geq .cse3 (fp.neg .cse12)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse13))) (and .cse0 .cse1 .cse2 .cse5 (fp.leq .cse3 .cse12) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) .cse6 .cse7 .cse8 .cse9 .cse10 (fp.geq .cse3 .cse4) .cse11))))) [2023-11-29 04:55:16,000 INFO L899 garLoopResultBuilder]: For program point L102-1(line 102) no Hoare annotation was computed. [2023-11-29 04:55:16,000 INFO L895 garLoopResultBuilder]: At program point L103(line 103) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse16 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse16 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse5 (bvsge .cse17 (_ bv1 32))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse13 (select .cse16 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse7 (bvsle .cse17 (_ bv1 32))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse16 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse9 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= (select .cse16 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse10 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (let ((.cse15 (select (select |#memory_int#3| |~#float_Array_0~0.base|) (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse11 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (fp.leq .cse3 (fp.neg .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (fp.geq .cse3 (fp.neg .cse12)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse13))) (and .cse0 .cse1 .cse2 .cse5 (fp.leq .cse3 .cse12) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) .cse6 .cse7 .cse8 .cse9 .cse10 (fp.geq .cse3 .cse4) .cse11))))) [2023-11-29 04:55:16,001 INFO L895 garLoopResultBuilder]: At program point L70(line 70) the Hoare annotation is: (let ((.cse2 (select |#memory_int#3| |~#float_Array_0~0.base|))) (let ((.cse3 (let ((.cse18 (select .cse2 (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse18) ((_ extract 30 23) .cse18) ((_ extract 22 0) .cse18)))) (.cse4 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse0 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse0 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|)))) (= currentRoundingMode roundNearestTiesToEven) (fp.eq (let ((.cse1 (select .cse2 |~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) .cse3) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)) (let ((.cse8 (select .cse0 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse6 (select .cse0 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)))) (let ((.cse5 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse0 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse9 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse0 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse10 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse0 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse11 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= .cse6 ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse12 (= ((_ extract 7 0) (select .cse4 |~#BOOL_unsigned_char_Array_0~0.offset|)) |ULTIMATE.start_updateVariables_#t~mem41#1|)) (.cse7 ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 |~#unsigned_char_Array_0~0.offset|)))) (.cse13 (let ((.cse15 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse17 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and .cse15 (exists ((|v_skolemized_q#valueAsBitvector_19| (_ BitVec 64))) (let ((.cse16 (select |#memory_int#2| |~#double_Array_0~0.base|))) (and (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_19|) (select .cse16 |~#double_Array_0~0.offset|)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_19|) (select .cse16 (bvadd |~#double_Array_0~0.offset| (_ bv4 32)))) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_19|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_19|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_19|)) ((_ to_fp 11 53) currentRoundingMode (/ 10000000000000009.0 1000000000000000000.0)))))) (fp.leq .cse3 (fp.neg ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (fp.geq .cse3 (fp.neg .cse17))) (and .cse15 (fp.leq .cse3 .cse17) (fp.geq .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))))))) (.cse14 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse8)))) (or (and .cse5 (= ((_ zero_extend 24) ((_ extract 7 0) .cse6)) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse7 ((_ zero_extend 24) ((_ extract 7 0) .cse8)))))) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse5 .cse9 .cse10 .cse11 .cse12 (not (bvsgt .cse7 ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))))))) .cse13 .cse14))))))) [2023-11-29 04:55:16,001 INFO L899 garLoopResultBuilder]: For program point L103-1(line 103) no Hoare annotation was computed. [2023-11-29 04:55:16,001 INFO L899 garLoopResultBuilder]: For program point L70-1(line 70) no Hoare annotation was computed. [2023-11-29 04:55:16,001 INFO L895 garLoopResultBuilder]: At program point L87(line 87) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse16 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse16 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse5 (bvsge .cse17 (_ bv1 32))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse13 (select .cse16 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse7 (bvsle .cse17 (_ bv1 32))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse16 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse9 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= (select .cse16 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse10 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (let ((.cse15 (select (select |#memory_int#3| |~#float_Array_0~0.base|) (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse11 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (fp.leq .cse3 (fp.neg .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (fp.geq .cse3 (fp.neg .cse12)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse13))) (and .cse0 .cse1 .cse2 .cse5 (fp.leq .cse3 .cse12) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) .cse6 .cse7 .cse8 .cse9 .cse10 (fp.geq .cse3 .cse4) .cse11))))) [2023-11-29 04:55:16,001 INFO L899 garLoopResultBuilder]: For program point L87-1(line 87) no Hoare annotation was computed. [2023-11-29 04:55:16,002 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (let ((.cse0 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|)) (.cse19 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse0 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|)))) (= currentRoundingMode roundNearestTiesToEven) (let ((.cse11 (select .cse0 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse10 (select .cse0 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|))) (.cse12 ((_ extract 7 0) (select .cse19 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (let ((.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse0 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse2 (bvsge ((_ zero_extend 24) .cse12) (_ bv1 32))) (.cse8 ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 |~#unsigned_char_Array_0~0.offset|)))) (.cse3 (let ((.cse18 (select |#memory_int#3| |~#float_Array_0~0.base|))) (let ((.cse15 (let ((.cse20 (select .cse18 (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse20) ((_ extract 30 23) .cse20) ((_ extract 22 0) .cse20))))) (let ((.cse13 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse19 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse16 (= .cse15 (let ((.cse17 (select .cse18 |~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse17) ((_ extract 30 23) .cse17) ((_ extract 22 0) .cse17)))))) (or (and .cse13 (exists ((|v_skolemized_q#valueAsBitvector_19| (_ BitVec 64))) (let ((.cse14 (select |#memory_int#2| |~#double_Array_0~0.base|))) (and (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_19|) (select .cse14 |~#double_Array_0~0.offset|)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_19|) (select .cse14 (bvadd |~#double_Array_0~0.offset| (_ bv4 32)))) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_19|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_19|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_19|)) ((_ to_fp 11 53) currentRoundingMode (/ 10000000000000009.0 1000000000000000000.0)))))) (fp.geq .cse15 (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) .cse16 (fp.leq .cse15 (fp.neg ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))))) (and .cse13 .cse16 (fp.leq .cse15 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (fp.geq .cse15 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))))))))) (.cse4 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse0 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse5 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse0 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse6 (= .cse12 |ULTIMATE.start_updateVariables_#t~mem42#1|)) (.cse7 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= .cse10 ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse9 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse11)))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (bvsgt .cse8 ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))))))) .cse9) (and .cse1 .cse2 (= ((_ zero_extend 24) ((_ extract 7 0) .cse10)) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse8 ((_ zero_extend 24) ((_ extract 7 0) .cse11)))))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse9)))) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse19 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) [2023-11-29 04:55:16,002 INFO L899 garLoopResultBuilder]: For program point L71-1(line 71) no Hoare annotation was computed. [2023-11-29 04:55:16,002 INFO L895 garLoopResultBuilder]: At program point L88(line 88) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse16 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse16 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse5 (bvsge .cse17 (_ bv1 32))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse13 (select .cse16 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse7 (bvsle .cse17 (_ bv1 32))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse16 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse9 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= (select .cse16 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse10 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (let ((.cse15 (select (select |#memory_int#3| |~#float_Array_0~0.base|) (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse11 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (fp.leq .cse3 (fp.neg .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (fp.geq .cse3 (fp.neg .cse12)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse13))) (and .cse0 .cse1 .cse2 .cse5 (fp.leq .cse3 .cse12) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) .cse6 .cse7 .cse8 .cse9 .cse10 (fp.geq .cse3 .cse4) .cse11))))) [2023-11-29 04:55:16,002 INFO L899 garLoopResultBuilder]: For program point L88-1(line 88) no Hoare annotation was computed. [2023-11-29 04:55:16,002 INFO L899 garLoopResultBuilder]: For program point L55(lines 55 63) no Hoare annotation was computed. [2023-11-29 04:55:16,002 INFO L895 garLoopResultBuilder]: At program point L105(line 105) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse16 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse16 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse5 (bvsge .cse17 (_ bv1 32))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse13 (select .cse16 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse7 (bvsle .cse17 (_ bv1 32))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse16 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse9 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= (select .cse16 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse10 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (let ((.cse15 (select (select |#memory_int#3| |~#float_Array_0~0.base|) (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse11 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (fp.leq .cse3 (fp.neg .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (fp.geq .cse3 (fp.neg .cse12)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse13))) (and .cse0 .cse1 .cse2 .cse5 (fp.leq .cse3 .cse12) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) .cse6 .cse7 .cse8 .cse9 .cse10 (fp.geq .cse3 .cse4) .cse11))))) [2023-11-29 04:55:16,002 INFO L899 garLoopResultBuilder]: For program point L105-1(line 105) no Hoare annotation was computed. [2023-11-29 04:55:16,002 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2023-11-29 04:55:16,002 INFO L899 garLoopResultBuilder]: For program point L56-2(line 56) no Hoare annotation was computed. [2023-11-29 04:55:16,003 INFO L895 garLoopResultBuilder]: At program point L106(line 106) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse16 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse16 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse5 (bvsge .cse17 (_ bv1 32))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse13 (select .cse16 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse7 (bvsle .cse17 (_ bv1 32))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse16 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse9 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= (select .cse16 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse10 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (let ((.cse15 (select (select |#memory_int#3| |~#float_Array_0~0.base|) (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse11 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (fp.leq .cse3 (fp.neg .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (fp.geq .cse3 (fp.neg .cse12)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse13))) (and .cse0 .cse1 .cse2 .cse5 (fp.leq .cse3 .cse12) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) .cse6 .cse7 .cse8 .cse9 .cse10 (fp.geq .cse3 .cse4) .cse11))))) [2023-11-29 04:55:16,003 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (let ((.cse18 (select |#memory_int#3| |~#float_Array_0~0.base|))) (let ((.cse0 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|)) (.cse14 (let ((.cse19 (select .cse18 (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse19) ((_ extract 30 23) .cse19) ((_ extract 22 0) .cse19))))) (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse0 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|)))) (let ((.cse16 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse6 (select .cse0 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse4 (select .cse0 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|))) (.cse12 ((_ zero_extend 24) ((_ extract 7 0) (select .cse16 |~#BOOL_unsigned_char_Array_0~0.offset|))))) (let ((.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse0 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse2 (bvsge .cse12 (_ bv1 32))) (.cse3 (let ((.cse13 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse16 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32)))) (or (and .cse13 (fp.leq .cse14 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (fp.geq .cse14 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (and .cse13 (fp.geq .cse14 (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (fp.leq .cse14 (fp.neg ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (exists ((|v_skolemized_q#valueAsBitvector_53| (_ BitVec 64))) (let ((.cse15 (select |#memory_int#2| |~#double_Array_0~0.base|))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_53|) (select .cse15 (bvadd |~#double_Array_0~0.offset| (_ bv4 32)))) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_53|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_53|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_53|)) ((_ to_fp 11 53) currentRoundingMode (/ 10000000000000009.0 1000000000000000000.0))) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_53|) (select .cse15 |~#double_Array_0~0.offset|))))))))) (.cse7 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse0 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse8 (bvsle .cse12 (_ bv1 32))) (.cse9 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse0 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse10 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= .cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse5 ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 |~#unsigned_char_Array_0~0.offset|)))) (.cse11 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse6)))) (or (and .cse1 .cse2 .cse3 (= ((_ zero_extend 24) ((_ extract 7 0) .cse4)) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse6)))))) .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse2 .cse3 .cse7 .cse8 .cse9 .cse10 (not (bvsgt .cse5 ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))))))) .cse11))))) (= currentRoundingMode roundNearestTiesToEven) (fp.eq (let ((.cse17 (select .cse18 |~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse17) ((_ extract 30 23) .cse17) ((_ extract 22 0) .cse17))) .cse14)))) [2023-11-29 04:55:16,003 INFO L899 garLoopResultBuilder]: For program point L106-1(line 106) no Hoare annotation was computed. [2023-11-29 04:55:16,003 INFO L899 garLoopResultBuilder]: For program point L73-1(line 73) no Hoare annotation was computed. [2023-11-29 04:55:16,003 INFO L895 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse16 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse16 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse5 (bvsge .cse17 (_ bv1 32))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse13 (select .cse16 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse7 (bvsle .cse17 (_ bv1 32))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse16 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse9 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= (select .cse16 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse10 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (let ((.cse15 (select (select |#memory_int#3| |~#float_Array_0~0.base|) (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse11 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (fp.leq .cse3 (fp.neg .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (fp.geq .cse3 (fp.neg .cse12)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse13))) (and .cse0 .cse1 .cse2 .cse5 (fp.leq .cse3 .cse12) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) .cse6 .cse7 .cse8 .cse9 .cse10 (fp.geq .cse3 .cse4) .cse11))))) [2023-11-29 04:55:16,003 INFO L899 garLoopResultBuilder]: For program point L90-1(line 90) no Hoare annotation was computed. [2023-11-29 04:55:16,004 INFO L895 garLoopResultBuilder]: At program point L74(line 74) the Hoare annotation is: (let ((.cse18 (select |#memory_int#3| |~#float_Array_0~0.base|))) (let ((.cse1 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse0 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|)) (.cse15 (let ((.cse19 (select .cse18 (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse19) ((_ extract 30 23) .cse19) ((_ extract 22 0) .cse19))))) (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse0 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|)))) (= ((_ extract 7 0) (select .cse1 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|))) |ULTIMATE.start_updateVariables_#t~mem45#1|) (let ((.cse7 (select .cse0 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse5 (select .cse0 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|))) (.cse13 ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 |~#BOOL_unsigned_char_Array_0~0.offset|))))) (let ((.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse0 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse3 (bvsge .cse13 (_ bv1 32))) (.cse4 (let ((.cse14 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32)))) (or (and .cse14 (fp.leq .cse15 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (fp.geq .cse15 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (and .cse14 (fp.geq .cse15 (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (fp.leq .cse15 (fp.neg ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (exists ((|v_skolemized_q#valueAsBitvector_53| (_ BitVec 64))) (let ((.cse16 (select |#memory_int#2| |~#double_Array_0~0.base|))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_53|) (select .cse16 (bvadd |~#double_Array_0~0.offset| (_ bv4 32)))) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_53|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_53|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_53|)) ((_ to_fp 11 53) currentRoundingMode (/ 10000000000000009.0 1000000000000000000.0))) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_53|) (select .cse16 |~#double_Array_0~0.offset|))))))))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse0 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse9 (bvsle .cse13 (_ bv1 32))) (.cse10 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse0 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse11 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= .cse5 ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse6 ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 |~#unsigned_char_Array_0~0.offset|)))) (.cse12 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse7)))) (or (and .cse2 .cse3 .cse4 (= ((_ zero_extend 24) ((_ extract 7 0) .cse5)) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse6 ((_ zero_extend 24) ((_ extract 7 0) .cse7)))))) .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse2 .cse3 .cse4 .cse8 .cse9 .cse10 .cse11 (not (bvsgt .cse6 ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))))))) .cse12)))) (= currentRoundingMode roundNearestTiesToEven) (fp.eq (let ((.cse17 (select .cse18 |~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse17) ((_ extract 30 23) .cse17) ((_ extract 22 0) .cse17))) .cse15)))) [2023-11-29 04:55:16,004 INFO L899 garLoopResultBuilder]: For program point L74-1(line 74) no Hoare annotation was computed. [2023-11-29 04:55:16,004 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 04:55:16,004 INFO L895 garLoopResultBuilder]: At program point L91(line 91) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse16 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse16 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse5 (bvsge .cse17 (_ bv1 32))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse13 (select .cse16 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse7 (bvsle .cse17 (_ bv1 32))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse16 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse9 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= (select .cse16 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse10 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (let ((.cse15 (select (select |#memory_int#3| |~#float_Array_0~0.base|) (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse11 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (fp.leq .cse3 (fp.neg .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (fp.geq .cse3 (fp.neg .cse12)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse13))) (and .cse0 .cse1 .cse2 .cse5 (fp.leq .cse3 .cse12) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) .cse6 .cse7 .cse8 .cse9 .cse10 (fp.geq .cse3 .cse4) .cse11))))) [2023-11-29 04:55:16,004 INFO L899 garLoopResultBuilder]: For program point L91-1(line 91) no Hoare annotation was computed. [2023-11-29 04:55:16,005 INFO L899 garLoopResultBuilder]: For program point L58(lines 58 62) no Hoare annotation was computed. [2023-11-29 04:55:16,005 INFO L899 garLoopResultBuilder]: For program point L58-2(lines 55 63) no Hoare annotation was computed. [2023-11-29 04:55:16,005 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 67) no Hoare annotation was computed. [2023-11-29 04:55:16,005 INFO L895 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (let ((.cse0 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|)) (.cse12 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse0 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|)))) (let ((.cse5 (select .cse0 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse3 (select .cse0 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|))) (.cse11 ((_ zero_extend 24) ((_ extract 7 0) (select .cse12 |~#BOOL_unsigned_char_Array_0~0.offset|))))) (let ((.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse0 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse2 (bvsge .cse11 (_ bv1 32))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse0 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse7 (bvsle .cse11 (_ bv1 32))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse0 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse9 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= .cse3 ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse4 ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 |~#unsigned_char_Array_0~0.offset|)))) (.cse10 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse5)))) (or (and .cse1 .cse2 (= ((_ zero_extend 24) ((_ extract 7 0) .cse3)) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse4 ((_ zero_extend 24) ((_ extract 7 0) .cse5)))))) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse6 .cse7 .cse8 .cse9 (not (bvsgt .cse4 ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))))))) .cse10)))) (= currentRoundingMode roundNearestTiesToEven) (let ((.cse14 (select |#memory_int#3| |~#float_Array_0~0.base|))) (fp.eq (let ((.cse13 (select .cse14 |~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13))) (let ((.cse15 (select .cse14 (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15))))) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse12 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) [2023-11-29 04:55:16,005 INFO L899 garLoopResultBuilder]: For program point L76-1(line 76) no Hoare annotation was computed. [2023-11-29 04:55:16,005 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 47) no Hoare annotation was computed. [2023-11-29 04:55:16,005 INFO L899 garLoopResultBuilder]: For program point L43-2(lines 43 47) no Hoare annotation was computed. [2023-11-29 04:55:16,006 INFO L895 garLoopResultBuilder]: At program point L93(line 93) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse16 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse16 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse5 (bvsge .cse17 (_ bv1 32))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse13 (select .cse16 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse7 (bvsle .cse17 (_ bv1 32))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse16 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse9 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= (select .cse16 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse10 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (let ((.cse15 (select (select |#memory_int#3| |~#float_Array_0~0.base|) (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse11 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (fp.leq .cse3 (fp.neg .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (fp.geq .cse3 (fp.neg .cse12)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse13))) (and .cse0 .cse1 .cse2 .cse5 (fp.leq .cse3 .cse12) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) .cse6 .cse7 .cse8 .cse9 .cse10 (fp.geq .cse3 .cse4) .cse11))))) [2023-11-29 04:55:16,006 INFO L899 garLoopResultBuilder]: For program point L93-1(line 93) no Hoare annotation was computed. [2023-11-29 04:55:16,006 INFO L895 garLoopResultBuilder]: At program point L77(line 77) the Hoare annotation is: (let ((.cse0 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse1 (select .cse0 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse14 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse0 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|)))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse1 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) (= currentRoundingMode roundNearestTiesToEven) (let ((.cse3 (select |#memory_int#3| |~#float_Array_0~0.base|))) (fp.eq (let ((.cse2 (select .cse3 |~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (select .cse3 (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (let ((.cse13 (select .cse0 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|))) (.cse15 ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 |~#BOOL_unsigned_char_Array_0~0.offset|))))) (let ((.cse5 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse0 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse6 (bvsge .cse15 (_ bv1 32))) (.cse11 ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 |~#unsigned_char_Array_0~0.offset|)))) (.cse7 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse0 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse8 (bvsle .cse15 (_ bv1 32))) (.cse9 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse0 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse10 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= .cse13 ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse12 (= |ULTIMATE.start_updateVariables_#t~mem48#1| ((_ extract 7 0) (select .cse14 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))))) (or (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (bvsgt .cse11 ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))))))) .cse12) (and .cse5 .cse6 (= ((_ zero_extend 24) ((_ extract 7 0) .cse13)) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse11 ((_ zero_extend 24) ((_ extract 7 0) .cse1)))))) .cse7 .cse8 .cse9 .cse10 .cse12)))) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32))))) [2023-11-29 04:55:16,006 INFO L899 garLoopResultBuilder]: For program point L77-1(line 77) no Hoare annotation was computed. [2023-11-29 04:55:16,007 INFO L899 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2023-11-29 04:55:16,007 INFO L899 garLoopResultBuilder]: For program point L44-2(line 44) no Hoare annotation was computed. [2023-11-29 04:55:16,007 INFO L895 garLoopResultBuilder]: At program point L94(line 94) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse16 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse16 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse5 (bvsge .cse17 (_ bv1 32))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse13 (select .cse16 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse7 (bvsle .cse17 (_ bv1 32))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse16 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse9 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= (select .cse16 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse10 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (let ((.cse15 (select (select |#memory_int#3| |~#float_Array_0~0.base|) (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse11 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (fp.leq .cse3 (fp.neg .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (fp.geq .cse3 (fp.neg .cse12)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse13))) (and .cse0 .cse1 .cse2 .cse5 (fp.leq .cse3 .cse12) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) .cse6 .cse7 .cse8 .cse9 .cse10 (fp.geq .cse3 .cse4) .cse11))))) [2023-11-29 04:55:16,007 INFO L899 garLoopResultBuilder]: For program point L94-1(line 94) no Hoare annotation was computed. [2023-11-29 04:55:16,007 INFO L899 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2023-11-29 04:55:16,007 INFO L899 garLoopResultBuilder]: For program point L111-1(line 111) no Hoare annotation was computed. [2023-11-29 04:55:16,007 INFO L899 garLoopResultBuilder]: For program point L111-3(line 111) no Hoare annotation was computed. [2023-11-29 04:55:16,007 INFO L899 garLoopResultBuilder]: For program point L111-5(line 111) no Hoare annotation was computed. [2023-11-29 04:55:16,008 INFO L899 garLoopResultBuilder]: For program point L111-7(line 111) no Hoare annotation was computed. [2023-11-29 04:55:16,008 INFO L899 garLoopResultBuilder]: For program point L111-8(line 111) no Hoare annotation was computed. [2023-11-29 04:55:16,008 INFO L899 garLoopResultBuilder]: For program point L111-9(line 111) no Hoare annotation was computed. [2023-11-29 04:55:16,008 INFO L899 garLoopResultBuilder]: For program point L111-10(line 111) no Hoare annotation was computed. [2023-11-29 04:55:16,008 INFO L899 garLoopResultBuilder]: For program point L111-12(line 111) no Hoare annotation was computed. [2023-11-29 04:55:16,008 INFO L899 garLoopResultBuilder]: For program point L111-14(line 111) no Hoare annotation was computed. [2023-11-29 04:55:16,008 INFO L899 garLoopResultBuilder]: For program point L111-16(line 111) no Hoare annotation was computed. [2023-11-29 04:55:16,008 INFO L899 garLoopResultBuilder]: For program point L111-17(line 111) no Hoare annotation was computed. [2023-11-29 04:55:16,008 INFO L899 garLoopResultBuilder]: For program point L111-18(line 111) no Hoare annotation was computed. [2023-11-29 04:55:16,008 INFO L899 garLoopResultBuilder]: For program point L111-19(line 111) no Hoare annotation was computed. [2023-11-29 04:55:16,008 INFO L899 garLoopResultBuilder]: For program point L111-21(line 111) no Hoare annotation was computed. [2023-11-29 04:55:16,009 INFO L899 garLoopResultBuilder]: For program point L111-23(line 111) no Hoare annotation was computed. [2023-11-29 04:55:16,009 INFO L899 garLoopResultBuilder]: For program point L111-25(line 111) no Hoare annotation was computed. [2023-11-29 04:55:16,009 INFO L899 garLoopResultBuilder]: For program point L111-26(line 111) no Hoare annotation was computed. [2023-11-29 04:55:16,009 INFO L899 garLoopResultBuilder]: For program point L111-27(line 111) no Hoare annotation was computed. [2023-11-29 04:55:16,009 INFO L899 garLoopResultBuilder]: For program point L111-29(line 111) no Hoare annotation was computed. [2023-11-29 04:55:16,009 INFO L899 garLoopResultBuilder]: For program point L111-31(line 111) no Hoare annotation was computed. [2023-11-29 04:55:16,009 INFO L899 garLoopResultBuilder]: For program point L79(line 79) no Hoare annotation was computed. [2023-11-29 04:55:16,009 INFO L899 garLoopResultBuilder]: For program point L111-32(line 111) no Hoare annotation was computed. [2023-11-29 04:55:16,009 INFO L899 garLoopResultBuilder]: For program point L79-2(line 79) no Hoare annotation was computed. [2023-11-29 04:55:16,009 INFO L899 garLoopResultBuilder]: For program point L111-34(line 111) no Hoare annotation was computed. [2023-11-29 04:55:16,009 INFO L899 garLoopResultBuilder]: For program point L79-3(line 79) no Hoare annotation was computed. [2023-11-29 04:55:16,009 INFO L899 garLoopResultBuilder]: For program point L111-36(line 111) no Hoare annotation was computed. [2023-11-29 04:55:16,010 INFO L899 garLoopResultBuilder]: For program point L79-5(line 79) no Hoare annotation was computed. [2023-11-29 04:55:16,010 INFO L899 garLoopResultBuilder]: For program point L111-37(line 111) no Hoare annotation was computed. [2023-11-29 04:55:16,010 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 04:55:16,010 INFO L899 garLoopResultBuilder]: For program point L79-7(line 79) no Hoare annotation was computed. [2023-11-29 04:55:16,010 INFO L899 garLoopResultBuilder]: For program point L111-39(line 111) no Hoare annotation was computed. [2023-11-29 04:55:16,010 INFO L895 garLoopResultBuilder]: At program point L79-8(line 79) the Hoare annotation is: (let ((.cse28 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse13 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse15 (select .cse13 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|))) (.cse27 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse19 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse29 ((_ zero_extend 24) ((_ extract 7 0) (select .cse28 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse18 (let ((.cse31 (select (select |#memory_int#3| |~#float_Array_0~0.base|) (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse31) ((_ extract 30 23) .cse31) ((_ extract 22 0) .cse31)))) (.cse24 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (let ((.cse14 (fp.geq .cse18 (fp.neg .cse24))) (.cse0 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse13 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse5 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse13 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse7 (bvsge .cse29 (_ bv1 32))) (.cse20 (let ((.cse30 (fp.geq .cse18 (fp.neg .cse19)))) (or (and (not |ULTIMATE.start_updateVariables_#t~short52#1|) (not .cse30)) (and |ULTIMATE.start_updateVariables_#t~short52#1| .cse30)))) (.cse4 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse28 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse6 (fp.leq .cse18 (fp.neg .cse27))) (.cse17 (not |ULTIMATE.start_updateVariables_#t~short55#1|)) (.cse16 (not |ULTIMATE.start_updateVariables_#t~short56#1|)) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse13 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse9 (bvsle .cse29 (_ bv1 32))) (.cse10 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse13 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse11 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= .cse15 ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse2 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse28 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32))) (.cse1 (select .cse13 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|)))) (or (and .cse0 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse1 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) .cse2 .cse3 (let ((.cse12 ((_ zero_extend 24) ((_ extract 7 0) (select .cse13 |~#unsigned_char_Array_0~0.offset|))))) (or (and .cse4 .cse5 .cse6 .cse7 |ULTIMATE.start_updateVariables_#t~short52#1| |ULTIMATE.start_updateVariables_#t~short56#1| .cse8 .cse9 .cse10 .cse11 (not (bvsgt .cse12 ((_ zero_extend 24) ((_ extract 7 0) (select .cse13 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))))))) .cse14) (and .cse4 .cse5 .cse6 .cse7 |ULTIMATE.start_updateVariables_#t~short52#1| |ULTIMATE.start_updateVariables_#t~short56#1| (= ((_ zero_extend 24) ((_ extract 7 0) .cse15)) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse12 ((_ zero_extend 24) ((_ extract 7 0) .cse1)))))) .cse8 .cse9 .cse10 .cse11 .cse14)))) (and .cse4 .cse16 .cse17 (not (fp.leq .cse18 .cse19)) .cse2 (or (and .cse7 .cse9 .cse14) (and .cse7 .cse20 .cse9))) (and .cse0 .cse5 .cse7 (let ((.cse25 (fp.geq .cse18 .cse27))) (let ((.cse26 (not .cse25))) (let ((.cse21 (or (and .cse16 .cse26) (and |ULTIMATE.start_updateVariables_#t~short56#1| .cse25))) (.cse22 (or (and |ULTIMATE.start_updateVariables_#t~short55#1| .cse25) (and .cse17 .cse26))) (.cse23 (fp.leq .cse18 .cse24))) (or (and .cse4 .cse21 .cse22 .cse20 .cse23) (and .cse4 .cse21 .cse22 .cse23 (not .cse6)))))) .cse8 .cse9 .cse10 .cse11 .cse2 .cse3 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse1))))))) [2023-11-29 04:55:16,011 INFO L899 garLoopResultBuilder]: For program point L111-40(line 111) no Hoare annotation was computed. [2023-11-29 04:55:16,011 INFO L899 garLoopResultBuilder]: For program point L79-9(line 79) no Hoare annotation was computed. [2023-11-29 04:55:16,011 INFO L899 garLoopResultBuilder]: For program point L111-42(line 111) no Hoare annotation was computed. [2023-11-29 04:55:16,011 INFO L899 garLoopResultBuilder]: For program point L111-43(line 111) no Hoare annotation was computed. [2023-11-29 04:55:16,011 INFO L899 garLoopResultBuilder]: For program point L111-45(line 111) no Hoare annotation was computed. [2023-11-29 04:55:16,011 INFO L895 garLoopResultBuilder]: At program point L96(line 96) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse16 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse16 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse5 (bvsge .cse17 (_ bv1 32))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse13 (select .cse16 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse7 (bvsle .cse17 (_ bv1 32))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse16 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse9 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= (select .cse16 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse10 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (let ((.cse15 (select (select |#memory_int#3| |~#float_Array_0~0.base|) (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse11 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (fp.leq .cse3 (fp.neg .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (fp.geq .cse3 (fp.neg .cse12)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse13))) (and .cse0 .cse1 .cse2 .cse5 (fp.leq .cse3 .cse12) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) .cse6 .cse7 .cse8 .cse9 .cse10 (fp.geq .cse3 .cse4) .cse11))))) [2023-11-29 04:55:16,011 INFO L899 garLoopResultBuilder]: For program point L96-1(line 96) no Hoare annotation was computed. [2023-11-29 04:55:16,012 INFO L895 garLoopResultBuilder]: At program point L97(line 97) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse16 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse16 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse5 (bvsge .cse17 (_ bv1 32))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse13 (select .cse16 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse7 (bvsle .cse17 (_ bv1 32))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse16 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse9 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= (select .cse16 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse10 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (let ((.cse15 (select (select |#memory_int#3| |~#float_Array_0~0.base|) (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse11 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (fp.leq .cse3 (fp.neg .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (fp.geq .cse3 (fp.neg .cse12)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse13))) (and .cse0 .cse1 .cse2 .cse5 (fp.leq .cse3 .cse12) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) .cse6 .cse7 .cse8 .cse9 .cse10 (fp.geq .cse3 .cse4) .cse11))))) [2023-11-29 04:55:16,012 INFO L899 garLoopResultBuilder]: For program point L97-1(line 97) no Hoare annotation was computed. [2023-11-29 04:55:16,012 INFO L899 garLoopResultBuilder]: For program point L64(line 64) no Hoare annotation was computed. [2023-11-29 04:55:16,012 INFO L899 garLoopResultBuilder]: For program point L64-2(lines 64 66) no Hoare annotation was computed. [2023-11-29 04:55:16,012 INFO L895 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse16 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse16 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse5 (bvsge .cse17 (_ bv1 32))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse13 (select .cse16 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse7 (bvsle .cse17 (_ bv1 32))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse16 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse9 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= (select .cse16 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse10 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (let ((.cse15 (select (select |#memory_int#3| |~#float_Array_0~0.base|) (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse11 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (fp.leq .cse3 (fp.neg .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (fp.geq .cse3 (fp.neg .cse12)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse13))) (and .cse0 .cse1 .cse2 .cse5 (fp.leq .cse3 .cse12) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) .cse6 .cse7 .cse8 .cse9 .cse10 (fp.geq .cse3 .cse4) .cse11))))) [2023-11-29 04:55:16,012 INFO L899 garLoopResultBuilder]: For program point L81-1(line 81) no Hoare annotation was computed. [2023-11-29 04:55:16,013 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2023-11-29 04:55:16,013 INFO L899 garLoopResultBuilder]: For program point L48-2(line 48) no Hoare annotation was computed. [2023-11-29 04:55:16,013 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-29 04:55:16,013 INFO L895 garLoopResultBuilder]: At program point L82(line 82) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse16 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse16 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse5 (bvsge .cse17 (_ bv1 32))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse13 (select .cse16 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse7 (bvsle .cse17 (_ bv1 32))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse16 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse9 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= (select .cse16 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse10 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (let ((.cse15 (select (select |#memory_int#3| |~#float_Array_0~0.base|) (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse11 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (fp.leq .cse3 (fp.neg .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (fp.geq .cse3 (fp.neg .cse12)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse13))) (and .cse0 .cse1 .cse2 .cse5 (fp.leq .cse3 .cse12) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) .cse6 .cse7 .cse8 .cse9 .cse10 (fp.geq .cse3 .cse4) .cse11))))) [2023-11-29 04:55:16,013 INFO L899 garLoopResultBuilder]: For program point L82-1(line 82) no Hoare annotation was computed. [2023-11-29 04:55:16,013 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 51) no Hoare annotation was computed. [2023-11-29 04:55:16,013 INFO L899 garLoopResultBuilder]: For program point L49-2(lines 49 51) no Hoare annotation was computed. [2023-11-29 04:55:16,014 INFO L895 garLoopResultBuilder]: At program point L99(line 99) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse16 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse16 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse5 (bvsge .cse17 (_ bv1 32))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse13 (select .cse16 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse7 (bvsle .cse17 (_ bv1 32))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse16 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse9 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= (select .cse16 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse10 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (let ((.cse15 (select (select |#memory_int#3| |~#float_Array_0~0.base|) (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse11 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (fp.leq .cse3 (fp.neg .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (fp.geq .cse3 (fp.neg .cse12)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse13))) (and .cse0 .cse1 .cse2 .cse5 (fp.leq .cse3 .cse12) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) .cse6 .cse7 .cse8 .cse9 .cse10 (fp.geq .cse3 .cse4) .cse11))))) [2023-11-29 04:55:16,014 INFO L899 garLoopResultBuilder]: For program point L99-1(line 99) no Hoare annotation was computed. [2023-11-29 04:55:16,014 INFO L895 garLoopResultBuilder]: At program point L100(line 100) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse16 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse16 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse5 (bvsge .cse17 (_ bv1 32))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse13 (select .cse16 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse7 (bvsle .cse17 (_ bv1 32))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse16 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse9 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= (select .cse16 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse10 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (let ((.cse15 (select (select |#memory_int#3| |~#float_Array_0~0.base|) (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse11 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (fp.leq .cse3 (fp.neg .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (fp.geq .cse3 (fp.neg .cse12)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse13))) (and .cse0 .cse1 .cse2 .cse5 (fp.leq .cse3 .cse12) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) .cse6 .cse7 .cse8 .cse9 .cse10 (fp.geq .cse3 .cse4) .cse11))))) [2023-11-29 04:55:16,014 INFO L899 garLoopResultBuilder]: For program point L100-1(line 100) no Hoare annotation was computed. [2023-11-29 04:55:16,015 INFO L895 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse16 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse16 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse5 (bvsge .cse17 (_ bv1 32))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse13 (select .cse16 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse7 (bvsle .cse17 (_ bv1 32))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse16 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse9 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= (select .cse16 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse10 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (let ((.cse15 (select (select |#memory_int#3| |~#float_Array_0~0.base|) (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse11 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (fp.leq .cse3 (fp.neg .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (fp.geq .cse3 (fp.neg .cse12)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse13))) (and .cse0 .cse1 .cse2 .cse5 (fp.leq .cse3 .cse12) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) .cse6 .cse7 .cse8 .cse9 .cse10 (fp.geq .cse3 .cse4) .cse11))))) [2023-11-29 04:55:16,015 INFO L899 garLoopResultBuilder]: For program point L84-1(line 84) no Hoare annotation was computed. [2023-11-29 04:55:16,015 INFO L895 garLoopResultBuilder]: At program point L117-2(lines 117 123) the Hoare annotation is: (let ((.cse15 (select |#memory_int#3| |~#float_Array_0~0.base|)) (.cse0 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse8 (select .cse0 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse11 (let ((.cse16 (select .cse15 (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16)))) (.cse13 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse0 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|)))) (let ((.cse7 (select .cse0 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)))) (let ((.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse0 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse6 ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 |~#unsigned_char_Array_0~0.offset|)))) (.cse2 (let ((.cse9 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse13 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32)))) (or (let ((.cse10 ((_ zero_extend 24) ((_ extract 7 0) (select .cse13 |~#BOOL_unsigned_char_Array_0~0.offset|))))) (and .cse9 (bvsge .cse10 (_ bv1 32)) (fp.geq .cse11 (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (fp.leq .cse11 (fp.neg ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (bvsle .cse10 (_ bv1 32)) (exists ((|v_skolemized_q#valueAsBitvector_53| (_ BitVec 64))) (let ((.cse12 (select |#memory_int#2| |~#double_Array_0~0.base|))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_53|) (select .cse12 (bvadd |~#double_Array_0~0.offset| (_ bv4 32)))) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_53|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_53|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_53|)) ((_ to_fp 11 53) currentRoundingMode (/ 10000000000000009.0 1000000000000000000.0))) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_53|) (select .cse12 |~#double_Array_0~0.offset|))))))) (and .cse9 (fp.leq .cse11 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (fp.geq .cse11 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))))))) (.cse3 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse0 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse4 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse0 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse5 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= .cse7 ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|)))))))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 (not (bvsgt .cse6 ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))))))) (and .cse1 (= ((_ zero_extend 24) ((_ extract 7 0) .cse7)) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse6 ((_ zero_extend 24) ((_ extract 7 0) .cse8)))))) .cse2 .cse3 .cse4 .cse5)))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse8 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) (= currentRoundingMode roundNearestTiesToEven) (fp.eq (let ((.cse14 (select .cse15 |~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14))) .cse11) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse13 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32))))) [2023-11-29 04:55:16,016 INFO L899 garLoopResultBuilder]: For program point L117-3(lines 117 123) no Hoare annotation was computed. [2023-11-29 04:55:16,019 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:55:16,021 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:55:16,037 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet69#1_53 : bv8 :: ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet69#1_53) == #memory_int#5[~#unsigned_char_Array_0~0!base][~bvadd~32(6bv32, ~#unsigned_char_Array_0~0!offset)]) could not be translated [2023-11-29 04:55:16,038 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet78#1_47 : bv8 :: #memory_int#5[~#unsigned_char_Array_0~0!base][~bvadd~32(~#unsigned_char_Array_0~0!offset, 9bv32)] == ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet78#1_47)) could not be translated [2023-11-29 04:55:16,038 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(~#BOOL_unsigned_char_Array_0~0!offset, 1bv32)] could not be translated [2023-11-29 04:55:16,041 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated [2023-11-29 04:55:16,041 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated [2023-11-29 04:55:16,041 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated [2023-11-29 04:55:16,041 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated [2023-11-29 04:55:16,042 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ClassCastException: class de.uni_freiburg.informatik.ultimate.boogie.ast.BitVectorAccessExpression cannot be cast to class de.uni_freiburg.informatik.ultimate.boogie.ast.BitvecLiteral (de.uni_freiburg.informatik.ultimate.boogie.ast.BitVectorAccessExpression and de.uni_freiburg.informatik.ultimate.boogie.ast.BitvecLiteral are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @619bfe29) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateFunctionApplication(CACSL2BoogieBacktranslator.java:1188) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateExpression(CACSL2BoogieBacktranslator.java:1044) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateExpressionWithContext(CACSL2BoogieBacktranslator.java:950) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateFunctionApplication(CACSL2BoogieBacktranslator.java:1168) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateExpression(CACSL2BoogieBacktranslator.java:1044) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateBinaryExpression(CACSL2BoogieBacktranslator.java:1096) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateExpression(CACSL2BoogieBacktranslator.java:1034) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateBinaryExpression(CACSL2BoogieBacktranslator.java:1095) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateExpression(CACSL2BoogieBacktranslator.java:1034) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateBinaryExpression(CACSL2BoogieBacktranslator.java:1095) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateExpression(CACSL2BoogieBacktranslator.java:1034) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateBinaryExpression(CACSL2BoogieBacktranslator.java:1095) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateExpression(CACSL2BoogieBacktranslator.java:1034) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateBinaryExpression(CACSL2BoogieBacktranslator.java:1095) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateExpression(CACSL2BoogieBacktranslator.java:1034) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateBinaryExpression(CACSL2BoogieBacktranslator.java:1096) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateExpression(CACSL2BoogieBacktranslator.java:1034) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateBinaryExpression(CACSL2BoogieBacktranslator.java:1095) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateExpression(CACSL2BoogieBacktranslator.java:1034) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateBinaryExpression(CACSL2BoogieBacktranslator.java:1095) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateExpression(CACSL2BoogieBacktranslator.java:1034) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateBinaryExpression(CACSL2BoogieBacktranslator.java:1095) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateExpression(CACSL2BoogieBacktranslator.java:1034) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateBinaryExpression(CACSL2BoogieBacktranslator.java:1095) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateExpression(CACSL2BoogieBacktranslator.java:1034) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateBinaryExpression(CACSL2BoogieBacktranslator.java:1095) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateExpression(CACSL2BoogieBacktranslator.java:1034) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateBinaryExpression(CACSL2BoogieBacktranslator.java:1096) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateExpression(CACSL2BoogieBacktranslator.java:1034) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateBinaryExpression(CACSL2BoogieBacktranslator.java:1095) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateExpression(CACSL2BoogieBacktranslator.java:1034) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateBinaryExpression(CACSL2BoogieBacktranslator.java:1095) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateExpression(CACSL2BoogieBacktranslator.java:1034) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateBinaryExpression(CACSL2BoogieBacktranslator.java:1095) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateExpression(CACSL2BoogieBacktranslator.java:1034) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateBinaryExpression(CACSL2BoogieBacktranslator.java:1095) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateExpression(CACSL2BoogieBacktranslator.java:1034) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateExpressionWithContext(CACSL2BoogieBacktranslator.java:950) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateExpressionWithContext(CACSL2BoogieBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContext(ModelTranslationContainer.java:101) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContext(ModelTranslationContainer.java:101) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContext(ModelTranslationContainer.java:101) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContext(ModelTranslationContainer.java:101) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContextToString(ModelTranslationContainer.java:91) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.BacktranslationService.translateExpressionWithContextToString(BacktranslationService.java:98) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.(InvariantResult.java:47) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:191) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-29 04:55:16,047 INFO L158 Benchmark]: Toolchain (without parser) took 345018.82ms. Allocated memory was 69.2MB in the beginning and 1.0GB in the end (delta: 966.8MB). Free memory was 37.4MB in the beginning and 722.4MB in the end (delta: -685.0MB). Peak memory consumption was 625.6MB. Max. memory is 16.1GB. [2023-11-29 04:55:16,047 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 69.2MB. Free memory is still 45.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:55:16,048 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.32ms. Allocated memory is still 69.2MB. Free memory was 37.2MB in the beginning and 42.4MB in the end (delta: -5.2MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2023-11-29 04:55:16,048 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.54ms. Allocated memory is still 69.2MB. Free memory was 42.2MB in the beginning and 38.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 04:55:16,048 INFO L158 Benchmark]: Boogie Preprocessor took 106.28ms. Allocated memory is still 69.2MB. Free memory was 38.5MB in the beginning and 31.9MB in the end (delta: 6.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 04:55:16,048 INFO L158 Benchmark]: RCFGBuilder took 1304.39ms. Allocated memory was 69.2MB in the beginning and 94.4MB in the end (delta: 25.2MB). Free memory was 31.9MB in the beginning and 56.6MB in the end (delta: -24.6MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. [2023-11-29 04:55:16,049 INFO L158 Benchmark]: TraceAbstraction took 343152.48ms. Allocated memory was 94.4MB in the beginning and 1.0GB in the end (delta: 941.6MB). Free memory was 56.0MB in the beginning and 722.4MB in the end (delta: -666.4MB). Peak memory consumption was 618.7MB. Max. memory is 16.1GB. [2023-11-29 04:55:16,049 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.18ms. Allocated memory is still 69.2MB. Free memory is still 45.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 380.32ms. Allocated memory is still 69.2MB. Free memory was 37.2MB in the beginning and 42.4MB in the end (delta: -5.2MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.54ms. Allocated memory is still 69.2MB. Free memory was 42.2MB in the beginning and 38.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.28ms. Allocated memory is still 69.2MB. Free memory was 38.5MB in the beginning and 31.9MB in the end (delta: 6.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1304.39ms. Allocated memory was 69.2MB in the beginning and 94.4MB in the end (delta: 25.2MB). Free memory was 31.9MB in the beginning and 56.6MB in the end (delta: -24.6MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. * TraceAbstraction took 343152.48ms. Allocated memory was 94.4MB in the beginning and 1.0GB in the end (delta: 941.6MB). Free memory was 56.0MB in the beginning and 722.4MB in the end (delta: -666.4MB). Peak memory consumption was 618.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet69#1_53 : bv8 :: ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet69#1_53) == #memory_int#5[~#unsigned_char_Array_0~0!base][~bvadd~32(6bv32, ~#unsigned_char_Array_0~0!offset)]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet78#1_47 : bv8 :: #memory_int#5[~#unsigned_char_Array_0~0!base][~bvadd~32(~#unsigned_char_Array_0~0!offset, 9bv32)] == ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet78#1_47)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(~#BOOL_unsigned_char_Array_0~0!offset, 1bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 343.1s, OverallIterations: 34, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 80.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 162.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5574 SdHoareTripleChecker+Valid, 67.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5555 mSDsluCounter, 22453 SdHoareTripleChecker+Invalid, 63.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16768 mSDsCounter, 700 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8102 IncrementalHoareTripleChecker+Invalid, 8802 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 700 mSolverCounterUnsat, 5685 mSDtfsCounter, 8102 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9615 GetRequests, 9180 SyntacticMatches, 9 SemanticMatches, 426 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1507 ImplicationChecksByTransitivity, 40.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1103occurred in iteration=33, InterpolantAutomatonStates: 298, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 34 MinimizatonAttempts, 2136 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 1981 PreInvPairs, 2111 NumberOfFragments, 11106 HoareAnnotationTreeSize, 1981 FomulaSimplifications, 46044749 FormulaSimplificationTreeSizeReduction, 44.7s HoareSimplificationTime, 27 FomulaSimplificationsInter, 19564940 FormulaSimplificationTreeSizeReductionInter, 117.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.4s SsaConstructionTime, 9.5s SatisfiabilityAnalysisTime, 75.7s InterpolantComputationTime, 7051 NumberOfCodeBlocks, 7051 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 9298 ConstructedInterpolants, 804 QuantifiedInterpolants, 154137 SizeOfPredicates, 300 NumberOfNonLiveVariables, 14579 ConjunctsInSsa, 533 ConjunctsInUnsatCore, 49 InterpolantComputations, 28 PerfectInterpolantSequences, 53886/58800 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.boogie.ast.BitVectorAccessExpression cannot be cast to class de.uni_freiburg.informatik.ultimate.boogie.ast.BitvecLiteral (de.uni_freiburg.informatik.ultimate.boogie.ast.BitVectorAccessExpression and de.uni_freiburg.informatik.ultimate.boogie.ast.BitvecLiteral are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @619bfe29) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ClassCastException: class de.uni_freiburg.informatik.ultimate.boogie.ast.BitVectorAccessExpression cannot be cast to class de.uni_freiburg.informatik.ultimate.boogie.ast.BitvecLiteral (de.uni_freiburg.informatik.ultimate.boogie.ast.BitVectorAccessExpression and de.uni_freiburg.informatik.ultimate.boogie.ast.BitvecLiteral are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @619bfe29): de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateFunctionApplication(CACSL2BoogieBacktranslator.java:1188) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-29 04:55:16,199 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f732049e-6769-4970-9adf-4b27eb945272/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.boogie.ast.BitVectorAccessExpression cannot be cast to class de.uni_freiburg.informatik.ultimate.boogie.ast.BitvecLiteral (de.uni_freiburg.informatik.ultimate.boogie.ast.BitVectorAccessExpression and de.uni_freiburg.informatik.ultimate.boogie.ast.BitvecLiteral are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @619bfe29)