./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-0.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 75183837198a67904a3a61f480ace7d79976c5c6c2ed857798c72fba443adac4 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:56:53,832 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:56:53,899 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 04:56:53,903 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:56:53,903 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:56:53,926 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:56:53,927 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:56:53,928 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:56:53,928 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:56:53,929 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:56:53,930 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:56:53,930 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:56:53,931 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:56:53,931 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:56:53,932 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:56:53,932 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:56:53,933 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:56:53,933 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:56:53,934 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:56:53,934 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:56:53,935 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:56:53,935 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:56:53,936 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:56:53,936 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:56:53,937 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:56:53,937 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:56:53,938 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:56:53,938 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:56:53,938 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:56:53,939 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:56:53,939 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:56:53,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:56:53,940 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:56:53,940 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:56:53,941 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:56:53,941 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:56:53,941 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:56:53,941 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:56:53,942 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:56:53,942 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:56:53,942 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:56:53,942 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:56:53,943 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 75183837198a67904a3a61f480ace7d79976c5c6c2ed857798c72fba443adac4 [2023-11-29 04:56:54,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:56:54,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:56:54,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:56:54,209 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:56:54,209 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:56:54,210 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-0.i [2023-11-29 04:56:56,983 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:56:57,187 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:56:57,187 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-0.i [2023-11-29 04:56:57,198 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/bin/uautomizer-verify-BQ2R08f2Ya/data/2b96122e7/80aae80c76f24cc4b71612577a613f02/FLAG5918106ad [2023-11-29 04:56:57,214 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/bin/uautomizer-verify-BQ2R08f2Ya/data/2b96122e7/80aae80c76f24cc4b71612577a613f02 [2023-11-29 04:56:57,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:56:57,219 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:56:57,221 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:56:57,221 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:56:57,227 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:56:57,228 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:56:57" (1/1) ... [2023-11-29 04:56:57,229 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@747cd433 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:56:57, skipping insertion in model container [2023-11-29 04:56:57,229 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:56:57" (1/1) ... [2023-11-29 04:56:57,263 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:56:57,429 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-0.i[912,925] [2023-11-29 04:56:57,487 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:56:57,500 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:56:57,514 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-0.i[912,925] [2023-11-29 04:56:57,542 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:56:57,559 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:56:57,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:56:57 WrapperNode [2023-11-29 04:56:57,560 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:56:57,561 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:56:57,562 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:56:57,562 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:56:57,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:56:57" (1/1) ... [2023-11-29 04:56:57,582 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:56:57" (1/1) ... [2023-11-29 04:56:57,616 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2023-11-29 04:56:57,617 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:56:57,617 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:56:57,617 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:56:57,618 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:56:57,630 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:56:57" (1/1) ... [2023-11-29 04:56:57,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:56:57" (1/1) ... [2023-11-29 04:56:57,633 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:56:57" (1/1) ... [2023-11-29 04:56:57,651 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]. [2023-11-29 04:56:57,652 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:56:57" (1/1) ... [2023-11-29 04:56:57,652 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:56:57" (1/1) ... [2023-11-29 04:56:57,662 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:56:57" (1/1) ... [2023-11-29 04:56:57,667 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:56:57" (1/1) ... [2023-11-29 04:56:57,669 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:56:57" (1/1) ... [2023-11-29 04:56:57,672 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:56:57" (1/1) ... [2023-11-29 04:56:57,676 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:56:57,677 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:56:57,678 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:56:57,678 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:56:57,679 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:56:57" (1/1) ... [2023-11-29 04:56:57,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:56:57,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:56:57,711 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:56:57,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:56:57,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:56:57,748 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 04:56:57,748 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 04:56:57,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:56:57,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:56:57,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:56:57,830 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:56:57,832 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:56:58,120 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:56:58,166 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:56:58,166 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 04:56:58,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:56:58 BoogieIcfgContainer [2023-11-29 04:56:58,167 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:56:58,170 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:56:58,170 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:56:58,174 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:56:58,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:56:57" (1/3) ... [2023-11-29 04:56:58,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb14eaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:56:58, skipping insertion in model container [2023-11-29 04:56:58,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:56:57" (2/3) ... [2023-11-29 04:56:58,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb14eaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:56:58, skipping insertion in model container [2023-11-29 04:56:58,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:56:58" (3/3) ... [2023-11-29 04:56:58,196 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-0.i [2023-11-29 04:56:58,218 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:56:58,218 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 04:56:58,269 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:56:58,274 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@380de708, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:56:58,275 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 04:56:58,279 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 04:56:58,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-29 04:56:58,294 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:56:58,295 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:56:58,295 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:56:58,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:56:58,301 INFO L85 PathProgramCache]: Analyzing trace with hash 517854116, now seen corresponding path program 1 times [2023-11-29 04:56:58,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:56:58,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133227190] [2023-11-29 04:56:58,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:56:58,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:56:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:58,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:56:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:58,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:56:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:58,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:56:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:58,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:56:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:58,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:56:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:58,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:56:58,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:58,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:56:58,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:58,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:56:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:58,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:56:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:58,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 04:56:58,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:58,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:56:58,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:58,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 04:56:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:58,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 04:56:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:58,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 04:56:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:58,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 04:56:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:58,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 04:56:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:58,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 04:56:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:58,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 04:56:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:58,663 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 04:56:58,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:56:58,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133227190] [2023-11-29 04:56:58,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133227190] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:56:58,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:56:58,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:56:58,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002609039] [2023-11-29 04:56:58,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:56:58,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 04:56:58,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:56:58,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 04:56:58,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:56:58,706 INFO L87 Difference]: Start difference. First operand has 51 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 04:56:58,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:56:58,750 INFO L93 Difference]: Finished difference Result 99 states and 176 transitions. [2023-11-29 04:56:58,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 04:56:58,753 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 113 [2023-11-29 04:56:58,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:56:58,761 INFO L225 Difference]: With dead ends: 99 [2023-11-29 04:56:58,762 INFO L226 Difference]: Without dead ends: 49 [2023-11-29 04:56:58,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:56:58,769 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:56:58,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:56:58,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-29 04:56:58,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-11-29 04:56:58,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 states have internal predecessors, (39), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 04:56:58,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 75 transitions. [2023-11-29 04:56:58,819 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 75 transitions. Word has length 113 [2023-11-29 04:56:58,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:56:58,820 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 75 transitions. [2023-11-29 04:56:58,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 04:56:58,820 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 75 transitions. [2023-11-29 04:56:58,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-29 04:56:58,824 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:56:58,824 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:56:58,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:56:58,824 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:56:58,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:56:58,825 INFO L85 PathProgramCache]: Analyzing trace with hash -455536344, now seen corresponding path program 1 times [2023-11-29 04:56:58,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:56:58,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783411677] [2023-11-29 04:56:58,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:56:58,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:56:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:56:59,044 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:56:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:56:59,170 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:56:59,171 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 04:56:59,173 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 04:56:59,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:56:59,179 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-29 04:56:59,183 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:56:59,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 04:56:59 BoogieIcfgContainer [2023-11-29 04:56:59,259 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 04:56:59,260 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:56:59,260 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:56:59,260 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:56:59,261 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:56:58" (3/4) ... [2023-11-29 04:56:59,263 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 04:56:59,265 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:56:59,265 INFO L158 Benchmark]: Toolchain (without parser) took 2046.43ms. Allocated memory is still 153.1MB. Free memory was 104.3MB in the beginning and 112.8MB in the end (delta: -8.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:56:59,266 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 113.2MB. Free memory is still 66.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:56:59,266 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.67ms. Allocated memory is still 153.1MB. Free memory was 104.0MB in the beginning and 90.5MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 04:56:59,267 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.39ms. Allocated memory is still 153.1MB. Free memory was 90.5MB in the beginning and 87.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:56:59,268 INFO L158 Benchmark]: Boogie Preprocessor took 59.29ms. Allocated memory is still 153.1MB. Free memory was 87.5MB in the beginning and 83.7MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 04:56:59,268 INFO L158 Benchmark]: RCFGBuilder took 489.77ms. Allocated memory is still 153.1MB. Free memory was 83.7MB in the beginning and 62.8MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 04:56:59,269 INFO L158 Benchmark]: TraceAbstraction took 1089.30ms. Allocated memory is still 153.1MB. Free memory was 62.4MB in the beginning and 113.0MB in the end (delta: -50.6MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2023-11-29 04:56:59,269 INFO L158 Benchmark]: Witness Printer took 4.57ms. Allocated memory is still 153.1MB. Free memory was 113.0MB in the beginning and 112.8MB in the end (delta: 212.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:56:59,272 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.21ms. Allocated memory is still 113.2MB. Free memory is still 66.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 339.67ms. Allocated memory is still 153.1MB. Free memory was 104.0MB in the beginning and 90.5MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.39ms. Allocated memory is still 153.1MB. Free memory was 90.5MB in the beginning and 87.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.29ms. Allocated memory is still 153.1MB. Free memory was 87.5MB in the beginning and 83.7MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 489.77ms. Allocated memory is still 153.1MB. Free memory was 83.7MB in the beginning and 62.8MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1089.30ms. Allocated memory is still 153.1MB. Free memory was 62.4MB in the beginning and 113.0MB in the end (delta: -50.6MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. * Witness Printer took 4.57ms. Allocated memory is still 153.1MB. Free memory was 113.0MB in the beginning and 112.8MB in the end (delta: 212.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 113, overapproximation of someBinaryFLOATComparisonOperation at line 113. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 0; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 32; [L25] signed long int var_1_4 = -32; [L26] signed long int var_1_5 = 2; [L27] signed short int var_1_6 = -10; [L28] unsigned long int var_1_7 = 1; [L29] unsigned char var_1_8 = 0; [L30] unsigned long int var_1_9 = 3470417420; [L31] unsigned char var_1_10 = 0; [L32] double var_1_11 = 32.875; [L33] double var_1_12 = 25.6; [L34] double var_1_13 = 1.75; [L35] float var_1_14 = 5.4; [L36] float var_1_15 = 127.5; [L37] float var_1_16 = 3.5; [L38] signed long int var_1_17 = 64; [L39] unsigned char var_1_18 = 64; [L117] isInitial = 1 [L118] FCALL initially() [L119] COND TRUE 1 [L120] FCALL updateLastVariables() [L121] CALL updateVariables() [L80] var_1_2 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_3=32, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_3=32, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L81] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_3=32, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L82] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_3=32, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_3=32, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L82] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_3=32, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L83] var_1_3 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L84] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L85] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L85] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L86] var_1_4 = __VERIFIER_nondet_long() [L87] CALL assume_abort_if_not(var_1_4 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L87] RET assume_abort_if_not(var_1_4 >= -1073741823) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L88] CALL assume_abort_if_not(var_1_4 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L88] RET assume_abort_if_not(var_1_4 <= 1073741823) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L89] var_1_9 = __VERIFIER_nondet_ulong() [L90] CALL assume_abort_if_not(var_1_9 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L90] RET assume_abort_if_not(var_1_9 >= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L91] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L91] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L92] var_1_10 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L93] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, var_1_10=1, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L94] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L94] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L95] var_1_11 = __VERIFIER_nondet_double() [L96] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L96] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L97] var_1_12 = __VERIFIER_nondet_double() [L98] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L98] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L99] CALL assume_abort_if_not(var_1_12 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L99] RET assume_abort_if_not(var_1_12 != 0.0F) VAL [isInitial=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L100] var_1_13 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L101] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L102] var_1_15 = __VERIFIER_nondet_float() [L103] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L103] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L104] var_1_16 = __VERIFIER_nondet_float() [L105] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L105] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L106] var_1_18 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L107] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L108] CALL assume_abort_if_not(var_1_18 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L108] RET assume_abort_if_not(var_1_18 <= 255) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L121] RET updateVariables() [L122] CALL step() [L43] COND TRUE var_1_2 > (- var_1_3) [L44] var_1_1 = ((((var_1_3) > ((var_1_2 + var_1_4))) ? (var_1_3) : ((var_1_2 + var_1_4)))) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L48] COND TRUE var_1_3 < var_1_2 [L49] var_1_5 = ((var_1_2 - var_1_3) + var_1_4) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=-6, var_1_5=-5, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L51] COND TRUE var_1_2 < (- var_1_5) [L52] var_1_6 = (32 - var_1_3) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=-6, var_1_5=-5, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L54] COND FALSE !(var_1_1 > var_1_3) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=-6, var_1_5=-5, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=4294967290] [L59] COND FALSE !((- 8u) >= (var_1_9 - var_1_2)) [L62] var_1_8 = (((var_1_11 / var_1_12) >= var_1_13) || var_1_10) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=-6, var_1_5=-5, var_1_6=32, var_1_7=1, var_1_8=1, var_1_9=4294967290] [L64] COND FALSE !((var_1_12 * var_1_11) > var_1_13) [L71] var_1_14 = var_1_16 VAL [isInitial=1, var_1_10=1, var_1_14=3470417425, var_1_16=3470417425, var_1_17=64, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=-6, var_1_5=-5, var_1_6=32, var_1_7=1, var_1_8=1, var_1_9=4294967290] [L73] COND TRUE ((var_1_11 + var_1_14) / 9.2) < ((((var_1_13) < (var_1_16)) ? (var_1_13) : (var_1_16))) [L74] var_1_17 = ((((var_1_2) > (var_1_18)) ? (var_1_2) : (var_1_18))) VAL [isInitial=1, var_1_10=1, var_1_14=3470417425, var_1_16=3470417425, var_1_17=1, var_1_18=1, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=-6, var_1_5=-5, var_1_6=32, var_1_7=1, var_1_8=1, var_1_9=4294967290] [L122] RET step() [L123] CALL, EXPR property() [L113-L114] return (((((((var_1_2 > (- var_1_3)) ? (var_1_1 == ((signed long int) ((((var_1_3) > ((var_1_2 + var_1_4))) ? (var_1_3) : ((var_1_2 + var_1_4)))))) : (var_1_1 == ((signed long int) (((((1 - var_1_2)) < (16)) ? ((1 - var_1_2)) : (16)))))) && ((var_1_3 < var_1_2) ? (var_1_5 == ((signed long int) ((var_1_2 - var_1_3) + var_1_4))) : 1)) && ((var_1_2 < (- var_1_5)) ? (var_1_6 == ((signed short int) (32 - var_1_3))) : 1)) && ((var_1_1 > var_1_3) ? ((var_1_4 <= var_1_6) ? (var_1_7 == ((unsigned long int) ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))) : 1) : 1)) && (((- 8u) >= (var_1_9 - var_1_2)) ? (var_1_8 == ((unsigned char) (! var_1_10))) : (var_1_8 == ((unsigned char) (((var_1_11 / var_1_12) >= var_1_13) || var_1_10))))) && (((var_1_12 * var_1_11) > var_1_13) ? ((var_1_9 < var_1_5) ? (var_1_14 == ((float) var_1_15)) : (var_1_14 == ((float) var_1_15))) : (var_1_14 == ((float) var_1_16)))) && ((((var_1_11 + var_1_14) / 9.2) < ((((var_1_13) < (var_1_16)) ? (var_1_13) : (var_1_16)))) ? (var_1_17 == ((signed long int) ((((var_1_2) > (var_1_18)) ? (var_1_2) : (var_1_18))))) : (var_1_17 == ((signed long int) var_1_4))) ; [L123] RET, EXPR property() [L123] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=1, var_1_14=3470417425, var_1_16=3470417425, var_1_17=1, var_1_18=1, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=-6, var_1_5=-5, var_1_6=32, var_1_7=1, var_1_8=1, var_1_9=4294967290] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=1, var_1_14=3470417425, var_1_16=3470417425, var_1_17=1, var_1_18=1, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=-6, var_1_5=-5, var_1_6=32, var_1_7=1, var_1_8=1, var_1_9=4294967290] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 18, 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, 72 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 72 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred 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.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 112 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 612/612 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 04:56:59,297 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-0.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 75183837198a67904a3a61f480ace7d79976c5c6c2ed857798c72fba443adac4 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:57:01,386 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:57:01,459 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 04:57:01,474 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:57:01,475 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:57:01,503 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:57:01,503 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:57:01,504 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:57:01,505 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:57:01,505 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:57:01,506 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:57:01,506 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:57:01,507 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:57:01,508 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:57:01,508 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:57:01,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:57:01,510 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:57:01,510 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:57:01,511 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:57:01,511 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:57:01,512 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:57:01,513 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:57:01,513 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:57:01,514 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:57:01,514 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 04:57:01,514 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 04:57:01,515 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:57:01,515 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:57:01,516 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:57:01,516 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:57:01,517 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:57:01,517 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:57:01,517 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:57:01,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:57:01,518 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:57:01,518 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:57:01,519 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:57:01,519 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 04:57:01,519 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 04:57:01,519 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:57:01,520 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:57:01,520 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:57:01,520 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:57:01,520 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:57:01,521 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 04:57:01,521 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 75183837198a67904a3a61f480ace7d79976c5c6c2ed857798c72fba443adac4 [2023-11-29 04:57:01,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:57:01,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:57:01,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:57:01,847 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:57:01,847 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:57:01,849 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-0.i [2023-11-29 04:57:04,750 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:57:04,933 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:57:04,934 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-0.i [2023-11-29 04:57:04,944 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/bin/uautomizer-verify-BQ2R08f2Ya/data/4e860c1f9/445f189e95ca410a8a0aaaa7a925d81b/FLAG864c66b5f [2023-11-29 04:57:04,961 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/bin/uautomizer-verify-BQ2R08f2Ya/data/4e860c1f9/445f189e95ca410a8a0aaaa7a925d81b [2023-11-29 04:57:04,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:57:04,965 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:57:04,967 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:57:04,967 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:57:04,973 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:57:04,973 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:57:04" (1/1) ... [2023-11-29 04:57:04,975 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e2f86df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:57:04, skipping insertion in model container [2023-11-29 04:57:04,975 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:57:04" (1/1) ... [2023-11-29 04:57:05,008 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:57:05,184 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-0.i[912,925] [2023-11-29 04:57:05,237 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:57:05,254 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:57:05,268 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-0.i[912,925] [2023-11-29 04:57:05,297 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:57:05,317 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:57:05,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:57:05 WrapperNode [2023-11-29 04:57:05,318 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:57:05,319 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:57:05,320 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:57:05,320 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:57:05,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:57:05" (1/1) ... [2023-11-29 04:57:05,342 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:57:05" (1/1) ... [2023-11-29 04:57:05,373 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124 [2023-11-29 04:57:05,373 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:57:05,374 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:57:05,374 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:57:05,374 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:57:05,387 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:57:05" (1/1) ... [2023-11-29 04:57:05,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:57:05" (1/1) ... [2023-11-29 04:57:05,392 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:57:05" (1/1) ... [2023-11-29 04:57:05,407 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]. [2023-11-29 04:57:05,407 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:57:05" (1/1) ... [2023-11-29 04:57:05,408 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:57:05" (1/1) ... [2023-11-29 04:57:05,420 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:57:05" (1/1) ... [2023-11-29 04:57:05,424 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:57:05" (1/1) ... [2023-11-29 04:57:05,427 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:57:05" (1/1) ... [2023-11-29 04:57:05,429 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:57:05" (1/1) ... [2023-11-29 04:57:05,434 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:57:05,435 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:57:05,435 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:57:05,435 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:57:05,436 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:57:05" (1/1) ... [2023-11-29 04:57:05,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:57:05,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:57:05,468 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:57:05,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:57:05,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:57:05,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 04:57:05,504 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 04:57:05,504 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 04:57:05,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:57:05,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:57:05,591 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:57:05,593 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:57:28,195 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:57:28,241 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:57:28,241 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 04:57:28,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:57:28 BoogieIcfgContainer [2023-11-29 04:57:28,242 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:57:28,245 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:57:28,245 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:57:28,248 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:57:28,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:57:04" (1/3) ... [2023-11-29 04:57:28,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dd5fc3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:57:28, skipping insertion in model container [2023-11-29 04:57:28,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:57:05" (2/3) ... [2023-11-29 04:57:28,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dd5fc3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:57:28, skipping insertion in model container [2023-11-29 04:57:28,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:57:28" (3/3) ... [2023-11-29 04:57:28,252 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-0.i [2023-11-29 04:57:28,272 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:57:28,272 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 04:57:28,324 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:57:28,330 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5333f292, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:57:28,330 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 04:57:28,335 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 04:57:28,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-29 04:57:28,348 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:57:28,349 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:57:28,349 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:57:28,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:57:28,355 INFO L85 PathProgramCache]: Analyzing trace with hash 517854116, now seen corresponding path program 1 times [2023-11-29 04:57:28,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:57:28,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [49309420] [2023-11-29 04:57:28,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:57:28,368 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:57:28,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:57:28,370 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:57:28,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 04:57:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:30,493 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 04:57:30,504 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:57:30,553 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2023-11-29 04:57:30,553 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:57:30,554 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:57:30,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [49309420] [2023-11-29 04:57:30,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [49309420] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:57:30,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:57:30,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:57:30,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502902435] [2023-11-29 04:57:30,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:57:30,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 04:57:30,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:57:30,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 04:57:30,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:57:30,590 INFO L87 Difference]: Start difference. First operand has 51 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 04:57:36,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 04:57:36,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:57:36,734 INFO L93 Difference]: Finished difference Result 99 states and 176 transitions. [2023-11-29 04:57:37,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 04:57:37,316 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 113 [2023-11-29 04:57:37,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:57:37,323 INFO L225 Difference]: With dead ends: 99 [2023-11-29 04:57:37,323 INFO L226 Difference]: Without dead ends: 49 [2023-11-29 04:57:37,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:57:37,329 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:57:37,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2023-11-29 04:57:37,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-29 04:57:37,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-11-29 04:57:37,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 states have internal predecessors, (39), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 04:57:37,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 75 transitions. [2023-11-29 04:57:37,367 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 75 transitions. Word has length 113 [2023-11-29 04:57:37,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:57:37,367 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 75 transitions. [2023-11-29 04:57:37,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 04:57:37,368 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 75 transitions. [2023-11-29 04:57:37,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-29 04:57:37,370 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:57:37,371 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:57:37,404 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 04:57:37,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:57:37,572 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:57:37,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:57:37,573 INFO L85 PathProgramCache]: Analyzing trace with hash -455536344, now seen corresponding path program 1 times [2023-11-29 04:57:37,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:57:37,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [970457690] [2023-11-29 04:57:37,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:57:37,574 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:57:37,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:57:37,575 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:57:37,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efbb0271-51dd-4d40-8b2e-3c31505aaf65/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 04:57:39,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:39,728 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-29 04:57:39,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:58:03,804 WARN L293 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:58:11,938 WARN L293 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:58:21,005 WARN L293 SmtUtils]: Spent 9.07s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:58:29,524 WARN L293 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:58:38,622 WARN L293 SmtUtils]: Spent 9.10s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:58:45,094 WARN L293 SmtUtils]: Spent 6.47s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:58:54,156 WARN L293 SmtUtils]: Spent 9.06s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:59:03,242 WARN L293 SmtUtils]: Spent 9.09s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:59:22,821 WARN L293 SmtUtils]: Spent 9.05s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:59:31,861 WARN L293 SmtUtils]: Spent 9.04s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:59:40,905 WARN L293 SmtUtils]: Spent 9.04s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:59:49,963 WARN L293 SmtUtils]: Spent 9.06s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:59:59,042 WARN L293 SmtUtils]: Spent 9.08s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:00:08,095 WARN L293 SmtUtils]: Spent 9.05s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:00:17,130 WARN L293 SmtUtils]: Spent 9.03s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:00:26,183 WARN L293 SmtUtils]: Spent 9.05s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:00:35,252 WARN L293 SmtUtils]: Spent 9.07s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:00:39,518 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ zero_extend 24) c_~var_1_3~0))) (let ((.cse0 (bvneg .cse1)) (.cse4 ((_ zero_extend 24) c_~var_1_2~0))) (and (bvsge c_~var_1_4~0 (_ bv3221225473 32)) (= c_~var_1_6~0 ((_ extract 15 0) (bvadd .cse0 (_ bv32 32)))) (= c_~var_1_1~0 .cse1) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq c_~var_1_16~0 .cse2) (fp.leq c_~var_1_16~0 .cse3)) (and (fp.leq c_~var_1_16~0 (fp.neg .cse2)) (fp.geq c_~var_1_16~0 (fp.neg .cse3))))) (bvsle c_~var_1_4~0 (_ bv1073741823 32)) (= c_~var_1_5~0 (bvadd .cse0 c_~var_1_4~0 .cse4)) (bvslt .cse4 (bvneg c_~var_1_5~0)) (bvslt .cse1 .cse4) (let ((.cse5 (fp.geq (fp.div c_currentRoundingMode c_~var_1_11~0 c_~var_1_12~0) c_~var_1_13~0)) (.cse6 (= c_~var_1_10~0 (_ bv0 8)))) (or (and (not .cse5) (= c_~var_1_8~0 (_ bv0 8)) .cse6) (and (or .cse5 (not .cse6)) (= (_ bv1 8) c_~var_1_8~0)))) (not (bvuge (_ bv4294967288 32) (bvadd c_~var_1_9~0 (bvneg .cse4)))) (bvuge c_~var_1_9~0 (_ bv2147483647 32)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2023-11-29 05:00:49,928 WARN L293 SmtUtils]: Spent 8.68s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:00:59,115 WARN L293 SmtUtils]: Spent 9.19s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:01:08,312 WARN L293 SmtUtils]: Spent 9.20s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:01:16,965 WARN L293 SmtUtils]: Spent 8.65s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:01:26,105 WARN L293 SmtUtils]: Spent 9.14s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:01:35,332 WARN L293 SmtUtils]: Spent 9.23s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:01:44,666 WARN L293 SmtUtils]: Spent 9.33s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:01:53,913 WARN L293 SmtUtils]: Spent 9.25s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:02:03,138 WARN L293 SmtUtils]: Spent 9.22s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:02:12,367 WARN L293 SmtUtils]: Spent 9.23s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:02:21,567 WARN L293 SmtUtils]: Spent 9.20s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:02:30,780 WARN L293 SmtUtils]: Spent 9.21s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:02:40,009 WARN L293 SmtUtils]: Spent 9.23s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:02:49,238 WARN L293 SmtUtils]: Spent 9.23s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:02:58,468 WARN L293 SmtUtils]: Spent 9.23s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:03:07,758 WARN L293 SmtUtils]: Spent 9.29s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:03:16,960 WARN L293 SmtUtils]: Spent 9.20s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:03:26,188 WARN L293 SmtUtils]: Spent 9.23s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:03:35,503 WARN L293 SmtUtils]: Spent 9.31s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:03:44,708 WARN L293 SmtUtils]: Spent 9.20s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:03:54,040 WARN L293 SmtUtils]: Spent 9.33s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:04:03,271 WARN L293 SmtUtils]: Spent 9.23s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:04:07,556 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ zero_extend 24) c_~var_1_3~0))) (let ((.cse0 (bvneg .cse1)) (.cse4 ((_ zero_extend 24) c_~var_1_2~0))) (and (bvsge c_~var_1_4~0 (_ bv3221225473 32)) (= c_~var_1_6~0 ((_ extract 15 0) (bvadd .cse0 (_ bv32 32)))) (= c_~var_1_14~0 c_~var_1_16~0) (not (fp.gt (fp.mul c_currentRoundingMode c_~var_1_12~0 c_~var_1_11~0) c_~var_1_13~0)) (= c_~var_1_1~0 .cse1) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq c_~var_1_16~0 .cse2) (fp.leq c_~var_1_16~0 .cse3)) (and (fp.leq c_~var_1_16~0 (fp.neg .cse2)) (fp.geq c_~var_1_16~0 (fp.neg .cse3))))) (bvsle c_~var_1_4~0 (_ bv1073741823 32)) (= c_~var_1_5~0 (bvadd .cse0 c_~var_1_4~0 .cse4)) (bvslt .cse4 (bvneg c_~var_1_5~0)) (bvslt .cse1 .cse4) (let ((.cse5 (fp.geq (fp.div c_currentRoundingMode c_~var_1_11~0 c_~var_1_12~0) c_~var_1_13~0)) (.cse6 (= c_~var_1_10~0 (_ bv0 8)))) (or (and (not .cse5) (= c_~var_1_8~0 (_ bv0 8)) .cse6) (and (or .cse5 (not .cse6)) (= (_ bv1 8) c_~var_1_8~0)))) (not (bvuge (_ bv4294967288 32) (bvadd c_~var_1_9~0 (bvneg .cse4)))) (bvuge c_~var_1_9~0 (_ bv2147483647 32)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2023-11-29 05:04:11,840 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ zero_extend 24) c_~var_1_3~0))) (let ((.cse0 (bvneg .cse1)) (.cse4 ((_ zero_extend 24) c_~var_1_2~0))) (and (bvsge c_~var_1_4~0 (_ bv3221225473 32)) (= c_~var_1_6~0 ((_ extract 15 0) (bvadd .cse0 (_ bv32 32)))) (= c_~var_1_14~0 c_~var_1_16~0) (not (fp.gt (fp.mul c_currentRoundingMode c_~var_1_12~0 c_~var_1_11~0) c_~var_1_13~0)) (= c_~var_1_1~0 .cse1) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq c_~var_1_16~0 .cse2) (fp.leq c_~var_1_16~0 .cse3)) (and (fp.leq c_~var_1_16~0 (fp.neg .cse2)) (fp.geq c_~var_1_16~0 (fp.neg .cse3))))) (bvsle c_~var_1_4~0 (_ bv1073741823 32)) (= c_~var_1_5~0 (bvadd .cse0 c_~var_1_4~0 .cse4)) (bvslt .cse4 (bvneg c_~var_1_5~0)) (bvslt .cse1 .cse4) (let ((.cse5 (fp.geq (fp.div c_currentRoundingMode c_~var_1_11~0 c_~var_1_12~0) c_~var_1_13~0)) (.cse6 (= c_~var_1_10~0 (_ bv0 8)))) (or (and (not .cse5) (= c_~var_1_8~0 (_ bv0 8)) .cse6) (and (or .cse5 (not .cse6)) (= (_ bv1 8) c_~var_1_8~0)))) (not (bvuge (_ bv4294967288 32) (bvadd c_~var_1_9~0 (bvneg .cse4)))) (bvuge c_~var_1_9~0 (_ bv2147483647 32)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2023-11-29 05:04:21,289 WARN L293 SmtUtils]: Spent 9.41s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:04:31,289 WARN L293 SmtUtils]: Spent 10.00s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:04:41,273 WARN L293 SmtUtils]: Spent 9.98s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:04:50,705 WARN L293 SmtUtils]: Spent 9.43s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:05:00,665 WARN L293 SmtUtils]: Spent 9.96s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:05:10,671 WARN L293 SmtUtils]: Spent 10.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:05:20,682 WARN L293 SmtUtils]: Spent 10.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:05:30,663 WARN L293 SmtUtils]: Spent 9.98s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:05:40,636 WARN L293 SmtUtils]: Spent 9.97s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:05:50,635 WARN L293 SmtUtils]: Spent 10.00s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:06:00,945 WARN L293 SmtUtils]: Spent 10.31s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:06:10,958 WARN L293 SmtUtils]: Spent 10.01s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:06:21,810 WARN L293 SmtUtils]: Spent 10.85s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:06:31,903 WARN L293 SmtUtils]: Spent 10.09s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:06:41,873 WARN L293 SmtUtils]: Spent 9.97s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:06:51,728 WARN L293 SmtUtils]: Spent 9.85s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:07:01,689 WARN L293 SmtUtils]: Spent 9.96s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:07:11,590 WARN L293 SmtUtils]: Spent 9.90s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:07:21,462 WARN L293 SmtUtils]: Spent 9.87s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:07:31,396 WARN L293 SmtUtils]: Spent 9.93s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:07:41,302 WARN L293 SmtUtils]: Spent 9.91s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:07:52,013 WARN L293 SmtUtils]: Spent 10.71s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:08:01,941 WARN L293 SmtUtils]: Spent 9.93s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:08:11,906 WARN L293 SmtUtils]: Spent 9.96s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:08:21,881 WARN L293 SmtUtils]: Spent 9.97s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:08:31,865 WARN L293 SmtUtils]: Spent 9.98s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:08:41,893 WARN L293 SmtUtils]: Spent 10.03s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:08:51,803 WARN L293 SmtUtils]: Spent 9.91s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:09:01,748 WARN L293 SmtUtils]: Spent 9.94s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:09:11,759 WARN L293 SmtUtils]: Spent 10.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:09:16,196 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ zero_extend 24) c_~var_1_3~0))) (let ((.cse0 (bvneg .cse1)) (.cse4 ((_ zero_extend 24) c_~var_1_2~0))) (and (bvsge c_~var_1_4~0 (_ bv3221225473 32)) (= c_~var_1_6~0 ((_ extract 15 0) (bvadd .cse0 (_ bv32 32)))) (= c_~var_1_14~0 c_~var_1_16~0) (not (fp.gt (fp.mul c_currentRoundingMode c_~var_1_12~0 c_~var_1_11~0) c_~var_1_13~0)) (= c_~var_1_1~0 .cse1) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq c_~var_1_16~0 .cse2) (fp.leq c_~var_1_16~0 .cse3)) (and (fp.leq c_~var_1_16~0 (fp.neg .cse2)) (fp.geq c_~var_1_16~0 (fp.neg .cse3))))) (bvsle c_~var_1_4~0 (_ bv1073741823 32)) (= c_~var_1_5~0 (bvadd .cse0 c_~var_1_4~0 .cse4)) (bvslt .cse4 (bvneg c_~var_1_5~0)) (let ((.cse6 ((_ zero_extend 24) c_~var_1_18~0))) (let ((.cse5 (bvsgt .cse4 .cse6))) (or (and (= c_~var_1_17~0 .cse4) .cse5) (and (not .cse5) (= c_~var_1_17~0 .cse6))))) (bvslt .cse1 .cse4) (let ((.cse7 (fp.geq (fp.div c_currentRoundingMode c_~var_1_11~0 c_~var_1_12~0) c_~var_1_13~0)) (.cse8 (= c_~var_1_10~0 (_ bv0 8)))) (or (and (not .cse7) (= c_~var_1_8~0 (_ bv0 8)) .cse8) (and (or .cse7 (not .cse8)) (= (_ bv1 8) c_~var_1_8~0)))) (not (bvuge (_ bv4294967288 32) (bvadd c_~var_1_9~0 (bvneg .cse4)))) (bvuge c_~var_1_9~0 (_ bv2147483647 32)) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse10 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_16~0))) (let ((.cse11 (fp.lt c_~var_1_13~0 .cse10)) (.cse9 (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode c_~var_1_11~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_14~0)) ((_ to_fp 11 53) c_currentRoundingMode (/ 46.0 5.0))))) (or (and (fp.lt .cse9 .cse10) (not .cse11)) (and .cse11 (fp.lt .cse9 c_~var_1_13~0)))))))) is different from false [2023-11-29 05:09:20,842 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ zero_extend 24) c_~var_1_3~0))) (let ((.cse0 (bvneg .cse1)) (.cse4 ((_ zero_extend 24) c_~var_1_2~0))) (and (bvsge c_~var_1_4~0 (_ bv3221225473 32)) (= c_~var_1_6~0 ((_ extract 15 0) (bvadd .cse0 (_ bv32 32)))) (= c_~var_1_14~0 c_~var_1_16~0) (not (fp.gt (fp.mul c_currentRoundingMode c_~var_1_12~0 c_~var_1_11~0) c_~var_1_13~0)) (= c_~var_1_1~0 .cse1) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq c_~var_1_16~0 .cse2) (fp.leq c_~var_1_16~0 .cse3)) (and (fp.leq c_~var_1_16~0 (fp.neg .cse2)) (fp.geq c_~var_1_16~0 (fp.neg .cse3))))) (bvsle c_~var_1_4~0 (_ bv1073741823 32)) (= c_~var_1_5~0 (bvadd .cse0 c_~var_1_4~0 .cse4)) (bvslt .cse4 (bvneg c_~var_1_5~0)) (let ((.cse6 ((_ zero_extend 24) c_~var_1_18~0))) (let ((.cse5 (bvsgt .cse4 .cse6))) (or (and (= c_~var_1_17~0 .cse4) .cse5) (and (not .cse5) (= c_~var_1_17~0 .cse6))))) (bvslt .cse1 .cse4) (let ((.cse7 (fp.geq (fp.div c_currentRoundingMode c_~var_1_11~0 c_~var_1_12~0) c_~var_1_13~0)) (.cse8 (= c_~var_1_10~0 (_ bv0 8)))) (or (and (not .cse7) (= c_~var_1_8~0 (_ bv0 8)) .cse8) (and (or .cse7 (not .cse8)) (= (_ bv1 8) c_~var_1_8~0)))) (not (bvuge (_ bv4294967288 32) (bvadd c_~var_1_9~0 (bvneg .cse4)))) (bvuge c_~var_1_9~0 (_ bv2147483647 32)) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse10 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_16~0))) (let ((.cse11 (fp.lt c_~var_1_13~0 .cse10)) (.cse9 (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode c_~var_1_11~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_14~0)) ((_ to_fp 11 53) c_currentRoundingMode (/ 46.0 5.0))))) (or (and (fp.lt .cse9 .cse10) (not .cse11)) (and .cse11 (fp.lt .cse9 c_~var_1_13~0)))))))) is different from true