./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1 --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 ead5d8ae4343bf6b87a76c9a2e262d48ceac54d8db7ffa685d6fe68c13556445 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 11:39:16,465 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 11:39:16,520 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-12-02 11:39:16,525 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 11:39:16,525 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 11:39:16,547 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 11:39:16,547 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 11:39:16,547 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 11:39:16,548 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 11:39:16,548 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 11:39:16,548 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 11:39:16,548 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 11:39:16,548 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 11:39:16,549 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 11:39:16,549 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 11:39:16,549 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 11:39:16,549 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 11:39:16,549 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 11:39:16,549 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 11:39:16,549 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 11:39:16,549 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 11:39:16,549 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 11:39:16,550 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 11:39:16,550 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 11:39:16,550 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 11:39:16,550 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 11:39:16,550 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 11:39:16,550 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 11:39:16,550 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 11:39:16,550 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 11:39:16,550 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 11:39:16,551 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 11:39:16,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:39:16,551 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 11:39:16,551 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 11:39:16,551 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 11:39:16,551 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 11:39:16,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:39:16,551 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 11:39:16,551 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 11:39:16,551 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 11:39:16,552 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 11:39:16,552 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 11:39:16,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 11:39:16,552 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 11:39:16,552 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 11:39:16,552 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 11:39:16,552 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 11:39:16,552 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1 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 -> ead5d8ae4343bf6b87a76c9a2e262d48ceac54d8db7ffa685d6fe68c13556445 [2024-12-02 11:39:16,771 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 11:39:16,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 11:39:16,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 11:39:16,782 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 11:39:16,782 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 11:39:16,783 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i [2024-12-02 11:39:19,377 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/data/a306da289/2ae81f6f0d79416f8d11572a7e38529d/FLAGc7666ea3a [2024-12-02 11:39:19,608 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 11:39:19,609 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i [2024-12-02 11:39:19,616 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/data/a306da289/2ae81f6f0d79416f8d11572a7e38529d/FLAGc7666ea3a [2024-12-02 11:39:19,950 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/data/a306da289/2ae81f6f0d79416f8d11572a7e38529d [2024-12-02 11:39:19,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 11:39:19,953 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 11:39:19,954 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 11:39:19,954 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 11:39:19,958 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 11:39:19,958 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:39:19" (1/1) ... [2024-12-02 11:39:19,959 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38419a17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:39:19, skipping insertion in model container [2024-12-02 11:39:19,959 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:39:19" (1/1) ... [2024-12-02 11:39:19,976 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 11:39:20,077 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i[916,929] [2024-12-02 11:39:20,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 11:39:20,139 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 11:39:20,148 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i[916,929] [2024-12-02 11:39:20,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 11:39:20,203 INFO L204 MainTranslator]: Completed translation [2024-12-02 11:39:20,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:39:20 WrapperNode [2024-12-02 11:39:20,204 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 11:39:20,205 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 11:39:20,205 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 11:39:20,205 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 11:39:20,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:39:20" (1/1) ... [2024-12-02 11:39:20,220 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:39:20" (1/1) ... [2024-12-02 11:39:20,254 INFO L138 Inliner]: procedures = 30, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 580 [2024-12-02 11:39:20,255 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 11:39:20,255 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 11:39:20,255 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 11:39:20,255 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 11:39:20,262 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:39:20" (1/1) ... [2024-12-02 11:39:20,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:39:20" (1/1) ... [2024-12-02 11:39:20,268 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:39:20" (1/1) ... [2024-12-02 11:39:20,275 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-12-02 11:39:20,275 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:39:20" (1/1) ... [2024-12-02 11:39:20,275 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:39:20" (1/1) ... [2024-12-02 11:39:20,294 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:39:20" (1/1) ... [2024-12-02 11:39:20,296 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:39:20" (1/1) ... [2024-12-02 11:39:20,301 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:39:20" (1/1) ... [2024-12-02 11:39:20,304 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:39:20" (1/1) ... [2024-12-02 11:39:20,306 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:39:20" (1/1) ... [2024-12-02 11:39:20,310 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 11:39:20,311 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 11:39:20,311 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 11:39:20,311 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 11:39:20,312 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:39:20" (1/1) ... [2024-12-02 11:39:20,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:39:20,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:39:20,339 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 11:39:20,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 11:39:20,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 11:39:20,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-12-02 11:39:20,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-12-02 11:39:20,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-12-02 11:39:20,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-12-02 11:39:20,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-12-02 11:39:20,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-12-02 11:39:20,360 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-12-02 11:39:20,360 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-12-02 11:39:20,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-02 11:39:20,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 11:39:20,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 11:39:20,458 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 11:39:20,460 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 11:39:21,097 INFO L? ?]: Removed 161 outVars from TransFormulas that were not future-live. [2024-12-02 11:39:21,097 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 11:39:21,108 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 11:39:21,108 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-02 11:39:21,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:39:21 BoogieIcfgContainer [2024-12-02 11:39:21,109 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 11:39:21,111 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 11:39:21,111 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 11:39:21,115 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 11:39:21,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 11:39:19" (1/3) ... [2024-12-02 11:39:21,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cf704e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:39:21, skipping insertion in model container [2024-12-02 11:39:21,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:39:20" (2/3) ... [2024-12-02 11:39:21,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cf704e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:39:21, skipping insertion in model container [2024-12-02 11:39:21,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:39:21" (3/3) ... [2024-12-02 11:39:21,118 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-11.i [2024-12-02 11:39:21,133 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 11:39:21,134 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-11.i that has 2 procedures, 139 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-12-02 11:39:21,183 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 11:39:21,193 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=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;@25bec17e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 11:39:21,193 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-02 11:39:21,197 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 120 states have (on average 1.4666666666666666) internal successors, (176), 121 states have internal predecessors, (176), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-12-02 11:39:21,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-12-02 11:39:21,207 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:39:21,207 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:39:21,208 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:39:21,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:39:21,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1531865718, now seen corresponding path program 1 times [2024-12-02 11:39:21,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:39:21,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521829027] [2024-12-02 11:39:21,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:39:21,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:39:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:39:21,507 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-12-02 11:39:21,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:39:21,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521829027] [2024-12-02 11:39:21,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521829027] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:39:21,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470194475] [2024-12-02 11:39:21,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:39:21,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:39:21,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:39:21,511 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:39:21,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 11:39:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:39:21,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-12-02 11:39:21,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:39:21,784 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-12-02 11:39:21,784 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 11:39:21,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470194475] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:39:21,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 11:39:21,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-12-02 11:39:21,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519643820] [2024-12-02 11:39:21,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:39:21,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-02 11:39:21,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:39:21,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-02 11:39:21,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-02 11:39:21,809 INFO L87 Difference]: Start difference. First operand has 139 states, 120 states have (on average 1.4666666666666666) internal successors, (176), 121 states have internal predecessors, (176), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-12-02 11:39:21,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:39:21,838 INFO L93 Difference]: Finished difference Result 271 states and 426 transitions. [2024-12-02 11:39:21,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-02 11:39:21,839 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2024-12-02 11:39:21,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:39:21,845 INFO L225 Difference]: With dead ends: 271 [2024-12-02 11:39:21,845 INFO L226 Difference]: Without dead ends: 135 [2024-12-02 11:39:21,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-02 11:39:21,850 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:39:21,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:39:21,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-12-02 11:39:21,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-12-02 11:39:21,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 117 states have (on average 1.4444444444444444) internal successors, (169), 117 states have internal predecessors, (169), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-12-02 11:39:21,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 201 transitions. [2024-12-02 11:39:21,887 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 201 transitions. Word has length 133 [2024-12-02 11:39:21,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:39:21,888 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 201 transitions. [2024-12-02 11:39:21,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-12-02 11:39:21,888 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 201 transitions. [2024-12-02 11:39:21,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-12-02 11:39:21,891 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:39:21,891 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:39:21,898 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 11:39:22,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-12-02 11:39:22,092 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:39:22,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:39:22,093 INFO L85 PathProgramCache]: Analyzing trace with hash 736442078, now seen corresponding path program 1 times [2024-12-02 11:39:22,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:39:22,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47846333] [2024-12-02 11:39:22,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:39:22,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:39:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:39:22,479 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-12-02 11:39:22,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:39:22,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47846333] [2024-12-02 11:39:22,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47846333] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:39:22,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602485034] [2024-12-02 11:39:22,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:39:22,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:39:22,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:39:22,482 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:39:22,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 11:39:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:39:22,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-02 11:39:22,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:39:22,755 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-12-02 11:39:22,755 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 11:39:22,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602485034] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:39:22,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 11:39:22,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-12-02 11:39:22,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058294869] [2024-12-02 11:39:22,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:39:22,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 11:39:22,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:39:22,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 11:39:22,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-12-02 11:39:22,758 INFO L87 Difference]: Start difference. First operand 135 states and 201 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-12-02 11:39:22,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:39:22,805 INFO L93 Difference]: Finished difference Result 269 states and 402 transitions. [2024-12-02 11:39:22,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 11:39:22,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-12-02 11:39:22,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:39:22,807 INFO L225 Difference]: With dead ends: 269 [2024-12-02 11:39:22,808 INFO L226 Difference]: Without dead ends: 137 [2024-12-02 11:39:22,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-12-02 11:39:22,809 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 0 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:39:22,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 586 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:39:22,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-12-02 11:39:22,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-12-02 11:39:22,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 119 states have (on average 1.4369747899159664) internal successors, (171), 119 states have internal predecessors, (171), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-12-02 11:39:22,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 203 transitions. [2024-12-02 11:39:22,822 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 203 transitions. Word has length 133 [2024-12-02 11:39:22,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:39:22,823 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 203 transitions. [2024-12-02 11:39:22,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-12-02 11:39:22,824 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 203 transitions. [2024-12-02 11:39:22,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-12-02 11:39:22,826 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:39:22,826 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:39:22,832 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-02 11:39:23,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:39:23,027 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:39:23,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:39:23,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1071614654, now seen corresponding path program 1 times [2024-12-02 11:39:23,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:39:23,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544051442] [2024-12-02 11:39:23,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:39:23,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:39:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:39:23,429 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-12-02 11:39:23,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:39:23,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544051442] [2024-12-02 11:39:23,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544051442] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:39:23,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881795801] [2024-12-02 11:39:23,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:39:23,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:39:23,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:39:23,432 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:39:23,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 11:39:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:39:23,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-12-02 11:39:23,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:39:23,736 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-12-02 11:39:23,737 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 11:39:23,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881795801] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:39:23,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 11:39:23,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-12-02 11:39:23,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901933038] [2024-12-02 11:39:23,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:39:23,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:39:23,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:39:23,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:39:23,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-12-02 11:39:23,739 INFO L87 Difference]: Start difference. First operand 137 states and 203 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-12-02 11:39:23,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:39:23,787 INFO L93 Difference]: Finished difference Result 274 states and 407 transitions. [2024-12-02 11:39:23,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:39:23,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2024-12-02 11:39:23,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:39:23,790 INFO L225 Difference]: With dead ends: 274 [2024-12-02 11:39:23,790 INFO L226 Difference]: Without dead ends: 140 [2024-12-02 11:39:23,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-12-02 11:39:23,791 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:39:23,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 775 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:39:23,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-12-02 11:39:23,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-12-02 11:39:23,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 122 states have (on average 1.4262295081967213) internal successors, (174), 122 states have internal predecessors, (174), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-12-02 11:39:23,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 206 transitions. [2024-12-02 11:39:23,803 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 206 transitions. Word has length 135 [2024-12-02 11:39:23,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:39:23,804 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 206 transitions. [2024-12-02 11:39:23,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-12-02 11:39:23,804 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 206 transitions. [2024-12-02 11:39:23,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-12-02 11:39:23,806 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:39:23,807 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:39:23,815 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-12-02 11:39:24,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:39:24,007 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:39:24,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:39:24,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1857035872, now seen corresponding path program 1 times [2024-12-02 11:39:24,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:39:24,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738949187] [2024-12-02 11:39:24,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:39:24,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:39:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:39:24,334 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-12-02 11:39:24,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:39:24,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738949187] [2024-12-02 11:39:24,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738949187] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:39:24,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393450341] [2024-12-02 11:39:24,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:39:24,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:39:24,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:39:24,337 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:39:24,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 11:39:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:39:24,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-12-02 11:39:24,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:39:24,636 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-12-02 11:39:24,636 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 11:39:24,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393450341] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:39:24,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 11:39:24,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-12-02 11:39:24,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497678335] [2024-12-02 11:39:24,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:39:24,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:39:24,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:39:24,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:39:24,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-12-02 11:39:24,638 INFO L87 Difference]: Start difference. First operand 140 states and 206 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-12-02 11:39:24,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:39:24,683 INFO L93 Difference]: Finished difference Result 280 states and 413 transitions. [2024-12-02 11:39:24,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:39:24,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-12-02 11:39:24,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:39:24,685 INFO L225 Difference]: With dead ends: 280 [2024-12-02 11:39:24,685 INFO L226 Difference]: Without dead ends: 143 [2024-12-02 11:39:24,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-12-02 11:39:24,687 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 777 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 [2024-12-02 11:39:24,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 777 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:39:24,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-12-02 11:39:24,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2024-12-02 11:39:24,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 123 states have (on average 1.4227642276422765) internal successors, (175), 123 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-12-02 11:39:24,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 207 transitions. [2024-12-02 11:39:24,698 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 207 transitions. Word has length 136 [2024-12-02 11:39:24,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:39:24,698 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 207 transitions. [2024-12-02 11:39:24,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-12-02 11:39:24,699 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 207 transitions. [2024-12-02 11:39:24,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-02 11:39:24,701 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:39:24,701 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:39:24,710 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-02 11:39:24,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:39:24,901 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:39:24,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:39:24,902 INFO L85 PathProgramCache]: Analyzing trace with hash 424638356, now seen corresponding path program 1 times [2024-12-02 11:39:24,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:39:24,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170682834] [2024-12-02 11:39:24,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:39:24,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:39:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:39:25,190 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-12-02 11:39:25,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:39:25,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170682834] [2024-12-02 11:39:25,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170682834] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:39:25,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179903858] [2024-12-02 11:39:25,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:39:25,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:39:25,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:39:25,196 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:39:25,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 11:39:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:39:25,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-12-02 11:39:25,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:39:25,464 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-12-02 11:39:25,465 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 11:39:25,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179903858] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:39:25,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 11:39:25,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-12-02 11:39:25,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871746051] [2024-12-02 11:39:25,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:39:25,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:39:25,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:39:25,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:39:25,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-12-02 11:39:25,467 INFO L87 Difference]: Start difference. First operand 141 states and 207 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-12-02 11:39:25,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:39:25,503 INFO L93 Difference]: Finished difference Result 282 states and 415 transitions. [2024-12-02 11:39:25,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:39:25,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-12-02 11:39:25,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:39:25,505 INFO L225 Difference]: With dead ends: 282 [2024-12-02 11:39:25,506 INFO L226 Difference]: Without dead ends: 144 [2024-12-02 11:39:25,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-12-02 11:39:25,507 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:39:25,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 776 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:39:25,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-12-02 11:39:25,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-12-02 11:39:25,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.4126984126984128) internal successors, (178), 126 states have internal predecessors, (178), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-12-02 11:39:25,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 210 transitions. [2024-12-02 11:39:25,515 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 210 transitions. Word has length 137 [2024-12-02 11:39:25,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:39:25,515 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 210 transitions. [2024-12-02 11:39:25,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-12-02 11:39:25,516 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 210 transitions. [2024-12-02 11:39:25,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-02 11:39:25,517 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:39:25,517 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:39:25,527 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-02 11:39:25,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:39:25,718 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:39:25,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:39:25,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1905414409, now seen corresponding path program 1 times [2024-12-02 11:39:25,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:39:25,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702168016] [2024-12-02 11:39:25,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:39:25,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:39:25,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:39:25,974 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-12-02 11:39:25,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:39:25,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702168016] [2024-12-02 11:39:25,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702168016] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:39:25,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817320903] [2024-12-02 11:39:25,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:39:25,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:39:25,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:39:25,976 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:39:25,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-02 11:39:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:39:26,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-02 11:39:26,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:39:26,260 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-12-02 11:39:26,260 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 11:39:26,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817320903] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:39:26,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 11:39:26,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2024-12-02 11:39:26,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062910751] [2024-12-02 11:39:26,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:39:26,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 11:39:26,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:39:26,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 11:39:26,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-12-02 11:39:26,262 INFO L87 Difference]: Start difference. First operand 144 states and 210 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-12-02 11:39:26,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:39:26,307 INFO L93 Difference]: Finished difference Result 289 states and 422 transitions. [2024-12-02 11:39:26,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 11:39:26,308 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-12-02 11:39:26,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:39:26,309 INFO L225 Difference]: With dead ends: 289 [2024-12-02 11:39:26,309 INFO L226 Difference]: Without dead ends: 148 [2024-12-02 11:39:26,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-12-02 11:39:26,310 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 0 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:39:26,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 964 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:39:26,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-12-02 11:39:26,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 145. [2024-12-02 11:39:26,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 127 states have (on average 1.4094488188976377) internal successors, (179), 127 states have internal predecessors, (179), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-12-02 11:39:26,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 211 transitions. [2024-12-02 11:39:26,318 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 211 transitions. Word has length 137 [2024-12-02 11:39:26,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:39:26,318 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 211 transitions. [2024-12-02 11:39:26,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-12-02 11:39:26,319 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 211 transitions. [2024-12-02 11:39:26,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-02 11:39:26,320 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:39:26,320 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:39:26,327 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-12-02 11:39:26,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:39:26,521 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:39:26,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:39:26,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1129593061, now seen corresponding path program 1 times [2024-12-02 11:39:26,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:39:26,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73633626] [2024-12-02 11:39:26,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:39:26,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:39:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:39:26,620 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-12-02 11:39:26,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:39:26,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73633626] [2024-12-02 11:39:26,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73633626] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:39:26,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:39:26,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:39:26,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915645080] [2024-12-02 11:39:26,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:39:26,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:39:26,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:39:26,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:39:26,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:39:26,622 INFO L87 Difference]: Start difference. First operand 145 states and 211 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-12-02 11:39:26,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:39:26,642 INFO L93 Difference]: Finished difference Result 288 states and 421 transitions. [2024-12-02 11:39:26,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:39:26,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2024-12-02 11:39:26,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:39:26,644 INFO L225 Difference]: With dead ends: 288 [2024-12-02 11:39:26,645 INFO L226 Difference]: Without dead ends: 146 [2024-12-02 11:39:26,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:39:26,645 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 0 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:39:26,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 393 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:39:26,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-12-02 11:39:26,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2024-12-02 11:39:26,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 128 states have (on average 1.40625) internal successors, (180), 128 states have internal predecessors, (180), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-12-02 11:39:26,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 212 transitions. [2024-12-02 11:39:26,652 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 212 transitions. Word has length 138 [2024-12-02 11:39:26,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:39:26,652 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 212 transitions. [2024-12-02 11:39:26,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-12-02 11:39:26,653 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 212 transitions. [2024-12-02 11:39:26,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-02 11:39:26,654 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:39:26,654 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:39:26,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 11:39:26,654 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:39:26,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:39:26,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1885510557, now seen corresponding path program 1 times [2024-12-02 11:39:26,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:39:26,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116879585] [2024-12-02 11:39:26,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:39:26,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:39:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 11:39:26,746 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 11:39:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 11:39:26,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 11:39:26,832 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 11:39:26,832 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-12-02 11:39:26,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 11:39:26,838 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:39:26,883 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 11:39:26,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 11:39:26 BoogieIcfgContainer [2024-12-02 11:39:26,886 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 11:39:26,886 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 11:39:26,887 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 11:39:26,887 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 11:39:26,887 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:39:21" (3/4) ... [2024-12-02 11:39:26,889 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-12-02 11:39:26,890 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 11:39:26,891 INFO L158 Benchmark]: Toolchain (without parser) took 6937.66ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 117.3MB in the beginning and 271.1MB in the end (delta: -153.8MB). Peak memory consumption was 76.7MB. Max. memory is 16.1GB. [2024-12-02 11:39:26,891 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 142.6MB. Free memory is still 83.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 11:39:26,891 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.08ms. Allocated memory is still 142.6MB. Free memory was 117.3MB in the beginning and 100.2MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-02 11:39:26,892 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.10ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 96.0MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 11:39:26,892 INFO L158 Benchmark]: Boogie Preprocessor took 55.17ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 92.2MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 11:39:26,892 INFO L158 Benchmark]: RCFGBuilder took 797.87ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 107.1MB in the end (delta: -14.9MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2024-12-02 11:39:26,892 INFO L158 Benchmark]: TraceAbstraction took 5775.19ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 106.5MB in the beginning and 275.1MB in the end (delta: -168.6MB). Peak memory consumption was 70.2MB. Max. memory is 16.1GB. [2024-12-02 11:39:26,892 INFO L158 Benchmark]: Witness Printer took 3.73ms. Allocated memory is still 377.5MB. Free memory was 275.1MB in the beginning and 271.1MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 11:39:26,894 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.26ms. Allocated memory is still 142.6MB. Free memory is still 83.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.08ms. Allocated memory is still 142.6MB. Free memory was 117.3MB in the beginning and 100.2MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.10ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 96.0MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.17ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 92.2MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 797.87ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 107.1MB in the end (delta: -14.9MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. * TraceAbstraction took 5775.19ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 106.5MB in the beginning and 275.1MB in the end (delta: -168.6MB). Peak memory consumption was 70.2MB. Max. memory is 16.1GB. * Witness Printer took 3.73ms. Allocated memory is still 377.5MB. Free memory was 275.1MB in the beginning and 271.1MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 119, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 119, overapproximation of someBinaryDOUBLEComparisonOperation at line 59, overapproximation of someBinaryDOUBLEComparisonOperation at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 91. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { -16, 50.75, 7.675, 10, 32.5, 1000000.7, 2.4, 1, 1, 1, 5, 200, 10, 1 }; [L55] unsigned char last_1_WrapperStruct00_var_1_11 = 1; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_11=1] [L123] isInitial = 1 [L124] FCALL initially() [L126] CALL updateLastVariables() [L116] EXPR WrapperStruct00.var_1_11 [L116] last_1_WrapperStruct00_var_1_11 = WrapperStruct00.var_1_11 [L126] RET updateLastVariables() [L127] CALL updateVariables() [L88] WrapperStruct00.var_1_2 = __VERIFIER_nondet_double() [L89] EXPR WrapperStruct00.var_1_2 [L89] EXPR WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F [L89] EXPR WrapperStruct00.var_1_2 [L89] EXPR WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L89] EXPR (WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L89] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L89] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L90] WrapperStruct00.var_1_3 = __VERIFIER_nondet_double() [L91] EXPR WrapperStruct00.var_1_3 [L91] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L91] EXPR WrapperStruct00.var_1_3 [L91] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L91] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L91] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L91] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L92] WrapperStruct00.var_1_7 = __VERIFIER_nondet_char() [L93] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L94] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L95] WrapperStruct00.var_1_9 = __VERIFIER_nondet_float() [L96] EXPR WrapperStruct00.var_1_9 [L96] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L96] EXPR WrapperStruct00.var_1_9 [L96] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L96] EXPR (WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L96] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L96] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L97] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float() [L98] EXPR WrapperStruct00.var_1_10 [L98] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L98] EXPR WrapperStruct00.var_1_10 [L98] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L98] EXPR (WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L98] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L98] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L99] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L100] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L101] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L102] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L103] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L104] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L105] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L107] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L108] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L109] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L110] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L111] WrapperStruct00.var_1_17 = __VERIFIER_nondet_uchar() [L112] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L113] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L127] RET updateVariables() [L128] CALL step() [L59] EXPR WrapperStruct00.var_1_3 [L59] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L59] COND FALSE !(WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_2) [L68] EXPR WrapperStruct00.var_1_8 [L68] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L68] COND FALSE !(WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_8) [L71] EXPR WrapperStruct00.var_1_11 [L71] unsigned char stepLocal_0 = WrapperStruct00.var_1_11; [L72] EXPR WrapperStruct00.var_1_2 [L72] EXPR WrapperStruct00.var_1_8 [L72] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1] [L72] COND FALSE !((WrapperStruct00.var_1_2 - 5.25) < (WrapperStruct00.var_1_8 * (WrapperStruct00.var_1_8 * 199.4))) [L81] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1] [L81] COND FALSE !(! WrapperStruct00.var_1_11) [L84] EXPR WrapperStruct00.var_1_16 [L84] WrapperStruct00.var_1_14 = WrapperStruct00.var_1_16 [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR WrapperStruct00.var_1_2 [L119] EXPR WrapperStruct00.var_1_8 [L119] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L119] EXPR ((WrapperStruct00.var_1_2 - 5.25) < (WrapperStruct00.var_1_8 * (WrapperStruct00.var_1_8 * 199.4))) ? ((WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11) ? ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : 1) : 1 [L119] EXPR WrapperStruct00.var_1_11 [L119] EXPR WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11 [L119] EXPR WrapperStruct00.var_1_11 [L119] EXPR WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L119] EXPR (WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11) ? ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : 1 [L119] EXPR WrapperStruct00.var_1_8 [L119] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L119] EXPR (WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) [L119] EXPR WrapperStruct00.var_1_1 [L119] EXPR WrapperStruct00.var_1_7 [L119] EXPR (WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L119] EXPR (WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11) ? ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L119] EXPR ((WrapperStruct00.var_1_2 - 5.25) < (WrapperStruct00.var_1_8 * (WrapperStruct00.var_1_8 * 199.4))) ? ((WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11) ? ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : 1) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L119] EXPR (((WrapperStruct00.var_1_2 - 5.25) < (WrapperStruct00.var_1_8 * (WrapperStruct00.var_1_8 * 199.4))) ? ((WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11) ? ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : 1) : 1) && ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_2) ? (last_1_WrapperStruct00_var_1_11 ? ((! last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) > ((10.25f + WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_9) : ((10.25f + WrapperStruct00.var_1_10)))))) : (WrapperStruct00.var_1_8 == ((float) WrapperStruct00.var_1_9))) : 1) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L119] EXPR ((((WrapperStruct00.var_1_2 - 5.25) < (WrapperStruct00.var_1_8 * (WrapperStruct00.var_1_8 * 199.4))) ? ((WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11) ? ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : 1) : 1) && ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_2) ? (last_1_WrapperStruct00_var_1_11 ? ((! last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) > ((10.25f + WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_9) : ((10.25f + WrapperStruct00.var_1_10)))))) : (WrapperStruct00.var_1_8 == ((float) WrapperStruct00.var_1_9))) : 1) : 1)) && ((WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_12 || WrapperStruct00.var_1_13))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L119] EXPR (((((WrapperStruct00.var_1_2 - 5.25) < (WrapperStruct00.var_1_8 * (WrapperStruct00.var_1_8 * 199.4))) ? ((WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11) ? ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : 1) : 1) && ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_2) ? (last_1_WrapperStruct00_var_1_11 ? ((! last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) > ((10.25f + WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_9) : ((10.25f + WrapperStruct00.var_1_10)))))) : (WrapperStruct00.var_1_8 == ((float) WrapperStruct00.var_1_9))) : 1) : 1)) && ((WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_12 || WrapperStruct00.var_1_13))) : 1)) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_14 == ((unsigned char) ((((((((WrapperStruct00.var_1_15) < (((((WrapperStruct00.var_1_16) > (5)) ? (WrapperStruct00.var_1_16) : (5))))) ? (WrapperStruct00.var_1_15) : (((((WrapperStruct00.var_1_16) > (5)) ? (WrapperStruct00.var_1_16) : (5))))))) < (WrapperStruct00.var_1_17)) ? (((((WrapperStruct00.var_1_15) < (((((WrapperStruct00.var_1_16) > (5)) ? (WrapperStruct00.var_1_16) : (5))))) ? (WrapperStruct00.var_1_15) : (((((WrapperStruct00.var_1_16) > (5)) ? (WrapperStruct00.var_1_16) : (5))))))) : (WrapperStruct00.var_1_17))))) : (WrapperStruct00.var_1_14 == ((unsigned char) WrapperStruct00.var_1_16))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L119-L120] return (((((WrapperStruct00.var_1_2 - 5.25) < (WrapperStruct00.var_1_8 * (WrapperStruct00.var_1_8 * 199.4))) ? ((WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11) ? ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : 1) : 1) && ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_2) ? (last_1_WrapperStruct00_var_1_11 ? ((! last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) > ((10.25f + WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_9) : ((10.25f + WrapperStruct00.var_1_10)))))) : (WrapperStruct00.var_1_8 == ((float) WrapperStruct00.var_1_9))) : 1) : 1)) && ((WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_12 || WrapperStruct00.var_1_13))) : 1)) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_14 == ((unsigned char) ((((((((WrapperStruct00.var_1_15) < (((((WrapperStruct00.var_1_16) > (5)) ? (WrapperStruct00.var_1_16) : (5))))) ? (WrapperStruct00.var_1_15) : (((((WrapperStruct00.var_1_16) > (5)) ? (WrapperStruct00.var_1_16) : (5))))))) < (WrapperStruct00.var_1_17)) ? (((((WrapperStruct00.var_1_15) < (((((WrapperStruct00.var_1_16) > (5)) ? (WrapperStruct00.var_1_16) : (5))))) ? (WrapperStruct00.var_1_15) : (((((WrapperStruct00.var_1_16) > (5)) ? (WrapperStruct00.var_1_16) : (5))))))) : (WrapperStruct00.var_1_17))))) : (WrapperStruct00.var_1_14 == ((unsigned char) WrapperStruct00.var_1_16))) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 139 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 8, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 4472 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3081 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 143 IncrementalHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 1391 mSDtfsCounter, 143 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 850 GetRequests, 817 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=7, InterpolantAutomatonStates: 30, 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, 7 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1898 NumberOfCodeBlocks, 1898 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1747 ConstructedInterpolants, 0 QuantifiedInterpolants, 1823 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2809 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 6075/6240 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-12-02 11:39:26,909 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1 --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 ead5d8ae4343bf6b87a76c9a2e262d48ceac54d8db7ffa685d6fe68c13556445 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 11:39:28,909 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 11:39:28,991 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-12-02 11:39:28,997 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 11:39:28,997 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 11:39:29,020 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 11:39:29,021 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 11:39:29,021 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 11:39:29,021 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 11:39:29,021 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 11:39:29,021 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 11:39:29,022 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 11:39:29,022 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 11:39:29,022 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 11:39:29,022 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 11:39:29,022 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 11:39:29,022 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 11:39:29,023 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 11:39:29,023 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 11:39:29,023 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 11:39:29,023 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 11:39:29,023 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 11:39:29,023 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 11:39:29,023 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-12-02 11:39:29,023 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-12-02 11:39:29,023 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-12-02 11:39:29,023 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 11:39:29,023 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 11:39:29,023 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 11:39:29,024 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 11:39:29,024 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 11:39:29,024 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 11:39:29,024 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 11:39:29,024 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 11:39:29,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:39:29,024 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 11:39:29,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 11:39:29,025 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 11:39:29,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 11:39:29,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:39:29,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 11:39:29,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 11:39:29,025 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 11:39:29,025 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 11:39:29,025 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-12-02 11:39:29,025 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-12-02 11:39:29,025 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 11:39:29,026 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 11:39:29,026 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 11:39:29,026 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 11:39:29,026 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1 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 -> ead5d8ae4343bf6b87a76c9a2e262d48ceac54d8db7ffa685d6fe68c13556445 [2024-12-02 11:39:29,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 11:39:29,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 11:39:29,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 11:39:29,266 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 11:39:29,266 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 11:39:29,268 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i [2024-12-02 11:39:31,931 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/data/888ef583c/914a3f9ff61542539e7d638429ba5f84/FLAGce2741621 [2024-12-02 11:39:32,112 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 11:39:32,113 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i [2024-12-02 11:39:32,121 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/data/888ef583c/914a3f9ff61542539e7d638429ba5f84/FLAGce2741621 [2024-12-02 11:39:32,485 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/data/888ef583c/914a3f9ff61542539e7d638429ba5f84 [2024-12-02 11:39:32,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 11:39:32,488 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 11:39:32,489 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 11:39:32,489 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 11:39:32,494 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 11:39:32,494 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:39:32" (1/1) ... [2024-12-02 11:39:32,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21d91484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:39:32, skipping insertion in model container [2024-12-02 11:39:32,496 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:39:32" (1/1) ... [2024-12-02 11:39:32,516 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 11:39:32,642 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i[916,929] [2024-12-02 11:39:32,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 11:39:32,699 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 11:39:32,709 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i[916,929] [2024-12-02 11:39:32,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 11:39:32,777 INFO L204 MainTranslator]: Completed translation [2024-12-02 11:39:32,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:39:32 WrapperNode [2024-12-02 11:39:32,778 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 11:39:32,779 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 11:39:32,780 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 11:39:32,780 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 11:39:32,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:39:32" (1/1) ... [2024-12-02 11:39:32,802 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:39:32" (1/1) ... [2024-12-02 11:39:32,836 INFO L138 Inliner]: procedures = 34, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 578 [2024-12-02 11:39:32,836 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 11:39:32,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 11:39:32,837 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 11:39:32,837 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 11:39:32,845 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:39:32" (1/1) ... [2024-12-02 11:39:32,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:39:32" (1/1) ... [2024-12-02 11:39:32,851 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:39:32" (1/1) ... [2024-12-02 11:39:32,870 INFO L175 MemorySlicer]: Split 142 memory accesses to 2 slices as follows [2, 140]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 32 writes are split as follows [0, 32]. [2024-12-02 11:39:32,870 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:39:32" (1/1) ... [2024-12-02 11:39:32,871 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:39:32" (1/1) ... [2024-12-02 11:39:32,893 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:39:32" (1/1) ... [2024-12-02 11:39:32,894 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:39:32" (1/1) ... [2024-12-02 11:39:32,899 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:39:32" (1/1) ... [2024-12-02 11:39:32,902 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:39:32" (1/1) ... [2024-12-02 11:39:32,905 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:39:32" (1/1) ... [2024-12-02 11:39:32,910 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 11:39:32,911 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 11:39:32,911 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 11:39:32,911 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 11:39:32,912 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:39:32" (1/1) ... [2024-12-02 11:39:32,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:39:32,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:39:32,945 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 11:39:32,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 11:39:32,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 11:39:32,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-12-02 11:39:32,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-12-02 11:39:32,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-12-02 11:39:32,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-12-02 11:39:32,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-12-02 11:39:32,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-12-02 11:39:32,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-12-02 11:39:32,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-12-02 11:39:32,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-12-02 11:39:32,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-12-02 11:39:32,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-12-02 11:39:32,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-12-02 11:39:32,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-12-02 11:39:32,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-12-02 11:39:32,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-12-02 11:39:32,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-12-02 11:39:32,981 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-12-02 11:39:32,981 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-12-02 11:39:32,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-12-02 11:39:32,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-12-02 11:39:32,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 11:39:32,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 11:39:32,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-12-02 11:39:32,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-12-02 11:39:33,097 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 11:39:33,099 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 11:39:51,583 INFO L? ?]: Removed 165 outVars from TransFormulas that were not future-live. [2024-12-02 11:39:51,583 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 11:39:51,596 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 11:39:51,596 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-02 11:39:51,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:39:51 BoogieIcfgContainer [2024-12-02 11:39:51,597 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 11:39:51,599 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 11:39:51,599 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 11:39:51,603 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 11:39:51,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 11:39:32" (1/3) ... [2024-12-02 11:39:51,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b01cfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:39:51, skipping insertion in model container [2024-12-02 11:39:51,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:39:32" (2/3) ... [2024-12-02 11:39:51,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b01cfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:39:51, skipping insertion in model container [2024-12-02 11:39:51,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:39:51" (3/3) ... [2024-12-02 11:39:51,606 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-11.i [2024-12-02 11:39:51,620 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 11:39:51,622 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-11.i that has 2 procedures, 139 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-12-02 11:39:51,671 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 11:39:51,680 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=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;@a02dfb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 11:39:51,681 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-02 11:39:51,685 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 120 states have (on average 1.4666666666666666) internal successors, (176), 121 states have internal predecessors, (176), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-12-02 11:39:51,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-12-02 11:39:51,694 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:39:51,695 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:39:51,695 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:39:51,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:39:51,699 INFO L85 PathProgramCache]: Analyzing trace with hash -358520638, now seen corresponding path program 1 times [2024-12-02 11:39:51,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 11:39:51,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1765657212] [2024-12-02 11:39:51,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:39:51,709 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-12-02 11:39:51,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 11:39:51,711 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-12-02 11:39:51,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-12-02 11:39:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:39:52,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-12-02 11:39:52,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:39:52,806 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-12-02 11:39:52,806 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 11:39:52,806 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 11:39:52,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1765657212] [2024-12-02 11:39:52,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1765657212] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:39:52,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:39:52,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:39:52,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924158004] [2024-12-02 11:39:52,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:39:52,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-02 11:39:52,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 11:39:52,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-02 11:39:52,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-02 11:39:52,828 INFO L87 Difference]: Start difference. First operand has 139 states, 120 states have (on average 1.4666666666666666) internal successors, (176), 121 states have internal predecessors, (176), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-12-02 11:39:52,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:39:52,855 INFO L93 Difference]: Finished difference Result 271 states and 426 transitions. [2024-12-02 11:39:52,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-02 11:39:52,857 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2024-12-02 11:39:52,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:39:52,863 INFO L225 Difference]: With dead ends: 271 [2024-12-02 11:39:52,864 INFO L226 Difference]: Without dead ends: 135 [2024-12-02 11:39:52,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-02 11:39:52,869 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:39:52,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:39:52,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-12-02 11:39:52,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-12-02 11:39:52,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 117 states have (on average 1.4444444444444444) internal successors, (169), 117 states have internal predecessors, (169), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-12-02 11:39:52,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 201 transitions. [2024-12-02 11:39:52,914 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 201 transitions. Word has length 133 [2024-12-02 11:39:52,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:39:52,915 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 201 transitions. [2024-12-02 11:39:52,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-12-02 11:39:52,915 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 201 transitions. [2024-12-02 11:39:52,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-12-02 11:39:52,918 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:39:52,918 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:39:52,940 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-12-02 11:39:53,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-12-02 11:39:53,119 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:39:53,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:39:53,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1153944278, now seen corresponding path program 1 times [2024-12-02 11:39:53,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 11:39:53,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [779068011] [2024-12-02 11:39:53,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:39:53,122 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-12-02 11:39:53,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 11:39:53,124 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-12-02 11:39:53,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-12-02 11:39:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:39:54,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-02 11:39:54,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:39:54,330 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-12-02 11:39:54,330 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 11:39:54,330 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 11:39:54,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [779068011] [2024-12-02 11:39:54,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [779068011] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:39:54,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:39:54,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 11:39:54,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683111725] [2024-12-02 11:39:54,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:39:54,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 11:39:54,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 11:39:54,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 11:39:54,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 11:39:54,333 INFO L87 Difference]: Start difference. First operand 135 states and 201 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-12-02 11:39:54,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:39:54,466 INFO L93 Difference]: Finished difference Result 269 states and 402 transitions. [2024-12-02 11:39:54,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 11:39:54,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-12-02 11:39:54,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:39:54,471 INFO L225 Difference]: With dead ends: 269 [2024-12-02 11:39:54,471 INFO L226 Difference]: Without dead ends: 137 [2024-12-02 11:39:54,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 11:39:54,473 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 0 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 11:39:54,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 586 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 11:39:54,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-12-02 11:39:54,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-12-02 11:39:54,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 119 states have (on average 1.4369747899159664) internal successors, (171), 119 states have internal predecessors, (171), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-12-02 11:39:54,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 203 transitions. [2024-12-02 11:39:54,489 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 203 transitions. Word has length 133 [2024-12-02 11:39:54,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:39:54,491 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 203 transitions. [2024-12-02 11:39:54,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-12-02 11:39:54,491 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 203 transitions. [2024-12-02 11:39:54,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-12-02 11:39:54,494 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:39:54,494 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:39:54,514 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -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 [2024-12-02 11:39:54,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-12-02 11:39:54,695 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:39:54,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:39:54,696 INFO L85 PathProgramCache]: Analyzing trace with hash -961736306, now seen corresponding path program 1 times [2024-12-02 11:39:54,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 11:39:54,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1252643724] [2024-12-02 11:39:54,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:39:54,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 [2024-12-02 11:39:54,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 11:39:54,699 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-12-02 11:39:54,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-12-02 11:39:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:39:55,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-12-02 11:39:55,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:39:55,978 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-12-02 11:39:55,978 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 11:39:55,978 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 11:39:55,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1252643724] [2024-12-02 11:39:55,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1252643724] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:39:55,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:39:55,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:39:55,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396600799] [2024-12-02 11:39:55,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:39:55,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:39:55,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 11:39:55,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:39:55,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:39:55,980 INFO L87 Difference]: Start difference. First operand 137 states and 203 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-12-02 11:39:56,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:39:56,173 INFO L93 Difference]: Finished difference Result 274 states and 407 transitions. [2024-12-02 11:39:56,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:39:56,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2024-12-02 11:39:56,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:39:56,176 INFO L225 Difference]: With dead ends: 274 [2024-12-02 11:39:56,176 INFO L226 Difference]: Without dead ends: 140 [2024-12-02 11:39:56,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:39:56,178 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 11:39:56,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 775 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 11:39:56,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-12-02 11:39:56,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-12-02 11:39:56,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 122 states have (on average 1.4262295081967213) internal successors, (174), 122 states have internal predecessors, (174), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-12-02 11:39:56,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 206 transitions. [2024-12-02 11:39:56,189 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 206 transitions. Word has length 135 [2024-12-02 11:39:56,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:39:56,190 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 206 transitions. [2024-12-02 11:39:56,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-12-02 11:39:56,191 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 206 transitions. [2024-12-02 11:39:56,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-12-02 11:39:56,193 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:39:56,193 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:39:56,213 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -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 [2024-12-02 11:39:56,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-12-02 11:39:56,394 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:39:56,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:39:56,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1555103386, now seen corresponding path program 1 times [2024-12-02 11:39:56,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 11:39:56,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [966412296] [2024-12-02 11:39:56,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:39:56,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 [2024-12-02 11:39:56,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 11:39:56,398 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-12-02 11:39:56,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-12-02 11:39:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:39:57,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-02 11:39:57,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:39:57,647 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-12-02 11:39:57,647 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 11:39:57,647 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 11:39:57,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [966412296] [2024-12-02 11:39:57,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [966412296] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:39:57,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:39:57,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 11:39:57,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058154003] [2024-12-02 11:39:57,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:39:57,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 11:39:57,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 11:39:57,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 11:39:57,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 11:39:57,650 INFO L87 Difference]: Start difference. First operand 140 states and 206 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-12-02 11:40:03,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-12-02 11:40:04,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:40:04,075 INFO L93 Difference]: Finished difference Result 278 states and 411 transitions. [2024-12-02 11:40:04,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 11:40:04,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-12-02 11:40:04,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:40:04,077 INFO L225 Difference]: With dead ends: 278 [2024-12-02 11:40:04,077 INFO L226 Difference]: Without dead ends: 141 [2024-12-02 11:40:04,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:40:04,079 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 1 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-12-02 11:40:04,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 499 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2024-12-02 11:40:04,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-12-02 11:40:04,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-12-02 11:40:04,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 123 states have (on average 1.4227642276422765) internal successors, (175), 123 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-12-02 11:40:04,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 207 transitions. [2024-12-02 11:40:04,091 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 207 transitions. Word has length 136 [2024-12-02 11:40:04,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:40:04,092 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 207 transitions. [2024-12-02 11:40:04,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-12-02 11:40:04,092 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 207 transitions. [2024-12-02 11:40:04,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-12-02 11:40:04,094 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:40:04,094 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:40:04,114 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-12-02 11:40:04,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-12-02 11:40:04,294 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:40:04,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:40:04,295 INFO L85 PathProgramCache]: Analyzing trace with hash 968297372, now seen corresponding path program 1 times [2024-12-02 11:40:04,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 11:40:04,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1761010667] [2024-12-02 11:40:04,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:40:04,295 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-12-02 11:40:04,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 11:40:04,297 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-12-02 11:40:04,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -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 [2024-12-02 11:40:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:40:05,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-12-02 11:40:05,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:40:05,444 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-12-02 11:40:05,444 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 11:40:05,444 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 11:40:05,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1761010667] [2024-12-02 11:40:05,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1761010667] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:40:05,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:40:05,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:40:05,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398159198] [2024-12-02 11:40:05,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:40:05,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:40:05,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 11:40:05,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:40:05,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:40:05,446 INFO L87 Difference]: Start difference. First operand 141 states and 207 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-12-02 11:40:05,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:40:05,808 INFO L93 Difference]: Finished difference Result 282 states and 415 transitions. [2024-12-02 11:40:05,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:40:05,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-12-02 11:40:05,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:40:05,811 INFO L225 Difference]: With dead ends: 282 [2024-12-02 11:40:05,811 INFO L226 Difference]: Without dead ends: 144 [2024-12-02 11:40:05,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:40:05,813 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 777 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.3s IncrementalHoareTripleChecker+Time [2024-12-02 11:40:05,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 777 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 11:40:05,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-12-02 11:40:05,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2024-12-02 11:40:05,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 124 states have (on average 1.4193548387096775) internal successors, (176), 124 states have internal predecessors, (176), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-12-02 11:40:05,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 208 transitions. [2024-12-02 11:40:05,824 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 208 transitions. Word has length 136 [2024-12-02 11:40:05,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:40:05,825 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 208 transitions. [2024-12-02 11:40:05,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-12-02 11:40:05,825 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 208 transitions. [2024-12-02 11:40:05,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-02 11:40:05,827 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:40:05,827 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:40:05,852 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -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 [2024-12-02 11:40:06,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-12-02 11:40:06,028 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:40:06,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:40:06,029 INFO L85 PathProgramCache]: Analyzing trace with hash 608463171, now seen corresponding path program 1 times [2024-12-02 11:40:06,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 11:40:06,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1745266037] [2024-12-02 11:40:06,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:40:06,029 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-12-02 11:40:06,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 11:40:06,031 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-12-02 11:40:06,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -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 [2024-12-02 11:40:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:40:07,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-02 11:40:07,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:40:07,246 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-12-02 11:40:07,247 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 11:40:07,247 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 11:40:07,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1745266037] [2024-12-02 11:40:07,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1745266037] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:40:07,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:40:07,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 11:40:07,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287344651] [2024-12-02 11:40:07,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:40:07,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 11:40:07,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 11:40:07,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 11:40:07,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 11:40:07,249 INFO L87 Difference]: Start difference. First operand 142 states and 208 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-12-02 11:40:07,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:40:07,485 INFO L93 Difference]: Finished difference Result 285 states and 418 transitions. [2024-12-02 11:40:07,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 11:40:07,486 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-12-02 11:40:07,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:40:07,487 INFO L225 Difference]: With dead ends: 285 [2024-12-02 11:40:07,487 INFO L226 Difference]: Without dead ends: 146 [2024-12-02 11:40:07,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 11:40:07,488 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 0 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 11:40:07,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 964 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 11:40:07,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-12-02 11:40:07,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2024-12-02 11:40:07,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 125 states have (on average 1.416) internal successors, (177), 125 states have internal predecessors, (177), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-12-02 11:40:07,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 209 transitions. [2024-12-02 11:40:07,498 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 209 transitions. Word has length 137 [2024-12-02 11:40:07,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:40:07,498 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 209 transitions. [2024-12-02 11:40:07,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-12-02 11:40:07,499 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 209 transitions. [2024-12-02 11:40:07,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-02 11:40:07,501 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:40:07,502 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:40:07,520 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -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)] Ended with exit code 0 [2024-12-02 11:40:07,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-12-02 11:40:07,702 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:40:07,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:40:07,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1356451360, now seen corresponding path program 1 times [2024-12-02 11:40:07,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 11:40:07,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1873937172] [2024-12-02 11:40:07,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:40:07,703 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-12-02 11:40:07,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 11:40:07,705 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-12-02 11:40:07,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-12-02 11:40:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:40:08,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-12-02 11:40:08,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:40:08,876 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-12-02 11:40:08,876 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 11:40:08,876 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 11:40:08,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1873937172] [2024-12-02 11:40:08,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1873937172] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:40:08,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:40:08,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:40:08,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707541638] [2024-12-02 11:40:08,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:40:08,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:40:08,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 11:40:08,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:40:08,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:40:08,878 INFO L87 Difference]: Start difference. First operand 143 states and 209 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-12-02 11:40:09,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:40:09,057 INFO L93 Difference]: Finished difference Result 286 states and 419 transitions. [2024-12-02 11:40:09,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:40:09,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-12-02 11:40:09,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:40:09,059 INFO L225 Difference]: With dead ends: 286 [2024-12-02 11:40:09,059 INFO L226 Difference]: Without dead ends: 146 [2024-12-02 11:40:09,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:40:09,060 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 11:40:09,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 776 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 11:40:09,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-12-02 11:40:09,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2024-12-02 11:40:09,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 128 states have (on average 1.40625) internal successors, (180), 128 states have internal predecessors, (180), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-12-02 11:40:09,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 212 transitions. [2024-12-02 11:40:09,067 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 212 transitions. Word has length 137 [2024-12-02 11:40:09,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:40:09,068 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 212 transitions. [2024-12-02 11:40:09,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-12-02 11:40:09,068 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 212 transitions. [2024-12-02 11:40:09,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-02 11:40:09,070 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:40:09,070 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:40:09,091 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-12-02 11:40:09,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-12-02 11:40:09,271 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:40:09,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:40:09,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1851522911, now seen corresponding path program 1 times [2024-12-02 11:40:09,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 11:40:09,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [876985550] [2024-12-02 11:40:09,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:40:09,272 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-12-02 11:40:09,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 11:40:09,274 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-12-02 11:40:09,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -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 [2024-12-02 11:40:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:40:10,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-12-02 11:40:10,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:40:10,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:40:10,605 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 173 treesize of output 65 [2024-12-02 11:40:10,741 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-12-02 11:40:10,741 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 11:40:10,741 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 11:40:10,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [876985550] [2024-12-02 11:40:10,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [876985550] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:40:10,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:40:10,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:40:10,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778482107] [2024-12-02 11:40:10,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:40:10,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 11:40:10,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 11:40:10,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 11:40:10,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 11:40:10,743 INFO L87 Difference]: Start difference. First operand 146 states and 212 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-12-02 11:40:16,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 11:40:20,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 11:40:24,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-12-02 11:40:28,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 11:40:32,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 11:40:36,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 11:40:40,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-12-02 11:40:45,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-12-02 11:40:49,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-12-02 11:40:53,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-12-02 11:40:57,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-12-02 11:41:01,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 11:41:05,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 11:41:09,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-12-02 11:41:13,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 11:41:14,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:41:14,204 INFO L93 Difference]: Finished difference Result 290 states and 422 transitions. [2024-12-02 11:41:14,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 11:41:14,205 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2024-12-02 11:41:14,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:41:14,206 INFO L225 Difference]: With dead ends: 290 [2024-12-02 11:41:14,206 INFO L226 Difference]: Without dead ends: 147 [2024-12-02 11:41:14,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-12-02 11:41:14,207 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 196 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 62.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 63.3s IncrementalHoareTripleChecker+Time [2024-12-02 11:41:14,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 594 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 15 Unknown, 0 Unchecked, 63.3s Time] [2024-12-02 11:41:14,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-12-02 11:41:14,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2024-12-02 11:41:14,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 128 states have (on average 1.3984375) internal successors, (179), 128 states have internal predecessors, (179), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-12-02 11:41:14,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 211 transitions. [2024-12-02 11:41:14,215 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 211 transitions. Word has length 138 [2024-12-02 11:41:14,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:41:14,215 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 211 transitions. [2024-12-02 11:41:14,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-12-02 11:41:14,215 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 211 transitions. [2024-12-02 11:41:14,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-12-02 11:41:14,217 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:41:14,217 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:41:14,237 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -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 [2024-12-02 11:41:14,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-12-02 11:41:14,418 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:41:14,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:41:14,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1010090265, now seen corresponding path program 1 times [2024-12-02 11:41:14,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 11:41:14,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [773635813] [2024-12-02 11:41:14,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:41:14,419 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-12-02 11:41:14,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 11:41:14,420 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-12-02 11:41:14,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -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 [2024-12-02 11:41:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:41:15,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-12-02 11:41:15,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:41:15,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 11:41:15,854 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 119 treesize of output 21 [2024-12-02 11:41:16,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:41:16,166 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 82 treesize of output 49 [2024-12-02 11:41:16,702 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:41:16,702 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 77 treesize of output 59 [2024-12-02 11:41:21,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:41:21,365 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 76 treesize of output 72 [2024-12-02 11:41:22,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:41:22,402 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 91 treesize of output 75 [2024-12-02 11:41:23,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:41:23,136 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 91 treesize of output 75 [2024-12-02 11:41:23,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:41:23,810 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 86 treesize of output 85 [2024-12-02 11:41:24,974 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:41:24,975 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 96 treesize of output 98 [2024-12-02 11:41:26,355 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:41:26,356 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 106 treesize of output 111 [2024-12-02 11:41:27,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:41:27,907 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 116 treesize of output 115 [2024-12-02 11:41:29,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:41:29,375 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 116 treesize of output 124 [2024-12-02 11:41:31,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:41:31,367 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 166 treesize of output 64 [2024-12-02 11:41:31,565 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 244 proven. 192 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-12-02 11:41:31,565 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:41:32,805 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-12-02 11:41:32,805 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 11:41:32,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [773635813] [2024-12-02 11:41:32,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [773635813] provided 1 perfect and 1 imperfect interpolant sequences [2024-12-02 11:41:32,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 11:41:32,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2024-12-02 11:41:32,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150626541] [2024-12-02 11:41:32,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:41:32,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 11:41:32,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 11:41:32,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 11:41:32,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=106, Unknown=1, NotChecked=0, Total=156 [2024-12-02 11:41:32,807 INFO L87 Difference]: Start difference. First operand 146 states and 211 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-12-02 11:41:38,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-12-02 11:41:42,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-12-02 11:41:46,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-12-02 11:41:48,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:41:48,541 INFO L93 Difference]: Finished difference Result 432 states and 627 transitions. [2024-12-02 11:41:48,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 11:41:48,547 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 140 [2024-12-02 11:41:48,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:41:48,549 INFO L225 Difference]: With dead ends: 432 [2024-12-02 11:41:48,549 INFO L226 Difference]: Without dead ends: 289 [2024-12-02 11:41:48,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=53, Invalid=128, Unknown=1, NotChecked=0, Total=182 [2024-12-02 11:41:48,550 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 139 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.6s IncrementalHoareTripleChecker+Time [2024-12-02 11:41:48,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 337 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 259 Invalid, 3 Unknown, 0 Unchecked, 15.6s Time] [2024-12-02 11:41:48,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-12-02 11:41:48,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 284. [2024-12-02 11:41:48,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 249 states have (on average 1.3975903614457832) internal successors, (348), 249 states have internal predecessors, (348), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-12-02 11:41:48,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 412 transitions. [2024-12-02 11:41:48,562 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 412 transitions. Word has length 140 [2024-12-02 11:41:48,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:41:48,562 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 412 transitions. [2024-12-02 11:41:48,562 INFO L472 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-12-02 11:41:48,562 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 412 transitions. [2024-12-02 11:41:48,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-02 11:41:48,563 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:41:48,563 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:41:48,587 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -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 [2024-12-02 11:41:48,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-12-02 11:41:48,763 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:41:48,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:41:48,764 INFO L85 PathProgramCache]: Analyzing trace with hash 47098284, now seen corresponding path program 1 times [2024-12-02 11:41:48,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 11:41:48,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1203074900] [2024-12-02 11:41:48,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:41:48,764 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-12-02 11:41:48,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 11:41:48,766 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-12-02 11:41:48,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-12-02 11:41:50,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:41:50,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-12-02 11:41:50,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:41:50,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 11:41:50,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 11:41:50,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 11:41:50,853 INFO L224 Elim1Store]: Index analysis took 306 ms [2024-12-02 11:41:51,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 58 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 51 [2024-12-02 11:41:51,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 108 [2024-12-02 11:41:56,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:41:56,950 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 237 treesize of output 162 [2024-12-02 11:42:03,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:42:03,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 211 treesize of output 162 [2024-12-02 11:42:09,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:42:09,791 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 201 treesize of output 158 [2024-12-02 11:42:11,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:42:11,365 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 201 treesize of output 158 [2024-12-02 11:42:17,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:42:17,163 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 196 treesize of output 159 [2024-12-02 11:42:23,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:42:23,583 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 201 treesize of output 149 [2024-12-02 11:42:29,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:42:29,836 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 106 treesize of output 111 [2024-12-02 11:42:32,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:42:32,310 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 121 treesize of output 105 [2024-12-02 11:42:34,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:42:34,682 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 106 treesize of output 111 [2024-12-02 11:42:38,205 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 142 treesize of output 110 [2024-12-02 11:42:38,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 11:42:38,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:42:38,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 110 treesize of output 184 [2024-12-02 11:42:38,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 44 [2024-12-02 11:42:46,796 WARN L286 SmtUtils]: Spent 5.69s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:42:56,540 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:43:06,690 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:43:14,091 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|))) (let ((.cse2 (select .cse15 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))) (.cse1 (select .cse15 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|))) (.cse4 (let ((.cse16 (select .cse15 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16))))) (and (not (fp.lt (fp.sub c_currentRoundingMode (let ((.cse0 (concat .cse1 .cse2))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode .cse4))) (fp.mul c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (let ((.cse8 (select .cse15 (bvadd (_ bv30 32) |c_~#WrapperStruct00~0.offset|))) (.cse5 (exists ((|v_skolemized_q#valueAsBitvector_74| (_ BitVec 64))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_74|) (select .cse15 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|))))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet97#1_20| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet97#1_20|) (select .cse15 (bvadd (_ bv36 32) |c_~#WrapperStruct00~0.offset|))))) (.cse7 (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 65.0 2.0))) .cse4)) (.cse9 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet91#1_20| (_ BitVec 8))) (= (select .cse15 (bvadd (_ bv34 32) |c_~#WrapperStruct00~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet91#1_20|)))) (.cse10 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet85#1_20| (_ BitVec 8))) (= (select .cse15 (bvadd (_ bv31 32) |c_~#WrapperStruct00~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet85#1_20|)))) (.cse11 (exists ((|v_skolemized_q#valueAsBitvector_73| (_ BitVec 64))) (let ((.cse14 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_73|)) (.cse13 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_73|))) (and (fp.leq (let ((.cse12 (concat .cse13 .cse14))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12))) ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854776000.0))) (= .cse2 .cse14) (= .cse13 .cse1)))))) (or (and .cse5 .cse6 .cse7 (= .cse8 ((_ sign_extend 24) (_ bv1 8))) .cse9 .cse10 .cse11) (and (= ((_ sign_extend 24) (_ bv0 8)) .cse8) .cse5 .cse6 .cse7 .cse9 .cse10 .cse11))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-12-02 11:43:18,146 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|))) (let ((.cse2 (select .cse15 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))) (.cse1 (select .cse15 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|))) (.cse4 (let ((.cse16 (select .cse15 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16))))) (and (not (fp.lt (fp.sub c_currentRoundingMode (let ((.cse0 (concat .cse1 .cse2))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode .cse4))) (fp.mul c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (let ((.cse8 (select .cse15 (bvadd (_ bv30 32) |c_~#WrapperStruct00~0.offset|))) (.cse5 (exists ((|v_skolemized_q#valueAsBitvector_74| (_ BitVec 64))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_74|) (select .cse15 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|))))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet97#1_20| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet97#1_20|) (select .cse15 (bvadd (_ bv36 32) |c_~#WrapperStruct00~0.offset|))))) (.cse7 (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 65.0 2.0))) .cse4)) (.cse9 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet91#1_20| (_ BitVec 8))) (= (select .cse15 (bvadd (_ bv34 32) |c_~#WrapperStruct00~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet91#1_20|)))) (.cse10 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet85#1_20| (_ BitVec 8))) (= (select .cse15 (bvadd (_ bv31 32) |c_~#WrapperStruct00~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet85#1_20|)))) (.cse11 (exists ((|v_skolemized_q#valueAsBitvector_73| (_ BitVec 64))) (let ((.cse14 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_73|)) (.cse13 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_73|))) (and (fp.leq (let ((.cse12 (concat .cse13 .cse14))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12))) ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854776000.0))) (= .cse2 .cse14) (= .cse13 .cse1)))))) (or (and .cse5 .cse6 .cse7 (= .cse8 ((_ sign_extend 24) (_ bv1 8))) .cse9 .cse10 .cse11) (and (= ((_ sign_extend 24) (_ bv0 8)) .cse8) .cse5 .cse6 .cse7 .cse9 .cse10 .cse11))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-12-02 11:43:26,066 WARN L286 SmtUtils]: Spent 7.91s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:43:41,441 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:43:48,477 WARN L286 SmtUtils]: Spent 6.75s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:43:48,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:43:48,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 394 treesize of output 273 [2024-12-02 11:43:56,766 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:44:14,686 WARN L286 SmtUtils]: Spent 6.38s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:44:22,866 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:44:26,910 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|))) (let ((.cse12 (select .cse0 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|))) (.cse11 (select .cse0 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))) (.cse16 (let ((.cse19 (select .cse0 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse19) ((_ extract 30 23) .cse19) ((_ extract 22 0) .cse19))))) (and (= (select .cse0 (bvadd (_ bv33 32) |c_~#WrapperStruct00~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (select .cse0 (bvadd (_ bv35 32) |c_~#WrapperStruct00~0.offset|))))) (let ((.cse6 (select .cse0 (bvadd (_ bv31 32) |c_~#WrapperStruct00~0.offset|))) (.cse4 (select .cse0 (bvadd (_ bv30 32) |c_~#WrapperStruct00~0.offset|))) (.cse1 (select .cse0 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|))) (.cse10 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854776000.0))) (.cse5 (select .cse0 (bvadd (_ bv34 32) |c_~#WrapperStruct00~0.offset|))) (.cse3 (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 65.0 2.0))) .cse16)) (.cse2 (select .cse0 (bvadd (_ bv36 32) |c_~#WrapperStruct00~0.offset|)))) (or (and (exists ((|v_skolemized_q#valueAsBitvector_74| (_ BitVec 64))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_74|) .cse1)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet97#1_20| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet97#1_20|) .cse2)) .cse3 (= .cse4 ((_ sign_extend 24) (_ bv1 8))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet91#1_20| (_ BitVec 8))) (= .cse5 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet91#1_20|))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet85#1_20| (_ BitVec 8))) (= .cse6 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet85#1_20|))) (exists ((|v_skolemized_q#valueAsBitvector_73| (_ BitVec 64))) (let ((.cse9 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_73|)) (.cse8 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_73|))) (and (fp.leq (let ((.cse7 (concat .cse8 .cse9))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))) .cse10) (= .cse11 .cse9) (= .cse8 .cse12))))) (and (exists ((v_prenex_8 (_ BitVec 8))) (= .cse6 ((_ sign_extend 24) v_prenex_8))) (= ((_ sign_extend 24) (_ bv0 8)) .cse4) (exists ((v_prenex_11 (_ BitVec 64))) (= ((_ extract 63 32) v_prenex_11) .cse1)) (exists ((v_prenex_9 (_ BitVec 64))) (let ((.cse14 ((_ extract 63 32) v_prenex_9)) (.cse15 ((_ extract 31 0) v_prenex_9))) (and (fp.leq (let ((.cse13 (concat .cse14 .cse15))) (fp ((_ extract 63 63) .cse13) ((_ extract 62 52) .cse13) ((_ extract 51 0) .cse13))) .cse10) (= .cse12 .cse14) (= .cse11 .cse15)))) (exists ((v_prenex_10 (_ BitVec 8))) (= .cse5 ((_ sign_extend 24) v_prenex_10))) .cse3 (exists ((v_prenex_7 (_ BitVec 8))) (= ((_ sign_extend 24) v_prenex_7) .cse2))))) (not (fp.lt (fp.sub c_currentRoundingMode (let ((.cse17 (concat .cse12 .cse11))) (fp ((_ extract 63 63) .cse17) ((_ extract 62 52) .cse17) ((_ extract 51 0) .cse17))) ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse18 ((_ to_fp 11 53) c_currentRoundingMode .cse16))) (fp.mul c_currentRoundingMode .cse18 (fp.mul c_currentRoundingMode .cse18 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-12-02 11:44:30,962 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|))) (let ((.cse12 (select .cse0 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|))) (.cse11 (select .cse0 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))) (.cse16 (let ((.cse19 (select .cse0 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse19) ((_ extract 30 23) .cse19) ((_ extract 22 0) .cse19))))) (and (= (select .cse0 (bvadd (_ bv33 32) |c_~#WrapperStruct00~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (select .cse0 (bvadd (_ bv35 32) |c_~#WrapperStruct00~0.offset|))))) (let ((.cse6 (select .cse0 (bvadd (_ bv31 32) |c_~#WrapperStruct00~0.offset|))) (.cse4 (select .cse0 (bvadd (_ bv30 32) |c_~#WrapperStruct00~0.offset|))) (.cse1 (select .cse0 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|))) (.cse10 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854776000.0))) (.cse5 (select .cse0 (bvadd (_ bv34 32) |c_~#WrapperStruct00~0.offset|))) (.cse3 (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 65.0 2.0))) .cse16)) (.cse2 (select .cse0 (bvadd (_ bv36 32) |c_~#WrapperStruct00~0.offset|)))) (or (and (exists ((|v_skolemized_q#valueAsBitvector_74| (_ BitVec 64))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_74|) .cse1)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet97#1_20| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet97#1_20|) .cse2)) .cse3 (= .cse4 ((_ sign_extend 24) (_ bv1 8))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet91#1_20| (_ BitVec 8))) (= .cse5 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet91#1_20|))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet85#1_20| (_ BitVec 8))) (= .cse6 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet85#1_20|))) (exists ((|v_skolemized_q#valueAsBitvector_73| (_ BitVec 64))) (let ((.cse9 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_73|)) (.cse8 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_73|))) (and (fp.leq (let ((.cse7 (concat .cse8 .cse9))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))) .cse10) (= .cse11 .cse9) (= .cse8 .cse12))))) (and (exists ((v_prenex_8 (_ BitVec 8))) (= .cse6 ((_ sign_extend 24) v_prenex_8))) (= ((_ sign_extend 24) (_ bv0 8)) .cse4) (exists ((v_prenex_11 (_ BitVec 64))) (= ((_ extract 63 32) v_prenex_11) .cse1)) (exists ((v_prenex_9 (_ BitVec 64))) (let ((.cse14 ((_ extract 63 32) v_prenex_9)) (.cse15 ((_ extract 31 0) v_prenex_9))) (and (fp.leq (let ((.cse13 (concat .cse14 .cse15))) (fp ((_ extract 63 63) .cse13) ((_ extract 62 52) .cse13) ((_ extract 51 0) .cse13))) .cse10) (= .cse12 .cse14) (= .cse11 .cse15)))) (exists ((v_prenex_10 (_ BitVec 8))) (= .cse5 ((_ sign_extend 24) v_prenex_10))) .cse3 (exists ((v_prenex_7 (_ BitVec 8))) (= ((_ sign_extend 24) v_prenex_7) .cse2))))) (not (fp.lt (fp.sub c_currentRoundingMode (let ((.cse17 (concat .cse12 .cse11))) (fp ((_ extract 63 63) .cse17) ((_ extract 62 52) .cse17) ((_ extract 51 0) .cse17))) ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse18 ((_ to_fp 11 53) c_currentRoundingMode .cse16))) (fp.mul c_currentRoundingMode .cse18 (fp.mul c_currentRoundingMode .cse18 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-12-02 11:44:31,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:44:31,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 495 treesize of output 219 [2024-12-02 11:44:39,502 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:44:48,009 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:44:56,312 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:45:11,428 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854776000.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))) (.cse7 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 65.0 2.0))))) (or (exists ((v_arrayElimCell_174 (_ BitVec 32))) (let ((.cse5 (fp ((_ extract 31 31) v_arrayElimCell_174) ((_ extract 30 23) v_arrayElimCell_174) ((_ extract 22 0) v_arrayElimCell_174)))) (and (exists ((|v_skolemized_q#valueAsBitvector_73| (_ BitVec 64))) (let ((.cse0 (let ((.cse6 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_73|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_73|)))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))))) (and (fp.leq .cse0 .cse1) (not (fp.lt (fp.sub c_currentRoundingMode .cse0 .cse2) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode .cse5))) (fp.mul c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode .cse3 .cse4))))) (= .cse0 |c_ULTIMATE.start_property_#t~mem101#1|)))) (= |c_ULTIMATE.start_property_#t~mem103#1| .cse5) (= .cse7 .cse5) (= |c_ULTIMATE.start_property_#t~mem102#1| .cse5)))) (exists ((v_arrayElimCell_174 (_ BitVec 32))) (let ((.cse10 (fp ((_ extract 31 31) v_arrayElimCell_174) ((_ extract 30 23) v_arrayElimCell_174) ((_ extract 22 0) v_arrayElimCell_174)))) (and (exists ((v_prenex_9 (_ BitVec 64))) (let ((.cse8 (let ((.cse11 (concat ((_ extract 63 32) v_prenex_9) ((_ extract 31 0) v_prenex_9)))) (fp ((_ extract 63 63) .cse11) ((_ extract 62 52) .cse11) ((_ extract 51 0) .cse11))))) (and (fp.leq .cse8 .cse1) (not (fp.lt (fp.sub c_currentRoundingMode .cse8 .cse2) (let ((.cse9 ((_ to_fp 11 53) c_currentRoundingMode .cse10))) (fp.mul c_currentRoundingMode .cse9 (fp.mul c_currentRoundingMode .cse9 .cse4))))) (= .cse8 |c_ULTIMATE.start_property_#t~mem101#1|)))) (= |c_ULTIMATE.start_property_#t~mem103#1| .cse10) (= .cse7 .cse10) (= |c_ULTIMATE.start_property_#t~mem102#1| .cse10)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-12-02 11:45:15,566 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 33 proven. 403 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-12-02 11:45:15,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:45:23,679 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:45:27,731 WARN L851 $PredicateComparison]: unable to prove that (not (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem101#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem103#1|) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem102#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))))) is different from false [2024-12-02 11:45:31,789 WARN L873 $PredicateComparison]: unable to prove that (not (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem101#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem103#1|) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem102#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))))) is different from true [2024-12-02 11:45:39,893 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:45:43,946 WARN L851 $PredicateComparison]: unable to prove that (not (let ((.cse1 (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|))) (fp.lt (fp.sub c_currentRoundingMode (let ((.cse0 (concat (select .cse1 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse1 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse3 (select .cse1 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))))) (fp.mul c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))))))) is different from false [2024-12-02 11:45:47,994 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|))) (fp.lt (fp.sub c_currentRoundingMode (let ((.cse0 (concat (select .cse1 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse1 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse3 (select .cse1 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))))) (fp.mul c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))))))) is different from true [2024-12-02 11:45:56,098 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:46:04,206 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:46:12,485 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:46:20,761 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:46:24,861 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))) (or (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_step_#t~mem18#1| .cse0) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_step_#t~mem20#1|) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_step_#t~mem19#1|) .cse1))) (not (let ((.cse3 (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|))) (fp.lt (fp.sub c_currentRoundingMode (let ((.cse2 (concat (select .cse3 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) .cse0) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse5 (select .cse3 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5)))))) (fp.mul c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode .cse4 .cse1)))))))) is different from false [2024-12-02 11:46:28,964 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))) (or (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_step_#t~mem18#1| .cse0) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_step_#t~mem20#1|) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_step_#t~mem19#1|) .cse1))) (not (let ((.cse3 (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|))) (fp.lt (fp.sub c_currentRoundingMode (let ((.cse2 (concat (select .cse3 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) .cse0) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse5 (select .cse3 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5)))))) (fp.mul c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode .cse4 .cse1)))))))) is different from true [2024-12-02 11:46:29,771 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-12-02 11:46:29,772 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 11:46:29,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1203074900] [2024-12-02 11:46:29,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1203074900] provided 1 perfect and 1 imperfect interpolant sequences [2024-12-02 11:46:29,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 11:46:29,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [23] total 27 [2024-12-02 11:46:29,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862719566] [2024-12-02 11:46:29,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:46:29,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:46:29,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 11:46:29,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:46:29,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=342, Unknown=15, NotChecked=258, Total=702 [2024-12-02 11:46:29,774 INFO L87 Difference]: Start difference. First operand 284 states and 412 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-12-02 11:46:29,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:46:29,789 INFO L93 Difference]: Finished difference Result 573 states and 833 transitions. [2024-12-02 11:46:29,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:46:29,789 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 142 [2024-12-02 11:46:29,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:46:29,792 INFO L225 Difference]: With dead ends: 573 [2024-12-02 11:46:29,792 INFO L226 Difference]: Without dead ends: 292 [2024-12-02 11:46:29,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 256 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 72.6s TimeCoverageRelationStatistics Valid=87, Invalid=342, Unknown=15, NotChecked=258, Total=702 [2024-12-02 11:46:29,794 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 617 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:46:29,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 617 Unchecked, 0.0s Time] [2024-12-02 11:46:29,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-12-02 11:46:29,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2024-12-02 11:46:29,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 257 states have (on average 1.3929961089494163) internal successors, (358), 257 states have internal predecessors, (358), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-12-02 11:46:29,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 422 transitions. [2024-12-02 11:46:29,810 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 422 transitions. Word has length 142 [2024-12-02 11:46:29,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:46:29,811 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 422 transitions. [2024-12-02 11:46:29,811 INFO L472 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-12-02 11:46:29,811 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 422 transitions. [2024-12-02 11:46:29,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-12-02 11:46:29,812 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:46:29,813 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:46:29,833 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -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 [2024-12-02 11:46:30,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-12-02 11:46:30,013 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:46:30,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:46:30,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1637790262, now seen corresponding path program 1 times [2024-12-02 11:46:30,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 11:46:30,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1858548083] [2024-12-02 11:46:30,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:46:30,014 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-12-02 11:46:30,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 11:46:30,016 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-12-02 11:46:30,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cfb570-776a-4938-8740-87e91179d2cf/bin/uautomizer-verify-84ZbGMXZE1/mathsat -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 [2024-12-02 11:46:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:46:31,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-12-02 11:46:31,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:46:31,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 11:46:32,751 INFO L224 Elim1Store]: Index analysis took 1207 ms [2024-12-02 11:46:32,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 10 [2024-12-02 11:46:33,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2024-12-02 11:46:39,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 120 [2024-12-02 11:46:45,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:46:45,520 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 293 treesize of output 172 [2024-12-02 11:46:49,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:46:49,724 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 293 treesize of output 172 [2024-12-02 11:46:53,058 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:46:53,058 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 293 treesize of output 172 [2024-12-02 11:46:56,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:46:56,382 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 288 treesize of output 182 [2024-12-02 11:47:01,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:47:01,300 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 218 treesize of output 151 [2024-12-02 11:47:06,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:47:06,589 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 121 treesize of output 114 [2024-12-02 11:47:10,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:47:10,732 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 116 treesize of output 124 [2024-12-02 11:47:16,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:47:16,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 126 treesize of output 137 [2024-12-02 11:47:25,154 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 162 treesize of output 126 [2024-12-02 11:47:25,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 11:47:25,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:47:25,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 12 new quantified variables, introduced 45 case distinctions, treesize of input 126 treesize of output 234 [2024-12-02 11:47:26,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 118 [2024-12-02 11:47:32,780 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:47:32,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 491 treesize of output 415 [2024-12-02 11:47:49,682 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:48:00,056 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:48:11,564 WARN L286 SmtUtils]: Spent 6.21s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:48:15,611 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|))) (let ((.cse1 (select .cse0 (bvadd (_ bv35 32) |c_~#WrapperStruct00~0.offset|))) (.cse16 (select .cse0 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|))) (.cse13 (select .cse0 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))) (.cse29 (let ((.cse32 (select .cse0 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse32) ((_ extract 30 23) .cse32) ((_ extract 22 0) .cse32))))) (and (= (select .cse0 (bvadd (_ bv33 32) |c_~#WrapperStruct00~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) .cse1))) (let ((.cse28 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854776000.0))) (let ((.cse18 ((_ to_fp 11 53) roundNearestTiesToEven .cse28)) (.cse11 (= ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 2.0))) .cse29)) (.cse19 (select .cse0 (bvadd (_ bv31 32) |c_~#WrapperStruct00~0.offset|))) (.cse2 (select .cse0 (bvadd (_ bv36 32) |c_~#WrapperStruct00~0.offset|))) (.cse20 (select .cse0 (bvadd (_ bv32 32) |c_~#WrapperStruct00~0.offset|))) (.cse12 (select .cse0 (bvadd (_ bv30 32) |c_~#WrapperStruct00~0.offset|))) (.cse3 (select .cse0 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))))) (.cse9 (select .cse0 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse28)))) (or (and (exists ((v_prenex_15 (_ BitVec 8))) (= .cse2 ((_ sign_extend 24) v_prenex_15))) (exists ((v_prenex_14 (_ BitVec 8))) (= ((_ sign_extend 24) v_prenex_14) .cse1)) (exists ((v_prenex_19 (_ BitVec 64))) (let ((.cse4 ((_ extract 63 32) v_prenex_19)) (.cse8 ((_ extract 31 0) v_prenex_19))) (let ((.cse5 (let ((.cse10 (concat .cse4 .cse8))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10))))) (and (= .cse3 .cse4) (fp.leq .cse5 .cse6) (fp.geq .cse5 .cse7) (= .cse8 .cse9))))) .cse11 (= ((_ sign_extend 24) (_ bv0 8)) .cse12) (exists ((v_prenex_17 (_ BitVec 64))) (let ((.cse15 ((_ extract 63 32) v_prenex_17)) (.cse14 ((_ extract 31 0) v_prenex_17))) (and (= .cse13 .cse14) (= .cse15 .cse16) (fp.leq (let ((.cse17 (concat .cse15 .cse14))) (fp ((_ extract 63 63) .cse17) ((_ extract 62 52) .cse17) ((_ extract 51 0) .cse17))) .cse18)))) (exists ((v_prenex_16 (_ BitVec 8))) (= .cse19 ((_ sign_extend 24) v_prenex_16))) (exists ((v_prenex_18 (_ BitVec 8))) (= .cse20 ((_ sign_extend 24) v_prenex_18)))) (and (exists ((|v_skolemized_q#valueAsBitvector_83| (_ BitVec 64))) (let ((.cse21 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_83|)) (.cse22 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_83|))) (and (= .cse16 .cse21) (= .cse13 .cse22) (fp.leq (let ((.cse23 (concat .cse21 .cse22))) (fp ((_ extract 63 63) .cse23) ((_ extract 62 52) .cse23) ((_ extract 51 0) .cse23))) .cse18)))) .cse11 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet85#1_22| (_ BitVec 8))) (= .cse19 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet85#1_22|))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet97#1_22| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet97#1_22|) .cse2)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet88#1_21| (_ BitVec 8))) (= .cse20 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet88#1_21|))) (= .cse12 ((_ sign_extend 24) (_ bv1 8))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet94#1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet94#1_21|) .cse1)) (exists ((|v_skolemized_q#valueAsBitvector_84| (_ BitVec 64))) (let ((.cse24 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_84|)) (.cse26 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_84|))) (let ((.cse25 (let ((.cse27 (concat .cse24 .cse26))) (fp ((_ extract 63 63) .cse27) ((_ extract 62 52) .cse27) ((_ extract 51 0) .cse27))))) (and (= .cse3 .cse24) (fp.leq .cse25 .cse6) (= .cse26 .cse9) (fp.geq .cse25 .cse7))))))))) (not (fp.lt (fp.sub roundNearestTiesToEven (let ((.cse30 (concat .cse16 .cse13))) (fp ((_ extract 63 63) .cse30) ((_ extract 62 52) .cse30) ((_ extract 51 0) .cse30))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 21.0 4.0))) (let ((.cse31 ((_ to_fp 11 53) roundNearestTiesToEven .cse29))) (fp.mul roundNearestTiesToEven .cse31 (fp.mul roundNearestTiesToEven .cse31 ((_ to_fp 11 53) roundNearestTiesToEven (/ 997.0 5.0)))))))))) is different from false [2024-12-02 11:48:19,659 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|))) (let ((.cse1 (select .cse0 (bvadd (_ bv35 32) |c_~#WrapperStruct00~0.offset|))) (.cse16 (select .cse0 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|))) (.cse13 (select .cse0 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))) (.cse29 (let ((.cse32 (select .cse0 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse32) ((_ extract 30 23) .cse32) ((_ extract 22 0) .cse32))))) (and (= (select .cse0 (bvadd (_ bv33 32) |c_~#WrapperStruct00~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) .cse1))) (let ((.cse28 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854776000.0))) (let ((.cse18 ((_ to_fp 11 53) roundNearestTiesToEven .cse28)) (.cse11 (= ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 2.0))) .cse29)) (.cse19 (select .cse0 (bvadd (_ bv31 32) |c_~#WrapperStruct00~0.offset|))) (.cse2 (select .cse0 (bvadd (_ bv36 32) |c_~#WrapperStruct00~0.offset|))) (.cse20 (select .cse0 (bvadd (_ bv32 32) |c_~#WrapperStruct00~0.offset|))) (.cse12 (select .cse0 (bvadd (_ bv30 32) |c_~#WrapperStruct00~0.offset|))) (.cse3 (select .cse0 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))))) (.cse9 (select .cse0 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse28)))) (or (and (exists ((v_prenex_15 (_ BitVec 8))) (= .cse2 ((_ sign_extend 24) v_prenex_15))) (exists ((v_prenex_14 (_ BitVec 8))) (= ((_ sign_extend 24) v_prenex_14) .cse1)) (exists ((v_prenex_19 (_ BitVec 64))) (let ((.cse4 ((_ extract 63 32) v_prenex_19)) (.cse8 ((_ extract 31 0) v_prenex_19))) (let ((.cse5 (let ((.cse10 (concat .cse4 .cse8))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10))))) (and (= .cse3 .cse4) (fp.leq .cse5 .cse6) (fp.geq .cse5 .cse7) (= .cse8 .cse9))))) .cse11 (= ((_ sign_extend 24) (_ bv0 8)) .cse12) (exists ((v_prenex_17 (_ BitVec 64))) (let ((.cse15 ((_ extract 63 32) v_prenex_17)) (.cse14 ((_ extract 31 0) v_prenex_17))) (and (= .cse13 .cse14) (= .cse15 .cse16) (fp.leq (let ((.cse17 (concat .cse15 .cse14))) (fp ((_ extract 63 63) .cse17) ((_ extract 62 52) .cse17) ((_ extract 51 0) .cse17))) .cse18)))) (exists ((v_prenex_16 (_ BitVec 8))) (= .cse19 ((_ sign_extend 24) v_prenex_16))) (exists ((v_prenex_18 (_ BitVec 8))) (= .cse20 ((_ sign_extend 24) v_prenex_18)))) (and (exists ((|v_skolemized_q#valueAsBitvector_83| (_ BitVec 64))) (let ((.cse21 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_83|)) (.cse22 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_83|))) (and (= .cse16 .cse21) (= .cse13 .cse22) (fp.leq (let ((.cse23 (concat .cse21 .cse22))) (fp ((_ extract 63 63) .cse23) ((_ extract 62 52) .cse23) ((_ extract 51 0) .cse23))) .cse18)))) .cse11 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet85#1_22| (_ BitVec 8))) (= .cse19 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet85#1_22|))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet97#1_22| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet97#1_22|) .cse2)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet88#1_21| (_ BitVec 8))) (= .cse20 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet88#1_21|))) (= .cse12 ((_ sign_extend 24) (_ bv1 8))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet94#1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet94#1_21|) .cse1)) (exists ((|v_skolemized_q#valueAsBitvector_84| (_ BitVec 64))) (let ((.cse24 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_84|)) (.cse26 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_84|))) (let ((.cse25 (let ((.cse27 (concat .cse24 .cse26))) (fp ((_ extract 63 63) .cse27) ((_ extract 62 52) .cse27) ((_ extract 51 0) .cse27))))) (and (= .cse3 .cse24) (fp.leq .cse25 .cse6) (= .cse26 .cse9) (fp.geq .cse25 .cse7))))))))) (not (fp.lt (fp.sub roundNearestTiesToEven (let ((.cse30 (concat .cse16 .cse13))) (fp ((_ extract 63 63) .cse30) ((_ extract 62 52) .cse30) ((_ extract 51 0) .cse30))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 21.0 4.0))) (let ((.cse31 ((_ to_fp 11 53) roundNearestTiesToEven .cse29))) (fp.mul roundNearestTiesToEven .cse31 (fp.mul roundNearestTiesToEven .cse31 ((_ to_fp 11 53) roundNearestTiesToEven (/ 997.0 5.0)))))))))) is different from true [2024-12-02 11:48:44,849 WARN L286 SmtUtils]: Spent 7.57s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:48:45,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:48:45,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 636 treesize of output 336 [2024-12-02 11:49:00,215 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:49:16,467 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:49:28,319 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:49:36,904 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:49:41,553 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse18 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854776000.0))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 21.0 4.0))) (.cse8 ((_ to_fp 11 53) roundNearestTiesToEven (/ 997.0 5.0))) (.cse10 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 2.0)))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven .cse18)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse18)))) (or (and (exists ((v_prenex_19 (_ BitVec 64))) (let ((.cse0 (let ((.cse3 (concat ((_ extract 63 32) v_prenex_19) ((_ extract 31 0) v_prenex_19)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2) (= .cse0 |c_ULTIMATE.start_property_#t~mem116#1|)))) (exists ((v_arrayElimCell_278 (_ BitVec 32)) (v_prenex_17 (_ BitVec 64))) (let ((.cse9 (fp ((_ extract 31 31) v_arrayElimCell_278) ((_ extract 30 23) v_arrayElimCell_278) ((_ extract 22 0) v_arrayElimCell_278))) (.cse4 (let ((.cse11 (concat ((_ extract 63 32) v_prenex_17) ((_ extract 31 0) v_prenex_17)))) (fp ((_ extract 63 63) .cse11) ((_ extract 62 52) .cse11) ((_ extract 51 0) .cse11))))) (and (fp.leq .cse4 .cse5) (not (fp.lt (fp.sub roundNearestTiesToEven .cse4 .cse6) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven .cse9))) (fp.mul roundNearestTiesToEven .cse7 (fp.mul roundNearestTiesToEven .cse7 .cse8))))) (= .cse9 .cse10) (= |c_ULTIMATE.start_property_#t~mem117#1| .cse4))))) (and (exists ((v_arrayElimCell_278 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_83| (_ BitVec 64))) (let ((.cse14 (fp ((_ extract 31 31) v_arrayElimCell_278) ((_ extract 30 23) v_arrayElimCell_278) ((_ extract 22 0) v_arrayElimCell_278))) (.cse12 (let ((.cse15 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_83|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_83|)))) (fp ((_ extract 63 63) .cse15) ((_ extract 62 52) .cse15) ((_ extract 51 0) .cse15))))) (and (= |c_ULTIMATE.start_property_#t~mem117#1| .cse12) (not (fp.lt (fp.sub roundNearestTiesToEven .cse12 .cse6) (let ((.cse13 ((_ to_fp 11 53) roundNearestTiesToEven .cse14))) (fp.mul roundNearestTiesToEven .cse13 (fp.mul roundNearestTiesToEven .cse13 .cse8))))) (= .cse14 .cse10) (fp.leq .cse12 .cse5)))) (exists ((|v_skolemized_q#valueAsBitvector_84| (_ BitVec 64))) (let ((.cse16 (let ((.cse17 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_84|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_84|)))) (fp ((_ extract 63 63) .cse17) ((_ extract 62 52) .cse17) ((_ extract 51 0) .cse17))))) (and (= .cse16 |c_ULTIMATE.start_property_#t~mem116#1|) (fp.leq .cse16 .cse1) (fp.geq .cse16 .cse2)))))))) is different from false [2024-12-02 11:49:45,796 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 359 proven. 45 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-12-02 11:49:45,797 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:49:55,252 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:50:03,369 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:50:07,426 WARN L851 $PredicateComparison]: unable to prove that (or (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem101#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem103#1|) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem102#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))) (not (let ((.cse1 (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|))) (fp.geq (let ((.cse0 (concat (select .cse1 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)) (select .cse1 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse2 (concat (select .cse1 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse1 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))))) is different from false [2024-12-02 11:50:11,485 WARN L873 $PredicateComparison]: unable to prove that (or (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem101#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem103#1|) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem102#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))) (not (let ((.cse1 (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|))) (fp.geq (let ((.cse0 (concat (select .cse1 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)) (select .cse1 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse2 (concat (select .cse1 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse1 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))))) is different from true [2024-12-02 11:50:19,672 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:50:27,782 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:50:31,837 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|))) (let ((.cse0 (let ((.cse5 (concat (select .cse3 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (or (fp.lt (fp.sub c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (select .cse3 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))))) (not (fp.geq (let ((.cse4 (concat (select .cse3 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) .cse0))))) is different from false [2024-12-02 11:50:35,895 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|))) (let ((.cse0 (let ((.cse5 (concat (select .cse3 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (or (fp.lt (fp.sub c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (select .cse3 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))))) (not (fp.geq (let ((.cse4 (concat (select .cse3 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) .cse0))))) is different from true [2024-12-02 11:50:44,074 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:50:52,181 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:51:00,358 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:51:08,472 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:51:16,649 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:51:24,762 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:51:35,906 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:51:44,106 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:51:52,303 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:52:00,459 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:52:08,581 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:52:20,950 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:52:29,061 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:52:37,245 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:52:45,357 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:52:53,545 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:53:01,665 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:53:09,851 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:53:17,965 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:53:26,150 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:53:34,268 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:53:41,875 WARN L286 SmtUtils]: Spent 7.61s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:53:49,992 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:53:58,226 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:54:06,343 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:54:14,532 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 11:54:22,650 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)