./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-62.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-62.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6eb0cfbb054266a9226d16312abfcc1d80aab089c1be5e77f741f325dadb184f --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 01:41:37,642 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 01:41:37,719 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-24 01:41:37,725 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 01:41:37,725 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 01:41:37,754 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 01:41:37,755 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 01:41:37,755 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 01:41:37,755 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 01:41:37,756 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 01:41:37,756 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 01:41:37,756 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 01:41:37,756 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 01:41:37,760 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 01:41:37,760 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 01:41:37,760 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 01:41:37,760 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 01:41:37,761 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 01:41:37,761 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 01:41:37,761 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 01:41:37,761 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 01:41:37,761 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 01:41:37,761 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 01:41:37,761 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 01:41:37,761 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 01:41:37,762 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 01:41:37,762 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 01:41:37,762 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 01:41:37,762 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 01:41:37,762 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:41:37,762 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:41:37,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:41:37,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:41:37,763 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 01:41:37,763 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:41:37,763 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:41:37,763 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:41:37,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:41:37,763 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 01:41:37,763 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 01:41:37,764 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 01:41:37,767 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 01:41:37,768 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-24 01:41:37,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-24 01:41:37,768 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 01:41:37,768 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 01:41:37,768 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 01:41:37,768 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 01:41:37,768 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6eb0cfbb054266a9226d16312abfcc1d80aab089c1be5e77f741f325dadb184f [2024-11-24 01:41:38,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 01:41:38,119 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 01:41:38,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 01:41:38,123 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 01:41:38,124 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 01:41:38,125 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-62.i [2024-11-24 01:41:41,229 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/data/eb3c53f38/ae6bc407200d4075baabfdc913eb2a36/FLAGead9f989a [2024-11-24 01:41:41,499 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 01:41:41,500 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-62.i [2024-11-24 01:41:41,507 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/data/eb3c53f38/ae6bc407200d4075baabfdc913eb2a36/FLAGead9f989a [2024-11-24 01:41:41,805 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/data/eb3c53f38/ae6bc407200d4075baabfdc913eb2a36 [2024-11-24 01:41:41,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 01:41:41,810 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 01:41:41,811 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 01:41:41,811 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 01:41:41,819 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 01:41:41,820 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:41:41" (1/1) ... [2024-11-24 01:41:41,821 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5010c59a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:41:41, skipping insertion in model container [2024-11-24 01:41:41,821 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:41:41" (1/1) ... [2024-11-24 01:41:41,847 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 01:41:42,066 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_a680295b-8728-4e83-8c14-a096fa174f6c/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-62.i[915,928] [2024-11-24 01:41:42,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:41:42,170 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 01:41:42,187 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_a680295b-8728-4e83-8c14-a096fa174f6c/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-62.i[915,928] [2024-11-24 01:41:42,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:41:42,224 INFO L204 MainTranslator]: Completed translation [2024-11-24 01:41:42,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:41:42 WrapperNode [2024-11-24 01:41:42,225 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 01:41:42,226 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 01:41:42,227 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 01:41:42,227 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 01:41:42,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:41:42" (1/1) ... [2024-11-24 01:41:42,242 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:41:42" (1/1) ... [2024-11-24 01:41:42,266 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-11-24 01:41:42,266 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 01:41:42,267 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 01:41:42,267 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 01:41:42,267 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 01:41:42,277 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:41:42" (1/1) ... [2024-11-24 01:41:42,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:41:42" (1/1) ... [2024-11-24 01:41:42,280 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:41:42" (1/1) ... [2024-11-24 01:41:42,293 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-24 01:41:42,294 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:41:42" (1/1) ... [2024-11-24 01:41:42,294 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:41:42" (1/1) ... [2024-11-24 01:41:42,300 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:41:42" (1/1) ... [2024-11-24 01:41:42,301 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:41:42" (1/1) ... [2024-11-24 01:41:42,305 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:41:42" (1/1) ... [2024-11-24 01:41:42,307 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:41:42" (1/1) ... [2024-11-24 01:41:42,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:41:42" (1/1) ... [2024-11-24 01:41:42,318 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 01:41:42,319 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 01:41:42,319 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 01:41:42,319 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 01:41:42,320 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:41:42" (1/1) ... [2024-11-24 01:41:42,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:41:42,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:41:42,364 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 01:41:42,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 01:41:42,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 01:41:42,396 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-24 01:41:42,396 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-24 01:41:42,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-24 01:41:42,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 01:41:42,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 01:41:42,481 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 01:41:42,484 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 01:41:42,772 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-24 01:41:42,773 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 01:41:42,784 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 01:41:42,784 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-24 01:41:42,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:41:42 BoogieIcfgContainer [2024-11-24 01:41:42,785 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 01:41:42,787 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 01:41:42,788 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 01:41:42,792 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 01:41:42,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:41:41" (1/3) ... [2024-11-24 01:41:42,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@165217d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:41:42, skipping insertion in model container [2024-11-24 01:41:42,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:41:42" (2/3) ... [2024-11-24 01:41:42,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@165217d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:41:42, skipping insertion in model container [2024-11-24 01:41:42,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:41:42" (3/3) ... [2024-11-24 01:41:42,795 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-62.i [2024-11-24 01:41:42,813 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 01:41:42,815 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-62.i that has 2 procedures, 47 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-24 01:41:42,908 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 01:41:42,929 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;@703f1a17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 01:41:42,929 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-24 01:41:42,935 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-24 01:41:42,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-24 01:41:42,945 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:41:42,947 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:41:42,947 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:41:42,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:41:42,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1017122564, now seen corresponding path program 1 times [2024-11-24 01:41:42,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:41:42,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415257621] [2024-11-24 01:41:42,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:41:42,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:41:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:41:43,263 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-24 01:41:43,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:41:43,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415257621] [2024-11-24 01:41:43,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415257621] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:41:43,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312062491] [2024-11-24 01:41:43,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:41:43,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:41:43,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:41:43,276 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:41:43,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-24 01:41:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:41:43,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-24 01:41:43,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:41:43,565 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-24 01:41:43,565 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:41:43,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312062491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:41:43,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 01:41:43,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-24 01:41:43,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806482882] [2024-11-24 01:41:43,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:41:43,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-24 01:41:43,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:41:43,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-24 01:41:43,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 01:41:43,605 INFO L87 Difference]: Start difference. First operand has 47 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-24 01:41:43,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:41:43,632 INFO L93 Difference]: Finished difference Result 91 states and 145 transitions. [2024-11-24 01:41:43,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-24 01:41:43,634 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 92 [2024-11-24 01:41:43,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:41:43,641 INFO L225 Difference]: With dead ends: 91 [2024-11-24 01:41:43,641 INFO L226 Difference]: Without dead ends: 43 [2024-11-24 01:41:43,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 01:41:43,649 INFO L435 NwaCegarLoop]: 64 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, 64 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:41:43,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:41:43,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-24 01:41:43,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-24 01:41:43,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-24 01:41:43,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2024-11-24 01:41:43,700 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 92 [2024-11-24 01:41:43,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:41:43,700 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2024-11-24 01:41:43,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-24 01:41:43,701 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2024-11-24 01:41:43,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-24 01:41:43,705 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:41:43,705 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:41:43,716 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-24 01:41:43,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-24 01:41:43,906 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:41:43,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:41:43,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1000603836, now seen corresponding path program 1 times [2024-11-24 01:41:43,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:41:43,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950820123] [2024-11-24 01:41:43,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:41:43,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:41:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 01:41:44,062 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 01:41:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 01:41:44,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-24 01:41:44,207 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-24 01:41:44,209 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-24 01:41:44,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-24 01:41:44,218 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-24 01:41:44,307 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-24 01:41:44,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 01:41:44 BoogieIcfgContainer [2024-11-24 01:41:44,311 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-24 01:41:44,311 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-24 01:41:44,311 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-24 01:41:44,311 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-24 01:41:44,312 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:41:42" (3/4) ... [2024-11-24 01:41:44,314 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-24 01:41:44,315 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-24 01:41:44,315 INFO L158 Benchmark]: Toolchain (without parser) took 2506.15ms. Allocated memory is still 117.4MB. Free memory was 92.7MB in the beginning and 63.7MB in the end (delta: 29.0MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2024-11-24 01:41:44,316 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 117.4MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 01:41:44,316 INFO L158 Benchmark]: CACSL2BoogieTranslator took 414.55ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 80.0MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 01:41:44,317 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.86ms. Allocated memory is still 117.4MB. Free memory was 80.0MB in the beginning and 78.3MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 01:41:44,317 INFO L158 Benchmark]: Boogie Preprocessor took 51.86ms. Allocated memory is still 117.4MB. Free memory was 78.3MB in the beginning and 76.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 01:41:44,317 INFO L158 Benchmark]: RCFGBuilder took 465.68ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 63.3MB in the end (delta: 13.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 01:41:44,318 INFO L158 Benchmark]: TraceAbstraction took 1523.22ms. Allocated memory is still 117.4MB. Free memory was 62.7MB in the beginning and 63.7MB in the end (delta: -1.0MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2024-11-24 01:41:44,318 INFO L158 Benchmark]: Witness Printer took 3.59ms. Allocated memory is still 117.4MB. Free memory was 63.7MB in the beginning and 63.7MB in the end (delta: 21.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 01:41:44,320 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.40ms. Allocated memory is still 117.4MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 414.55ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 80.0MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.86ms. Allocated memory is still 117.4MB. Free memory was 80.0MB in the beginning and 78.3MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.86ms. Allocated memory is still 117.4MB. Free memory was 78.3MB in the beginning and 76.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 465.68ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 63.3MB in the end (delta: 13.2MB). There was no memory consumed. Max. memory is 16.1GB. * TraceAbstraction took 1523.22ms. Allocated memory is still 117.4MB. Free memory was 62.7MB in the beginning and 63.7MB in the end (delta: -1.0MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. * Witness Printer took 3.59ms. Allocated memory is still 117.4MB. Free memory was 63.7MB in the beginning and 63.7MB in the end (delta: 21.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 53, overapproximation of someBinaryFLOATComparisonOperation at line 87. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 32; [L23] signed char var_1_2 = -128; [L24] unsigned char var_1_3 = 1; [L25] signed char var_1_4 = -5; [L26] unsigned char var_1_5 = 16; [L27] unsigned char var_1_9 = 25; [L28] float var_1_10 = 2.5; [L29] signed char var_1_11 = 1; [L30] signed char var_1_12 = 4; [L31] float var_1_13 = 7.75; [L32] float var_1_14 = 64.75; [L33] float var_1_15 = 256.52; [L34] float var_1_16 = 3.25; VAL [isInitial=0, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-5, var_1_5=16, var_1_9=25] [L91] isInitial = 1 [L92] FCALL initially() [L93] int k_loop; [L94] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-5, var_1_5=16, var_1_9=25] [L94] COND TRUE k_loop < 1 VAL [isInitial=1, k_loop=0, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-5, var_1_5=16, var_1_9=25] [L95] FCALL updateLastVariables() [L96] CALL updateVariables() [L60] var_1_3 = __VERIFIER_nondet_uchar() [L61] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_4=-5, var_1_5=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_4=-5, var_1_5=16, var_1_9=25] [L61] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_4=-5, var_1_5=16, var_1_9=25] [L62] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-5, var_1_5=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-5, var_1_5=16, var_1_9=25] [L62] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-5, var_1_5=16, var_1_9=25] [L63] var_1_4 = __VERIFIER_nondet_char() [L64] CALL assume_abort_if_not(var_1_4 >= -126) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=79, var_1_5=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=79, var_1_5=16, var_1_9=25] [L64] RET assume_abort_if_not(var_1_4 >= -126) VAL [isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=79, var_1_5=16, var_1_9=25] [L65] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=79, var_1_5=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=79, var_1_5=16, var_1_9=25] [L65] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=79, var_1_5=16, var_1_9=25] [L66] var_1_9 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=79, var_1_5=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=79, var_1_5=16] [L67] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=79, var_1_5=16] [L68] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=79, var_1_5=16, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=79, var_1_5=16, var_1_9=254] [L68] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=79, var_1_5=16, var_1_9=254] [L69] var_1_11 = __VERIFIER_nondet_char() [L70] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=79, var_1_5=16, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=79, var_1_5=16, var_1_9=254] [L70] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=79, var_1_5=16, var_1_9=254] [L71] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=79, var_1_5=16, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=79, var_1_5=16, var_1_9=254] [L71] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=79, var_1_5=16, var_1_9=254] [L72] var_1_12 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=0, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=79, var_1_5=16, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=0, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=79, var_1_5=16, var_1_9=254] [L73] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=0, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=79, var_1_5=16, var_1_9=254] [L74] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=0, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=79, var_1_5=16, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=0, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=79, var_1_5=16, var_1_9=254] [L74] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=0, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=79, var_1_5=16, var_1_9=254] [L75] var_1_13 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_13 >= -230584.3009213691390e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=0, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=79, var_1_5=16, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=0, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=79, var_1_5=16, var_1_9=254] [L76] RET assume_abort_if_not((var_1_13 >= -230584.3009213691390e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=0, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=79, var_1_5=16, var_1_9=254] [L77] var_1_14 = __VERIFIER_nondet_float() [L78] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=0, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=79, var_1_5=16, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=0, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=79, var_1_5=16, var_1_9=254] [L78] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=0, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=79, var_1_5=16, var_1_9=254] [L79] var_1_15 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=0, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=79, var_1_5=16, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=0, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=79, var_1_5=16, var_1_9=254] [L80] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=0, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=79, var_1_5=16, var_1_9=254] [L81] var_1_16 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=0, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=79, var_1_5=16, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=0, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=79, var_1_5=16, var_1_9=254] [L82] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=0, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=79, var_1_5=16, var_1_9=254] [L96] RET updateVariables() [L97] CALL step() [L38] var_1_1 = (16 - 2) VAL [isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=0, var_1_1=14, var_1_2=-128, var_1_3=1, var_1_4=79, var_1_5=16, var_1_9=254] [L39] COND TRUE \read(var_1_3) [L40] var_1_2 = ((((-4) < 0 ) ? -(-4) : (-4))) VAL [isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=0, var_1_1=14, var_1_2=4, var_1_3=1, var_1_4=79, var_1_5=16, var_1_9=254] [L44] COND FALSE !(var_1_4 < ((16 + var_1_11) - var_1_12)) [L51] var_1_10 = var_1_14 VAL [isInitial=1, var_1_10=261, var_1_11=63, var_1_12=0, var_1_14=261, var_1_1=14, var_1_2=4, var_1_3=1, var_1_4=79, var_1_5=16, var_1_9=254] [L53] COND TRUE (var_1_10 * var_1_10) > var_1_10 [L54] var_1_5 = (((((25) < (5)) ? (25) : (5))) + 10) VAL [isInitial=1, var_1_10=261, var_1_11=63, var_1_12=0, var_1_14=261, var_1_1=14, var_1_2=4, var_1_3=1, var_1_4=79, var_1_5=15, var_1_9=254] [L97] RET step() [L98] CALL, EXPR property() [L87-L88] return (((var_1_1 == ((signed char) (16 - 2))) && (var_1_3 ? (var_1_2 == ((signed char) ((((-4) < 0 ) ? -(-4) : (-4))))) : (var_1_2 == ((signed char) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))))) && (((var_1_10 * var_1_10) > var_1_10) ? (var_1_5 == ((unsigned char) (((((25) < (5)) ? (25) : (5))) + 10))) : (var_1_5 == ((unsigned char) var_1_9)))) && ((var_1_4 < ((16 + var_1_11) - var_1_12)) ? (var_1_3 ? (var_1_10 == ((float) ((var_1_13 + 50.6f) + var_1_14))) : (var_1_10 == ((float) (var_1_15 - var_1_16)))) : (var_1_10 == ((float) var_1_14))) ; VAL [\result=0, isInitial=1, var_1_10=261, var_1_11=63, var_1_12=0, var_1_14=261, var_1_1=14, var_1_2=4, var_1_3=1, var_1_4=79, var_1_5=15, var_1_9=254] [L98] RET, EXPR property() [L98] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=261, var_1_11=63, var_1_12=0, var_1_14=261, var_1_1=14, var_1_2=4, var_1_3=1, var_1_4=79, var_1_5=15, var_1_9=254] [L19] reach_error() VAL [isInitial=1, var_1_10=261, var_1_11=63, var_1_12=0, var_1_14=261, var_1_1=14, var_1_2=4, var_1_3=1, var_1_4=79, var_1_5=15, var_1_9=254] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 2, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 64 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 64 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 276 NumberOfCodeBlocks, 276 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 182 ConstructedInterpolants, 0 QuantifiedInterpolants, 182 SizeOfPredicates, 0 NumberOfNonLiveVariables, 217 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 702/728 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-24 01:41:44,341 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-62.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6eb0cfbb054266a9226d16312abfcc1d80aab089c1be5e77f741f325dadb184f --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 01:41:47,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 01:41:47,509 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-24 01:41:47,522 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 01:41:47,526 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 01:41:47,577 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 01:41:47,578 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 01:41:47,578 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 01:41:47,579 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 01:41:47,579 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 01:41:47,581 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 01:41:47,581 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 01:41:47,581 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 01:41:47,582 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 01:41:47,582 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 01:41:47,582 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 01:41:47,582 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 01:41:47,583 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 01:41:47,583 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 01:41:47,583 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 01:41:47,583 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 01:41:47,583 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 01:41:47,584 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 01:41:47,584 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-24 01:41:47,584 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-24 01:41:47,584 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-24 01:41:47,584 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 01:41:47,584 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 01:41:47,584 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 01:41:47,584 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 01:41:47,585 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 01:41:47,586 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:41:47,586 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:41:47,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:41:47,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:41:47,586 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 01:41:47,586 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:41:47,586 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:41:47,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:41:47,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:41:47,587 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 01:41:47,587 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 01:41:47,587 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 01:41:47,587 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 01:41:47,587 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-24 01:41:47,587 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-24 01:41:47,587 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 01:41:47,587 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 01:41:47,587 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 01:41:47,587 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 01:41:47,587 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6eb0cfbb054266a9226d16312abfcc1d80aab089c1be5e77f741f325dadb184f [2024-11-24 01:41:47,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 01:41:47,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 01:41:47,936 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 01:41:47,938 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 01:41:47,938 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 01:41:47,941 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-62.i [2024-11-24 01:41:51,179 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/data/09be34d05/a5799925fec6439d94df2dd217b5e1d2/FLAGba20d78cd [2024-11-24 01:41:51,536 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 01:41:51,536 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-62.i [2024-11-24 01:41:51,549 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/data/09be34d05/a5799925fec6439d94df2dd217b5e1d2/FLAGba20d78cd [2024-11-24 01:41:51,581 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/data/09be34d05/a5799925fec6439d94df2dd217b5e1d2 [2024-11-24 01:41:51,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 01:41:51,586 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 01:41:51,589 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 01:41:51,589 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 01:41:51,596 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 01:41:51,597 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:41:51" (1/1) ... [2024-11-24 01:41:51,600 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@162e944b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:41:51, skipping insertion in model container [2024-11-24 01:41:51,600 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:41:51" (1/1) ... [2024-11-24 01:41:51,622 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 01:41:51,811 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-62.i[915,928] [2024-11-24 01:41:51,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:41:51,920 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 01:41:51,933 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_a680295b-8728-4e83-8c14-a096fa174f6c/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-62.i[915,928] [2024-11-24 01:41:51,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:41:52,004 INFO L204 MainTranslator]: Completed translation [2024-11-24 01:41:52,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:41:52 WrapperNode [2024-11-24 01:41:52,005 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 01:41:52,006 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 01:41:52,007 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 01:41:52,007 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 01:41:52,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:41:52" (1/1) ... [2024-11-24 01:41:52,033 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:41:52" (1/1) ... [2024-11-24 01:41:52,067 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2024-11-24 01:41:52,068 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 01:41:52,069 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 01:41:52,069 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 01:41:52,069 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 01:41:52,079 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:41:52" (1/1) ... [2024-11-24 01:41:52,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:41:52" (1/1) ... [2024-11-24 01:41:52,083 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:41:52" (1/1) ... [2024-11-24 01:41:52,097 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-24 01:41:52,097 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:41:52" (1/1) ... [2024-11-24 01:41:52,097 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:41:52" (1/1) ... [2024-11-24 01:41:52,106 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:41:52" (1/1) ... [2024-11-24 01:41:52,107 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:41:52" (1/1) ... [2024-11-24 01:41:52,111 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:41:52" (1/1) ... [2024-11-24 01:41:52,113 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:41:52" (1/1) ... [2024-11-24 01:41:52,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:41:52" (1/1) ... [2024-11-24 01:41:52,118 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 01:41:52,119 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 01:41:52,119 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 01:41:52,119 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 01:41:52,120 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:41:52" (1/1) ... [2024-11-24 01:41:52,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:41:52,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:41:52,170 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 01:41:52,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 01:41:52,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 01:41:52,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-24 01:41:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-24 01:41:52,209 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-24 01:41:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 01:41:52,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 01:41:52,301 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 01:41:52,303 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 01:41:54,464 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-24 01:41:54,464 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 01:41:54,482 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 01:41:54,483 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-24 01:41:54,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:41:54 BoogieIcfgContainer [2024-11-24 01:41:54,484 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 01:41:54,486 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 01:41:54,487 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 01:41:54,494 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 01:41:54,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:41:51" (1/3) ... [2024-11-24 01:41:54,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d86cce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:41:54, skipping insertion in model container [2024-11-24 01:41:54,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:41:52" (2/3) ... [2024-11-24 01:41:54,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d86cce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:41:54, skipping insertion in model container [2024-11-24 01:41:54,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:41:54" (3/3) ... [2024-11-24 01:41:54,498 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-62.i [2024-11-24 01:41:54,518 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 01:41:54,521 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-62.i that has 2 procedures, 47 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-24 01:41:54,601 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 01:41:54,617 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;@71a86806, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 01:41:54,618 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-24 01:41:54,624 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-24 01:41:54,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-24 01:41:54,636 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:41:54,637 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:41:54,638 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:41:54,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:41:54,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1017122564, now seen corresponding path program 1 times [2024-11-24 01:41:54,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:41:54,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1664472477] [2024-11-24 01:41:54,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:41:54,660 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:41:54,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:41:54,662 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 01:41:54,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-24 01:41:54,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:41:54,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-24 01:41:55,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:41:55,073 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-11-24 01:41:55,073 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:41:55,074 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:41:55,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1664472477] [2024-11-24 01:41:55,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1664472477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:41:55,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:41:55,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 01:41:55,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938554948] [2024-11-24 01:41:55,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:41:55,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-24 01:41:55,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:41:55,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-24 01:41:55,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 01:41:55,105 INFO L87 Difference]: Start difference. First operand has 47 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-24 01:41:55,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:41:55,144 INFO L93 Difference]: Finished difference Result 91 states and 145 transitions. [2024-11-24 01:41:55,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-24 01:41:55,146 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 92 [2024-11-24 01:41:55,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:41:55,152 INFO L225 Difference]: With dead ends: 91 [2024-11-24 01:41:55,152 INFO L226 Difference]: Without dead ends: 43 [2024-11-24 01:41:55,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 01:41:55,159 INFO L435 NwaCegarLoop]: 64 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, 64 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:41:55,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:41:55,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-24 01:41:55,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-24 01:41:55,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-24 01:41:55,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2024-11-24 01:41:55,219 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 92 [2024-11-24 01:41:55,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:41:55,223 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2024-11-24 01:41:55,224 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-24 01:41:55,224 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2024-11-24 01:41:55,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-24 01:41:55,229 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:41:55,230 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:41:55,239 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-24 01:41:55,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:41:55,431 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:41:55,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:41:55,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1000603836, now seen corresponding path program 1 times [2024-11-24 01:41:55,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:41:55,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1220210470] [2024-11-24 01:41:55,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:41:55,433 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:41:55,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:41:55,435 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 01:41:55,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-24 01:41:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:41:55,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-24 01:41:55,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:42:40,133 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 123 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-24 01:42:40,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:43:41,909 WARN L286 SmtUtils]: Spent 5.08s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:44:41,468 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse43 ((_ sign_extend 24) c_~var_1_2~0)) (.cse45 ((_ sign_extend 24) c_~var_1_4~0))) (let ((.cse11 (bvslt .cse45 (_ bv0 32))) (.cse15 (= (_ bv4 32) .cse43)) (.cse35 ((_ zero_extend 24) c_~var_1_5~0)) (.cse42 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse45)))) (.cse36 ((_ sign_extend 24) ((_ extract 7 0) .cse45))) (.cse4 (= c_~var_1_3~0 (_ bv0 8))) (.cse44 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0))) (.cse23 (bvslt .cse45 (bvadd (bvneg ((_ sign_extend 24) c_~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) c_~var_1_11~0))))) (let ((.cse1 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))))) (.cse26 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0)))) (.cse2 (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0))) (.cse22 (not .cse23)) (.cse6 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse44) c_~var_1_14~0)))) (.cse7 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse44) c_~var_1_14~0))))) (.cse10 (not .cse4)) (.cse12 (= .cse43 .cse36)) (.cse32 (fp.eq c_~var_1_10~0 c_~var_1_14~0)) (.cse20 (= .cse43 .cse42)) (.cse34 (= (_ bv15 32) .cse35)) (.cse17 (not .cse15)) (.cse19 (= (_ bv4 32) .cse42)) (.cse21 (not .cse11)) (.cse0 (fp.gt (fp.mul c_currentRoundingMode c_~var_1_10~0 c_~var_1_10~0) c_~var_1_10~0))) (and (or .cse0 (let ((.cse18 (= (_ bv4 32) .cse36)) (.cse33 (forall ((~var_1_9~0 (_ BitVec 8))) (= ((_ zero_extend 24) ~var_1_9~0) .cse35)))) (let ((.cse13 (or .cse32 .cse33)) (.cse14 (or (not .cse32) .cse33)) (.cse30 (not .cse18)) (.cse29 (not .cse19)) (.cse16 (not .cse34))) (let ((.cse27 (and (or .cse4 (let ((.cse31 (and .cse32 .cse33))) (and (or (and .cse16 (or .cse31 .cse30) (or .cse18 .cse31) .cse15) .cse11) (or (and .cse16 .cse15 (or .cse31 .cse19) (or .cse31 .cse29)) .cse21)))) (or .cse10 (and (or .cse11 (and .cse16 (or (and .cse32 .cse12 .cse33) .cse15) (or .cse17 (and .cse32 .cse33 .cse18)))) (or (and (or .cse17 (and .cse32 .cse33 .cse19)) .cse16 (or (and .cse32 .cse20 .cse33) .cse15)) .cse21))))) (.cse28 (and .cse13 .cse14))) (let ((.cse8 (or .cse11 (and (or .cse18 .cse28) .cse16 (or .cse28 .cse30) .cse15))) (.cse9 (or (and (or .cse28 .cse19) (or .cse28 .cse29) .cse16 .cse15) .cse21)) (.cse24 (or .cse27 .cse7)) (.cse25 (or .cse27 .cse6))) (and (or .cse1 (and .cse2 (or (let ((.cse3 (or (and .cse16 (or .cse17 (and .cse13 .cse14 .cse19)) (or (and .cse20 .cse13 .cse14) .cse15)) .cse21)) (.cse5 (or .cse11 (and (or (and .cse12 .cse13 .cse14) .cse15) .cse16 (or .cse17 (and .cse13 .cse18 .cse14)))))) (and (or (and .cse3 .cse4 .cse5) .cse6) (or .cse7 (and (or (and .cse8 .cse9) .cse4) (or .cse10 (and .cse3 .cse5)))))) .cse22) (or .cse23 (and .cse24 .cse25)))) (or (and (or (and .cse8 .cse2 .cse10 .cse6 .cse9) .cse22) (or .cse23 (and .cse24 .cse2 .cse25))) .cse26))))))) (or (let ((.cse41 (and (or .cse4 (and .cse32 .cse34 .cse15)) (or .cse10 (and (or .cse11 (and .cse32 .cse34 .cse12)) (or (and .cse32 .cse20 .cse34 (or .cse17 .cse19)) .cse21)))))) (let ((.cse39 (or .cse41 .cse7)) (.cse40 (or .cse41 .cse6))) (and (or (and (or (let ((.cse37 (or .cse11 (and .cse34 .cse12))) (.cse38 (or (and .cse20 .cse34) .cse21))) (and (or (and .cse37 .cse4 .cse38) .cse6) (or .cse7 (and (or (and .cse37 .cse38) .cse10) (or .cse4 (and .cse34 .cse15)))))) .cse22) .cse2 (or .cse23 (and .cse39 .cse40))) .cse1) (or .cse26 (and (or .cse23 (and .cse2 .cse39 .cse40)) (or (and .cse34 .cse2 .cse10 .cse15 .cse6) .cse22)))))) (not .cse0)))))) is different from true [2024-11-24 01:45:17,496 WARN L873 $PredicateComparison]: unable to prove that (or (not (fp.gt (fp.mul c_currentRoundingMode c_~var_1_10~0 c_~var_1_10~0) c_~var_1_10~0)) (let ((.cse19 ((_ sign_extend 24) c_~var_1_4~0))) (let ((.cse11 (= c_~var_1_3~0 (_ bv0 8))) (.cse14 (bvslt .cse19 (_ bv0 32))) (.cse20 ((_ sign_extend 24) c_~var_1_2~0))) (let ((.cse3 (= (_ bv4 32) .cse20)) (.cse12 (= .cse20 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse19))))) (.cse13 (not .cse14)) (.cse15 (= .cse20 ((_ sign_extend 24) ((_ extract 7 0) .cse19)))) (.cse2 (not .cse11)) (.cse18 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0)))) (let ((.cse5 (bvslt .cse19 (bvadd (bvneg ((_ sign_extend 24) c_~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) c_~var_1_11~0)))) (.cse4 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse18) c_~var_1_14~0)))) (.cse8 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse18) c_~var_1_14~0))))) (.cse16 (let ((.cse17 (fp.eq c_~var_1_10~0 c_~var_1_14~0))) (and (or .cse11 (and .cse17 .cse3)) (or (and (or (and .cse17 .cse12) .cse13) (or (and .cse17 .cse15) .cse14)) .cse2))))) (let ((.cse6 (or .cse8 .cse16)) (.cse7 (or .cse16 .cse4)) (.cse1 (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0))) (.cse0 (not .cse5))) (and (or (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4)) (or .cse5 (and .cse6 .cse1 .cse7)))) (or (and (or .cse5 (and .cse6 .cse7)) .cse1 (or (let ((.cse9 (or .cse14 .cse15)) (.cse10 (or .cse12 .cse13))) (and (or .cse8 (and (or .cse2 (and .cse9 .cse10)) (or .cse11 .cse3))) (or (and .cse9 .cse11 .cse10) .cse4))) .cse0)) (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0)))))))))))) is different from true [2024-11-24 01:45:42,708 WARN L873 $PredicateComparison]: unable to prove that (or (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0))) (.cse2 (let ((.cse6 (= c_~var_1_3~0 (_ bv0 8))) (.cse4 ((_ sign_extend 24) c_~var_1_2~0))) (and (or (and (forall ((~var_1_4~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse3 ((_ sign_extend 24) ~var_1_4~0))) (or (bvslt .cse3 (_ bv0 32)) (= ((_ sign_extend 24) ((_ extract 7 0) .cse3)) .cse4) (bvslt .cse3 (bvadd (bvneg ((_ sign_extend 24) ~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) ~var_1_11~0)))))) (forall ((~var_1_4~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse5 ((_ sign_extend 24) ~var_1_4~0))) (or (bvslt .cse5 (bvadd (bvneg ((_ sign_extend 24) ~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) ~var_1_11~0))) (not (bvslt .cse5 (_ bv0 32))) (= .cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse5)))))))) (not .cse6)) (or .cse6 (= (_ bv4 32) .cse4)))))) (and (or (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_14~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse1) c_~var_1_14~0))) .cse2) (or (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_14~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse1) c_~var_1_14~0)))) .cse2) (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0)))))) (and (or .cse0 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_14~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0)))) (or .cse0 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_14~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))))))) (not (fp.gt (fp.mul c_currentRoundingMode c_~var_1_14~0 c_~var_1_14~0) c_~var_1_14~0))) is different from true [2024-11-24 01:45:55,104 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-24 01:45:55,105 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:45:55,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1220210470] [2024-11-24 01:45:55,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1220210470] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-24 01:45:55,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 01:45:55,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2024-11-24 01:45:55,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627550148] [2024-11-24 01:45:55,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:45:55,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-24 01:45:55,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:45:55,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-24 01:45:55,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=144, Unknown=3, NotChecked=78, Total=272 [2024-11-24 01:45:55,109 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-24 01:46:03,479 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_14~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0)))) (.cse2 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_14~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))))) (.cse0 (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0))) (.cse3 (not (fp.gt (fp.mul c_currentRoundingMode c_~var_1_14~0 c_~var_1_14~0) c_~var_1_14~0)))) (and (or (and (or .cse0 .cse1) (or .cse0 .cse2)) .cse3) (or (let ((.cse4 (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0))) (.cse6 (let ((.cse10 (= c_~var_1_3~0 (_ bv0 8))) (.cse8 ((_ sign_extend 24) c_~var_1_2~0))) (and (or (and (forall ((~var_1_4~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse7 ((_ sign_extend 24) ~var_1_4~0))) (or (bvslt .cse7 (_ bv0 32)) (= ((_ sign_extend 24) ((_ extract 7 0) .cse7)) .cse8) (bvslt .cse7 (bvadd (bvneg ((_ sign_extend 24) ~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) ~var_1_11~0)))))) (forall ((~var_1_4~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse9 ((_ sign_extend 24) ~var_1_4~0))) (or (bvslt .cse9 (bvadd (bvneg ((_ sign_extend 24) ~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) ~var_1_11~0))) (not (bvslt .cse9 (_ bv0 32))) (= .cse8 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse9)))))))) (not .cse10)) (or .cse10 (= (_ bv4 32) .cse8)))))) (and (or (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_14~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse5) c_~var_1_14~0))) .cse6) (or (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_14~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse5) c_~var_1_14~0)))) .cse6) .cse0)))) (and (or .cse4 .cse1) (or .cse4 .cse2))) .cse3))) is different from true [2024-11-24 01:46:05,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-24 01:46:06,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-24 01:46:08,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-24 01:46:11,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-24 01:46:14,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-24 01:46:15,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 01:46:19,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.67s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-24 01:46:20,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-24 01:46:25,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-24 01:46:25,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:46:25,050 INFO L93 Difference]: Finished difference Result 82 states and 113 transitions. [2024-11-24 01:46:25,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 01:46:25,065 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 92 [2024-11-24 01:46:25,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:46:25,067 INFO L225 Difference]: With dead ends: 82 [2024-11-24 01:46:25,067 INFO L226 Difference]: Without dead ends: 80 [2024-11-24 01:46:25,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 33.9s TimeCoverageRelationStatistics Valid=49, Invalid=145, Unknown=4, NotChecked=108, Total=306 [2024-11-24 01:46:25,068 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 47 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 348 IncrementalHoareTripleChecker+Unchecked, 25.8s IncrementalHoareTripleChecker+Time [2024-11-24 01:46:25,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 312 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 348 Unchecked, 25.8s Time] [2024-11-24 01:46:25,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-24 01:46:25,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2024-11-24 01:46:25,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 50 states have internal predecessors, (59), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-24 01:46:25,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 109 transitions. [2024-11-24 01:46:25,091 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 109 transitions. Word has length 92 [2024-11-24 01:46:25,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:46:25,091 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 109 transitions. [2024-11-24 01:46:25,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-24 01:46:25,092 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 109 transitions. [2024-11-24 01:46:25,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-24 01:46:25,094 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:46:25,094 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:46:25,102 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-24 01:46:25,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:46:25,295 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:46:25,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:46:25,296 INFO L85 PathProgramCache]: Analyzing trace with hash -998756794, now seen corresponding path program 1 times [2024-11-24 01:46:25,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:46:25,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1438666147] [2024-11-24 01:46:25,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:46:25,297 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:46:25,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:46:25,298 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 01:46:25,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-24 01:46:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:46:25,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-24 01:46:25,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:47:05,135 WARN L286 SmtUtils]: Spent 5.32s 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-24 01:47:09,923 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 123 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-24 01:47:09,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:48:53,772 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse36 ((_ sign_extend 24) c_~var_1_2~0))) (let ((.cse12 (= (_ bv4 32) .cse36)) (.cse38 ((_ sign_extend 24) c_~var_1_4~0))) (let ((.cse16 (bvslt .cse38 (_ bv0 32))) (.cse28 (not .cse12)) (.cse26 ((_ zero_extend 24) c_~var_1_5~0)) (.cse35 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse38)))) (.cse29 ((_ sign_extend 24) ((_ extract 7 0) .cse38))) (.cse9 (= c_~var_1_3~0 (_ bv0 8))) (.cse37 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0))) (.cse1 (bvslt .cse38 (bvadd (bvneg ((_ sign_extend 24) c_~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) c_~var_1_11~0))))) (let ((.cse20 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))))) (.cse21 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0)))) (.cse4 (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0))) (.cse19 (not .cse1)) (.cse13 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse37) c_~var_1_14~0)))) (.cse5 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse37) c_~var_1_14~0))))) (.cse6 (not .cse9)) (.cse15 (= .cse36 .cse29)) (.cse23 (fp.eq c_~var_1_10~0 c_~var_1_14~0)) (.cse17 (= .cse36 .cse35)) (.cse27 (= (_ bv15 32) .cse26)) (.cse24 (or .cse28 (= (_ bv4 32) .cse35))) (.cse18 (not .cse16)) (.cse0 (fp.gt (fp.mul c_currentRoundingMode c_~var_1_10~0 c_~var_1_10~0) c_~var_1_10~0))) (and (or .cse0 (let ((.cse25 ((_ zero_extend 24) c_~var_1_9~0))) (let ((.cse14 (or .cse28 (= (_ bv4 32) .cse29))) (.cse10 (or (= .cse25 (_ bv15 32)) (not .cse27))) (.cse11 (= .cse25 .cse26))) (let ((.cse22 (and (or (and .cse23 .cse11 .cse12) .cse9) (or .cse6 (and (or .cse16 (and .cse23 .cse11 .cse14 .cse15)) (or (and .cse23 .cse17 .cse24 .cse10 .cse11) .cse18)))))) (let ((.cse2 (or .cse5 .cse22)) (.cse3 (or .cse22 .cse13))) (and (or (and (or .cse1 (and .cse2 .cse3)) .cse4 (or (let ((.cse7 (or (and .cse17 .cse10 .cse11) .cse18)) (.cse8 (or (and .cse11 .cse14 .cse15) .cse16))) (and (or .cse5 (and (or .cse6 (and .cse7 .cse8)) (or .cse9 (and .cse10 .cse11 .cse12)))) (or (and .cse9 .cse7 .cse8) .cse13))) .cse19)) .cse20) (or .cse21 (and (or (and .cse10 .cse11 .cse4 .cse6 .cse12 .cse13) .cse19) (or .cse1 (and .cse4 .cse2 .cse3)))))))))) (or (let ((.cse34 (and (or .cse9 (and .cse23 .cse27 .cse12)) (or .cse6 (and (or .cse16 (and .cse23 .cse27 .cse15)) (or (and .cse23 .cse17 .cse27 .cse24) .cse18)))))) (let ((.cse32 (or .cse34 .cse5)) (.cse33 (or .cse34 .cse13))) (and (or (and (or (let ((.cse30 (or .cse16 (and .cse27 .cse15))) (.cse31 (or (and .cse17 .cse27) .cse18))) (and (or (and .cse30 .cse9 .cse31) .cse13) (or .cse5 (and (or (and .cse30 .cse31) .cse6) (or .cse9 (and .cse27 .cse12)))))) .cse19) .cse4 (or .cse1 (and .cse32 .cse33))) .cse20) (or .cse21 (and (or .cse1 (and .cse4 .cse32 .cse33)) (or (and .cse27 .cse4 .cse6 .cse12 .cse13) .cse19)))))) (not .cse0))))))) is different from true [2024-11-24 01:49:37,465 WARN L873 $PredicateComparison]: unable to prove that (or (fp.gt (fp.mul c_currentRoundingMode c_~var_1_10~0 c_~var_1_10~0) c_~var_1_10~0) (let ((.cse19 ((_ sign_extend 24) c_~var_1_4~0))) (let ((.cse11 (= c_~var_1_3~0 (_ bv0 8))) (.cse14 (bvslt .cse19 (_ bv0 32))) (.cse20 ((_ sign_extend 24) c_~var_1_2~0))) (let ((.cse3 (= (_ bv4 32) .cse20)) (.cse12 (= .cse20 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse19))))) (.cse13 (not .cse14)) (.cse15 (= .cse20 ((_ sign_extend 24) ((_ extract 7 0) .cse19)))) (.cse2 (not .cse11)) (.cse18 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0)))) (let ((.cse5 (bvslt .cse19 (bvadd (bvneg ((_ sign_extend 24) c_~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) c_~var_1_11~0)))) (.cse4 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse18) c_~var_1_14~0)))) (.cse8 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse18) c_~var_1_14~0))))) (.cse16 (let ((.cse17 (fp.eq c_~var_1_10~0 c_~var_1_14~0))) (and (or .cse11 (and .cse17 .cse3)) (or (and (or (and .cse17 .cse12) .cse13) (or (and .cse17 .cse15) .cse14)) .cse2))))) (let ((.cse6 (or .cse8 .cse16)) (.cse7 (or .cse16 .cse4)) (.cse1 (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0))) (.cse0 (not .cse5))) (and (or (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4)) (or .cse5 (and .cse6 .cse1 .cse7)))) (or (and (or .cse5 (and .cse6 .cse7)) .cse1 (or (let ((.cse9 (or .cse14 .cse15)) (.cse10 (or .cse12 .cse13))) (and (or .cse8 (and (or .cse2 (and .cse9 .cse10)) (or .cse11 .cse3))) (or (and .cse9 .cse11 .cse10) .cse4))) .cse0)) (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0)))))))))))) is different from true [2024-11-24 01:49:59,064 WARN L286 SmtUtils]: Spent 5.07s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:50:05,695 WARN L873 $PredicateComparison]: unable to prove that (or (let ((.cse0 (let ((.cse2 (let ((.cse6 (fp.eq c_~var_1_14~0 c_~var_1_14~0)) (.cse4 ((_ sign_extend 24) c_~var_1_2~0)) (.cse7 (= c_~var_1_3~0 (_ bv0 8)))) (and (or (and (forall ((~var_1_4~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse3 ((_ sign_extend 24) ~var_1_4~0))) (or (bvslt .cse3 (_ bv0 32)) (= ((_ sign_extend 24) ((_ extract 7 0) .cse3)) .cse4) (bvslt .cse3 (bvadd (bvneg ((_ sign_extend 24) ~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) ~var_1_11~0)))))) (forall ((~var_1_4~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse5 ((_ sign_extend 24) ~var_1_4~0))) (or (bvslt .cse5 (bvadd (bvneg ((_ sign_extend 24) ~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) ~var_1_11~0))) (not (bvslt .cse5 (_ bv0 32))) (= .cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse5))))))) .cse6) (not .cse7)) (or (and .cse6 (= (_ bv4 32) .cse4)) .cse7)))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0)))) (and (or (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_14~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse1) c_~var_1_14~0)))) .cse2) (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0)) (or .cse2 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_14~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse1) c_~var_1_14~0)))))))) (and (or .cse0 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_14~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0)))) (or .cse0 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_14~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))))))) (fp.gt (fp.mul c_currentRoundingMode c_~var_1_14~0 c_~var_1_14~0) c_~var_1_14~0)) is different from true [2024-11-24 01:50:25,248 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 33 proven. 6 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-24 01:50:25,248 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:50:25,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1438666147] [2024-11-24 01:50:25,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1438666147] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 01:50:25,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 01:50:25,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2024-11-24 01:50:25,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920096818] [2024-11-24 01:50:25,249 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 01:50:25,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-24 01:50:25,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:50:25,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-24 01:50:25,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=229, Unknown=3, NotChecked=102, Total=420 [2024-11-24 01:50:25,251 INFO L87 Difference]: Start difference. First operand 77 states and 109 transitions. Second operand has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2024-11-24 01:50:39,155 WARN L286 SmtUtils]: Spent 5.06s on a formula simplification. DAG size of input: 41 DAG size of output: 39 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-24 01:51:11,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-24 01:51:18,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-24 01:51:23,368 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (= c_~var_1_3~0 (_ bv0 8)))) (let ((.cse7 (not .cse8))) (and (or (let ((.cse0 (let ((.cse2 (let ((.cse6 (fp.eq c_~var_1_14~0 c_~var_1_14~0)) (.cse4 ((_ sign_extend 24) c_~var_1_2~0))) (and (or (and (forall ((~var_1_4~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse3 ((_ sign_extend 24) ~var_1_4~0))) (or (bvslt .cse3 (_ bv0 32)) (= ((_ sign_extend 24) ((_ extract 7 0) .cse3)) .cse4) (bvslt .cse3 (bvadd (bvneg ((_ sign_extend 24) ~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) ~var_1_11~0)))))) (forall ((~var_1_4~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse5 ((_ sign_extend 24) ~var_1_4~0))) (or (bvslt .cse5 (bvadd (bvneg ((_ sign_extend 24) ~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) ~var_1_11~0))) (not (bvslt .cse5 (_ bv0 32))) (= .cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse5))))))) .cse6) .cse7) (or (and .cse6 (= (_ bv4 32) .cse4)) .cse8)))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0)))) (and (or (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_14~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse1) c_~var_1_14~0)))) .cse2) (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0)) (or .cse2 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_14~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse1) c_~var_1_14~0)))))))) (and (or .cse0 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_14~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0)))) (or .cse0 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_14~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))))))) (fp.gt (fp.mul c_currentRoundingMode c_~var_1_14~0 c_~var_1_14~0) c_~var_1_14~0)) (= (_ bv4 8) c_~var_1_2~0) (= (_ bv14 8) c_~var_1_1~0) (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse9 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (or (and (fp.leq c_~var_1_14~0 .cse9) (fp.geq c_~var_1_14~0 .cse10)) (and (fp.leq c_~var_1_14~0 (fp.neg .cse10)) (fp.geq c_~var_1_14~0 (fp.neg .cse9))))) .cse7 (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-24 01:51:27,585 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse20 ((_ sign_extend 24) c_~var_1_4~0))) (let ((.cse5 (bvslt .cse20 (bvadd (bvneg ((_ sign_extend 24) c_~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) c_~var_1_11~0)))) (.cse11 (= c_~var_1_3~0 (_ bv0 8)))) (let ((.cse2 (not .cse11)) (.cse0 (not .cse5))) (and (= (_ bv4 8) c_~var_1_2~0) (or (fp.gt (fp.mul c_currentRoundingMode c_~var_1_10~0 c_~var_1_10~0) c_~var_1_10~0) (let ((.cse14 (bvslt .cse20 (_ bv0 32))) (.cse19 ((_ sign_extend 24) c_~var_1_2~0))) (let ((.cse3 (= (_ bv4 32) .cse19)) (.cse12 (= .cse19 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse20))))) (.cse13 (not .cse14)) (.cse15 (= .cse19 ((_ sign_extend 24) ((_ extract 7 0) .cse20)))) (.cse18 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0)))) (let ((.cse4 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse18) c_~var_1_14~0)))) (.cse8 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse18) c_~var_1_14~0))))) (.cse16 (let ((.cse17 (fp.eq c_~var_1_10~0 c_~var_1_14~0))) (and (or .cse11 (and .cse17 .cse3)) (or (and (or (and .cse17 .cse12) .cse13) (or (and .cse17 .cse15) .cse14)) .cse2))))) (let ((.cse6 (or .cse8 .cse16)) (.cse7 (or .cse16 .cse4)) (.cse1 (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0)))) (and (or (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4)) (or .cse5 (and .cse6 .cse1 .cse7)))) (or (and (or .cse5 (and .cse6 .cse7)) .cse1 (or (let ((.cse9 (or .cse14 .cse15)) (.cse10 (or .cse12 .cse13))) (and (or .cse8 (and (or .cse2 (and .cse9 .cse10)) (or .cse11 .cse3))) (or (and .cse9 .cse11 .cse10) .cse4))) .cse0)) (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))))))))))) (= (_ bv14 8) c_~var_1_1~0) (let ((.cse22 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse21 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (or (and (fp.leq c_~var_1_14~0 .cse21) (fp.geq c_~var_1_14~0 .cse22)) (and (fp.leq c_~var_1_14~0 (fp.neg .cse22)) (fp.geq c_~var_1_14~0 (fp.neg .cse21))))) .cse2 .cse0 (= c_~var_1_14~0 c_~var_1_10~0) (= c_currentRoundingMode roundNearestTiesToEven))))) is different from true [2024-11-24 01:51:32,271 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse37 ((_ sign_extend 24) c_~var_1_2~0))) (let ((.cse12 (= (_ bv4 32) .cse37)) (.cse39 ((_ sign_extend 24) c_~var_1_4~0))) (let ((.cse1 (bvslt .cse39 (bvadd (bvneg ((_ sign_extend 24) c_~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) c_~var_1_11~0)))) (.cse9 (= c_~var_1_3~0 (_ bv0 8))) (.cse0 (fp.gt (fp.mul c_currentRoundingMode c_~var_1_10~0 c_~var_1_10~0) c_~var_1_10~0)) (.cse16 (bvslt .cse39 (_ bv0 32))) (.cse28 (not .cse12)) (.cse26 ((_ zero_extend 24) c_~var_1_5~0)) (.cse36 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse39)))) (.cse29 ((_ sign_extend 24) ((_ extract 7 0) .cse39))) (.cse38 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0)))) (let ((.cse20 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))))) (.cse21 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0)))) (.cse4 (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0))) (.cse13 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse38) c_~var_1_14~0)))) (.cse5 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse38) c_~var_1_14~0))))) (.cse15 (= .cse37 .cse29)) (.cse23 (fp.eq c_~var_1_10~0 c_~var_1_14~0)) (.cse17 (= .cse37 .cse36)) (.cse27 (= (_ bv15 32) .cse26)) (.cse24 (or .cse28 (= (_ bv4 32) .cse36))) (.cse18 (not .cse16)) (.cse30 (not .cse0)) (.cse6 (not .cse9)) (.cse19 (not .cse1))) (and (or .cse0 (let ((.cse25 ((_ zero_extend 24) c_~var_1_9~0))) (let ((.cse14 (or .cse28 (= (_ bv4 32) .cse29))) (.cse10 (or (= .cse25 (_ bv15 32)) (not .cse27))) (.cse11 (= .cse25 .cse26))) (let ((.cse22 (and (or (and .cse23 .cse11 .cse12) .cse9) (or .cse6 (and (or .cse16 (and .cse23 .cse11 .cse14 .cse15)) (or (and .cse23 .cse17 .cse24 .cse10 .cse11) .cse18)))))) (let ((.cse2 (or .cse5 .cse22)) (.cse3 (or .cse22 .cse13))) (and (or (and (or .cse1 (and .cse2 .cse3)) .cse4 (or (let ((.cse7 (or (and .cse17 .cse10 .cse11) .cse18)) (.cse8 (or (and .cse11 .cse14 .cse15) .cse16))) (and (or .cse5 (and (or .cse6 (and .cse7 .cse8)) (or .cse9 (and .cse10 .cse11 .cse12)))) (or (and .cse9 .cse7 .cse8) .cse13))) .cse19)) .cse20) (or .cse21 (and (or (and .cse10 .cse11 .cse4 .cse6 .cse12 .cse13) .cse19) (or .cse1 (and .cse4 .cse2 .cse3)))))))))) (= (_ bv4 8) c_~var_1_2~0) (fp.leq c_~var_1_14~0 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0)) (= (_ bv14 8) c_~var_1_1~0) .cse30 (or (let ((.cse35 (and (or .cse9 (and .cse23 .cse27 .cse12)) (or .cse6 (and (or .cse16 (and .cse23 .cse27 .cse15)) (or (and .cse23 .cse17 .cse27 .cse24) .cse18)))))) (let ((.cse33 (or .cse35 .cse5)) (.cse34 (or .cse35 .cse13))) (and (or (and (or (let ((.cse31 (or .cse16 (and .cse27 .cse15))) (.cse32 (or (and .cse17 .cse27) .cse18))) (and (or (and .cse31 .cse9 .cse32) .cse13) (or .cse5 (and (or (and .cse31 .cse32) .cse6) (or .cse9 (and .cse27 .cse12)))))) .cse19) .cse4 (or .cse1 (and .cse33 .cse34))) .cse20) (or .cse21 (and (or .cse1 (and .cse4 .cse33 .cse34)) (or (and .cse27 .cse4 .cse6 .cse12 .cse13) .cse19)))))) .cse30) (fp.geq c_~var_1_14~0 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) .cse6 (= c_~var_1_5~0 c_~var_1_9~0) .cse19 (= c_~var_1_14~0 c_~var_1_10~0) (= c_currentRoundingMode roundNearestTiesToEven)))))) is different from true [2024-11-24 01:51:34,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 01:51:40,766 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_14~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))))) (.cse5 (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0))) (.cse9 (fp.eq c_~var_1_14~0 c_~var_1_14~0)) (.cse1 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_14~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0)))) (.cse11 (fp.gt (fp.mul c_currentRoundingMode c_~var_1_14~0 c_~var_1_14~0) c_~var_1_14~0))) (and (or (let ((.cse0 (let ((.cse4 (let ((.cse7 ((_ sign_extend 24) c_~var_1_2~0)) (.cse10 (= c_~var_1_3~0 (_ bv0 8)))) (and (or (and (forall ((~var_1_4~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse6 ((_ sign_extend 24) ~var_1_4~0))) (or (bvslt .cse6 (_ bv0 32)) (= ((_ sign_extend 24) ((_ extract 7 0) .cse6)) .cse7) (bvslt .cse6 (bvadd (bvneg ((_ sign_extend 24) ~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) ~var_1_11~0)))))) (forall ((~var_1_4~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse8 ((_ sign_extend 24) ~var_1_4~0))) (or (bvslt .cse8 (bvadd (bvneg ((_ sign_extend 24) ~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) ~var_1_11~0))) (not (bvslt .cse8 (_ bv0 32))) (= .cse7 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse8))))))) .cse9) (not .cse10)) (or (and .cse9 (= (_ bv4 32) .cse7)) .cse10)))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0)))) (and (or (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_14~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse3) c_~var_1_14~0)))) .cse4) .cse5 (or .cse4 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_14~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse3) c_~var_1_14~0)))))))) (and (or .cse0 .cse1) (or .cse0 .cse2))) .cse11) (or (and (or .cse5 .cse2) (or (and .cse5 .cse9) .cse1)) .cse11))) is different from true [2024-11-24 01:51:46,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-24 01:51:54,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:51:54,866 INFO L93 Difference]: Finished difference Result 172 states and 230 transitions. [2024-11-24 01:51:54,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-24 01:51:54,873 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) Word has length 92 [2024-11-24 01:51:54,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:51:54,876 INFO L225 Difference]: With dead ends: 172 [2024-11-24 01:51:54,876 INFO L226 Difference]: Without dead ends: 170 [2024-11-24 01:51:54,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 82.5s TimeCoverageRelationStatistics Valid=204, Invalid=519, Unknown=7, NotChecked=392, Total=1122 [2024-11-24 01:51:54,878 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 187 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 829 IncrementalHoareTripleChecker+Unchecked, 40.2s IncrementalHoareTripleChecker+Time [2024-11-24 01:51:54,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 390 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 454 Invalid, 0 Unknown, 829 Unchecked, 40.2s Time] [2024-11-24 01:51:54,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-24 01:51:54,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 127. [2024-11-24 01:51:54,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 81 states have (on average 1.1851851851851851) internal successors, (96), 82 states have internal predecessors, (96), 39 states have call successors, (39), 6 states have call predecessors, (39), 6 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-24 01:51:54,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 174 transitions. [2024-11-24 01:51:54,924 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 174 transitions. Word has length 92 [2024-11-24 01:51:54,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:51:54,928 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 174 transitions. [2024-11-24 01:51:54,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2024-11-24 01:51:54,929 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 174 transitions. [2024-11-24 01:51:54,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-24 01:51:54,934 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:51:54,934 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:51:54,944 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-24 01:51:55,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:51:55,135 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:51:55,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:51:55,136 INFO L85 PathProgramCache]: Analyzing trace with hash 774403526, now seen corresponding path program 1 times [2024-11-24 01:51:55,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:51:55,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [217348865] [2024-11-24 01:51:55,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:51:55,136 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:51:55,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:51:55,141 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 01:51:55,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a680295b-8728-4e83-8c14-a096fa174f6c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-24 01:51:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:51:55,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-24 01:51:55,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:52:26,440 WARN L286 SmtUtils]: Spent 5.55s 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-24 01:52:57,809 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 123 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-24 01:52:57,809 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:53:32,392 WARN L286 SmtUtils]: Spent 5.10s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:54:02,157 WARN L286 SmtUtils]: Spent 5.14s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:55:27,371 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse42 ((_ sign_extend 24) c_~var_1_2~0)) (.cse45 ((_ sign_extend 24) c_~var_1_4~0))) (let ((.cse4 (= c_~var_1_3~0 (_ bv0 8))) (.cse36 ((_ sign_extend 24) ((_ extract 7 0) .cse45))) (.cse12 (bvslt .cse45 (_ bv0 32))) (.cse16 (= (_ bv4 32) .cse42)) (.cse43 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse45)))) (.cse35 ((_ zero_extend 24) c_~var_1_5~0)) (.cse44 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0))) (.cse23 (bvslt .cse45 (bvadd (bvneg ((_ sign_extend 24) c_~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) c_~var_1_11~0))))) (let ((.cse0 (fp.gt (fp.mul c_currentRoundingMode c_~var_1_10~0 c_~var_1_10~0) c_~var_1_10~0)) (.cse26 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0)))) (.cse1 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))))) (.cse22 (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0))) (.cse2 (not .cse23)) (.cse11 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse44) c_~var_1_14~0)))) (.cse3 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse44) c_~var_1_14~0))))) (.cse34 (= (_ bv15 32) .cse35)) (.cse20 (= .cse42 .cse43)) (.cse17 (not .cse16)) (.cse19 (= (_ bv4 32) .cse43)) (.cse21 (not .cse12)) (.cse32 (fp.eq c_~var_1_10~0 c_~var_1_14~0)) (.cse13 (= .cse42 .cse36)) (.cse10 (not .cse4))) (and (or .cse0 (let ((.cse18 (= (_ bv4 32) .cse36)) (.cse33 (forall ((~var_1_9~0 (_ BitVec 8))) (= ((_ zero_extend 24) ~var_1_9~0) .cse35)))) (let ((.cse14 (or .cse32 .cse33)) (.cse15 (or (not .cse32) .cse33)) (.cse29 (not .cse18)) (.cse30 (not .cse19)) (.cse6 (not .cse34))) (let ((.cse27 (and (or .cse4 (let ((.cse31 (and .cse32 .cse33))) (and .cse6 (or .cse12 (and (or .cse31 .cse29) (or .cse18 .cse31) .cse16)) (or (and .cse16 (or .cse31 .cse19) (or .cse31 .cse30)) .cse21)))) (or .cse10 (and .cse6 (or (and (or .cse17 (and .cse32 .cse33 .cse19)) (or (and .cse32 .cse20 .cse33) .cse16)) .cse21) (or .cse12 (and (or (and .cse32 .cse13 .cse33) .cse16) (or .cse17 (and .cse32 .cse33 .cse18)))))))) (.cse28 (and .cse14 .cse15))) (let ((.cse5 (or .cse21 (and (or .cse28 .cse19) (or .cse28 .cse30) .cse16))) (.cse7 (or .cse12 (and (or .cse18 .cse28) (or .cse28 .cse29) .cse16))) (.cse24 (or .cse27 .cse11)) (.cse25 (or .cse27 .cse3))) (and (or .cse1 (and (or .cse2 (let ((.cse8 (or (and (or .cse17 (and .cse14 .cse15 .cse19)) (or (and .cse20 .cse14 .cse15) .cse16)) .cse21)) (.cse9 (or .cse12 (and (or (and .cse13 .cse14 .cse15) .cse16) (or .cse17 (and .cse14 .cse18 .cse15)))))) (and (or .cse3 (and (or .cse4 (and .cse5 .cse6 .cse7)) (or (and .cse8 .cse9 .cse6) .cse10))) (or (and .cse8 .cse9 .cse6 .cse4) .cse11)))) .cse22 (or .cse23 (and .cse24 .cse25)))) (or .cse26 (and (or .cse2 (and .cse5 .cse22 .cse6 .cse10 .cse7 .cse11)) (or .cse23 (and .cse22 .cse24 .cse25)))))))))) (or (not .cse0) (let ((.cse41 (and (or .cse4 (and .cse32 .cse34 .cse16)) (or (and .cse34 (or (and .cse32 .cse20 (or .cse17 .cse19)) .cse21) (or (and .cse32 .cse13) .cse12)) .cse10)))) (let ((.cse37 (or .cse3 .cse41)) (.cse38 (or .cse41 .cse11))) (and (or .cse26 (and (or (and .cse37 .cse22 .cse38) .cse23) (or (and .cse34 .cse22 .cse10 .cse16 .cse11) .cse2))) (or .cse1 (and (or .cse23 (and .cse37 .cse38)) .cse22 (or (let ((.cse39 (or .cse12 .cse13)) (.cse40 (or .cse20 .cse21))) (and (or .cse3 (and (or .cse4 (and .cse34 .cse16)) (or .cse10 (and .cse34 .cse39 .cse40)))) (or (and .cse34 .cse39 .cse4 .cse40) .cse11))) .cse2))))))))))) is different from true [2024-11-24 01:56:08,269 WARN L873 $PredicateComparison]: unable to prove that (or (not (fp.gt (fp.mul c_currentRoundingMode c_~var_1_10~0 c_~var_1_10~0) c_~var_1_10~0)) (let ((.cse19 ((_ sign_extend 24) c_~var_1_4~0))) (let ((.cse11 (= c_~var_1_3~0 (_ bv0 8))) (.cse14 (bvslt .cse19 (_ bv0 32))) (.cse20 ((_ sign_extend 24) c_~var_1_2~0))) (let ((.cse3 (= (_ bv4 32) .cse20)) (.cse12 (= .cse20 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse19))))) (.cse13 (not .cse14)) (.cse15 (= .cse20 ((_ sign_extend 24) ((_ extract 7 0) .cse19)))) (.cse2 (not .cse11)) (.cse18 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0)))) (let ((.cse5 (bvslt .cse19 (bvadd (bvneg ((_ sign_extend 24) c_~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) c_~var_1_11~0)))) (.cse4 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse18) c_~var_1_14~0)))) (.cse8 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse18) c_~var_1_14~0))))) (.cse16 (let ((.cse17 (fp.eq c_~var_1_10~0 c_~var_1_14~0))) (and (or .cse11 (and .cse17 .cse3)) (or (and (or (and .cse17 .cse12) .cse13) (or (and .cse17 .cse15) .cse14)) .cse2))))) (let ((.cse6 (or .cse8 .cse16)) (.cse7 (or .cse16 .cse4)) (.cse1 (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0))) (.cse0 (not .cse5))) (and (or (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4)) (or .cse5 (and .cse6 .cse1 .cse7)))) (or (and (or .cse5 (and .cse6 .cse7)) .cse1 (or (let ((.cse9 (or .cse14 .cse15)) (.cse10 (or .cse12 .cse13))) (and (or .cse8 (and (or .cse2 (and .cse9 .cse10)) (or .cse11 .cse3))) (or (and .cse9 .cse11 .cse10) .cse4))) .cse0)) (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0)))))))))))) is different from true [2024-11-24 01:56:34,815 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ sign_extend 24) c_~var_1_4~0))) (or (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0))) (.cse2 (let ((.cse3 (= c_~var_1_3~0 (_ bv0 8))) (.cse5 ((_ sign_extend 24) c_~var_1_2~0))) (and (or (not .cse3) (let ((.cse4 (bvslt .cse6 (_ bv0 32)))) (and (or .cse4 (= .cse5 ((_ sign_extend 24) ((_ extract 7 0) .cse6)))) (or (= .cse5 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse6)))) (not .cse4))))) (or .cse3 (= (_ bv4 32) .cse5)))))) (and (or (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_14~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse1) c_~var_1_14~0))) .cse2) (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0)) (or (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_14~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse1) c_~var_1_14~0)))) .cse2))))) (and (or .cse0 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_14~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))))) (or .cse0 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_14~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0)))))) (forall ((~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (bvslt .cse6 (bvadd (bvneg ((_ sign_extend 24) ~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) ~var_1_11~0)))) (not (fp.gt (fp.mul c_currentRoundingMode c_~var_1_14~0 c_~var_1_14~0) c_~var_1_14~0)))) is different from true