./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-20.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-20.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2ce1ea73380d9456a1f136ae7fb40364a65fd1608042e66fc50d954be964842d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:57:03,836 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:57:03,969 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 17:57:03,980 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:57:03,981 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:57:04,027 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:57:04,028 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:57:04,031 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:57:04,032 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:57:04,034 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:57:04,035 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:57:04,035 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:57:04,036 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:57:04,037 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:57:04,037 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:57:04,040 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:57:04,041 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:57:04,041 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:57:04,042 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:57:04,045 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:57:04,046 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:57:04,047 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:57:04,047 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:57:04,047 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:57:04,048 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:57:04,048 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:57:04,049 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:57:04,049 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:57:04,049 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:57:04,050 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:57:04,052 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:57:04,053 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:57:04,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:57:04,054 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:57:04,054 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:57:04,055 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:57:04,055 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:57:04,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:57:04,056 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:57:04,056 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:57:04,056 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:57:04,057 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:57:04,057 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_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2ce1ea73380d9456a1f136ae7fb40364a65fd1608042e66fc50d954be964842d [2024-11-08 17:57:04,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:57:04,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:57:04,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:57:04,508 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:57:04,509 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:57:04,511 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-20.i Unable to find full path for "g++" [2024-11-08 17:57:07,136 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:57:07,421 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:57:07,422 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-20.i [2024-11-08 17:57:07,433 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/data/dad79363b/2b8256a17de24f818b97b6dd35523e17/FLAGb4d1f4b67 [2024-11-08 17:57:07,738 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/data/dad79363b/2b8256a17de24f818b97b6dd35523e17 [2024-11-08 17:57:07,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:57:07,744 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:57:07,746 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:57:07,746 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:57:07,755 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:57:07,756 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:57:07" (1/1) ... [2024-11-08 17:57:07,757 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5377f0a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:07, skipping insertion in model container [2024-11-08 17:57:07,758 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:57:07" (1/1) ... [2024-11-08 17:57:07,794 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:57:08,142 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-20.i[915,928] [2024-11-08 17:57:08,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:57:08,206 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:57:08,225 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-20.i[915,928] [2024-11-08 17:57:08,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:57:08,275 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:57:08,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:08 WrapperNode [2024-11-08 17:57:08,276 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:57:08,278 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:57:08,278 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:57:08,279 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:57:08,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:08" (1/1) ... [2024-11-08 17:57:08,302 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:08" (1/1) ... [2024-11-08 17:57:08,333 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 78 [2024-11-08 17:57:08,334 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:57:08,335 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:57:08,335 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:57:08,336 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:57:08,364 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:08" (1/1) ... [2024-11-08 17:57:08,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:08" (1/1) ... [2024-11-08 17:57:08,367 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:08" (1/1) ... [2024-11-08 17:57:08,397 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 17:57:08,401 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:08" (1/1) ... [2024-11-08 17:57:08,405 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:08" (1/1) ... [2024-11-08 17:57:08,412 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:08" (1/1) ... [2024-11-08 17:57:08,417 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:08" (1/1) ... [2024-11-08 17:57:08,421 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:08" (1/1) ... [2024-11-08 17:57:08,423 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:08" (1/1) ... [2024-11-08 17:57:08,432 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:57:08,433 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:57:08,433 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:57:08,434 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:57:08,435 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:08" (1/1) ... [2024-11-08 17:57:08,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:57:08,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:57:08,483 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:57:08,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:57:08,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:57:08,533 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:57:08,533 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:57:08,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 17:57:08,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:57:08,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:57:08,611 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:57:08,614 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:57:08,826 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 17:57:08,827 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:57:08,845 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:57:08,845 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:57:08,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:57:08 BoogieIcfgContainer [2024-11-08 17:57:08,846 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:57:08,850 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:57:08,850 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:57:08,855 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:57:08,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:57:07" (1/3) ... [2024-11-08 17:57:08,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bbb95c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:57:08, skipping insertion in model container [2024-11-08 17:57:08,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:08" (2/3) ... [2024-11-08 17:57:08,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bbb95c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:57:08, skipping insertion in model container [2024-11-08 17:57:08,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:57:08" (3/3) ... [2024-11-08 17:57:08,860 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-20.i [2024-11-08 17:57:08,887 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:57:08,887 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:57:08,981 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:57:08,988 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@50bdd5af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:57:08,989 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:57:08,993 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 17:57:09,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-08 17:57:09,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:57:09,009 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:57:09,010 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:57:09,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:57:09,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1762824234, now seen corresponding path program 1 times [2024-11-08 17:57:09,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:57:09,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539104320] [2024-11-08 17:57:09,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:57:09,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:57:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:09,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:57:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:09,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:57:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:09,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:57:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:09,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 17:57:09,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:09,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 17:57:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:09,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 17:57:09,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:09,352 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-08 17:57:09,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:57:09,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539104320] [2024-11-08 17:57:09,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539104320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:57:09,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:57:09,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:57:09,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506748781] [2024-11-08 17:57:09,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:57:09,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:57:09,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:57:09,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:57:09,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:57:09,402 INFO L87 Difference]: Start difference. First operand has 36 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 17:57:09,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:57:09,431 INFO L93 Difference]: Finished difference Result 65 states and 100 transitions. [2024-11-08 17:57:09,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:57:09,433 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 49 [2024-11-08 17:57:09,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:57:09,444 INFO L225 Difference]: With dead ends: 65 [2024-11-08 17:57:09,444 INFO L226 Difference]: Without dead ends: 32 [2024-11-08 17:57:09,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:57:09,454 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:57:09,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:57:09,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-08 17:57:09,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-08 17:57:09,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 17:57:09,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2024-11-08 17:57:09,528 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 49 [2024-11-08 17:57:09,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:57:09,530 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2024-11-08 17:57:09,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 17:57:09,531 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2024-11-08 17:57:09,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-08 17:57:09,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:57:09,536 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:57:09,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:57:09,537 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:57:09,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:57:09,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1236900978, now seen corresponding path program 1 times [2024-11-08 17:57:09,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:57:09,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451853197] [2024-11-08 17:57:09,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:57:09,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:57:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:09,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:57:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:09,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:57:09,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:09,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:57:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:09,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 17:57:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:09,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 17:57:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:09,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 17:57:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:09,902 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-08 17:57:09,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:57:09,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451853197] [2024-11-08 17:57:09,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451853197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:57:09,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:57:09,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:57:09,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524222501] [2024-11-08 17:57:09,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:57:09,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:57:09,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:57:09,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:57:09,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:57:09,915 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-08 17:57:09,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:57:09,982 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2024-11-08 17:57:09,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:57:09,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 49 [2024-11-08 17:57:09,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:57:09,989 INFO L225 Difference]: With dead ends: 72 [2024-11-08 17:57:09,989 INFO L226 Difference]: Without dead ends: 43 [2024-11-08 17:57:09,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:57:09,991 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 12 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:57:09,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 73 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:57:09,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-08 17:57:10,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2024-11-08 17:57:10,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 17:57:10,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2024-11-08 17:57:10,002 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 49 [2024-11-08 17:57:10,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:57:10,004 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2024-11-08 17:57:10,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-08 17:57:10,005 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2024-11-08 17:57:10,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-08 17:57:10,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:57:10,007 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:57:10,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 17:57:10,007 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:57:10,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:57:10,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1797194382, now seen corresponding path program 1 times [2024-11-08 17:57:10,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:57:10,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459996094] [2024-11-08 17:57:10,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:57:10,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:57:10,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:57:10,100 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 17:57:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:57:10,223 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 17:57:10,223 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 17:57:10,225 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 17:57:10,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 17:57:10,233 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 17:57:10,277 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 17:57:10,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 05:57:10 BoogieIcfgContainer [2024-11-08 17:57:10,282 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 17:57:10,283 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 17:57:10,283 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 17:57:10,283 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 17:57:10,284 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:57:08" (3/4) ... [2024-11-08 17:57:10,287 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 17:57:10,288 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 17:57:10,289 INFO L158 Benchmark]: Toolchain (without parser) took 2545.61ms. Allocated memory was 125.8MB in the beginning and 165.7MB in the end (delta: 39.8MB). Free memory was 66.9MB in the beginning and 121.0MB in the end (delta: -54.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:57:10,290 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 125.8MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:57:10,291 INFO L158 Benchmark]: CACSL2BoogieTranslator took 531.46ms. Allocated memory was 125.8MB in the beginning and 165.7MB in the end (delta: 39.8MB). Free memory was 66.8MB in the beginning and 129.2MB in the end (delta: -62.4MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2024-11-08 17:57:10,291 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.09ms. Allocated memory is still 165.7MB. Free memory was 129.2MB in the beginning and 127.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 17:57:10,292 INFO L158 Benchmark]: Boogie Preprocessor took 97.42ms. Allocated memory is still 165.7MB. Free memory was 127.2MB in the beginning and 125.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 17:57:10,293 INFO L158 Benchmark]: RCFGBuilder took 412.83ms. Allocated memory is still 165.7MB. Free memory was 125.0MB in the beginning and 112.5MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 17:57:10,293 INFO L158 Benchmark]: TraceAbstraction took 1431.99ms. Allocated memory is still 165.7MB. Free memory was 112.0MB in the beginning and 121.0MB in the end (delta: -9.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:57:10,294 INFO L158 Benchmark]: Witness Printer took 5.59ms. Allocated memory is still 165.7MB. Free memory is still 121.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:57:10,297 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.37ms. Allocated memory is still 125.8MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 531.46ms. Allocated memory was 125.8MB in the beginning and 165.7MB in the end (delta: 39.8MB). Free memory was 66.8MB in the beginning and 129.2MB in the end (delta: -62.4MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.09ms. Allocated memory is still 165.7MB. Free memory was 129.2MB in the beginning and 127.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.42ms. Allocated memory is still 165.7MB. Free memory was 127.2MB in the beginning and 125.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 412.83ms. Allocated memory is still 165.7MB. Free memory was 125.0MB in the beginning and 112.5MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1431.99ms. Allocated memory is still 165.7MB. Free memory was 112.0MB in the beginning and 121.0MB in the end (delta: -9.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.59ms. Allocated memory is still 165.7MB. Free memory is still 121.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryArithmeticDOUBLEoperation at line 41, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryArithmeticFLOAToperation at line 45. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 0.6; [L23] unsigned char var_1_2 = 0; [L24] float var_1_3 = 0.0; [L25] float var_1_4 = 2.95; [L26] float var_1_5 = 8.5; [L27] float var_1_6 = 999999999999.4; [L28] double var_1_7 = 10.2; [L29] double var_1_8 = 32.7; [L30] double var_1_9 = 32.75; [L31] double last_1_var_1_8 = 32.7; VAL [isInitial=0, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=0, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L79] isInitial = 1 [L80] FCALL initially() [L81] COND TRUE 1 [L82] CALL updateLastVariables() [L72] last_1_var_1_8 = var_1_8 VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=0, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L82] RET updateLastVariables() [L83] CALL updateVariables() [L59] var_1_2 = __VERIFIER_nondet_uchar() [L60] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L60] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L61] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L61] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L62] var_1_3 = __VERIFIER_nondet_float() [L63] CALL assume_abort_if_not((var_1_3 >= 4611686.018427382800e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L63] RET assume_abort_if_not((var_1_3 >= 4611686.018427382800e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L64] var_1_4 = __VERIFIER_nondet_float() [L65] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L65] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L66] var_1_5 = __VERIFIER_nondet_float() [L67] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L67] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L68] var_1_6 = __VERIFIER_nondet_float() [L69] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L69] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L83] RET updateVariables() [L84] CALL step() [L35] COND TRUE \read(var_1_2) [L36] var_1_1 = ((var_1_3 - var_1_4) - var_1_5) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L40] COND TRUE \read(var_1_2) [L41] var_1_7 = ((((((var_1_3 - 255.719)) < (var_1_5)) ? ((var_1_3 - 255.719)) : (var_1_5))) - 2.3) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_8=327/10, var_1_9=131/4] [L43] COND TRUE \read(var_1_2) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_8=327/10, var_1_9=131/4] [L44] COND TRUE var_1_7 >= ((((last_1_var_1_8) > (var_1_6)) ? (last_1_var_1_8) : (var_1_6))) [L45] var_1_8 = (var_1_5 - var_1_3) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_9=131/4] [L54] COND TRUE var_1_4 != (var_1_3 - var_1_5) [L55] var_1_9 = var_1_6 VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_6=1000000000004, var_1_9=1000000000004] [L84] RET step() [L85] CALL, EXPR property() [L75-L76] return (((var_1_2 ? (var_1_1 == ((float) ((var_1_3 - var_1_4) - var_1_5))) : (var_1_1 == ((float) (var_1_4 + var_1_6)))) && (var_1_2 ? (var_1_7 == ((double) ((((((var_1_3 - 255.719)) < (var_1_5)) ? ((var_1_3 - 255.719)) : (var_1_5))) - 2.3))) : 1)) && (var_1_2 ? ((var_1_7 >= ((((last_1_var_1_8) > (var_1_6)) ? (last_1_var_1_8) : (var_1_6)))) ? (var_1_8 == ((double) (var_1_5 - var_1_3))) : (var_1_8 == ((double) var_1_4))) : ((var_1_7 <= var_1_5) ? (var_1_8 == ((double) var_1_6)) : 1))) && ((var_1_4 != (var_1_3 - var_1_5)) ? (var_1_9 == ((double) var_1_6)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_6=1000000000004, var_1_9=1000000000004] [L85] RET, EXPR property() [L85] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_6=1000000000004, var_1_9=1000000000004] [L19] reach_error() VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_6=1000000000004, var_1_9=1000000000004] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 3, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 116 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11 IncrementalHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 85 mSDtfsCounter, 11 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 106 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 120/120 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 17:57:10,337 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-20.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2ce1ea73380d9456a1f136ae7fb40364a65fd1608042e66fc50d954be964842d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:57:13,670 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:57:13,788 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 17:57:13,798 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:57:13,798 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:57:13,849 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:57:13,850 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:57:13,851 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:57:13,851 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:57:13,852 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:57:13,852 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:57:13,852 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:57:13,853 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:57:13,854 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:57:13,854 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:57:13,856 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:57:13,858 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:57:13,861 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:57:13,861 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:57:13,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:57:13,862 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:57:13,862 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:57:13,862 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:57:13,863 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 17:57:13,863 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 17:57:13,863 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:57:13,864 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 17:57:13,864 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:57:13,864 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:57:13,864 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:57:13,865 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:57:13,868 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:57:13,868 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:57:13,868 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:57:13,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:57:13,869 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:57:13,869 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:57:13,869 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:57:13,870 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 17:57:13,870 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 17:57:13,870 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:57:13,880 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:57:13,880 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:57:13,881 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:57:13,881 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_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2ce1ea73380d9456a1f136ae7fb40364a65fd1608042e66fc50d954be964842d [2024-11-08 17:57:14,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:57:14,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:57:14,407 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:57:14,409 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:57:14,410 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:57:14,412 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-20.i Unable to find full path for "g++" [2024-11-08 17:57:17,061 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:57:17,428 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:57:17,429 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-20.i [2024-11-08 17:57:17,441 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/data/03e4f7c41/13ea60f91f214413a21f65124f18be85/FLAG4962fee70 [2024-11-08 17:57:17,461 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/data/03e4f7c41/13ea60f91f214413a21f65124f18be85 [2024-11-08 17:57:17,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:57:17,474 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:57:17,476 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:57:17,476 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:57:17,484 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:57:17,485 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:57:17" (1/1) ... [2024-11-08 17:57:17,487 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@617594d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:17, skipping insertion in model container [2024-11-08 17:57:17,487 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:57:17" (1/1) ... [2024-11-08 17:57:17,527 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:57:17,877 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-20.i[915,928] [2024-11-08 17:57:18,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:57:18,031 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:57:18,056 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-20.i[915,928] [2024-11-08 17:57:18,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:57:18,133 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:57:18,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:18 WrapperNode [2024-11-08 17:57:18,134 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:57:18,136 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:57:18,137 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:57:18,137 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:57:18,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:18" (1/1) ... [2024-11-08 17:57:18,170 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:18" (1/1) ... [2024-11-08 17:57:18,219 INFO L138 Inliner]: procedures = 27, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 78 [2024-11-08 17:57:18,222 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:57:18,223 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:57:18,224 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:57:18,224 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:57:18,248 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:18" (1/1) ... [2024-11-08 17:57:18,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:18" (1/1) ... [2024-11-08 17:57:18,254 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:18" (1/1) ... [2024-11-08 17:57:18,281 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 17:57:18,281 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:18" (1/1) ... [2024-11-08 17:57:18,282 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:18" (1/1) ... [2024-11-08 17:57:18,299 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:18" (1/1) ... [2024-11-08 17:57:18,307 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:18" (1/1) ... [2024-11-08 17:57:18,310 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:18" (1/1) ... [2024-11-08 17:57:18,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:18" (1/1) ... [2024-11-08 17:57:18,316 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:57:18,318 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:57:18,318 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:57:18,318 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:57:18,320 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:18" (1/1) ... [2024-11-08 17:57:18,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:57:18,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:57:18,362 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:57:18,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:57:18,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:57:18,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 17:57:18,411 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:57:18,411 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:57:18,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:57:18,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:57:18,551 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:57:18,554 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:57:28,708 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 17:57:28,709 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:57:28,725 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:57:28,725 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:57:28,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:57:28 BoogieIcfgContainer [2024-11-08 17:57:28,726 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:57:28,741 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:57:28,742 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:57:28,746 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:57:28,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:57:17" (1/3) ... [2024-11-08 17:57:28,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43f4a6b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:57:28, skipping insertion in model container [2024-11-08 17:57:28,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:18" (2/3) ... [2024-11-08 17:57:28,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43f4a6b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:57:28, skipping insertion in model container [2024-11-08 17:57:28,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:57:28" (3/3) ... [2024-11-08 17:57:28,752 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-20.i [2024-11-08 17:57:28,774 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:57:28,774 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:57:28,859 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:57:28,868 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5ccb469c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:57:28,869 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:57:28,873 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 17:57:28,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-08 17:57:28,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:57:28,885 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:57:28,885 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:57:28,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:57:28,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1762824234, now seen corresponding path program 1 times [2024-11-08 17:57:28,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:57:28,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [515195513] [2024-11-08 17:57:28,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:57:28,909 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:57:28,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:57:28,918 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:57:28,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 17:57:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:29,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 17:57:29,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:57:29,633 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-08 17:57:29,633 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:57:29,634 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:57:29,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [515195513] [2024-11-08 17:57:29,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [515195513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:57:29,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:57:29,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:57:29,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123509207] [2024-11-08 17:57:29,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:57:29,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:57:29,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:57:29,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:57:29,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:57:29,680 INFO L87 Difference]: Start difference. First operand has 36 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 17:57:29,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:57:29,710 INFO L93 Difference]: Finished difference Result 65 states and 100 transitions. [2024-11-08 17:57:29,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:57:29,713 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 49 [2024-11-08 17:57:29,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:57:29,721 INFO L225 Difference]: With dead ends: 65 [2024-11-08 17:57:29,721 INFO L226 Difference]: Without dead ends: 32 [2024-11-08 17:57:29,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:57:29,729 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:57:29,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:57:29,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-08 17:57:29,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-08 17:57:29,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 17:57:29,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2024-11-08 17:57:29,787 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 49 [2024-11-08 17:57:29,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:57:29,789 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2024-11-08 17:57:29,789 INFO L472 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 17:57:29,790 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2024-11-08 17:57:29,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-08 17:57:29,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:57:29,794 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:57:29,812 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 17:57:29,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:57:29,996 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:57:29,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:57:29,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1236900978, now seen corresponding path program 1 times [2024-11-08 17:57:29,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:57:29,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1375980739] [2024-11-08 17:57:29,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:57:29,999 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:57:29,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:57:30,003 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:57:30,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 17:57:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:30,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 17:57:30,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:57:30,737 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-08 17:57:30,737 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:57:30,741 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:57:30,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1375980739] [2024-11-08 17:57:30,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1375980739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:57:30,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:57:30,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:57:30,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014113389] [2024-11-08 17:57:30,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:57:30,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:57:30,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:57:30,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:57:30,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:57:30,751 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-08 17:57:34,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.52s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:57:38,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:57:42,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:57:42,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:57:42,843 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2024-11-08 17:57:42,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:57:42,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 49 [2024-11-08 17:57:42,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:57:42,846 INFO L225 Difference]: With dead ends: 72 [2024-11-08 17:57:42,846 INFO L226 Difference]: Without dead ends: 43 [2024-11-08 17:57:42,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:57:42,849 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 12 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:57:42,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 73 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 2 Unknown, 0 Unchecked, 12.1s Time] [2024-11-08 17:57:42,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-08 17:57:42,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2024-11-08 17:57:42,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 17:57:42,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2024-11-08 17:57:42,862 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 49 [2024-11-08 17:57:42,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:57:42,864 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2024-11-08 17:57:42,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-08 17:57:42,864 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2024-11-08 17:57:42,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-08 17:57:42,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:57:42,871 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:57:42,888 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 17:57:43,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:57:43,073 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:57:43,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:57:43,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1797194382, now seen corresponding path program 1 times [2024-11-08 17:57:43,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:57:43,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [890561613] [2024-11-08 17:57:43,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:57:43,076 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:57:43,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:57:43,080 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:57:43,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6848c39e-ecf3-494e-993e-e763fff01ae1/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 17:57:43,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:44,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-08 17:57:44,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:58:05,629 WARN L286 SmtUtils]: Spent 5.84s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 17:58:13,128 WARN L286 SmtUtils]: Spent 7.47s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:58:21,083 WARN L286 SmtUtils]: Spent 7.95s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:58:27,593 WARN L286 SmtUtils]: Spent 6.51s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:58:34,282 WARN L286 SmtUtils]: Spent 6.69s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:58:39,996 WARN L286 SmtUtils]: Spent 5.71s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:58:48,111 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:58:55,862 WARN L286 SmtUtils]: Spent 7.75s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:59:02,089 WARN L286 SmtUtils]: Spent 6.23s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:59:09,422 WARN L286 SmtUtils]: Spent 7.33s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:59:15,722 WARN L286 SmtUtils]: Spent 6.30s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:59:23,841 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:59:31,093 WARN L286 SmtUtils]: Spent 7.25s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:59:38,210 WARN L286 SmtUtils]: Spent 7.12s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:59:46,331 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:59:51,872 WARN L286 SmtUtils]: Spent 5.54s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:00:03,829 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (and (fp.leq c_~var_1_5~0 .cse0) (fp.leq c_~var_1_3~0 .cse0) (fp.geq c_~var_1_3~0 .cse1) (or (and (fp.geq c_~var_1_6~0 .cse1) (fp.leq c_~var_1_6~0 .cse2)) (and (fp.geq c_~var_1_6~0 (fp.neg .cse2)) (fp.leq c_~var_1_6~0 (fp.neg .cse1)))) (fp.leq c_~var_1_4~0 .cse2) (= c_~var_1_1~0 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0) c_~var_1_5~0)) (fp.geq c_~var_1_4~0 .cse1) (let ((.cse6 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_3~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 255719.0 1000.0)))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_5~0))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (/ 23.0 10.0))) (.cse3 (fp.lt .cse6 .cse4))) (or (and (not .cse3) (= c_~var_1_7~0 (fp.sub c_currentRoundingMode .cse4 .cse5))) (and (= c_~var_1_7~0 (fp.sub c_currentRoundingMode .cse6 .cse5)) .cse3)))) (fp.geq c_~var_1_5~0 .cse1) (not (= (_ bv0 8) c_~var_1_2~0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-08 18:00:16,848 WARN L286 SmtUtils]: Spent 7.98s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:00:22,962 WARN L286 SmtUtils]: Spent 6.11s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:00:31,058 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:00:39,201 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:00:47,306 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:01:02,854 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:01:10,971 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:01:19,102 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:01:27,225 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:01:32,996 WARN L286 SmtUtils]: Spent 5.77s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:01:38,721 WARN L286 SmtUtils]: Spent 5.72s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:01:46,822 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:01:57,543 WARN L286 SmtUtils]: Spent 6.43s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:02:05,809 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:02:13,954 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:02:22,147 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:02:30,271 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:02:38,411 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:02:46,590 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:02:54,777 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:03:02,954 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:03:11,144 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:03:19,315 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:03:27,507 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:03:34,442 WARN L286 SmtUtils]: Spent 6.93s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:03:42,671 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:03:50,878 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:03:59,053 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:04:07,243 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:04:15,410 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:04:23,609 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:04:31,771 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:04:39,930 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:04:48,106 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:04:56,279 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:05:00,324 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (and (fp.leq c_~var_1_5~0 .cse0) (fp.leq c_~var_1_3~0 .cse0) (fp.geq c_~var_1_3~0 .cse1) (or (and (fp.geq c_~var_1_6~0 .cse1) (fp.leq c_~var_1_6~0 .cse2)) (and (fp.geq c_~var_1_6~0 (fp.neg .cse2)) (fp.leq c_~var_1_6~0 (fp.neg .cse1)))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_6~0))) (let ((.cse4 (fp.gt c_~last_1_var_1_8~0 .cse3))) (or (and (fp.geq c_~var_1_7~0 .cse3) (not .cse4)) (and .cse4 (fp.geq c_~var_1_7~0 c_~last_1_var_1_8~0))))) (fp.leq c_~var_1_4~0 .cse2) (= c_~var_1_1~0 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0) c_~var_1_5~0)) (fp.geq c_~var_1_4~0 .cse1) (= c_~var_1_8~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_5~0 c_~var_1_3~0))) (let ((.cse8 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_3~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 255719.0 1000.0)))) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_5~0))) (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode (/ 23.0 10.0))) (.cse5 (fp.lt .cse8 .cse6))) (or (and (not .cse5) (= c_~var_1_7~0 (fp.sub c_currentRoundingMode .cse6 .cse7))) (and (= c_~var_1_7~0 (fp.sub c_currentRoundingMode .cse8 .cse7)) .cse5)))) (fp.geq c_~var_1_5~0 .cse1) (not (= (_ bv0 8) c_~var_1_2~0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-08 18:05:04,367 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (and (fp.leq c_~var_1_5~0 .cse0) (fp.leq c_~var_1_3~0 .cse0) (fp.geq c_~var_1_3~0 .cse1) (or (and (fp.geq c_~var_1_6~0 .cse1) (fp.leq c_~var_1_6~0 .cse2)) (and (fp.geq c_~var_1_6~0 (fp.neg .cse2)) (fp.leq c_~var_1_6~0 (fp.neg .cse1)))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_6~0))) (let ((.cse4 (fp.gt c_~last_1_var_1_8~0 .cse3))) (or (and (fp.geq c_~var_1_7~0 .cse3) (not .cse4)) (and .cse4 (fp.geq c_~var_1_7~0 c_~last_1_var_1_8~0))))) (fp.leq c_~var_1_4~0 .cse2) (= c_~var_1_1~0 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0) c_~var_1_5~0)) (fp.geq c_~var_1_4~0 .cse1) (= c_~var_1_8~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_5~0 c_~var_1_3~0))) (let ((.cse8 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_3~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 255719.0 1000.0)))) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_5~0))) (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode (/ 23.0 10.0))) (.cse5 (fp.lt .cse8 .cse6))) (or (and (not .cse5) (= c_~var_1_7~0 (fp.sub c_currentRoundingMode .cse6 .cse7))) (and (= c_~var_1_7~0 (fp.sub c_currentRoundingMode .cse8 .cse7)) .cse5)))) (fp.geq c_~var_1_5~0 .cse1) (not (= (_ bv0 8) c_~var_1_2~0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-08 18:05:12,591 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:05:20,816 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:05:29,034 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:05:37,213 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:05:45,389 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:05:53,571 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:06:01,770 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:06:09,946 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:06:18,156 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:06:26,355 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:06:34,564 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:06:42,873 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:06:51,045 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:06:59,196 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:07:07,397 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:07:15,576 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:07:23,740 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:07:31,910 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:07:40,104 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:07:48,285 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:07:56,445 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:08:04,605 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:08:12,774 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:08:16,826 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_6~0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (and (fp.leq c_~var_1_5~0 .cse0) (fp.leq c_~var_1_3~0 .cse0) (fp.geq c_~var_1_3~0 .cse1) (or (and (fp.geq c_~var_1_6~0 .cse1) (fp.leq c_~var_1_6~0 .cse2)) (and (fp.geq c_~var_1_6~0 (fp.neg .cse2)) (fp.leq c_~var_1_6~0 (fp.neg .cse1)))) (= c_~var_1_9~0 .cse3) (let ((.cse4 (fp.gt c_~last_1_var_1_8~0 .cse3))) (or (and (fp.geq c_~var_1_7~0 .cse3) (not .cse4)) (and .cse4 (fp.geq c_~var_1_7~0 c_~last_1_var_1_8~0)))) (fp.leq c_~var_1_4~0 .cse2) (= c_~var_1_1~0 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0) c_~var_1_5~0)) (fp.geq c_~var_1_4~0 .cse1) (= c_~var_1_8~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_5~0 c_~var_1_3~0))) (let ((.cse8 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_3~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 255719.0 1000.0)))) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_5~0))) (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode (/ 23.0 10.0))) (.cse5 (fp.lt .cse8 .cse6))) (or (and (not .cse5) (= c_~var_1_7~0 (fp.sub c_currentRoundingMode .cse6 .cse7))) (and (= c_~var_1_7~0 (fp.sub c_currentRoundingMode .cse8 .cse7)) .cse5)))) (fp.geq c_~var_1_5~0 .cse1) (not (= (_ bv0 8) c_~var_1_2~0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-08 18:08:20,865 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_6~0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (and (fp.leq c_~var_1_5~0 .cse0) (fp.leq c_~var_1_3~0 .cse0) (fp.geq c_~var_1_3~0 .cse1) (or (and (fp.geq c_~var_1_6~0 .cse1) (fp.leq c_~var_1_6~0 .cse2)) (and (fp.geq c_~var_1_6~0 (fp.neg .cse2)) (fp.leq c_~var_1_6~0 (fp.neg .cse1)))) (= c_~var_1_9~0 .cse3) (let ((.cse4 (fp.gt c_~last_1_var_1_8~0 .cse3))) (or (and (fp.geq c_~var_1_7~0 .cse3) (not .cse4)) (and .cse4 (fp.geq c_~var_1_7~0 c_~last_1_var_1_8~0)))) (fp.leq c_~var_1_4~0 .cse2) (= c_~var_1_1~0 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0) c_~var_1_5~0)) (fp.geq c_~var_1_4~0 .cse1) (= c_~var_1_8~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_5~0 c_~var_1_3~0))) (let ((.cse8 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_3~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 255719.0 1000.0)))) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_5~0))) (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode (/ 23.0 10.0))) (.cse5 (fp.lt .cse8 .cse6))) (or (and (not .cse5) (= c_~var_1_7~0 (fp.sub c_currentRoundingMode .cse6 .cse7))) (and (= c_~var_1_7~0 (fp.sub c_currentRoundingMode .cse8 .cse7)) .cse5)))) (fp.geq c_~var_1_5~0 .cse1) (not (= (_ bv0 8) c_~var_1_2~0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-08 18:11:28,267 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:11:37,441 WARN L286 SmtUtils]: Spent 6.85s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:11:45,674 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:11:53,906 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:12:05,663 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:12:13,900 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)