./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-0.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX --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 236e9a83f25840205b9c3455bfa2071e05298d6f23a3b7465f829136c71d4a4c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:48:22,779 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:48:22,872 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 17:48:22,879 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:48:22,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:48:22,906 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:48:22,906 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:48:22,907 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:48:22,908 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:48:22,908 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:48:22,909 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:48:22,909 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:48:22,910 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:48:22,911 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:48:22,911 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:48:22,912 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:48:22,912 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:48:22,913 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:48:22,913 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:48:22,914 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:48:22,914 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:48:22,918 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:48:22,920 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:48:22,921 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:48:22,921 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:48:22,922 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:48:22,922 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:48:22,922 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:48:22,923 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:48:22,924 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:48:22,925 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:48:22,926 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:48:22,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:48:22,927 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:48:22,927 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:48:22,928 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:48:22,928 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:48:22,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:48:22,929 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:48:22,929 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:48:22,930 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:48:22,930 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:48:22,930 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX 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 -> 236e9a83f25840205b9c3455bfa2071e05298d6f23a3b7465f829136c71d4a4c [2024-11-08 17:48:23,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:48:23,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:48:23,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:48:23,295 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:48:23,296 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:48:23,297 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-0.i Unable to find full path for "g++" [2024-11-08 17:48:25,561 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:48:25,795 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:48:25,796 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-0.i [2024-11-08 17:48:25,815 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/data/a52194e2a/b2acde98138745f7a0f5aff1fcc5c57d/FLAGf027cd9fa [2024-11-08 17:48:26,140 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/data/a52194e2a/b2acde98138745f7a0f5aff1fcc5c57d [2024-11-08 17:48:26,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:48:26,146 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:48:26,147 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:48:26,148 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:48:26,159 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:48:26,160 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:48:26" (1/1) ... [2024-11-08 17:48:26,164 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58293404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:26, skipping insertion in model container [2024-11-08 17:48:26,165 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:48:26" (1/1) ... [2024-11-08 17:48:26,209 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:48:26,445 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_65619145-6509-4714-ab6e-73f41dbe99a2/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-0.i[918,931] [2024-11-08 17:48:26,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:48:26,539 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:48:26,553 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_65619145-6509-4714-ab6e-73f41dbe99a2/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-0.i[918,931] [2024-11-08 17:48:26,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:48:26,609 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:48:26,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:26 WrapperNode [2024-11-08 17:48:26,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:48:26,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:48:26,612 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:48:26,612 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:48:26,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:26" (1/1) ... [2024-11-08 17:48:26,634 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:26" (1/1) ... [2024-11-08 17:48:26,666 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2024-11-08 17:48:26,667 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:48:26,668 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:48:26,668 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:48:26,668 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:48:26,684 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:26" (1/1) ... [2024-11-08 17:48:26,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:26" (1/1) ... [2024-11-08 17:48:26,688 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:26" (1/1) ... [2024-11-08 17:48:26,706 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 17:48:26,706 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:26" (1/1) ... [2024-11-08 17:48:26,707 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:26" (1/1) ... [2024-11-08 17:48:26,717 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:26" (1/1) ... [2024-11-08 17:48:26,721 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:26" (1/1) ... [2024-11-08 17:48:26,724 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:26" (1/1) ... [2024-11-08 17:48:26,725 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:26" (1/1) ... [2024-11-08 17:48:26,730 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:48:26,733 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:48:26,733 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:48:26,733 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:48:26,734 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:26" (1/1) ... [2024-11-08 17:48:26,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:48:26,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:48:26,776 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:48:26,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:48:26,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:48:26,819 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:48:26,821 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:48:26,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 17:48:26,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:48:26,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:48:26,948 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:48:26,953 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:48:27,409 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 17:48:27,410 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:48:27,425 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:48:27,425 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:48:27,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:48:27 BoogieIcfgContainer [2024-11-08 17:48:27,426 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:48:27,430 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:48:27,433 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:48:27,438 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:48:27,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:48:26" (1/3) ... [2024-11-08 17:48:27,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ff36c92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:48:27, skipping insertion in model container [2024-11-08 17:48:27,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:26" (2/3) ... [2024-11-08 17:48:27,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ff36c92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:48:27, skipping insertion in model container [2024-11-08 17:48:27,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:48:27" (3/3) ... [2024-11-08 17:48:27,444 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-0.i [2024-11-08 17:48:27,469 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:48:27,470 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:48:27,573 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:48:27,582 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;@2bcea990, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:48:27,583 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:48:27,588 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:48:27,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-08 17:48:27,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:48:27,603 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:48:27,605 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:48:27,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:48:27,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1134737847, now seen corresponding path program 1 times [2024-11-08 17:48:27,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:48:27,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651759776] [2024-11-08 17:48:27,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:48:27,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:48:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:28,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:48:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:28,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:48:28,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:28,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:48:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:28,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:48:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:28,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:48:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:28,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:48:28,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:28,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:48:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:28,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:48:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:28,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:48:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:28,133 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:48:28,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:48:28,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651759776] [2024-11-08 17:48:28,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651759776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:48:28,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:48:28,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:48:28,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135902746] [2024-11-08 17:48:28,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:48:28,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:48:28,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:48:28,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:48:28,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:48:28,186 INFO L87 Difference]: Start difference. First operand has 43 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:48:28,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:48:28,217 INFO L93 Difference]: Finished difference Result 78 states and 127 transitions. [2024-11-08 17:48:28,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:48:28,220 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 67 [2024-11-08 17:48:28,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:48:28,232 INFO L225 Difference]: With dead ends: 78 [2024-11-08 17:48:28,233 INFO L226 Difference]: Without dead ends: 38 [2024-11-08 17:48:28,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 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-08 17:48:28,240 INFO L432 NwaCegarLoop]: 53 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, 53 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-08 17:48:28,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:48:28,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-08 17:48:28,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-08 17:48:28,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:48:28,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2024-11-08 17:48:28,308 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 67 [2024-11-08 17:48:28,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:48:28,309 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2024-11-08 17:48:28,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:48:28,309 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2024-11-08 17:48:28,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-08 17:48:28,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:48:28,315 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:48:28,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:48:28,316 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:48:28,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:48:28,317 INFO L85 PathProgramCache]: Analyzing trace with hash 622760957, now seen corresponding path program 1 times [2024-11-08 17:48:28,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:48:28,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683092405] [2024-11-08 17:48:28,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:48:28,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:48:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:28,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:48:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:28,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:48:28,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:28,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:48:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:28,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:48:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:28,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:48:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:28,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:48:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:28,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:48:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:28,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:48:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:28,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:48:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:28,934 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:48:28,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:48:28,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683092405] [2024-11-08 17:48:28,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683092405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:48:28,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:48:28,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:48:28,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039963606] [2024-11-08 17:48:28,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:48:28,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:48:28,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:48:28,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:48:28,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:48:28,940 INFO L87 Difference]: Start difference. First operand 38 states and 53 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:48:29,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:48:29,169 INFO L93 Difference]: Finished difference Result 109 states and 154 transitions. [2024-11-08 17:48:29,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:48:29,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 67 [2024-11-08 17:48:29,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:48:29,174 INFO L225 Difference]: With dead ends: 109 [2024-11-08 17:48:29,174 INFO L226 Difference]: Without dead ends: 74 [2024-11-08 17:48:29,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:48:29,180 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 34 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:48:29,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 135 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:48:29,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-08 17:48:29,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 62. [2024-11-08 17:48:29,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 41 states have internal predecessors, (51), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:48:29,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 87 transitions. [2024-11-08 17:48:29,208 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 87 transitions. Word has length 67 [2024-11-08 17:48:29,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:48:29,212 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 87 transitions. [2024-11-08 17:48:29,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:48:29,212 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 87 transitions. [2024-11-08 17:48:29,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-08 17:48:29,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:48:29,214 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:48:29,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 17:48:29,217 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:48:29,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:48:29,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1302819327, now seen corresponding path program 1 times [2024-11-08 17:48:29,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:48:29,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943604141] [2024-11-08 17:48:29,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:48:29,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:48:29,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:29,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:48:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:29,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:48:29,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:29,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:48:29,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:29,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:48:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:29,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:48:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:29,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:48:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:29,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:48:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:29,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:48:29,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:29,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:48:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:29,873 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:48:29,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:48:29,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943604141] [2024-11-08 17:48:29,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943604141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:48:29,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:48:29,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:48:29,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960932850] [2024-11-08 17:48:29,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:48:29,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:48:29,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:48:29,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:48:29,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:48:29,884 INFO L87 Difference]: Start difference. First operand 62 states and 87 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:48:30,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:48:30,081 INFO L93 Difference]: Finished difference Result 141 states and 197 transitions. [2024-11-08 17:48:30,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:48:30,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 67 [2024-11-08 17:48:30,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:48:30,085 INFO L225 Difference]: With dead ends: 141 [2024-11-08 17:48:30,088 INFO L226 Difference]: Without dead ends: 105 [2024-11-08 17:48:30,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:48:30,090 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 54 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:48:30,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 147 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:48:30,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-08 17:48:30,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 95. [2024-11-08 17:48:30,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 64 states have (on average 1.25) internal successors, (80), 64 states have internal predecessors, (80), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-08 17:48:30,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 134 transitions. [2024-11-08 17:48:30,131 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 134 transitions. Word has length 67 [2024-11-08 17:48:30,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:48:30,131 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 134 transitions. [2024-11-08 17:48:30,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:48:30,132 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 134 transitions. [2024-11-08 17:48:30,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-08 17:48:30,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:48:30,136 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:48:30,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 17:48:30,137 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:48:30,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:48:30,138 INFO L85 PathProgramCache]: Analyzing trace with hash 909792317, now seen corresponding path program 1 times [2024-11-08 17:48:30,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:48:30,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073354950] [2024-11-08 17:48:30,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:48:30,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:48:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:48:30,272 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 17:48:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:48:30,410 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 17:48:30,411 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 17:48:30,412 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 17:48:30,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 17:48:30,420 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-08 17:48:30,523 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 17:48:30,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 05:48:30 BoogieIcfgContainer [2024-11-08 17:48:30,528 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 17:48:30,528 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 17:48:30,528 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 17:48:30,529 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 17:48:30,529 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:48:27" (3/4) ... [2024-11-08 17:48:30,536 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 17:48:30,537 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 17:48:30,538 INFO L158 Benchmark]: Toolchain (without parser) took 4392.77ms. Allocated memory is still 159.4MB. Free memory was 123.4MB in the beginning and 88.1MB in the end (delta: 35.4MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. [2024-11-08 17:48:30,539 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 109.1MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:48:30,539 INFO L158 Benchmark]: CACSL2BoogieTranslator took 463.09ms. Allocated memory is still 159.4MB. Free memory was 123.0MB in the beginning and 108.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 17:48:30,540 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.85ms. Allocated memory is still 159.4MB. Free memory was 108.3MB in the beginning and 106.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 17:48:30,541 INFO L158 Benchmark]: Boogie Preprocessor took 61.87ms. Allocated memory is still 159.4MB. Free memory was 106.2MB in the beginning and 103.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 17:48:30,541 INFO L158 Benchmark]: RCFGBuilder took 693.63ms. Allocated memory is still 159.4MB. Free memory was 103.2MB in the beginning and 86.9MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 17:48:30,542 INFO L158 Benchmark]: TraceAbstraction took 3097.68ms. Allocated memory is still 159.4MB. Free memory was 86.4MB in the beginning and 88.1MB in the end (delta: -1.6MB). Peak memory consumption was 175.5kB. Max. memory is 16.1GB. [2024-11-08 17:48:30,542 INFO L158 Benchmark]: Witness Printer took 9.39ms. Allocated memory is still 159.4MB. Free memory is still 88.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:48:30,549 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.30ms. Allocated memory is still 109.1MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 463.09ms. Allocated memory is still 159.4MB. Free memory was 123.0MB in the beginning and 108.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.85ms. Allocated memory is still 159.4MB. Free memory was 108.3MB in the beginning and 106.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.87ms. Allocated memory is still 159.4MB. Free memory was 106.2MB in the beginning and 103.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 693.63ms. Allocated memory is still 159.4MB. Free memory was 103.2MB in the beginning and 86.9MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3097.68ms. Allocated memory is still 159.4MB. Free memory was 86.4MB in the beginning and 88.1MB in the end (delta: -1.6MB). Peak memory consumption was 175.5kB. Max. memory is 16.1GB. * Witness Printer took 9.39ms. Allocated memory is still 159.4MB. Free memory is still 88.1MB. 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 someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryFLOATComparisonOperation at line 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 0; [L23] signed long int var_1_5 = 2; [L24] signed short int var_1_6 = -10; [L25] unsigned long int var_1_7 = 1; [L26] unsigned char var_1_8 = 0; [L27] unsigned long int var_1_9 = 3470417420; [L28] unsigned char var_1_10 = 0; [L29] double var_1_12 = 25.6; [L30] double var_1_13 = 1.75; [L31] float var_1_14 = 5.4; [L32] float var_1_15 = 127.5; [L33] float var_1_16 = 3.5; [L34] signed long int var_1_17 = 64; [L35] signed long int last_1_var_1_1 = 0; [L36] signed long int last_1_var_1_5 = 2; [L37] signed short int last_1_var_1_6 = -10; [L38] unsigned long int last_1_var_1_7 = 1; [L39] float last_1_var_1_14 = 5.4; [L40] signed long int last_1_var_1_17 = 64; VAL [isInitial=0, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L98] last_1_var_1_1 = var_1_1 [L99] last_1_var_1_5 = var_1_5 [L100] last_1_var_1_6 = var_1_6 [L101] last_1_var_1_7 = var_1_7 [L102] last_1_var_1_14 = var_1_14 [L103] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L113] RET updateLastVariables() [L114] CALL updateVariables() [L81] var_1_9 = __VERIFIER_nondet_ulong() [L82] CALL assume_abort_if_not(var_1_9 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L82] RET assume_abort_if_not(var_1_9 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L83] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L83] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L84] var_1_10 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L85] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L86] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L86] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L87] var_1_12 = __VERIFIER_nondet_double() [L88] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L88] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L89] CALL assume_abort_if_not(var_1_12 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L89] RET assume_abort_if_not(var_1_12 != 0.0F) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L90] var_1_13 = __VERIFIER_nondet_double() [L91] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L91] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L92] var_1_15 = __VERIFIER_nondet_float() [L93] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L93] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L94] var_1_16 = __VERIFIER_nondet_float() [L95] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L95] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L114] RET updateVariables() [L115] CALL step() [L44] COND TRUE ((last_1_var_1_14 + last_1_var_1_14) / 9.2) < ((((last_1_var_1_14) < (var_1_16)) ? (last_1_var_1_14) : (var_1_16))) [L45] var_1_17 = ((((last_1_var_1_1) > (last_1_var_1_6)) ? (last_1_var_1_1) : (last_1_var_1_6))) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L49] COND FALSE !(last_1_var_1_7 > (- last_1_var_1_5)) [L52] var_1_1 = (((((1 - last_1_var_1_7)) < (16)) ? ((1 - last_1_var_1_7)) : (16))) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L54] COND FALSE !(last_1_var_1_17 < (- last_1_var_1_1)) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L57] COND FALSE !(var_1_17 > var_1_17) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L62] COND FALSE !((var_1_12 * last_1_var_1_14) > var_1_13) [L69] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=3470417425, var_1_16=3470417425, var_1_17=0, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L71] COND TRUE var_1_6 < var_1_17 [L72] var_1_5 = ((var_1_17 - var_1_6) + var_1_6) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=3470417425, var_1_16=3470417425, var_1_17=0, var_1_1=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L74] COND TRUE (- 8u) >= (var_1_9 - var_1_6) [L75] var_1_8 = (! var_1_10) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=3470417425, var_1_16=3470417425, var_1_17=0, var_1_1=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L115] RET step() [L116] CALL, EXPR property() [L106-L107] return (((((((last_1_var_1_7 > (- last_1_var_1_5)) ? (var_1_1 == ((signed long int) ((((last_1_var_1_5) > ((last_1_var_1_7 + last_1_var_1_6))) ? (last_1_var_1_5) : ((last_1_var_1_7 + last_1_var_1_6)))))) : (var_1_1 == ((signed long int) (((((1 - last_1_var_1_7)) < (16)) ? ((1 - last_1_var_1_7)) : (16)))))) && ((var_1_6 < var_1_17) ? (var_1_5 == ((signed long int) ((var_1_17 - var_1_6) + var_1_6))) : 1)) && ((last_1_var_1_17 < (- last_1_var_1_1)) ? (var_1_6 == ((signed short int) (32 - last_1_var_1_6))) : 1)) && ((var_1_17 > var_1_17) ? ((var_1_6 <= var_1_1) ? (var_1_7 == ((unsigned long int) ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))))) : 1) : 1)) && (((- 8u) >= (var_1_9 - var_1_6)) ? (var_1_8 == ((unsigned char) (! var_1_10))) : (var_1_8 == ((unsigned char) (((var_1_14 / var_1_12) >= var_1_14) || var_1_10))))) && (((var_1_12 * last_1_var_1_14) > var_1_13) ? ((var_1_9 < var_1_7) ? (var_1_14 == ((float) var_1_15)) : (var_1_14 == ((float) var_1_15))) : (var_1_14 == ((float) var_1_16)))) && ((((last_1_var_1_14 + last_1_var_1_14) / 9.2) < ((((last_1_var_1_14) < (var_1_16)) ? (last_1_var_1_14) : (var_1_16)))) ? (var_1_17 == ((signed long int) ((((last_1_var_1_1) > (last_1_var_1_6)) ? (last_1_var_1_1) : (last_1_var_1_6))))) : (var_1_17 == ((signed long int) last_1_var_1_6))) ; VAL [\result=0, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=3470417425, var_1_16=3470417425, var_1_17=0, var_1_1=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=3470417425, var_1_16=3470417425, var_1_17=0, var_1_1=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=3470417425, var_1_16=3470417425, var_1_17=0, var_1_1=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 4, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 88 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 88 mSDsluCounter, 335 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 177 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33 IncrementalHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 158 mSDtfsCounter, 33 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=3, InterpolantAutomatonStates: 10, 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, 3 MinimizatonAttempts, 22 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 268 NumberOfCodeBlocks, 268 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 456 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 432/432 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 17:48:30,604 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/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/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-0.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX --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 236e9a83f25840205b9c3455bfa2071e05298d6f23a3b7465f829136c71d4a4c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:48:33,499 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:48:33,610 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 17:48:33,620 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:48:33,621 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:48:33,683 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:48:33,683 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:48:33,684 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:48:33,685 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:48:33,686 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:48:33,686 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:48:33,687 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:48:33,688 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:48:33,689 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:48:33,690 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:48:33,690 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:48:33,690 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:48:33,694 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:48:33,695 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:48:33,695 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:48:33,695 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:48:33,698 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:48:33,698 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:48:33,699 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 17:48:33,699 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 17:48:33,700 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:48:33,700 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 17:48:33,700 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:48:33,701 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:48:33,701 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:48:33,701 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:48:33,702 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:48:33,702 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:48:33,702 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:48:33,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:48:33,703 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:48:33,704 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:48:33,704 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:48:33,704 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 17:48:33,704 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 17:48:33,705 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:48:33,706 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:48:33,706 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:48:33,707 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:48:33,708 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX 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 -> 236e9a83f25840205b9c3455bfa2071e05298d6f23a3b7465f829136c71d4a4c [2024-11-08 17:48:34,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:48:34,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:48:34,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:48:34,257 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:48:34,257 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:48:34,259 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-0.i Unable to find full path for "g++" [2024-11-08 17:48:36,974 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:48:37,342 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:48:37,343 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-0.i [2024-11-08 17:48:37,352 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/data/df7d88e88/9aad3f01803c452186b5fea1b42c8524/FLAG1dab18d46 [2024-11-08 17:48:37,370 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/data/df7d88e88/9aad3f01803c452186b5fea1b42c8524 [2024-11-08 17:48:37,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:48:37,374 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:48:37,376 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:48:37,376 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:48:37,385 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:48:37,386 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:48:37" (1/1) ... [2024-11-08 17:48:37,387 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@797c7c7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:37, skipping insertion in model container [2024-11-08 17:48:37,387 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:48:37" (1/1) ... [2024-11-08 17:48:37,429 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:48:37,654 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_65619145-6509-4714-ab6e-73f41dbe99a2/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-0.i[918,931] [2024-11-08 17:48:37,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:48:37,815 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:48:37,866 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_65619145-6509-4714-ab6e-73f41dbe99a2/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-0.i[918,931] [2024-11-08 17:48:37,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:48:37,937 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:48:37,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:37 WrapperNode [2024-11-08 17:48:37,938 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:48:37,940 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:48:37,940 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:48:37,940 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:48:37,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:37" (1/1) ... [2024-11-08 17:48:37,968 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:37" (1/1) ... [2024-11-08 17:48:38,008 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2024-11-08 17:48:38,012 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:48:38,013 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:48:38,013 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:48:38,013 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:48:38,028 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:37" (1/1) ... [2024-11-08 17:48:38,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:37" (1/1) ... [2024-11-08 17:48:38,034 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:37" (1/1) ... [2024-11-08 17:48:38,056 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 17:48:38,058 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:37" (1/1) ... [2024-11-08 17:48:38,058 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:37" (1/1) ... [2024-11-08 17:48:38,074 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:37" (1/1) ... [2024-11-08 17:48:38,082 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:37" (1/1) ... [2024-11-08 17:48:38,084 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:37" (1/1) ... [2024-11-08 17:48:38,089 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:37" (1/1) ... [2024-11-08 17:48:38,093 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:48:38,098 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:48:38,098 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:48:38,098 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:48:38,103 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:37" (1/1) ... [2024-11-08 17:48:38,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:48:38,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:48:38,150 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:48:38,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:48:38,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:48:38,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 17:48:38,197 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:48:38,197 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:48:38,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:48:38,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:48:38,345 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:48:38,348 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:49:00,940 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 17:49:00,940 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:49:00,960 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:49:00,960 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:49:00,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:49:00 BoogieIcfgContainer [2024-11-08 17:49:00,974 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:49:00,977 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:49:00,978 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:49:00,982 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:49:00,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:48:37" (1/3) ... [2024-11-08 17:49:00,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f1a4b5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:49:00, skipping insertion in model container [2024-11-08 17:49:00,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:37" (2/3) ... [2024-11-08 17:49:00,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f1a4b5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:49:00, skipping insertion in model container [2024-11-08 17:49:00,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:49:00" (3/3) ... [2024-11-08 17:49:00,986 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-0.i [2024-11-08 17:49:01,008 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:49:01,008 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:49:01,138 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:49:01,150 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;@51de372d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:49:01,154 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:49:01,164 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:49:01,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-08 17:49:01,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:01,181 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:49:01,182 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:01,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:01,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1134737847, now seen corresponding path program 1 times [2024-11-08 17:49:01,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:49:01,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [731881336] [2024-11-08 17:49:01,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:01,205 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-08 17:49:01,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:49:01,217 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:49:01,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:49:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:03,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 17:49:03,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:49:03,757 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 17:49:03,757 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:49:03,758 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:49:03,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [731881336] [2024-11-08 17:49:03,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [731881336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:03,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:03,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:49:03,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025260721] [2024-11-08 17:49:03,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:03,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:49:03,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:49:03,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:49:03,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:49:03,802 INFO L87 Difference]: Start difference. First operand has 43 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:49:03,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:49:03,835 INFO L93 Difference]: Finished difference Result 78 states and 127 transitions. [2024-11-08 17:49:03,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:49:03,839 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 67 [2024-11-08 17:49:03,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:49:03,848 INFO L225 Difference]: With dead ends: 78 [2024-11-08 17:49:03,849 INFO L226 Difference]: Without dead ends: 38 [2024-11-08 17:49:03,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 66 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-08 17:49:03,856 INFO L432 NwaCegarLoop]: 53 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, 53 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-08 17:49:03,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:49:03,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-08 17:49:03,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-08 17:49:03,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:49:03,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2024-11-08 17:49:03,903 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 67 [2024-11-08 17:49:03,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:49:03,904 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2024-11-08 17:49:03,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:49:03,904 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2024-11-08 17:49:03,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-08 17:49:03,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:03,907 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:49:03,936 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-08 17:49:04,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:49:04,109 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:04,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:04,110 INFO L85 PathProgramCache]: Analyzing trace with hash 622760957, now seen corresponding path program 1 times [2024-11-08 17:49:04,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:49:04,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1121300283] [2024-11-08 17:49:04,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:04,126 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-08 17:49:04,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:49:04,132 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:49:04,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:49:06,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:06,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 17:49:06,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:49:11,971 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:49:11,971 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:49:11,972 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:49:11,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1121300283] [2024-11-08 17:49:11,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1121300283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:11,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:11,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:49:11,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264544791] [2024-11-08 17:49:11,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:11,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:49:11,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:49:11,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:49:11,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:49:11,987 INFO L87 Difference]: Start difference. First operand 38 states and 53 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:49:17,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.70s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:49:21,180 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-08 17:49:25,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:49:30,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.66s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:49:34,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:49:34,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:49:34,270 INFO L93 Difference]: Finished difference Result 116 states and 162 transitions. [2024-11-08 17:49:34,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:49:34,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 67 [2024-11-08 17:49:34,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:49:34,500 INFO L225 Difference]: With dead ends: 116 [2024-11-08 17:49:34,500 INFO L226 Difference]: Without dead ends: 81 [2024-11-08 17:49:34,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:49:34,503 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 51 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 19 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:49:34,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 147 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 11 Invalid, 5 Unknown, 0 Unchecked, 22.0s Time] [2024-11-08 17:49:34,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-08 17:49:34,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 71. [2024-11-08 17:49:34,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:49:34,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2024-11-08 17:49:34,529 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 101 transitions. Word has length 67 [2024-11-08 17:49:34,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:49:34,530 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 101 transitions. [2024-11-08 17:49:34,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:49:34,531 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2024-11-08 17:49:34,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-08 17:49:34,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:34,533 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:49:34,566 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:49:34,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:49:34,735 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:34,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:34,735 INFO L85 PathProgramCache]: Analyzing trace with hash 229733947, now seen corresponding path program 1 times [2024-11-08 17:49:34,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:49:34,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [862064508] [2024-11-08 17:49:34,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:34,737 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-08 17:49:34,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:49:34,741 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:49:34,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:49:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:36,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 17:49:36,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:49:42,769 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:49:42,769 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:49:42,770 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:49:42,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [862064508] [2024-11-08 17:49:42,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [862064508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:42,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:42,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:49:42,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106340039] [2024-11-08 17:49:42,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:42,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:49:42,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:49:42,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:49:42,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:49:42,773 INFO L87 Difference]: Start difference. First operand 71 states and 101 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:49:47,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:49:51,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:49:55,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:50:00,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.66s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:50:04,739 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-08 17:50:09,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:50:13,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:50:17,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:50:22,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.67s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:50:26,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:50:26,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:50:26,502 INFO L93 Difference]: Finished difference Result 181 states and 257 transitions. [2024-11-08 17:50:26,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:50:26,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 67 [2024-11-08 17:50:26,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:50:26,737 INFO L225 Difference]: With dead ends: 181 [2024-11-08 17:50:26,738 INFO L226 Difference]: Without dead ends: 113 [2024-11-08 17:50:26,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:50:26,740 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 30 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 19 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:50:26,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 136 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 12 Invalid, 10 Unknown, 0 Unchecked, 43.4s Time] [2024-11-08 17:50:26,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-08 17:50:26,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 95. [2024-11-08 17:50:26,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 64 states have (on average 1.25) internal successors, (80), 64 states have internal predecessors, (80), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-08 17:50:26,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 134 transitions. [2024-11-08 17:50:26,787 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 134 transitions. Word has length 67 [2024-11-08 17:50:26,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:50:26,788 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 134 transitions. [2024-11-08 17:50:26,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:50:26,789 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 134 transitions. [2024-11-08 17:50:26,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-08 17:50:26,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:50:26,792 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:50:26,821 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-08 17:50:26,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:50:26,993 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:50:26,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:50:26,994 INFO L85 PathProgramCache]: Analyzing trace with hash 909792317, now seen corresponding path program 1 times [2024-11-08 17:50:26,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:50:26,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [62537918] [2024-11-08 17:50:26,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:50:26,995 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-08 17:50:26,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:50:26,999 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:50:27,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65619145-6509-4714-ab6e-73f41dbe99a2/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:50:29,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:29,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-08 17:50:29,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:51:01,745 WARN L286 SmtUtils]: Spent 7.27s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:51:09,940 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:51:17,476 WARN L286 SmtUtils]: Spent 7.22s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:51:23,051 WARN L286 SmtUtils]: Spent 5.57s 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-08 17:51:29,760 WARN L286 SmtUtils]: Spent 6.42s 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-08 17:51:38,192 WARN L286 SmtUtils]: Spent 8.34s 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-08 17:51:42,245 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~last_1_var_1_14~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 27.0 5.0)))) (let ((.cse1 ((_ sign_extend 16) c_~last_1_var_1_6~0))) (let ((.cse0 (bvsgt (_ bv0 32) .cse1))) (or (and (not .cse0) (= c_~var_1_17~0 .cse1)) (and .cse0 (= (_ bv0 32) c_~var_1_17~0))))) (= (_ bv64 32) c_~last_1_var_1_17~0) (= (_ bv1 32) c_~last_1_var_1_7~0) (fp.leq c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (= c_~last_1_var_1_5~0 (_ bv2 32)) (or (fp.lt c_~last_1_var_1_14~0 c_~var_1_16~0) (fp.lt (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode c_~last_1_var_1_14~0 c_~last_1_var_1_14~0)) ((_ to_fp 11 53) c_currentRoundingMode (/ 46.0 5.0))) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_16~0))) (= (_ bv1 32) c_~var_1_7~0) (= (_ bv0 32) c_~last_1_var_1_1~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-08 17:51:46,339 WARN L873 $PredicateComparison]: unable to prove that (and (= c_~last_1_var_1_14~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 27.0 5.0)))) (let ((.cse1 ((_ sign_extend 16) c_~last_1_var_1_6~0))) (let ((.cse0 (bvsgt (_ bv0 32) .cse1))) (or (and (not .cse0) (= c_~var_1_17~0 .cse1)) (and .cse0 (= (_ bv0 32) c_~var_1_17~0))))) (= (_ bv64 32) c_~last_1_var_1_17~0) (= (_ bv1 32) c_~last_1_var_1_7~0) (fp.leq c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (= c_~last_1_var_1_5~0 (_ bv2 32)) (or (fp.lt c_~last_1_var_1_14~0 c_~var_1_16~0) (fp.lt (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode c_~last_1_var_1_14~0 c_~last_1_var_1_14~0)) ((_ to_fp 11 53) c_currentRoundingMode (/ 46.0 5.0))) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_16~0))) (= (_ bv1 32) c_~var_1_7~0) (= (_ bv0 32) c_~last_1_var_1_1~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-08 17:52:14,939 WARN L286 SmtUtils]: Spent 6.97s 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-08 17:52:25,732 WARN L286 SmtUtils]: Spent 6.85s 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-08 17:52:32,509 WARN L873 $PredicateComparison]: unable to prove that (and (= c_~last_1_var_1_14~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 27.0 5.0)))) (let ((.cse1 ((_ sign_extend 16) c_~last_1_var_1_6~0))) (let ((.cse0 (bvsgt (_ bv0 32) .cse1))) (or (and (not .cse0) (= c_~var_1_17~0 .cse1)) (and .cse0 (= (_ bv0 32) c_~var_1_17~0))))) (= (_ bv64 32) c_~last_1_var_1_17~0) (= (_ bv0 32) c_~var_1_1~0) (= (_ bv1 32) c_~last_1_var_1_7~0) (fp.lt (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode c_~last_1_var_1_14~0 c_~last_1_var_1_14~0)) ((_ to_fp 11 53) c_currentRoundingMode (/ 46.0 5.0))) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_16~0)) (fp.leq c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (= c_~last_1_var_1_5~0 (_ bv2 32)) (= (_ bv1 32) c_~var_1_7~0) (= (_ bv0 32) c_~last_1_var_1_1~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-08 17:52:41,378 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:52:48,703 WARN L286 SmtUtils]: Spent 6.98s 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-08 17:52:56,895 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:53:05,460 WARN L286 SmtUtils]: Spent 8.17s 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-08 17:53:12,298 WARN L286 SmtUtils]: Spent 6.84s 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-08 17:53:20,490 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-08 17:53:29,068 WARN L286 SmtUtils]: Spent 8.38s 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-08 17:53:37,731 WARN L286 SmtUtils]: Spent 7.80s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:53:45,608 WARN L286 SmtUtils]: Spent 7.65s 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-08 17:53:51,780 WARN L286 SmtUtils]: Spent 6.17s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:54:00,465 WARN L286 SmtUtils]: Spent 8.16s 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-08 17:54:08,643 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-08 17:54:16,427 WARN L286 SmtUtils]: Spent 7.78s 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-08 17:54:24,922 WARN L286 SmtUtils]: Spent 8.38s 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-08 17:54:39,348 WARN L286 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:54:52,183 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:55:01,979 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:55:12,339 WARN L286 SmtUtils]: Spent 6.89s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:55:20,884 WARN L286 SmtUtils]: Spent 8.54s 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-08 17:55:24,957 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~last_1_var_1_14~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 27.0 5.0)))) (let ((.cse1 ((_ sign_extend 16) c_~last_1_var_1_6~0))) (let ((.cse0 (bvsgt (_ bv0 32) .cse1))) (or (and (not .cse0) (= c_~var_1_17~0 .cse1)) (and .cse0 (= (_ bv0 32) c_~var_1_17~0))))) (= (_ bv64 32) c_~last_1_var_1_17~0) (= c_~var_1_14~0 c_~var_1_16~0) (= (_ bv0 32) c_~var_1_1~0) (= (_ bv1 32) c_~last_1_var_1_7~0) (fp.lt (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode c_~last_1_var_1_14~0 c_~last_1_var_1_14~0)) ((_ to_fp 11 53) c_currentRoundingMode (/ 46.0 5.0))) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_16~0)) (fp.leq c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (= c_~last_1_var_1_5~0 (_ bv2 32)) (= (_ bv1 32) c_~var_1_7~0) (= (_ bv0 32) c_~last_1_var_1_1~0) (not (fp.gt (fp.mul c_currentRoundingMode c_~var_1_12~0 ((_ to_fp 11 53) c_currentRoundingMode c_~last_1_var_1_14~0)) c_~var_1_13~0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-08 17:55:29,086 WARN L873 $PredicateComparison]: unable to prove that (and (= c_~last_1_var_1_14~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 27.0 5.0)))) (let ((.cse1 ((_ sign_extend 16) c_~last_1_var_1_6~0))) (let ((.cse0 (bvsgt (_ bv0 32) .cse1))) (or (and (not .cse0) (= c_~var_1_17~0 .cse1)) (and .cse0 (= (_ bv0 32) c_~var_1_17~0))))) (= (_ bv64 32) c_~last_1_var_1_17~0) (= c_~var_1_14~0 c_~var_1_16~0) (= (_ bv0 32) c_~var_1_1~0) (= (_ bv1 32) c_~last_1_var_1_7~0) (fp.lt (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode c_~last_1_var_1_14~0 c_~last_1_var_1_14~0)) ((_ to_fp 11 53) c_currentRoundingMode (/ 46.0 5.0))) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_16~0)) (fp.leq c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (= c_~last_1_var_1_5~0 (_ bv2 32)) (= (_ bv1 32) c_~var_1_7~0) (= (_ bv0 32) c_~last_1_var_1_1~0) (not (fp.gt (fp.mul c_currentRoundingMode c_~var_1_12~0 ((_ to_fp 11 53) c_currentRoundingMode c_~last_1_var_1_14~0)) c_~var_1_13~0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-08 17:55:38,434 WARN L286 SmtUtils]: Spent 8.28s 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-08 17:55:46,757 WARN L286 SmtUtils]: Spent 8.32s 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-08 17:55:56,299 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:56:12,764 WARN L286 SmtUtils]: Spent 6.79s 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-08 17:56:21,022 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:56:29,228 WARN L286 SmtUtils]: Spent 8.21s 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-08 17:56:41,152 WARN L286 SmtUtils]: Spent 8.31s 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-08 17:56:48,174 WARN L286 SmtUtils]: Spent 7.02s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:56:56,596 WARN L286 SmtUtils]: Spent 8.42s 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-08 17:57:00,669 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~last_1_var_1_14~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 27.0 5.0)))) (let ((.cse1 ((_ sign_extend 16) c_~last_1_var_1_6~0))) (let ((.cse0 (bvsgt (_ bv0 32) .cse1))) (or (and (not .cse0) (= c_~var_1_17~0 .cse1)) (and .cse0 (= (_ bv0 32) c_~var_1_17~0))))) (= (_ bv64 32) c_~last_1_var_1_17~0) (= c_~var_1_14~0 c_~var_1_16~0) (= (_ bv0 32) c_~var_1_1~0) (= (_ bv1 32) c_~last_1_var_1_7~0) (fp.lt (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode c_~last_1_var_1_14~0 c_~last_1_var_1_14~0)) ((_ to_fp 11 53) c_currentRoundingMode (/ 46.0 5.0))) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_16~0)) (fp.leq c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (= c_~last_1_var_1_5~0 (_ bv2 32)) (= (_ bv1 32) c_~var_1_7~0) (= (_ bv0 32) c_~last_1_var_1_1~0) (not (fp.gt (fp.mul c_currentRoundingMode c_~var_1_12~0 ((_ to_fp 11 53) c_currentRoundingMode c_~last_1_var_1_14~0)) c_~var_1_13~0)) (= c_currentRoundingMode roundNearestTiesToEven) (= c_~var_1_5~0 (let ((.cse2 ((_ sign_extend 16) c_~var_1_6~0))) (bvadd .cse2 (bvneg .cse2) c_~var_1_17~0)))) is different from false [2024-11-08 17:57:04,786 WARN L873 $PredicateComparison]: unable to prove that (and (= c_~last_1_var_1_14~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 27.0 5.0)))) (let ((.cse1 ((_ sign_extend 16) c_~last_1_var_1_6~0))) (let ((.cse0 (bvsgt (_ bv0 32) .cse1))) (or (and (not .cse0) (= c_~var_1_17~0 .cse1)) (and .cse0 (= (_ bv0 32) c_~var_1_17~0))))) (= (_ bv64 32) c_~last_1_var_1_17~0) (= c_~var_1_14~0 c_~var_1_16~0) (= (_ bv0 32) c_~var_1_1~0) (= (_ bv1 32) c_~last_1_var_1_7~0) (fp.lt (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode c_~last_1_var_1_14~0 c_~last_1_var_1_14~0)) ((_ to_fp 11 53) c_currentRoundingMode (/ 46.0 5.0))) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_16~0)) (fp.leq c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (= c_~last_1_var_1_5~0 (_ bv2 32)) (= (_ bv1 32) c_~var_1_7~0) (= (_ bv0 32) c_~last_1_var_1_1~0) (not (fp.gt (fp.mul c_currentRoundingMode c_~var_1_12~0 ((_ to_fp 11 53) c_currentRoundingMode c_~last_1_var_1_14~0)) c_~var_1_13~0)) (= c_currentRoundingMode roundNearestTiesToEven) (= c_~var_1_5~0 (let ((.cse2 ((_ sign_extend 16) c_~var_1_6~0))) (bvadd .cse2 (bvneg .cse2) c_~var_1_17~0)))) is different from true [2024-11-08 17:57:13,048 WARN L286 SmtUtils]: Spent 8.22s 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-08 17:57:20,788 WARN L286 SmtUtils]: Spent 7.74s 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-08 17:57:29,062 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:57:40,207 WARN L286 SmtUtils]: Spent 8.23s 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-08 17:57:49,412 WARN L286 SmtUtils]: Spent 7.97s 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-08 17:57:57,694 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:58:07,612 WARN L286 SmtUtils]: Spent 8.29s 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-08 17:58:15,414 WARN L286 SmtUtils]: Spent 7.80s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:58:22,741 WARN L286 SmtUtils]: Spent 5.89s 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-08 17:58:30,930 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:58:41,495 WARN L286 SmtUtils]: Spent 8.27s 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-08 17:58:53,351 WARN L286 SmtUtils]: Spent 8.48s 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-08 17:58:59,919 WARN L286 SmtUtils]: Spent 6.57s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:59:03,997 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ sign_extend 16) c_~var_1_6~0))) (let ((.cse2 (bvneg .cse4))) (and (= c_~last_1_var_1_14~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 27.0 5.0)))) (let ((.cse1 ((_ sign_extend 16) c_~last_1_var_1_6~0))) (let ((.cse0 (bvsgt (_ bv0 32) .cse1))) (or (and (not .cse0) (= c_~var_1_17~0 .cse1)) (and .cse0 (= (_ bv0 32) c_~var_1_17~0))))) (bvuge (_ bv4294967288 32) (bvadd c_~var_1_9~0 .cse2)) (= (_ bv64 32) c_~last_1_var_1_17~0) (= c_~var_1_14~0 c_~var_1_16~0) (= (_ bv0 32) c_~var_1_1~0) (= (_ bv1 32) c_~last_1_var_1_7~0) (fp.lt (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode c_~last_1_var_1_14~0 c_~last_1_var_1_14~0)) ((_ to_fp 11 53) c_currentRoundingMode (/ 46.0 5.0))) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_16~0)) (fp.leq c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (= c_~last_1_var_1_5~0 (_ bv2 32)) (= (_ bv1 32) c_~var_1_7~0) (let ((.cse3 (= (_ bv0 8) c_~var_1_10~0))) (or (and (= (_ bv1 8) c_~var_1_8~0) .cse3) (and (not .cse3) (= (_ bv0 8) c_~var_1_8~0)))) (= (_ bv0 32) c_~last_1_var_1_1~0) (not (fp.gt (fp.mul c_currentRoundingMode c_~var_1_12~0 ((_ to_fp 11 53) c_currentRoundingMode c_~last_1_var_1_14~0)) c_~var_1_13~0)) (= c_currentRoundingMode roundNearestTiesToEven) (= c_~var_1_5~0 (bvadd .cse4 .cse2 c_~var_1_17~0))))) is different from false [2024-11-08 17:59:08,116 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ sign_extend 16) c_~var_1_6~0))) (let ((.cse2 (bvneg .cse4))) (and (= c_~last_1_var_1_14~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 27.0 5.0)))) (let ((.cse1 ((_ sign_extend 16) c_~last_1_var_1_6~0))) (let ((.cse0 (bvsgt (_ bv0 32) .cse1))) (or (and (not .cse0) (= c_~var_1_17~0 .cse1)) (and .cse0 (= (_ bv0 32) c_~var_1_17~0))))) (bvuge (_ bv4294967288 32) (bvadd c_~var_1_9~0 .cse2)) (= (_ bv64 32) c_~last_1_var_1_17~0) (= c_~var_1_14~0 c_~var_1_16~0) (= (_ bv0 32) c_~var_1_1~0) (= (_ bv1 32) c_~last_1_var_1_7~0) (fp.lt (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode c_~last_1_var_1_14~0 c_~last_1_var_1_14~0)) ((_ to_fp 11 53) c_currentRoundingMode (/ 46.0 5.0))) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_16~0)) (fp.leq c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (= c_~last_1_var_1_5~0 (_ bv2 32)) (= (_ bv1 32) c_~var_1_7~0) (let ((.cse3 (= (_ bv0 8) c_~var_1_10~0))) (or (and (= (_ bv1 8) c_~var_1_8~0) .cse3) (and (not .cse3) (= (_ bv0 8) c_~var_1_8~0)))) (= (_ bv0 32) c_~last_1_var_1_1~0) (not (fp.gt (fp.mul c_currentRoundingMode c_~var_1_12~0 ((_ to_fp 11 53) c_currentRoundingMode c_~last_1_var_1_14~0)) c_~var_1_13~0)) (= c_currentRoundingMode roundNearestTiesToEven) (= c_~var_1_5~0 (bvadd .cse4 .cse2 c_~var_1_17~0))))) is different from true