./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 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/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_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC --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-6497de0 [2024-11-24 01:32:48,136 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 01:32:48,247 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-24 01:32:48,256 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 01:32:48,256 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 01:32:48,291 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 01:32:48,295 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 01:32:48,295 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 01:32:48,296 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 01:32:48,296 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 01:32:48,296 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 01:32:48,296 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 01:32:48,297 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 01:32:48,298 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 01:32:48,298 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 01:32:48,298 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 01:32:48,298 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 01:32:48,299 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 01:32:48,299 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 01:32:48,299 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 01:32:48,299 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 01:32:48,299 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 01:32:48,299 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 01:32:48,300 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 01:32:48,300 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 01:32:48,300 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 01:32:48,300 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 01:32:48,300 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 01:32:48,301 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 01:32:48,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:32:48,301 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:32:48,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:32:48,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:32:48,302 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 01:32:48,302 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:32:48,302 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:32:48,302 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:32:48,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:32:48,302 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 01:32:48,303 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 01:32:48,303 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 01:32:48,303 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 01:32:48,303 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-24 01:32:48,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-24 01:32:48,304 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 01:32:48,304 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 01:32:48,304 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 01:32:48,304 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 01:32:48,304 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_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC 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-11-24 01:32:48,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 01:32:48,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 01:32:48,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 01:32:48,707 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 01:32:48,708 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 01:32:48,711 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i [2024-11-24 01:32:52,122 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/data/95479a22c/75a2d3bdf2064f74a20e77deeed17954/FLAGe3ab8a448 [2024-11-24 01:32:52,452 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 01:32:52,453 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i [2024-11-24 01:32:52,461 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/data/95479a22c/75a2d3bdf2064f74a20e77deeed17954/FLAGe3ab8a448 [2024-11-24 01:32:52,478 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/data/95479a22c/75a2d3bdf2064f74a20e77deeed17954 [2024-11-24 01:32:52,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 01:32:52,482 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 01:32:52,484 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 01:32:52,484 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 01:32:52,488 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 01:32:52,489 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:32:52" (1/1) ... [2024-11-24 01:32:52,490 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35dff9b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:32:52, skipping insertion in model container [2024-11-24 01:32:52,490 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:32:52" (1/1) ... [2024-11-24 01:32:52,517 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 01:32:52,731 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_50a58a88-1ac4-4c5d-b34b-4d391663b39f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i[916,929] [2024-11-24 01:32:52,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:32:52,844 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 01:32:52,858 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_50a58a88-1ac4-4c5d-b34b-4d391663b39f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i[916,929] [2024-11-24 01:32:52,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:32:52,972 INFO L204 MainTranslator]: Completed translation [2024-11-24 01:32:52,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:32:52 WrapperNode [2024-11-24 01:32:52,973 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 01:32:52,974 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 01:32:52,974 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 01:32:52,974 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 01:32:52,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:32:52" (1/1) ... [2024-11-24 01:32:52,997 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:32:52" (1/1) ... [2024-11-24 01:32:53,053 INFO L138 Inliner]: procedures = 30, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 580 [2024-11-24 01:32:53,053 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 01:32:53,054 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 01:32:53,054 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 01:32:53,054 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 01:32:53,066 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:32:52" (1/1) ... [2024-11-24 01:32:53,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:32:52" (1/1) ... [2024-11-24 01:32:53,073 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:32:52" (1/1) ... [2024-11-24 01:32:53,081 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-24 01:32:53,081 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:32:52" (1/1) ... [2024-11-24 01:32:53,081 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:32:52" (1/1) ... [2024-11-24 01:32:53,113 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:32:52" (1/1) ... [2024-11-24 01:32:53,115 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:32:52" (1/1) ... [2024-11-24 01:32:53,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:32:52" (1/1) ... [2024-11-24 01:32:53,135 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:32:52" (1/1) ... [2024-11-24 01:32:53,141 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:32:52" (1/1) ... [2024-11-24 01:32:53,150 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 01:32:53,151 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 01:32:53,152 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 01:32:53,152 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 01:32:53,153 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:32:52" (1/1) ... [2024-11-24 01:32:53,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:32:53,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:32:53,197 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 01:32:53,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 01:32:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 01:32:53,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-24 01:32:53,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-24 01:32:53,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-24 01:32:53,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-24 01:32:53,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-24 01:32:53,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-24 01:32:53,241 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-24 01:32:53,241 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-24 01:32:53,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-24 01:32:53,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 01:32:53,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 01:32:53,443 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 01:32:53,446 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 01:32:54,447 INFO L? ?]: Removed 161 outVars from TransFormulas that were not future-live. [2024-11-24 01:32:54,447 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 01:32:54,467 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 01:32:54,470 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-24 01:32:54,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:32:54 BoogieIcfgContainer [2024-11-24 01:32:54,470 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 01:32:54,474 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 01:32:54,474 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 01:32:54,481 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 01:32:54,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:32:52" (1/3) ... [2024-11-24 01:32:54,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb4fffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:32:54, skipping insertion in model container [2024-11-24 01:32:54,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:32:52" (2/3) ... [2024-11-24 01:32:54,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb4fffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:32:54, skipping insertion in model container [2024-11-24 01:32:54,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:32:54" (3/3) ... [2024-11-24 01:32:54,485 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-11.i [2024-11-24 01:32:54,504 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 01:32:54,506 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-11-24 01:32:54,595 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 01:32:54,616 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;@6bf5fb45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 01:32:54,616 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-24 01:32:54,623 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-11-24 01:32:54,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-24 01:32:54,639 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:32:54,640 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-11-24 01:32:54,641 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:32:54,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:32:54,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1531865718, now seen corresponding path program 1 times [2024-11-24 01:32:54,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:32:54,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587850782] [2024-11-24 01:32:54,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:32:54,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:32:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:32:55,128 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-24 01:32:55,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:32:55,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587850782] [2024-11-24 01:32:55,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587850782] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:32:55,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767743503] [2024-11-24 01:32:55,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:32:55,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:32:55,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:32:55,133 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:32:55,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-24 01:32:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:32:55,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-24 01:32:55,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:32:55,630 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-24 01:32:55,630 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:32:55,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767743503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:32:55,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 01:32:55,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-24 01:32:55,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870340136] [2024-11-24 01:32:55,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:32:55,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-24 01:32:55,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:32:55,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-24 01:32:55,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 01:32:55,665 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-11-24 01:32:55,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:32:55,703 INFO L93 Difference]: Finished difference Result 271 states and 426 transitions. [2024-11-24 01:32:55,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-24 01:32:55,705 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-11-24 01:32:55,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:32:55,719 INFO L225 Difference]: With dead ends: 271 [2024-11-24 01:32:55,719 INFO L226 Difference]: Without dead ends: 135 [2024-11-24 01:32:55,725 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-11-24 01:32:55,731 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-11-24 01:32:55,732 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-11-24 01:32:55,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-24 01:32:55,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-24 01:32:55,787 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-11-24 01:32:55,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 201 transitions. [2024-11-24 01:32:55,804 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 201 transitions. Word has length 133 [2024-11-24 01:32:55,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:32:55,805 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 201 transitions. [2024-11-24 01:32:55,806 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-11-24 01:32:55,806 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 201 transitions. [2024-11-24 01:32:55,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-24 01:32:55,812 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:32:55,812 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-11-24 01:32:55,825 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-24 01:32:56,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-24 01:32:56,014 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:32:56,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:32:56,015 INFO L85 PathProgramCache]: Analyzing trace with hash 736442078, now seen corresponding path program 1 times [2024-11-24 01:32:56,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:32:56,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409053375] [2024-11-24 01:32:56,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:32:56,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:32:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:32:56,882 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-24 01:32:56,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:32:56,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409053375] [2024-11-24 01:32:56,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409053375] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:32:56,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962730003] [2024-11-24 01:32:56,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:32:56,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:32:56,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:32:56,886 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:32:56,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-24 01:32:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:32:57,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-24 01:32:57,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:32:57,318 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-24 01:32:57,318 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:32:57,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962730003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:32:57,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 01:32:57,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-24 01:32:57,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388241287] [2024-11-24 01:32:57,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:32:57,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:32:57,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:32:57,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:32:57,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-24 01:32:57,324 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-11-24 01:32:57,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:32:57,426 INFO L93 Difference]: Finished difference Result 269 states and 402 transitions. [2024-11-24 01:32:57,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 01:32:57,430 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-11-24 01:32:57,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:32:57,433 INFO L225 Difference]: With dead ends: 269 [2024-11-24 01:32:57,433 INFO L226 Difference]: Without dead ends: 137 [2024-11-24 01:32:57,434 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-11-24 01:32:57,435 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-11-24 01:32:57,436 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-11-24 01:32:57,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-24 01:32:57,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-24 01:32:57,449 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-11-24 01:32:57,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 203 transitions. [2024-11-24 01:32:57,451 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 203 transitions. Word has length 133 [2024-11-24 01:32:57,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:32:57,453 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 203 transitions. [2024-11-24 01:32:57,453 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-11-24 01:32:57,454 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 203 transitions. [2024-11-24 01:32:57,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-24 01:32:57,456 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:32:57,457 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-11-24 01:32:57,468 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-24 01:32:57,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-24 01:32:57,658 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:32:57,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:32:57,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1071614654, now seen corresponding path program 1 times [2024-11-24 01:32:57,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:32:57,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200628452] [2024-11-24 01:32:57,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:32:57,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:32:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:32:58,295 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-24 01:32:58,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:32:58,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200628452] [2024-11-24 01:32:58,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200628452] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:32:58,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307187479] [2024-11-24 01:32:58,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:32:58,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:32:58,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:32:58,301 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:32:58,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-24 01:32:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:32:58,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-24 01:32:58,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:32:58,697 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-24 01:32:58,697 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:32:58,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307187479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:32:58,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 01:32:58,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-11-24 01:32:58,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188923630] [2024-11-24 01:32:58,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:32:58,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:32:58,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:32:58,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:32:58,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-24 01:32:58,702 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-11-24 01:32:58,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:32:58,773 INFO L93 Difference]: Finished difference Result 274 states and 407 transitions. [2024-11-24 01:32:58,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:32:58,774 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-11-24 01:32:58,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:32:58,776 INFO L225 Difference]: With dead ends: 274 [2024-11-24 01:32:58,776 INFO L226 Difference]: Without dead ends: 140 [2024-11-24 01:32:58,777 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-11-24 01:32:58,778 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-11-24 01:32:58,779 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-11-24 01:32:58,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-24 01:32:58,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-24 01:32:58,790 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-11-24 01:32:58,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 206 transitions. [2024-11-24 01:32:58,792 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 206 transitions. Word has length 135 [2024-11-24 01:32:58,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:32:58,793 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 206 transitions. [2024-11-24 01:32:58,793 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-11-24 01:32:58,793 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 206 transitions. [2024-11-24 01:32:58,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-24 01:32:58,796 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:32:58,796 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-11-24 01:32:58,807 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-24 01:32:58,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:32:58,997 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:32:58,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:32:58,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1857035872, now seen corresponding path program 1 times [2024-11-24 01:32:58,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:32:58,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237524441] [2024-11-24 01:32:58,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:32:58,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:32:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:32:59,407 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-24 01:32:59,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:32:59,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237524441] [2024-11-24 01:32:59,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237524441] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:32:59,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227230079] [2024-11-24 01:32:59,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:32:59,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:32:59,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:32:59,413 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:32:59,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-24 01:32:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:32:59,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-24 01:32:59,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:32:59,812 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-24 01:32:59,813 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:32:59,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227230079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:32:59,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 01:32:59,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-11-24 01:32:59,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720830097] [2024-11-24 01:32:59,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:32:59,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:32:59,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:32:59,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:32:59,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-24 01:32:59,816 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-11-24 01:32:59,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:32:59,886 INFO L93 Difference]: Finished difference Result 280 states and 413 transitions. [2024-11-24 01:32:59,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:32:59,887 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-11-24 01:32:59,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:32:59,892 INFO L225 Difference]: With dead ends: 280 [2024-11-24 01:32:59,892 INFO L226 Difference]: Without dead ends: 143 [2024-11-24 01:32:59,893 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-11-24 01:32:59,897 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-11-24 01:32:59,898 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-11-24 01:32:59,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-24 01:32:59,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2024-11-24 01:32:59,918 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-11-24 01:32:59,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 207 transitions. [2024-11-24 01:32:59,919 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 207 transitions. Word has length 136 [2024-11-24 01:32:59,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:32:59,923 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 207 transitions. [2024-11-24 01:32:59,923 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-11-24 01:32:59,923 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 207 transitions. [2024-11-24 01:32:59,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-24 01:32:59,925 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:32:59,928 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-11-24 01:32:59,941 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-24 01:33:00,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:33:00,130 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:33:00,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:33:00,130 INFO L85 PathProgramCache]: Analyzing trace with hash 424638356, now seen corresponding path program 1 times [2024-11-24 01:33:00,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:33:00,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106696631] [2024-11-24 01:33:00,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:33:00,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:33:00,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:33:00,571 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-24 01:33:00,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:33:00,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106696631] [2024-11-24 01:33:00,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106696631] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:33:00,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449019883] [2024-11-24 01:33:00,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:33:00,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:33:00,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:33:00,574 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:33:00,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-24 01:33:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:33:00,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-24 01:33:00,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:33:00,945 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-24 01:33:00,945 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:33:00,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449019883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:33:00,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 01:33:00,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-11-24 01:33:00,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191773546] [2024-11-24 01:33:00,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:33:00,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:33:00,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:33:00,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:33:00,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-24 01:33:00,948 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-11-24 01:33:01,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:33:01,000 INFO L93 Difference]: Finished difference Result 282 states and 415 transitions. [2024-11-24 01:33:01,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:33:01,001 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-11-24 01:33:01,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:33:01,003 INFO L225 Difference]: With dead ends: 282 [2024-11-24 01:33:01,003 INFO L226 Difference]: Without dead ends: 144 [2024-11-24 01:33:01,004 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-11-24 01:33:01,005 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-11-24 01:33:01,005 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-11-24 01:33:01,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-24 01:33:01,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-24 01:33:01,014 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-11-24 01:33:01,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 210 transitions. [2024-11-24 01:33:01,016 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 210 transitions. Word has length 137 [2024-11-24 01:33:01,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:33:01,017 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 210 transitions. [2024-11-24 01:33:01,017 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-11-24 01:33:01,017 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 210 transitions. [2024-11-24 01:33:01,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-24 01:33:01,019 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:33:01,020 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-11-24 01:33:01,031 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-24 01:33:01,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:33:01,221 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:33:01,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:33:01,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1905414409, now seen corresponding path program 1 times [2024-11-24 01:33:01,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:33:01,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629101557] [2024-11-24 01:33:01,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:33:01,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:33:01,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:33:01,663 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-24 01:33:01,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:33:01,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629101557] [2024-11-24 01:33:01,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629101557] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:33:01,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255161978] [2024-11-24 01:33:01,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:33:01,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:33:01,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:33:01,667 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:33:01,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-24 01:33:01,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:33:01,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-24 01:33:02,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:33:02,055 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-24 01:33:02,056 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:33:02,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255161978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:33:02,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 01:33:02,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2024-11-24 01:33:02,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447028126] [2024-11-24 01:33:02,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:33:02,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 01:33:02,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:33:02,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 01:33:02,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-24 01:33:02,058 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-11-24 01:33:02,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:33:02,130 INFO L93 Difference]: Finished difference Result 289 states and 422 transitions. [2024-11-24 01:33:02,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 01:33:02,131 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-11-24 01:33:02,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:33:02,132 INFO L225 Difference]: With dead ends: 289 [2024-11-24 01:33:02,133 INFO L226 Difference]: Without dead ends: 148 [2024-11-24 01:33:02,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-24 01:33:02,134 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-11-24 01:33:02,135 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-11-24 01:33:02,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-24 01:33:02,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 145. [2024-11-24 01:33:02,143 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-11-24 01:33:02,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 211 transitions. [2024-11-24 01:33:02,148 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 211 transitions. Word has length 137 [2024-11-24 01:33:02,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:33:02,149 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 211 transitions. [2024-11-24 01:33:02,149 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-11-24 01:33:02,149 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 211 transitions. [2024-11-24 01:33:02,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-24 01:33:02,151 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:33:02,151 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-11-24 01:33:02,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-24 01:33:02,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:33:02,352 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:33:02,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:33:02,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1129593061, now seen corresponding path program 1 times [2024-11-24 01:33:02,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:33:02,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162660467] [2024-11-24 01:33:02,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:33:02,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:33:02,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:33:02,490 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-24 01:33:02,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:33:02,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162660467] [2024-11-24 01:33:02,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162660467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:33:02,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:33:02,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:33:02,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089126652] [2024-11-24 01:33:02,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:33:02,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:33:02,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:33:02,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:33:02,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:33:02,498 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-11-24 01:33:02,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:33:02,535 INFO L93 Difference]: Finished difference Result 288 states and 421 transitions. [2024-11-24 01:33:02,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:33:02,536 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-11-24 01:33:02,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:33:02,538 INFO L225 Difference]: With dead ends: 288 [2024-11-24 01:33:02,538 INFO L226 Difference]: Without dead ends: 146 [2024-11-24 01:33:02,539 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-11-24 01:33:02,544 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-11-24 01:33:02,545 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-11-24 01:33:02,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-24 01:33:02,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2024-11-24 01:33:02,559 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-11-24 01:33:02,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 212 transitions. [2024-11-24 01:33:02,560 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 212 transitions. Word has length 138 [2024-11-24 01:33:02,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:33:02,561 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 212 transitions. [2024-11-24 01:33:02,561 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-11-24 01:33:02,561 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 212 transitions. [2024-11-24 01:33:02,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-24 01:33:02,567 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:33:02,567 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-11-24 01:33:02,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-24 01:33:02,568 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:33:02,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:33:02,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1885510557, now seen corresponding path program 1 times [2024-11-24 01:33:02,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:33:02,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209379711] [2024-11-24 01:33:02,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:33:02,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:33:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 01:33:02,729 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 01:33:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 01:33:02,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-24 01:33:02,887 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-24 01:33:02,888 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-24 01:33:02,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-24 01:33:02,893 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:33:02,956 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-24 01:33:02,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 01:33:02 BoogieIcfgContainer [2024-11-24 01:33:02,960 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-24 01:33:02,961 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-24 01:33:02,961 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-24 01:33:02,961 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-24 01:33:02,962 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:32:54" (3/4) ... [2024-11-24 01:33:02,965 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-24 01:33:02,966 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-24 01:33:02,967 INFO L158 Benchmark]: Toolchain (without parser) took 10484.66ms. Allocated memory was 109.1MB in the beginning and 167.8MB in the end (delta: 58.7MB). Free memory was 83.8MB in the beginning and 117.7MB in the end (delta: -33.9MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2024-11-24 01:33:02,967 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 83.9MB. Free memory is still 40.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 01:33:02,967 INFO L158 Benchmark]: CACSL2BoogieTranslator took 489.67ms. Allocated memory is still 109.1MB. Free memory was 83.8MB in the beginning and 66.6MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-24 01:33:02,968 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.66ms. Allocated memory is still 109.1MB. Free memory was 66.6MB in the beginning and 62.2MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 01:33:02,968 INFO L158 Benchmark]: Boogie Preprocessor took 96.34ms. Allocated memory is still 109.1MB. Free memory was 62.2MB in the beginning and 58.4MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 01:33:02,968 INFO L158 Benchmark]: RCFGBuilder took 1319.24ms. Allocated memory is still 109.1MB. Free memory was 58.4MB in the beginning and 66.3MB in the end (delta: -7.9MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. [2024-11-24 01:33:02,969 INFO L158 Benchmark]: TraceAbstraction took 8486.24ms. Allocated memory was 109.1MB in the beginning and 167.8MB in the end (delta: 58.7MB). Free memory was 65.8MB in the beginning and 117.7MB in the end (delta: -51.9MB). Peak memory consumption was 91.5MB. Max. memory is 16.1GB. [2024-11-24 01:33:02,969 INFO L158 Benchmark]: Witness Printer took 4.90ms. Allocated memory is still 167.8MB. Free memory was 117.7MB in the beginning and 117.7MB in the end (delta: 14.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 01:33:02,971 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.54ms. Allocated memory is still 83.9MB. Free memory is still 40.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 489.67ms. Allocated memory is still 109.1MB. Free memory was 83.8MB in the beginning and 66.6MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.66ms. Allocated memory is still 109.1MB. Free memory was 66.6MB in the beginning and 62.2MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.34ms. Allocated memory is still 109.1MB. Free memory was 62.2MB in the beginning and 58.4MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1319.24ms. Allocated memory is still 109.1MB. Free memory was 58.4MB in the beginning and 66.3MB in the end (delta: -7.9MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8486.24ms. Allocated memory was 109.1MB in the beginning and 167.8MB in the end (delta: 58.7MB). Free memory was 65.8MB in the beginning and 117.7MB in the end (delta: -51.9MB). Peak memory consumption was 91.5MB. Max. memory is 16.1GB. * Witness Printer took 4.90ms. Allocated memory is still 167.8MB. Free memory was 117.7MB in the beginning and 117.7MB in the end (delta: 14.4kB). 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 96, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 119, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 119, overapproximation of someBinaryDOUBLEComparisonOperation at line 59, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, 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: 8.3s, OverallIterations: 8, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 4472 SdHoareTripleChecker+Invalid, 0.2s 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.1s 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.6s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 2.8s 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-11-24 01:33:02,994 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/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_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/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_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC --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-6497de0 [2024-11-24 01:33:06,223 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 01:33:06,369 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-24 01:33:06,376 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 01:33:06,377 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 01:33:06,406 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 01:33:06,407 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 01:33:06,407 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 01:33:06,408 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 01:33:06,408 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 01:33:06,408 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 01:33:06,408 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 01:33:06,409 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 01:33:06,409 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 01:33:06,409 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 01:33:06,409 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 01:33:06,410 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 01:33:06,410 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 01:33:06,410 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 01:33:06,410 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 01:33:06,410 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 01:33:06,411 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 01:33:06,411 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 01:33:06,411 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-24 01:33:06,411 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-24 01:33:06,411 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-24 01:33:06,411 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 01:33:06,412 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 01:33:06,412 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 01:33:06,412 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 01:33:06,412 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 01:33:06,412 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:33:06,412 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:33:06,412 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:33:06,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:33:06,413 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 01:33:06,413 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:33:06,413 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:33:06,413 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:33:06,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:33:06,413 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 01:33:06,413 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 01:33:06,413 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 01:33:06,413 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 01:33:06,414 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-24 01:33:06,414 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-24 01:33:06,414 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 01:33:06,414 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 01:33:06,414 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 01:33:06,414 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 01:33:06,414 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_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC 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-11-24 01:33:06,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 01:33:06,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 01:33:06,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 01:33:06,810 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 01:33:06,810 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 01:33:06,813 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i [2024-11-24 01:33:10,115 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/data/8d6742883/acc04f2b874340dbaefb74b8a483ab75/FLAG4721d6cb9 [2024-11-24 01:33:10,498 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 01:33:10,499 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i [2024-11-24 01:33:10,523 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/data/8d6742883/acc04f2b874340dbaefb74b8a483ab75/FLAG4721d6cb9 [2024-11-24 01:33:10,549 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/data/8d6742883/acc04f2b874340dbaefb74b8a483ab75 [2024-11-24 01:33:10,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 01:33:10,554 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 01:33:10,557 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 01:33:10,557 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 01:33:10,564 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 01:33:10,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:33:10" (1/1) ... [2024-11-24 01:33:10,566 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53529fd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:33:10, skipping insertion in model container [2024-11-24 01:33:10,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:33:10" (1/1) ... [2024-11-24 01:33:10,595 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 01:33:10,814 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_50a58a88-1ac4-4c5d-b34b-4d391663b39f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i[916,929] [2024-11-24 01:33:10,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:33:10,943 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 01:33:10,960 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_50a58a88-1ac4-4c5d-b34b-4d391663b39f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i[916,929] [2024-11-24 01:33:11,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:33:11,114 INFO L204 MainTranslator]: Completed translation [2024-11-24 01:33:11,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:33:11 WrapperNode [2024-11-24 01:33:11,116 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 01:33:11,117 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 01:33:11,118 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 01:33:11,118 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 01:33:11,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:33:11" (1/1) ... [2024-11-24 01:33:11,161 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:33:11" (1/1) ... [2024-11-24 01:33:11,234 INFO L138 Inliner]: procedures = 34, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 578 [2024-11-24 01:33:11,234 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 01:33:11,235 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 01:33:11,235 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 01:33:11,235 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 01:33:11,250 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:33:11" (1/1) ... [2024-11-24 01:33:11,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:33:11" (1/1) ... [2024-11-24 01:33:11,261 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:33:11" (1/1) ... [2024-11-24 01:33:11,305 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-11-24 01:33:11,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:33:11" (1/1) ... [2024-11-24 01:33:11,306 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:33:11" (1/1) ... [2024-11-24 01:33:11,363 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:33:11" (1/1) ... [2024-11-24 01:33:11,369 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:33:11" (1/1) ... [2024-11-24 01:33:11,380 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:33:11" (1/1) ... [2024-11-24 01:33:11,389 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:33:11" (1/1) ... [2024-11-24 01:33:11,395 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:33:11" (1/1) ... [2024-11-24 01:33:11,408 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 01:33:11,409 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 01:33:11,412 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 01:33:11,413 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 01:33:11,414 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:33:11" (1/1) ... [2024-11-24 01:33:11,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:33:11,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:33:11,461 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 01:33:11,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 01:33:11,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 01:33:11,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-24 01:33:11,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-24 01:33:11,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-24 01:33:11,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-24 01:33:11,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-24 01:33:11,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-24 01:33:11,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-24 01:33:11,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-24 01:33:11,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-24 01:33:11,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-24 01:33:11,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-24 01:33:11,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-24 01:33:11,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-24 01:33:11,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-24 01:33:11,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-24 01:33:11,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-24 01:33:11,505 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-24 01:33:11,505 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-24 01:33:11,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-24 01:33:11,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-24 01:33:11,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 01:33:11,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 01:33:11,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-24 01:33:11,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-24 01:33:11,757 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 01:33:11,759 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 01:33:31,306 INFO L? ?]: Removed 165 outVars from TransFormulas that were not future-live. [2024-11-24 01:33:31,306 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 01:33:31,326 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 01:33:31,326 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-24 01:33:31,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:33:31 BoogieIcfgContainer [2024-11-24 01:33:31,327 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 01:33:31,329 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 01:33:31,329 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 01:33:31,335 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 01:33:31,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:33:10" (1/3) ... [2024-11-24 01:33:31,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4602ae8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:33:31, skipping insertion in model container [2024-11-24 01:33:31,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:33:11" (2/3) ... [2024-11-24 01:33:31,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4602ae8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:33:31, skipping insertion in model container [2024-11-24 01:33:31,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:33:31" (3/3) ... [2024-11-24 01:33:31,338 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-11.i [2024-11-24 01:33:31,355 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 01:33:31,356 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-11-24 01:33:31,429 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 01:33:31,448 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;@29934782, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 01:33:31,449 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-24 01:33:31,455 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-11-24 01:33:31,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-24 01:33:31,471 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:33:31,472 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-11-24 01:33:31,472 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:33:31,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:33:31,478 INFO L85 PathProgramCache]: Analyzing trace with hash -358520638, now seen corresponding path program 1 times [2024-11-24 01:33:31,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:33:31,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1461103601] [2024-11-24 01:33:31,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:33:31,490 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:33:31,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:33:31,492 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 01:33:31,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-24 01:33:32,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:33:32,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-24 01:33:32,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:33:32,943 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-11-24 01:33:32,943 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:33:32,944 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:33:32,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1461103601] [2024-11-24 01:33:32,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1461103601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:33:32,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:33:32,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 01:33:32,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749053895] [2024-11-24 01:33:32,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:33:32,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-24 01:33:32,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:33:32,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-24 01:33:32,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 01:33:32,981 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-11-24 01:33:33,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:33:33,024 INFO L93 Difference]: Finished difference Result 271 states and 426 transitions. [2024-11-24 01:33:33,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-24 01:33:33,026 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-11-24 01:33:33,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:33:33,036 INFO L225 Difference]: With dead ends: 271 [2024-11-24 01:33:33,036 INFO L226 Difference]: Without dead ends: 135 [2024-11-24 01:33:33,040 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-11-24 01:33:33,044 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-11-24 01:33:33,045 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-11-24 01:33:33,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-24 01:33:33,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-24 01:33:33,091 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-11-24 01:33:33,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 201 transitions. [2024-11-24 01:33:33,099 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 201 transitions. Word has length 133 [2024-11-24 01:33:33,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:33:33,100 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 201 transitions. [2024-11-24 01:33:33,100 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-11-24 01:33:33,100 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 201 transitions. [2024-11-24 01:33:33,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-24 01:33:33,104 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:33:33,105 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-11-24 01:33:33,134 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-24 01:33:33,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:33:33,306 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:33:33,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:33:33,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1153944278, now seen corresponding path program 1 times [2024-11-24 01:33:33,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:33:33,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [466146220] [2024-11-24 01:33:33,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:33:33,309 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:33:33,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:33:33,312 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 01:33:33,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-24 01:33:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:33:34,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-24 01:33:34,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:33:34,950 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-24 01:33:34,950 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:33:34,951 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:33:34,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [466146220] [2024-11-24 01:33:34,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [466146220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:33:34,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:33:34,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 01:33:34,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880719177] [2024-11-24 01:33:34,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:33:34,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:33:34,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:33:34,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:33:34,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:33:34,955 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-11-24 01:33:35,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:33:35,159 INFO L93 Difference]: Finished difference Result 269 states and 402 transitions. [2024-11-24 01:33:35,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 01:33:35,160 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-11-24 01:33:35,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:33:35,163 INFO L225 Difference]: With dead ends: 269 [2024-11-24 01:33:35,164 INFO L226 Difference]: Without dead ends: 137 [2024-11-24 01:33:35,165 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-11-24 01:33:35,166 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.2s IncrementalHoareTripleChecker+Time [2024-11-24 01:33:35,167 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.2s Time] [2024-11-24 01:33:35,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-24 01:33:35,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-24 01:33:35,182 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-11-24 01:33:35,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 203 transitions. [2024-11-24 01:33:35,185 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 203 transitions. Word has length 133 [2024-11-24 01:33:35,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:33:35,187 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 203 transitions. [2024-11-24 01:33:35,188 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-11-24 01:33:35,188 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 203 transitions. [2024-11-24 01:33:35,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-24 01:33:35,191 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:33:35,192 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-11-24 01:33:35,210 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -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-11-24 01:33:35,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:33:35,392 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:33:35,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:33:35,393 INFO L85 PathProgramCache]: Analyzing trace with hash -961736306, now seen corresponding path program 1 times [2024-11-24 01:33:35,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:33:35,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [535685268] [2024-11-24 01:33:35,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:33:35,394 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:33:35,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:33:35,397 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 01:33:35,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-24 01:33:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:33:36,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-24 01:33:36,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:33:36,985 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-24 01:33:36,985 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:33:36,985 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:33:36,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [535685268] [2024-11-24 01:33:36,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [535685268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:33:36,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:33:36,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:33:36,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281045534] [2024-11-24 01:33:36,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:33:36,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:33:36,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:33:36,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:33:36,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:33:36,989 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-11-24 01:33:37,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:33:37,224 INFO L93 Difference]: Finished difference Result 274 states and 407 transitions. [2024-11-24 01:33:37,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:33:37,225 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-11-24 01:33:37,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:33:37,227 INFO L225 Difference]: With dead ends: 274 [2024-11-24 01:33:37,228 INFO L226 Difference]: Without dead ends: 140 [2024-11-24 01:33:37,229 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-11-24 01:33:37,230 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-11-24 01:33:37,230 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-11-24 01:33:37,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-24 01:33:37,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-24 01:33:37,262 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-11-24 01:33:37,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 206 transitions. [2024-11-24 01:33:37,265 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 206 transitions. Word has length 135 [2024-11-24 01:33:37,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:33:37,265 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 206 transitions. [2024-11-24 01:33:37,266 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-11-24 01:33:37,266 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 206 transitions. [2024-11-24 01:33:37,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-24 01:33:37,269 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:33:37,269 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-11-24 01:33:37,299 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -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-11-24 01:33:37,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:33:37,470 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:33:37,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:33:37,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1555103386, now seen corresponding path program 1 times [2024-11-24 01:33:37,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:33:37,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1165899615] [2024-11-24 01:33:37,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:33:37,472 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:33:37,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:33:37,479 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 01:33:37,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-24 01:33:38,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:33:38,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-24 01:33:38,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:33:39,029 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-24 01:33:39,029 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:33:39,029 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:33:39,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1165899615] [2024-11-24 01:33:39,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1165899615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:33:39,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:33:39,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 01:33:39,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261924627] [2024-11-24 01:33:39,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:33:39,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:33:39,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:33:39,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:33:39,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:33:39,033 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-11-24 01:33:44,600 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-11-24 01:33:45,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:33:45,417 INFO L93 Difference]: Finished difference Result 278 states and 411 transitions. [2024-11-24 01:33:45,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 01:33:45,418 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-11-24 01:33:45,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:33:45,420 INFO L225 Difference]: With dead ends: 278 [2024-11-24 01:33:45,420 INFO L226 Difference]: Without dead ends: 141 [2024-11-24 01:33:45,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:33:45,422 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.3s IncrementalHoareTripleChecker+Time [2024-11-24 01:33:45,422 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.3s Time] [2024-11-24 01:33:45,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-24 01:33:45,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-11-24 01:33:45,434 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-11-24 01:33:45,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 207 transitions. [2024-11-24 01:33:45,437 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 207 transitions. Word has length 136 [2024-11-24 01:33:45,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:33:45,438 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 207 transitions. [2024-11-24 01:33:45,438 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-11-24 01:33:45,438 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 207 transitions. [2024-11-24 01:33:45,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-24 01:33:45,440 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:33:45,441 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-11-24 01:33:45,468 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-24 01:33:45,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:33:45,642 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:33:45,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:33:45,642 INFO L85 PathProgramCache]: Analyzing trace with hash 968297372, now seen corresponding path program 1 times [2024-11-24 01:33:45,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:33:45,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1156281392] [2024-11-24 01:33:45,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:33:45,643 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:33:45,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:33:45,647 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 01:33:45,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -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-11-24 01:33:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:33:46,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-24 01:33:46,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:33:47,055 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-24 01:33:47,056 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:33:47,057 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:33:47,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1156281392] [2024-11-24 01:33:47,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1156281392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:33:47,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:33:47,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:33:47,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943901391] [2024-11-24 01:33:47,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:33:47,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:33:47,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:33:47,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:33:47,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:33:47,063 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-11-24 01:33:47,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:33:47,459 INFO L93 Difference]: Finished difference Result 282 states and 415 transitions. [2024-11-24 01:33:47,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:33:47,460 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-11-24 01:33:47,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:33:47,461 INFO L225 Difference]: With dead ends: 282 [2024-11-24 01:33:47,462 INFO L226 Difference]: Without dead ends: 144 [2024-11-24 01:33:47,462 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-11-24 01:33:47,463 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.4s IncrementalHoareTripleChecker+Time [2024-11-24 01:33:47,464 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.4s Time] [2024-11-24 01:33:47,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-24 01:33:47,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2024-11-24 01:33:47,474 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-11-24 01:33:47,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 208 transitions. [2024-11-24 01:33:47,476 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 208 transitions. Word has length 136 [2024-11-24 01:33:47,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:33:47,477 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 208 transitions. [2024-11-24 01:33:47,477 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-11-24 01:33:47,477 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 208 transitions. [2024-11-24 01:33:47,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-24 01:33:47,480 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:33:47,480 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-11-24 01:33:47,507 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -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-11-24 01:33:47,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:33:47,681 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:33:47,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:33:47,681 INFO L85 PathProgramCache]: Analyzing trace with hash 608463171, now seen corresponding path program 1 times [2024-11-24 01:33:47,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:33:47,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2128307407] [2024-11-24 01:33:47,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:33:47,682 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:33:47,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:33:47,684 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 01:33:47,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -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-11-24 01:33:49,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:33:49,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-24 01:33:49,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:33:49,323 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-24 01:33:49,323 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:33:49,324 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:33:49,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2128307407] [2024-11-24 01:33:49,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2128307407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:33:49,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:33:49,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 01:33:49,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123498333] [2024-11-24 01:33:49,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:33:49,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 01:33:49,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:33:49,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 01:33:49,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:33:49,339 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-11-24 01:33:49,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:33:49,603 INFO L93 Difference]: Finished difference Result 285 states and 418 transitions. [2024-11-24 01:33:49,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 01:33:49,604 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-11-24 01:33:49,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:33:49,606 INFO L225 Difference]: With dead ends: 285 [2024-11-24 01:33:49,606 INFO L226 Difference]: Without dead ends: 146 [2024-11-24 01:33:49,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:33:49,608 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-11-24 01:33:49,608 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-11-24 01:33:49,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-24 01:33:49,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2024-11-24 01:33:49,618 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-11-24 01:33:49,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 209 transitions. [2024-11-24 01:33:49,620 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 209 transitions. Word has length 137 [2024-11-24 01:33:49,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:33:49,621 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 209 transitions. [2024-11-24 01:33:49,621 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-11-24 01:33:49,621 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 209 transitions. [2024-11-24 01:33:49,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-24 01:33:49,623 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:33:49,623 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-11-24 01:33:49,651 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -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-11-24 01:33:49,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:33:49,824 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:33:49,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:33:49,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1356451360, now seen corresponding path program 1 times [2024-11-24 01:33:49,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:33:49,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [444223903] [2024-11-24 01:33:49,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:33:49,825 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:33:49,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:33:49,827 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 01:33:49,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-24 01:33:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:33:51,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-24 01:33:51,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:33:51,296 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-24 01:33:51,296 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:33:51,296 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:33:51,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [444223903] [2024-11-24 01:33:51,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [444223903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:33:51,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:33:51,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:33:51,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566123624] [2024-11-24 01:33:51,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:33:51,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:33:51,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:33:51,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:33:51,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:33:51,298 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-11-24 01:33:51,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:33:51,496 INFO L93 Difference]: Finished difference Result 286 states and 419 transitions. [2024-11-24 01:33:51,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:33:51,498 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-11-24 01:33:51,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:33:51,500 INFO L225 Difference]: With dead ends: 286 [2024-11-24 01:33:51,500 INFO L226 Difference]: Without dead ends: 146 [2024-11-24 01:33:51,501 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-11-24 01:33:51,504 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-11-24 01:33:51,506 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-11-24 01:33:51,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-24 01:33:51,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2024-11-24 01:33:51,527 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-11-24 01:33:51,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 212 transitions. [2024-11-24 01:33:51,530 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 212 transitions. Word has length 137 [2024-11-24 01:33:51,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:33:51,533 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 212 transitions. [2024-11-24 01:33:51,534 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-11-24 01:33:51,534 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 212 transitions. [2024-11-24 01:33:51,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-24 01:33:51,537 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:33:51,538 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-11-24 01:33:51,569 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-24 01:33:51,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:33:51,739 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:33:51,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:33:51,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1851522911, now seen corresponding path program 1 times [2024-11-24 01:33:51,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:33:51,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2071880267] [2024-11-24 01:33:51,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:33:51,741 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:33:51,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:33:51,743 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 01:33:51,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -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-11-24 01:33:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:33:52,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-24 01:33:52,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:33:53,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:33:53,202 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-11-24 01:33:53,369 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-24 01:33:53,369 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:33:53,370 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:33:53,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2071880267] [2024-11-24 01:33:53,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2071880267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:33:53,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:33:53,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:33:53,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682780074] [2024-11-24 01:33:53,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:33:53,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 01:33:53,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:33:53,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 01:33:53,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:33:53,372 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-11-24 01:33:54,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:34:00,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 01:34:04,547 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-11-24 01:34:08,551 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-11-24 01:34:12,553 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-11-24 01:34:16,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 01:34:20,756 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-11-24 01:34:24,760 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-11-24 01:34:28,762 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-11-24 01:34:33,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:34:37,076 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-11-24 01:34:41,085 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-11-24 01:34:45,091 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-11-24 01:34:49,286 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-11-24 01:34:53,289 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-11-24 01:34:57,292 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-11-24 01:35:01,295 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-11-24 01:35:02,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:35:02,175 INFO L93 Difference]: Finished difference Result 290 states and 422 transitions. [2024-11-24 01:35:02,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-24 01:35:02,177 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-11-24 01:35:02,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:35:02,177 INFO L225 Difference]: With dead ends: 290 [2024-11-24 01:35:02,178 INFO L226 Difference]: Without dead ends: 147 [2024-11-24 01:35:02,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-24 01:35:02,179 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 196 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 68.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 68.6s IncrementalHoareTripleChecker+Time [2024-11-24 01:35:02,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 594 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 16 Unknown, 0 Unchecked, 68.6s Time] [2024-11-24 01:35:02,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-24 01:35:02,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2024-11-24 01:35:02,188 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-11-24 01:35:02,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 211 transitions. [2024-11-24 01:35:02,190 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 211 transitions. Word has length 138 [2024-11-24 01:35:02,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:35:02,190 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 211 transitions. [2024-11-24 01:35:02,190 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-11-24 01:35:02,190 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 211 transitions. [2024-11-24 01:35:02,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-24 01:35:02,192 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:35:02,192 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-11-24 01:35:02,222 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -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-11-24 01:35:02,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:35:02,393 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:35:02,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:35:02,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1010090265, now seen corresponding path program 1 times [2024-11-24 01:35:02,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:35:02,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1133414272] [2024-11-24 01:35:02,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:35:02,394 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:35:02,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:35:02,396 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 01:35:02,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -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-11-24 01:35:03,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:35:03,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-24 01:35:03,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:35:04,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-24 01:35:04,102 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-11-24 01:35:04,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:35:04,435 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-11-24 01:35:05,164 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:35:05,164 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-11-24 01:35:10,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:35:10,044 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-11-24 01:35:11,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:35:11,540 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-11-24 01:35:12,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:35:12,512 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-11-24 01:35:13,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:35:13,399 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-11-24 01:35:14,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:35:14,939 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-11-24 01:35:16,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:35:16,508 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-11-24 01:35:18,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:35:18,300 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-11-24 01:35:19,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:35:19,984 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-11-24 01:35:22,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:35:22,271 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-11-24 01:35:22,491 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 244 proven. 192 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-24 01:35:22,491 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:35:24,035 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-24 01:35:24,036 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:35:24,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1133414272] [2024-11-24 01:35:24,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1133414272] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-24 01:35:24,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 01:35:24,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2024-11-24 01:35:24,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251497749] [2024-11-24 01:35:24,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:35:24,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:35:24,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:35:24,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:35:24,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=106, Unknown=1, NotChecked=0, Total=156 [2024-11-24 01:35:24,038 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-11-24 01:35:29,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:35:32,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:35:36,316 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-11-24 01:35:38,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:35:38,369 INFO L93 Difference]: Finished difference Result 432 states and 627 transitions. [2024-11-24 01:35:38,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 01:35:38,374 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-11-24 01:35:38,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:35:38,376 INFO L225 Difference]: With dead ends: 432 [2024-11-24 01:35:38,376 INFO L226 Difference]: Without dead ends: 289 [2024-11-24 01:35:38,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=53, Invalid=128, Unknown=1, NotChecked=0, Total=182 [2024-11-24 01:35:38,378 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 139 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.2s IncrementalHoareTripleChecker+Time [2024-11-24 01:35:38,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 335 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 260 Invalid, 2 Unknown, 0 Unchecked, 14.2s Time] [2024-11-24 01:35:38,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-24 01:35:38,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 284. [2024-11-24 01:35:38,399 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-11-24 01:35:38,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 412 transitions. [2024-11-24 01:35:38,403 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 412 transitions. Word has length 140 [2024-11-24 01:35:38,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:35:38,404 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 412 transitions. [2024-11-24 01:35:38,404 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-11-24 01:35:38,404 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 412 transitions. [2024-11-24 01:35:38,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-24 01:35:38,406 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:35:38,406 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-11-24 01:35:38,433 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -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-11-24 01:35:38,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:35:38,612 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:35:38,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:35:38,613 INFO L85 PathProgramCache]: Analyzing trace with hash 47098284, now seen corresponding path program 1 times [2024-11-24 01:35:38,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:35:38,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1362451401] [2024-11-24 01:35:38,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:35:38,613 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:35:38,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:35:38,617 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 01:35:38,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-24 01:35:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:35:40,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-24 01:35:40,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:35:40,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-24 01:35:40,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-24 01:35:40,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-24 01:35:40,760 INFO L224 Elim1Store]: Index analysis took 354 ms [2024-11-24 01:35:41,072 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-11-24 01:35:41,689 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-11-24 01:35:47,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:35:47,361 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-11-24 01:35:53,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:35:53,630 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-11-24 01:36:00,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:36:00,203 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-11-24 01:36:01,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:36:01,886 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-11-24 01:36:07,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:36:07,713 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-11-24 01:36:14,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:36:14,293 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-11-24 01:36:20,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:36:20,827 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-11-24 01:36:23,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:36:23,627 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-11-24 01:36:26,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:36:26,116 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-11-24 01:36:29,784 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-11-24 01:36:29,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-24 01:36:29,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:36:29,822 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-11-24 01:36:30,450 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-11-24 01:36:40,198 WARN L286 SmtUtils]: Spent 7.04s 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-11-24 01:36:57,049 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-11-24 01:37:05,605 WARN L286 SmtUtils]: Spent 8.19s 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-11-24 01:37:09,648 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-11-24 01:37:13,701 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-11-24 01:37:21,801 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-11-24 01:37:31,544 WARN L286 SmtUtils]: Spent 7.56s 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-11-24 01:37:42,103 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-11-24 01:37:50,956 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-11-24 01:37:51,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:37:51,158 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-11-24 01:37:59,247 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-11-24 01:38:14,276 WARN L286 SmtUtils]: Spent 8.13s 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-11-24 01:38:25,047 WARN L286 SmtUtils]: Spent 8.25s 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-11-24 01:38:29,092 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-11-24 01:38:33,143 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-11-24 01:38:33,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:38:33,334 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-11-24 01:38:44,537 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-11-24 01:38:57,273 WARN L286 SmtUtils]: Spent 8.13s 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-11-24 01:39:06,475 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-11-24 01:39:16,078 WARN L286 SmtUtils]: Spent 8.16s 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-11-24 01:39:21,121 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-11-24 01:39:25,264 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 33 proven. 403 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-24 01:39:25,264 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:39:33,377 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-11-24 01:39:37,433 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-11-24 01:39:41,512 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-11-24 01:39:49,621 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-11-24 01:39:53,670 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-11-24 01:39:57,725 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-11-24 01:40:05,831 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-11-24 01:40:13,935 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-11-24 01:40:22,217 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-11-24 01:40:30,477 WARN L286 SmtUtils]: Spent 8.26s 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-11-24 01:40:34,583 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-11-24 01:40:38,695 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-11-24 01:40:39,529 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-24 01:40:39,529 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:40:39,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1362451401] [2024-11-24 01:40:39,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1362451401] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-24 01:40:39,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 01:40:39,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [23] total 27 [2024-11-24 01:40:39,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829062058] [2024-11-24 01:40:39,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:40:39,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:40:39,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:40:39,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:40:39,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=342, Unknown=15, NotChecked=258, Total=702 [2024-11-24 01:40:39,541 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-11-24 01:40:39,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:40:39,557 INFO L93 Difference]: Finished difference Result 573 states and 833 transitions. [2024-11-24 01:40:39,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:40:39,557 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-11-24 01:40:39,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:40:39,559 INFO L225 Difference]: With dead ends: 573 [2024-11-24 01:40:39,560 INFO L226 Difference]: Without dead ends: 292 [2024-11-24 01:40:39,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 256 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 73.2s TimeCoverageRelationStatistics Valid=87, Invalid=342, Unknown=15, NotChecked=258, Total=702 [2024-11-24 01:40:39,561 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-11-24 01:40:39,561 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-11-24 01:40:39,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-24 01:40:39,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2024-11-24 01:40:39,574 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-11-24 01:40:39,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 422 transitions. [2024-11-24 01:40:39,577 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 422 transitions. Word has length 142 [2024-11-24 01:40:39,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:40:39,577 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 422 transitions. [2024-11-24 01:40:39,577 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-11-24 01:40:39,577 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 422 transitions. [2024-11-24 01:40:39,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-24 01:40:39,579 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:40:39,579 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-11-24 01:40:39,606 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -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-11-24 01:40:39,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:40:39,780 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:40:39,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:40:39,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1637790262, now seen corresponding path program 1 times [2024-11-24 01:40:39,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:40:39,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [16988074] [2024-11-24 01:40:39,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:40:39,781 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:40:39,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:40:39,783 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 01:40:39,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50a58a88-1ac4-4c5d-b34b-4d391663b39f/bin/uautomizer-verify-LYvppIcaGC/mathsat -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-11-24 01:40:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:40:41,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-24 01:40:41,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:40:41,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-24 01:40:42,841 INFO L224 Elim1Store]: Index analysis took 1315 ms [2024-11-24 01:40:42,937 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-11-24 01:40:43,352 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-11-24 01:40:49,388 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-11-24 01:40:56,113 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:40:56,113 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-11-24 01:41:00,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:41:00,559 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-11-24 01:41:03,971 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:41:03,971 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-11-24 01:41:07,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:41:07,447 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-11-24 01:41:12,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:41:12,642 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-11-24 01:41:18,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:41:18,300 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-11-24 01:41:22,857 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:41:22,858 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-11-24 01:41:29,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:41:29,230 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-11-24 01:41:38,314 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-11-24 01:41:38,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-24 01:41:38,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:41:38,378 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-11-24 01:41:39,775 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-11-24 01:41:46,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:41:46,359 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-11-24 01:42:03,636 WARN L286 SmtUtils]: Spent 8.16s 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-11-24 01:42:13,931 WARN L286 SmtUtils]: Spent 8.17s 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-11-24 01:42:24,147 WARN L286 SmtUtils]: Spent 8.17s 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-11-24 01:42:32,246 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-11-24 01:42:36,296 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-11-24 01:42:40,343 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-11-24 01:42:53,144 WARN L286 SmtUtils]: Spent 8.16s 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-11-24 01:43:06,390 WARN L286 SmtUtils]: Spent 8.17s 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-11-24 01:43:14,855 WARN L286 SmtUtils]: Spent 8.16s 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-11-24 01:43:22,949 WARN L286 SmtUtils]: Spent 8.09s 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-11-24 01:43:23,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:43:23,230 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-11-24 01:43:42,098 WARN L286 SmtUtils]: Spent 8.16s 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-11-24 01:43:55,823 WARN L286 SmtUtils]: Spent 8.20s 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-11-24 01:44:04,663 WARN L286 SmtUtils]: Spent 8.18s 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-11-24 01:44:18,497 WARN L286 SmtUtils]: Spent 8.17s 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-11-24 01:44:25,914 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-11-24 01:44:30,180 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 359 proven. 45 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-24 01:44:30,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:44:39,734 WARN L286 SmtUtils]: Spent 8.22s 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-11-24 01:44:47,861 WARN L286 SmtUtils]: Spent 8.13s 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-11-24 01:44:51,929 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-11-24 01:44:55,992 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-11-24 01:45:04,212 WARN L286 SmtUtils]: Spent 8.22s 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-11-24 01:45:12,327 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-11-24 01:45:16,387 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-11-24 01:45:20,445 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-11-24 01:45:28,639 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-11-24 01:45:36,758 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-11-24 01:45:44,955 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-11-24 01:45:53,088 WARN L286 SmtUtils]: Spent 8.13s 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-11-24 01:46:01,298 WARN L286 SmtUtils]: Spent 8.21s 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-11-24 01:46:09,431 WARN L286 SmtUtils]: Spent 8.13s 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-11-24 01:46:17,639 WARN L286 SmtUtils]: Spent 8.21s 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-11-24 01:46:25,801 WARN L286 SmtUtils]: Spent 8.16s 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-11-24 01:46:34,067 WARN L286 SmtUtils]: Spent 8.26s 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-11-24 01:46:42,308 WARN L286 SmtUtils]: Spent 8.24s 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-11-24 01:46:50,599 WARN L286 SmtUtils]: Spent 8.29s 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-11-24 01:46:58,742 WARN L286 SmtUtils]: Spent 8.14s 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-11-24 01:47:08,432 WARN L286 SmtUtils]: Spent 5.44s 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-11-24 01:47:16,564 WARN L286 SmtUtils]: Spent 8.13s 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-11-24 01:47:24,776 WARN L286 SmtUtils]: Spent 8.21s 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-11-24 01:47:32,902 WARN L286 SmtUtils]: Spent 8.13s 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-11-24 01:47:41,108 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-11-24 01:47:49,232 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)