./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1211b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1211b.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu --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 357cd7c68915d75ef7cc5bde5b81cbcf327e780f04b059068444ae319e85eb5a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:38:26,156 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:38:26,258 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:38:26,263 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:38:26,264 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:38:26,288 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:38:26,288 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:38:26,289 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:38:26,290 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:38:26,290 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:38:26,291 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:38:26,292 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:38:26,293 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:38:26,293 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:38:26,294 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:38:26,294 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:38:26,295 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:38:26,296 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:38:26,296 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:38:26,297 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:38:26,297 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:38:26,298 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:38:26,299 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:38:26,299 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:38:26,300 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:38:26,300 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:38:26,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:38:26,302 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:38:26,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:38:26,303 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:38:26,303 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:38:26,304 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:38:26,305 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:38:26,305 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:38:26,306 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:38:26,306 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:38:26,307 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:38:26,307 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:38:26,307 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:38:26,308 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_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/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_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu 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 -> 357cd7c68915d75ef7cc5bde5b81cbcf327e780f04b059068444ae319e85eb5a [2023-11-19 07:38:26,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:38:26,640 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:38:26,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:38:26,646 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:38:26,647 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:38:26,649 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/float-newlib/double_req_bl_1211b.c [2023-11-19 07:38:29,719 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:38:29,962 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:38:29,962 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/sv-benchmarks/c/float-newlib/double_req_bl_1211b.c [2023-11-19 07:38:29,975 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/data/ab72771bb/fd1d66d709c34afa9ab10e4965a045ea/FLAG843bb494a [2023-11-19 07:38:30,294 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/data/ab72771bb/fd1d66d709c34afa9ab10e4965a045ea [2023-11-19 07:38:30,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:38:30,301 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:38:30,302 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:38:30,302 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:38:30,309 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:38:30,310 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:38:30" (1/1) ... [2023-11-19 07:38:30,311 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b479ace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:30, skipping insertion in model container [2023-11-19 07:38:30,312 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:38:30" (1/1) ... [2023-11-19 07:38:30,348 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:38:30,542 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/sv-benchmarks/c/float-newlib/double_req_bl_1211b.c[3718,3731] [2023-11-19 07:38:30,548 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:38:30,562 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:38:30,605 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/sv-benchmarks/c/float-newlib/double_req_bl_1211b.c[3718,3731] [2023-11-19 07:38:30,606 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:38:30,628 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:38:30,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:30 WrapperNode [2023-11-19 07:38:30,629 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:38:30,630 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:38:30,630 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:38:30,630 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:38:30,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:30" (1/1) ... [2023-11-19 07:38:30,650 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:30" (1/1) ... [2023-11-19 07:38:30,694 INFO L138 Inliner]: procedures = 20, calls = 80, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 333 [2023-11-19 07:38:30,695 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:38:30,695 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:38:30,695 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:38:30,696 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:38:30,706 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:30" (1/1) ... [2023-11-19 07:38:30,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:30" (1/1) ... [2023-11-19 07:38:30,715 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:30" (1/1) ... [2023-11-19 07:38:30,721 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:30" (1/1) ... [2023-11-19 07:38:30,735 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:30" (1/1) ... [2023-11-19 07:38:30,743 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:30" (1/1) ... [2023-11-19 07:38:30,746 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:30" (1/1) ... [2023-11-19 07:38:30,748 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:30" (1/1) ... [2023-11-19 07:38:30,753 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:38:30,761 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:38:30,761 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:38:30,761 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:38:30,763 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:30" (1/1) ... [2023-11-19 07:38:30,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:38:30,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:38:30,798 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:38:30,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:38:30,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:38:30,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:38:30,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:38:30,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-19 07:38:30,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:38:30,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-19 07:38:30,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:38:30,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:38:30,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-19 07:38:30,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:38:30,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:38:30,951 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:38:30,954 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:38:31,511 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:38:31,519 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:38:31,520 INFO L302 CfgBuilder]: Removed 24 assume(true) statements. [2023-11-19 07:38:31,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:38:31 BoogieIcfgContainer [2023-11-19 07:38:31,524 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:38:31,527 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:38:31,527 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:38:31,530 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:38:31,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:38:30" (1/3) ... [2023-11-19 07:38:31,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6788b11e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:38:31, skipping insertion in model container [2023-11-19 07:38:31,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:30" (2/3) ... [2023-11-19 07:38:31,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6788b11e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:38:31, skipping insertion in model container [2023-11-19 07:38:31,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:38:31" (3/3) ... [2023-11-19 07:38:31,534 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1211b.c [2023-11-19 07:38:31,554 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:38:31,554 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:38:31,606 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:38:31,613 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@33249d87, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:38:31,614 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:38:31,619 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 74 states have (on average 1.6891891891891893) internal successors, (125), 75 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:38:31,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-19 07:38:31,628 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:38:31,629 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:38:31,630 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:38:31,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:31,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1997667430, now seen corresponding path program 1 times [2023-11-19 07:38:31,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:31,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497403434] [2023-11-19 07:38:31,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:31,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:31,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:38:31,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:38:31,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497403434] [2023-11-19 07:38:31,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497403434] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:31,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:31,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:38:31,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088596995] [2023-11-19 07:38:31,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:31,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:38:31,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:38:31,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:38:31,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:38:31,964 INFO L87 Difference]: Start difference. First operand has 76 states, 74 states have (on average 1.6891891891891893) internal successors, (125), 75 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:38:31,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:38:31,997 INFO L93 Difference]: Finished difference Result 150 states and 248 transitions. [2023-11-19 07:38:31,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:38:31,999 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-19 07:38:31,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:38:32,007 INFO L225 Difference]: With dead ends: 150 [2023-11-19 07:38:32,007 INFO L226 Difference]: Without dead ends: 73 [2023-11-19 07:38:32,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:38:32,014 INFO L413 NwaCegarLoop]: 100 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, 100 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 [2023-11-19 07:38:32,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:38:32,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-19 07:38:32,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-11-19 07:38:32,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 72 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:38:32,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 97 transitions. [2023-11-19 07:38:32,053 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 97 transitions. Word has length 20 [2023-11-19 07:38:32,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:38:32,054 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 97 transitions. [2023-11-19 07:38:32,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:38:32,054 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 97 transitions. [2023-11-19 07:38:32,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-19 07:38:32,056 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:38:32,056 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:38:32,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:38:32,057 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:38:32,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:32,058 INFO L85 PathProgramCache]: Analyzing trace with hash 450168962, now seen corresponding path program 1 times [2023-11-19 07:38:32,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:32,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138677648] [2023-11-19 07:38:32,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:32,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:32,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:38:32,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:38:32,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138677648] [2023-11-19 07:38:32,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138677648] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:32,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:32,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:38:32,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336441934] [2023-11-19 07:38:32,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:32,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:38:32,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:38:32,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:38:32,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:38:32,326 INFO L87 Difference]: Start difference. First operand 73 states and 97 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:38:32,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:38:32,385 INFO L93 Difference]: Finished difference Result 76 states and 99 transitions. [2023-11-19 07:38:32,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:38:32,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-19 07:38:32,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:38:32,390 INFO L225 Difference]: With dead ends: 76 [2023-11-19 07:38:32,390 INFO L226 Difference]: Without dead ends: 73 [2023-11-19 07:38:32,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:38:32,392 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:38:32,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 188 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:38:32,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-19 07:38:32,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-11-19 07:38:32,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 72 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:38:32,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 96 transitions. [2023-11-19 07:38:32,408 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 96 transitions. Word has length 23 [2023-11-19 07:38:32,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:38:32,409 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 96 transitions. [2023-11-19 07:38:32,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:38:32,410 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 96 transitions. [2023-11-19 07:38:32,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-19 07:38:32,411 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:38:32,411 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:38:32,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:38:32,412 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:38:32,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:32,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1201724212, now seen corresponding path program 1 times [2023-11-19 07:38:32,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:32,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787774300] [2023-11-19 07:38:32,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:32,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:32,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:38:32,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:38:32,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787774300] [2023-11-19 07:38:32,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787774300] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:32,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:32,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:38:32,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837151891] [2023-11-19 07:38:32,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:32,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:38:32,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:38:32,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:38:32,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:38:32,868 INFO L87 Difference]: Start difference. First operand 73 states and 96 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:38:32,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:38:32,948 INFO L93 Difference]: Finished difference Result 90 states and 115 transitions. [2023-11-19 07:38:32,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:38:32,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-19 07:38:32,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:38:32,952 INFO L225 Difference]: With dead ends: 90 [2023-11-19 07:38:32,953 INFO L226 Difference]: Without dead ends: 78 [2023-11-19 07:38:32,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:38:32,960 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 3 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:38:32,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 264 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:38:32,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-19 07:38:32,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2023-11-19 07:38:32,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.32) internal successors, (99), 75 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:38:32,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 99 transitions. [2023-11-19 07:38:32,978 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 99 transitions. Word has length 25 [2023-11-19 07:38:32,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:38:32,978 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 99 transitions. [2023-11-19 07:38:32,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:38:32,984 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 99 transitions. [2023-11-19 07:38:32,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-19 07:38:32,987 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:38:32,987 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:38:32,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:38:32,987 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:38:32,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:32,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1011229780, now seen corresponding path program 1 times [2023-11-19 07:38:32,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:32,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632360821] [2023-11-19 07:38:32,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:32,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:33,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:33,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:38:33,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:38:33,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632360821] [2023-11-19 07:38:33,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632360821] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:33,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:33,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:38:33,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651081512] [2023-11-19 07:38:33,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:33,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:38:33,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:38:33,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:38:33,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:38:33,939 INFO L87 Difference]: Start difference. First operand 76 states and 99 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:38:34,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:38:34,074 INFO L93 Difference]: Finished difference Result 88 states and 111 transitions. [2023-11-19 07:38:34,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:38:34,075 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-19 07:38:34,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:38:34,079 INFO L225 Difference]: With dead ends: 88 [2023-11-19 07:38:34,079 INFO L226 Difference]: Without dead ends: 73 [2023-11-19 07:38:34,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-19 07:38:34,089 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 3 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:38:34,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 526 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:38:34,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-19 07:38:34,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-11-19 07:38:34,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 72 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:38:34,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 95 transitions. [2023-11-19 07:38:34,097 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 95 transitions. Word has length 26 [2023-11-19 07:38:34,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:38:34,097 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 95 transitions. [2023-11-19 07:38:34,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:38:34,098 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 95 transitions. [2023-11-19 07:38:34,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-19 07:38:34,099 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:38:34,099 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:38:34,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:38:34,100 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:38:34,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:34,100 INFO L85 PathProgramCache]: Analyzing trace with hash -664051652, now seen corresponding path program 1 times [2023-11-19 07:38:34,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:34,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941548618] [2023-11-19 07:38:34,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:34,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:38:34,169 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:38:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:38:34,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:38:34,285 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:38:34,286 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-19 07:38:34,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:38:34,293 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-19 07:38:34,297 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:38:34,343 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet26 could not be translated [2023-11-19 07:38:34,345 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet28 could not be translated [2023-11-19 07:38:34,346 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short36 could not be translated [2023-11-19 07:38:34,347 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret33 could not be translated [2023-11-19 07:38:34,348 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short35 could not be translated [2023-11-19 07:38:34,348 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated [2023-11-19 07:38:34,348 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret33 could not be translated [2023-11-19 07:38:34,349 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short36 could not be translated [2023-11-19 07:38:34,349 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short35 could not be translated [2023-11-19 07:38:34,349 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated [2023-11-19 07:38:34,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:38:34 BoogieIcfgContainer [2023-11-19 07:38:34,364 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:38:34,365 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:38:34,366 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:38:34,366 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:38:34,367 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:38:31" (3/4) ... [2023-11-19 07:38:34,370 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 07:38:34,371 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:38:34,372 INFO L158 Benchmark]: Toolchain (without parser) took 4070.96ms. Allocated memory was 182.5MB in the beginning and 226.5MB in the end (delta: 44.0MB). Free memory was 142.3MB in the beginning and 187.5MB in the end (delta: -45.1MB). Peak memory consumption was 1.4MB. Max. memory is 16.1GB. [2023-11-19 07:38:34,372 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 182.5MB. Free memory is still 155.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:38:34,373 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.02ms. Allocated memory is still 182.5MB. Free memory was 142.3MB in the beginning and 129.1MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-19 07:38:34,373 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.82ms. Allocated memory is still 182.5MB. Free memory was 129.1MB in the beginning and 126.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 07:38:34,375 INFO L158 Benchmark]: Boogie Preprocessor took 58.20ms. Allocated memory is still 182.5MB. Free memory was 126.3MB in the beginning and 124.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:38:34,375 INFO L158 Benchmark]: RCFGBuilder took 763.64ms. Allocated memory is still 182.5MB. Free memory was 124.2MB in the beginning and 96.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-11-19 07:38:34,375 INFO L158 Benchmark]: TraceAbstraction took 2837.47ms. Allocated memory was 182.5MB in the beginning and 226.5MB in the end (delta: 44.0MB). Free memory was 96.2MB in the beginning and 187.5MB in the end (delta: -91.3MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. [2023-11-19 07:38:34,376 INFO L158 Benchmark]: Witness Printer took 5.79ms. Allocated memory is still 226.5MB. Free memory is still 187.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:38:34,379 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.55ms. Allocated memory is still 182.5MB. Free memory is still 155.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 327.02ms. Allocated memory is still 182.5MB. Free memory was 142.3MB in the beginning and 129.1MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.82ms. Allocated memory is still 182.5MB. Free memory was 129.1MB in the beginning and 126.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.20ms. Allocated memory is still 182.5MB. Free memory was 126.3MB in the beginning and 124.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 763.64ms. Allocated memory is still 182.5MB. Free memory was 124.2MB in the beginning and 96.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 2837.47ms. Allocated memory was 182.5MB in the beginning and 226.5MB in the end (delta: 44.0MB). Free memory was 96.2MB in the beginning and 187.5MB in the end (delta: -91.3MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. * Witness Printer took 5.79ms. Allocated memory is still 226.5MB. Free memory is still 187.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet26 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet28 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short36 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret33 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret33 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short36 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 152]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 151, overapproximation of someBinaryArithmeticDOUBLEoperation at line 146. Possible FailurePath: [L20] static const double one_modf = 1.0; VAL [one_modf=1] [L146] double x = -1.0 / 0.0; [L147] double iptr = __VERIFIER_nondet_double(); [L147] double iptr = __VERIFIER_nondet_double(); [L148] CALL, EXPR modf_double(x, &iptr) [L23] __int32_t i0, i1, j0; [L24] __uint32_t i; VAL [\old(x)=6441402389, iptr={6:0}, iptr={6:0}, one_modf=1, x=6441402389] [L26] ieee_double_shape_type ew_u; [L27] EXPR ew_u.value = (x) [L28] EXPR ew_u.parts.msw [L28] EXPR (i0) = ew_u.parts.msw [L29] EXPR ew_u.parts.lsw [L29] EXPR (i1) = ew_u.parts.lsw [L25-L30] { ieee_double_shape_type ew_u; ew_u.value = (x); (i0) = ew_u.parts.msw; (i1) = ew_u.parts.lsw; } VAL [\old(x)=6441402389, i0=0, i1=0, iptr={6:0}, iptr={6:0}, one_modf=1, x=6441402389] [L31] j0 = ((i0 >> 20) & 0x7ff) - 0x3ff VAL [\old(x)=6441402389, i0=0, i1=0, iptr={6:0}, iptr={6:0}, j0=-1023, one_modf=1, x=6441402389] [L32] COND TRUE j0 < 20 VAL [\old(x)=6441402389, i0=0, i1=0, iptr={6:0}, iptr={6:0}, j0=-1023, one_modf=1, x=6441402389] [L33] COND TRUE j0 < 0 VAL [\old(x)=6441402389, i0=0, i1=0, iptr={6:0}, iptr={6:0}, j0=-1023, one_modf=1, x=6441402389] [L35] ieee_double_shape_type iw_u; [L36] EXPR iw_u.parts.msw = (i0 & 0x80000000) [L37] EXPR iw_u.parts.lsw = (0) [L38] EXPR iw_u.value [L38] EXPR (*iptr) = iw_u.value [L34-L39] { ieee_double_shape_type iw_u; iw_u.parts.msw = (i0 & 0x80000000); iw_u.parts.lsw = (0); (*iptr) = iw_u.value; } VAL [\old(x)=6441402389, i0=0, i1=0, iptr={6:0}, iptr={6:0}, j0=-1023, one_modf=1, x=6441402389] [L40] return x; VAL [\old(x)=6441402389, \result=6441402389, i0=0, i1=0, iptr={6:0}, iptr={6:0}, j0=-1023, one_modf=1, x=6441402389] [L148] RET, EXPR modf_double(x, &iptr) [L148] double res = modf_double(x, &iptr); [L151] EXPR \read(iptr) [L151] CALL, EXPR isinf_double(iptr) [L114] __int32_t hx, lx; VAL [\old(x)=6441402387, one_modf=1, x=6441402387] [L116] ieee_double_shape_type ew_u; [L117] EXPR ew_u.value = (x) [L118] EXPR ew_u.parts.msw [L118] EXPR (hx) = ew_u.parts.msw [L119] EXPR ew_u.parts.lsw [L119] EXPR (lx) = ew_u.parts.lsw [L115-L120] { ieee_double_shape_type ew_u; ew_u.value = (x); (hx) = ew_u.parts.msw; (lx) = ew_u.parts.lsw; } VAL [\old(x)=6441402387, hx=2146435072, lx=0, one_modf=1, x=6441402387] [L121] hx &= 0x7fffffff VAL [\old(x)=6441402387, hx=2146435072, lx=0, one_modf=1, x=6441402387] [L122] EXPR lx | (-lx) VAL [\old(x)=6441402387, hx=2146435072, lx=0, one_modf=1, x=6441402387] [L122] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L123] hx = 0x7ff00000 - hx VAL [\old(x)=6441402387, hx=0, lx=0, one_modf=1, x=6441402387] [L124] EXPR hx | (-hx) VAL [\old(x)=6441402387, hx=0, lx=0, one_modf=1, x=6441402387] [L124] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); [L151] RET, EXPR isinf_double(iptr) [L151] isinf_double(iptr) && !(res == -0.0 && __signbit_double(res) == 1) [L151] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [iptr={6:0}, one_modf=1, res=6441402389, x=6441402389] [L151] isinf_double(iptr) && !(res == -0.0 && __signbit_double(res) == 1) VAL [iptr={6:0}, one_modf=1, res=6441402389, x=6441402389] [L151] COND TRUE isinf_double(iptr) && !(res == -0.0 && __signbit_double(res) == 1) [L152] reach_error() VAL [iptr={6:0}, one_modf=1, res=6441402389, x=6441402389] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 1078 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 697 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 77 IncrementalHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 381 mSDtfsCounter, 77 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=0, InterpolantAutomatonStates: 16, 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, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 130 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-19 07:38:34,416 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1211b.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu --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 357cd7c68915d75ef7cc5bde5b81cbcf327e780f04b059068444ae319e85eb5a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:38:37,145 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:38:37,232 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-19 07:38:37,243 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:38:37,246 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:38:37,293 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:38:37,294 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:38:37,295 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:38:37,296 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:38:37,301 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:38:37,303 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:38:37,303 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:38:37,304 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:38:37,306 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:38:37,307 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:38:37,307 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:38:37,308 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:38:37,308 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:38:37,309 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:38:37,310 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:38:37,310 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:38:37,311 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 07:38:37,312 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-19 07:38:37,312 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-19 07:38:37,313 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:38:37,313 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:38:37,314 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:38:37,314 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:38:37,315 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:38:37,315 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:38:37,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:38:37,317 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:38:37,318 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:38:37,318 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:38:37,319 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-19 07:38:37,319 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-19 07:38:37,319 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:38:37,319 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:38:37,320 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:38:37,321 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:38:37,321 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-19 07:38:37,322 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:38:37,322 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_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/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_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu 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 -> 357cd7c68915d75ef7cc5bde5b81cbcf327e780f04b059068444ae319e85eb5a [2023-11-19 07:38:37,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:38:37,745 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:38:37,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:38:37,749 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:38:37,749 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:38:37,751 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/float-newlib/double_req_bl_1211b.c [2023-11-19 07:38:41,061 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:38:41,341 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:38:41,342 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/sv-benchmarks/c/float-newlib/double_req_bl_1211b.c [2023-11-19 07:38:41,356 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/data/c10631937/68cd03e30d0d4389924d583daa97ee60/FLAG9b318022d [2023-11-19 07:38:41,372 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/data/c10631937/68cd03e30d0d4389924d583daa97ee60 [2023-11-19 07:38:41,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:38:41,376 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:38:41,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:38:41,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:38:41,390 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:38:41,391 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:38:41" (1/1) ... [2023-11-19 07:38:41,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f6af71d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:41, skipping insertion in model container [2023-11-19 07:38:41,392 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:38:41" (1/1) ... [2023-11-19 07:38:41,447 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:38:41,631 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/sv-benchmarks/c/float-newlib/double_req_bl_1211b.c[3718,3731] [2023-11-19 07:38:41,640 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:38:41,668 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:38:41,751 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/sv-benchmarks/c/float-newlib/double_req_bl_1211b.c[3718,3731] [2023-11-19 07:38:41,765 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:38:41,786 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:38:41,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:41 WrapperNode [2023-11-19 07:38:41,787 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:38:41,788 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:38:41,788 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:38:41,789 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:38:41,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:41" (1/1) ... [2023-11-19 07:38:41,825 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:41" (1/1) ... [2023-11-19 07:38:41,873 INFO L138 Inliner]: procedures = 23, calls = 80, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 257 [2023-11-19 07:38:41,873 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:38:41,874 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:38:41,875 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:38:41,875 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:38:41,886 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:41" (1/1) ... [2023-11-19 07:38:41,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:41" (1/1) ... [2023-11-19 07:38:41,892 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:41" (1/1) ... [2023-11-19 07:38:41,896 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:41" (1/1) ... [2023-11-19 07:38:41,923 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:41" (1/1) ... [2023-11-19 07:38:41,934 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:41" (1/1) ... [2023-11-19 07:38:41,937 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:41" (1/1) ... [2023-11-19 07:38:41,939 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:41" (1/1) ... [2023-11-19 07:38:41,944 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:38:41,954 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:38:41,954 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:38:41,955 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:38:41,955 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:41" (1/1) ... [2023-11-19 07:38:41,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:38:41,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:38:42,002 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:38:42,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:38:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:38:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2023-11-19 07:38:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2023-11-19 07:38:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-19 07:38:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:38:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2023-11-19 07:38:42,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-19 07:38:42,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:38:42,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:38:42,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-19 07:38:42,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:38:42,188 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:38:42,190 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:38:44,844 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:38:44,852 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:38:44,852 INFO L302 CfgBuilder]: Removed 24 assume(true) statements. [2023-11-19 07:38:44,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:38:44 BoogieIcfgContainer [2023-11-19 07:38:44,863 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:38:44,865 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:38:44,865 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:38:44,868 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:38:44,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:38:41" (1/3) ... [2023-11-19 07:38:44,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4355ed24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:38:44, skipping insertion in model container [2023-11-19 07:38:44,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:41" (2/3) ... [2023-11-19 07:38:44,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4355ed24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:38:44, skipping insertion in model container [2023-11-19 07:38:44,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:38:44" (3/3) ... [2023-11-19 07:38:44,874 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1211b.c [2023-11-19 07:38:44,894 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:38:44,895 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:38:44,959 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:38:44,966 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5e4b3690, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:38:44,967 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:38:44,973 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 50 states have (on average 1.66) internal successors, (83), 51 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:38:44,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-19 07:38:44,981 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:38:44,981 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:38:44,983 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:38:44,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:44,991 INFO L85 PathProgramCache]: Analyzing trace with hash -892017235, now seen corresponding path program 1 times [2023-11-19 07:38:45,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:38:45,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1585828378] [2023-11-19 07:38:45,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:45,004 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:38:45,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:38:45,006 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-19 07:38:45,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-19 07:38:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:45,206 INFO L262 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-19 07:38:45,212 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:38:45,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:38:45,234 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:38:45,235 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:38:45,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1585828378] [2023-11-19 07:38:45,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1585828378] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:45,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:45,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:38:45,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103047085] [2023-11-19 07:38:45,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:45,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:38:45,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:38:45,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:38:45,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:38:45,317 INFO L87 Difference]: Start difference. First operand has 52 states, 50 states have (on average 1.66) internal successors, (83), 51 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:38:45,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:38:45,358 INFO L93 Difference]: Finished difference Result 102 states and 164 transitions. [2023-11-19 07:38:45,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:38:45,361 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-19 07:38:45,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:38:45,371 INFO L225 Difference]: With dead ends: 102 [2023-11-19 07:38:45,372 INFO L226 Difference]: Without dead ends: 49 [2023-11-19 07:38:45,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:38:45,380 INFO L413 NwaCegarLoop]: 58 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, 58 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 [2023-11-19 07:38:45,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:38:45,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-19 07:38:45,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-11-19 07:38:45,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:38:45,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2023-11-19 07:38:45,429 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 15 [2023-11-19 07:38:45,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:38:45,429 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2023-11-19 07:38:45,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:38:45,430 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2023-11-19 07:38:45,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-19 07:38:45,432 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:38:45,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:38:45,448 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-19 07:38:45,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:38:45,643 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:38:45,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:45,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1752581688, now seen corresponding path program 1 times [2023-11-19 07:38:45,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:38:45,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [478313269] [2023-11-19 07:38:45,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:45,646 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:38:45,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:38:45,649 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-19 07:38:45,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-19 07:38:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:45,823 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-19 07:38:45,827 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:38:46,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:38:46,202 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:38:46,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:38:46,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [478313269] [2023-11-19 07:38:46,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [478313269] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:46,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:46,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:38:46,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492274313] [2023-11-19 07:38:46,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:46,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:38:46,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:38:46,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:38:46,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:38:46,213 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:38:46,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:38:46,995 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2023-11-19 07:38:47,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:38:47,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-19 07:38:47,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:38:47,001 INFO L225 Difference]: With dead ends: 64 [2023-11-19 07:38:47,001 INFO L226 Difference]: Without dead ends: 27 [2023-11-19 07:38:47,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:38:47,003 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 22 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:38:47,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 73 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 07:38:47,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-19 07:38:47,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-19 07:38:47,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:38:47,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2023-11-19 07:38:47,048 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 18 [2023-11-19 07:38:47,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:38:47,049 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2023-11-19 07:38:47,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:38:47,050 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2023-11-19 07:38:47,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-19 07:38:47,051 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:38:47,051 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:38:47,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/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)] Forceful destruction successful, exit code 0 [2023-11-19 07:38:47,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:38:47,256 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:38:47,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:47,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1408426499, now seen corresponding path program 1 times [2023-11-19 07:38:47,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:38:47,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1745678834] [2023-11-19 07:38:47,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:47,258 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:38:47,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:38:47,262 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-19 07:38:47,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/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 [2023-11-19 07:38:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:47,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-19 07:38:47,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:38:47,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:38:47,697 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:38:47,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:38:47,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1745678834] [2023-11-19 07:38:47,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1745678834] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:47,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:47,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:38:47,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466752832] [2023-11-19 07:38:47,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:47,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:38:47,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:38:47,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:38:47,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:38:47,700 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:38:47,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:38:47,743 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2023-11-19 07:38:47,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:38:47,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-19 07:38:47,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:38:47,745 INFO L225 Difference]: With dead ends: 30 [2023-11-19 07:38:47,746 INFO L226 Difference]: Without dead ends: 27 [2023-11-19 07:38:47,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:38:47,750 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:38:47,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:38:47,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-19 07:38:47,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-19 07:38:47,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:38:47,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2023-11-19 07:38:47,756 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 20 [2023-11-19 07:38:47,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:38:47,759 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2023-11-19 07:38:47,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:38:47,760 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2023-11-19 07:38:47,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-19 07:38:47,761 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:38:47,761 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:38:47,772 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-19 07:38:47,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:38:47,972 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:38:47,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:47,973 INFO L85 PathProgramCache]: Analyzing trace with hash -605570489, now seen corresponding path program 1 times [2023-11-19 07:38:47,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:38:47,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [807172664] [2023-11-19 07:38:47,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:47,974 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:38:47,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:38:47,976 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-19 07:38:47,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-19 07:38:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:48,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-19 07:38:48,536 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:38:48,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:38:48,782 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:38:48,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:38:48,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [807172664] [2023-11-19 07:38:48,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [807172664] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:48,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:48,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:38:48,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497389548] [2023-11-19 07:38:48,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:48,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:38:48,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:38:48,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:38:48,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:38:48,785 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:38:50,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-19 07:38:51,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:38:51,272 INFO L93 Difference]: Finished difference Result 31 states and 30 transitions. [2023-11-19 07:38:51,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:38:51,274 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-11-19 07:38:51,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:38:51,275 INFO L225 Difference]: With dead ends: 31 [2023-11-19 07:38:51,275 INFO L226 Difference]: Without dead ends: 27 [2023-11-19 07:38:51,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:38:51,277 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 28 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:38:51,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 73 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2023-11-19 07:38:51,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-19 07:38:51,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-19 07:38:51,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0) internal successors, (26), 26 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:38:51,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2023-11-19 07:38:51,284 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 22 [2023-11-19 07:38:51,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:38:51,287 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2023-11-19 07:38:51,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:38:51,288 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2023-11-19 07:38:51,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-19 07:38:51,289 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:38:51,290 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:38:51,306 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-19 07:38:51,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:38:51,506 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:38:51,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:51,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1265561966, now seen corresponding path program 1 times [2023-11-19 07:38:51,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:38:51,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [423321398] [2023-11-19 07:38:51,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:51,508 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:38:51,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:38:51,510 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-19 07:38:51,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-19 07:38:51,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:52,010 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-19 07:38:52,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:38:52,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2023-11-19 07:38:52,510 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2023-11-19 07:38:52,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2023-11-19 07:38:52,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:38:52,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 38 [2023-11-19 07:38:53,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:38:53,978 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:38:53,978 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:38:53,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [423321398] [2023-11-19 07:38:53,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [423321398] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:53,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:53,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-19 07:38:53,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999885799] [2023-11-19 07:38:53,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:53,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-19 07:38:53,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:38:53,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-19 07:38:53,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-11-19 07:38:53,983 INFO L87 Difference]: Start difference. First operand 27 states and 26 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:38:57,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:38:57,452 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2023-11-19 07:38:57,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-19 07:38:57,452 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-19 07:38:57,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:38:57,453 INFO L225 Difference]: With dead ends: 27 [2023-11-19 07:38:57,453 INFO L226 Difference]: Without dead ends: 0 [2023-11-19 07:38:57,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2023-11-19 07:38:57,454 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 31 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-19 07:38:57,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 103 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-19 07:38:57,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-19 07:38:57,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-19 07:38:57,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:38:57,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-19 07:38:57,456 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2023-11-19 07:38:57,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:38:57,457 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-19 07:38:57,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:38:57,457 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-19 07:38:57,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-19 07:38:57,460 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-19 07:38:57,476 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-19 07:38:57,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:38:57,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-19 07:38:58,022 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 98) no Hoare annotation was computed. [2023-11-19 07:38:58,023 INFO L895 garLoopResultBuilder]: At program point L93-1(lines 93 98) the Hoare annotation is: false [2023-11-19 07:38:58,023 INFO L899 garLoopResultBuilder]: For program point L93-2(lines 93 98) no Hoare annotation was computed. [2023-11-19 07:38:58,023 INFO L899 garLoopResultBuilder]: For program point L151(line 151) no Hoare annotation was computed. [2023-11-19 07:38:58,023 INFO L899 garLoopResultBuilder]: For program point L151-1(line 151) no Hoare annotation was computed. [2023-11-19 07:38:58,023 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 108) no Hoare annotation was computed. [2023-11-19 07:38:58,023 INFO L899 garLoopResultBuilder]: For program point L151-3(line 151) no Hoare annotation was computed. [2023-11-19 07:38:58,024 INFO L899 garLoopResultBuilder]: For program point L151-5(lines 151 154) no Hoare annotation was computed. [2023-11-19 07:38:58,024 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 139 157) no Hoare annotation was computed. [2023-11-19 07:38:58,024 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-19 07:38:58,024 INFO L899 garLoopResultBuilder]: For program point L152(line 152) no Hoare annotation was computed. [2023-11-19 07:38:58,024 INFO L899 garLoopResultBuilder]: For program point __signbit_double_returnLabel#1(lines 127 137) no Hoare annotation was computed. [2023-11-19 07:38:58,025 INFO L899 garLoopResultBuilder]: For program point isinf_double_returnLabel#1(lines 113 125) no Hoare annotation was computed. [2023-11-19 07:38:58,025 INFO L899 garLoopResultBuilder]: For program point L46-1(lines 46 50) no Hoare annotation was computed. [2023-11-19 07:38:58,025 INFO L895 garLoopResultBuilder]: At program point L46-2(lines 46 50) the Hoare annotation is: false [2023-11-19 07:38:58,025 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-19 07:38:58,025 INFO L899 garLoopResultBuilder]: For program point L71-1(lines 71 75) no Hoare annotation was computed. [2023-11-19 07:38:58,026 INFO L895 garLoopResultBuilder]: At program point L71-2(lines 71 75) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_32| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_32|) |ULTIMATE.start_modf_double_~i0~0#1|) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_32|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_32|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_32|))))) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_modf_double_~x#1| (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)))) (exists ((|v_skolemized_q#valueAsBitvector_32| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_32|) (_ bv20 32))) (bvadd (_ bv1023 32) |ULTIMATE.start_modf_double_~j0~0#1|)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_32|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_32|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_32|)))))) [2023-11-19 07:38:58,026 INFO L899 garLoopResultBuilder]: For program point L88-1(lines 88 92) no Hoare annotation was computed. [2023-11-19 07:38:58,026 INFO L895 garLoopResultBuilder]: At program point L88-2(lines 88 92) the Hoare annotation is: false [2023-11-19 07:38:58,027 INFO L899 garLoopResultBuilder]: For program point L130-1(lines 130 134) no Hoare annotation was computed. [2023-11-19 07:38:58,028 INFO L895 garLoopResultBuilder]: At program point L130-2(lines 130 134) the Hoare annotation is: (and (exists ((|ULTIMATE.start_modf_double_~high~1#1| (_ BitVec 32))) (= |ULTIMATE.start_main_~res~0#1| (let ((.cse0 (concat (bvand |ULTIMATE.start_modf_double_~high~1#1| (_ bv2147483648 32)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) |ULTIMATE.start_main_#t~short25#1| (exists ((|ULTIMATE.start_modf_double_~high~1#1| (_ BitVec 32))) (= (let ((.cse1 (concat (bvand |ULTIMATE.start_modf_double_~high~1#1| (_ bv2147483648 32)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))) |ULTIMATE.start_modf_double_#res#1|)) (exists ((|v_skolemized_q#valueAsBitvector_49| (_ BitVec 64)) (v_arrayElimCell_4 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (let ((.cse2 (concat (bvand ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_49|) (_ bv2147483648 32)) v_arrayElimCell_4))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) |ULTIMATE.start___signbit_double_~x#1|) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_49|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_49|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_49|))))) (exists ((|v_skolemized_q#valueAsBitvector_49| (_ BitVec 64)) (v_arrayElimCell_4 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (let ((.cse3 (concat (bvand ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_49|) (_ bv2147483648 32)) v_arrayElimCell_4))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))) |ULTIMATE.start_main_~res~0#1|) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_49|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_49|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_49|))))) (exists ((|v_skolemized_q#valueAsBitvector_49| (_ BitVec 64)) (v_arrayElimCell_4 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (let ((.cse4 (concat (bvand ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_49|) (_ bv2147483648 32)) v_arrayElimCell_4))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) |ULTIMATE.start_modf_double_#res#1|) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_49|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_49|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_49|)))))) [2023-11-19 07:38:58,028 INFO L899 garLoopResultBuilder]: For program point L130-3(lines 130 134) no Hoare annotation was computed. [2023-11-19 07:38:58,028 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 109) no Hoare annotation was computed. [2023-11-19 07:38:58,028 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-19 07:38:58,029 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2023-11-19 07:38:58,029 INFO L899 garLoopResultBuilder]: For program point L115-1(lines 115 120) no Hoare annotation was computed. [2023-11-19 07:38:58,029 INFO L895 garLoopResultBuilder]: At program point L115-2(lines 115 120) the Hoare annotation is: (and (exists ((|ULTIMATE.start_modf_double_~high~1#1| (_ BitVec 32))) (= |ULTIMATE.start_main_~res~0#1| (let ((.cse0 (concat (bvand |ULTIMATE.start_modf_double_~high~1#1| (_ bv2147483648 32)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (exists ((|ULTIMATE.start_modf_double_~high~1#1| (_ BitVec 32))) (= (let ((.cse1 (concat (bvand |ULTIMATE.start_modf_double_~high~1#1| (_ bv2147483648 32)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))) |ULTIMATE.start_modf_double_#res#1|)) (exists ((|v_skolemized_q#valueAsBitvector_49| (_ BitVec 64)) (v_arrayElimCell_4 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (let ((.cse2 (concat (bvand ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_49|) (_ bv2147483648 32)) v_arrayElimCell_4))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) |ULTIMATE.start_main_~res~0#1|) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_49|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_49|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_49|))))) (exists ((|v_skolemized_q#valueAsBitvector_49| (_ BitVec 64)) (v_arrayElimCell_4 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (let ((.cse3 (concat (bvand ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_49|) (_ bv2147483648 32)) v_arrayElimCell_4))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))) |ULTIMATE.start_modf_double_#res#1|) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_49|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_49|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_49|)))))) [2023-11-19 07:38:58,030 INFO L899 garLoopResultBuilder]: For program point L115-3(lines 115 120) no Hoare annotation was computed. [2023-11-19 07:38:58,030 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 67) no Hoare annotation was computed. [2023-11-19 07:38:58,030 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-19 07:38:58,030 INFO L899 garLoopResultBuilder]: For program point L25-1(lines 25 30) no Hoare annotation was computed. [2023-11-19 07:38:58,030 INFO L895 garLoopResultBuilder]: At program point L25-2(lines 25 30) the Hoare annotation is: (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_modf_double_~x#1| (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)))) [2023-11-19 07:38:58,031 INFO L899 garLoopResultBuilder]: For program point L25-3(lines 25 30) no Hoare annotation was computed. [2023-11-19 07:38:58,031 INFO L899 garLoopResultBuilder]: For program point modf_double_returnLabel#1(lines 22 110) no Hoare annotation was computed. [2023-11-19 07:38:58,031 INFO L899 garLoopResultBuilder]: For program point L34-1(lines 34 39) no Hoare annotation was computed. [2023-11-19 07:38:58,031 INFO L895 garLoopResultBuilder]: At program point L34-2(lines 34 39) the Hoare annotation is: false [2023-11-19 07:38:58,031 INFO L899 garLoopResultBuilder]: For program point L34-3(lines 34 39) no Hoare annotation was computed. [2023-11-19 07:38:58,032 INFO L899 garLoopResultBuilder]: For program point L59-1(lines 59 64) no Hoare annotation was computed. [2023-11-19 07:38:58,032 INFO L895 garLoopResultBuilder]: At program point L59-2(lines 59 64) the Hoare annotation is: false [2023-11-19 07:38:58,032 INFO L899 garLoopResultBuilder]: For program point L59-3(lines 59 64) no Hoare annotation was computed. [2023-11-19 07:38:58,032 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 56) no Hoare annotation was computed. [2023-11-19 07:38:58,032 INFO L895 garLoopResultBuilder]: At program point L51-1(lines 51 56) the Hoare annotation is: false [2023-11-19 07:38:58,032 INFO L899 garLoopResultBuilder]: For program point L51-2(lines 51 56) no Hoare annotation was computed. [2023-11-19 07:38:58,033 INFO L899 garLoopResultBuilder]: For program point L76(lines 76 81) no Hoare annotation was computed. [2023-11-19 07:38:58,033 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 66) no Hoare annotation was computed. [2023-11-19 07:38:58,033 INFO L895 garLoopResultBuilder]: At program point L76-1(lines 76 81) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_32| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_32|) |ULTIMATE.start_modf_double_~i0~0#1|) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_32|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_32|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_32|))))) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_modf_double_~x#1| (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)))) (exists ((|v_skolemized_q#valueAsBitvector_32| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_32|) (_ bv20 32))) (bvadd (_ bv1023 32) |ULTIMATE.start_modf_double_~j0~0#1|)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_32|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_32|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_32|))))) (exists ((|v_ULTIMATE.start_modf_double_~#gh_u~1#1.base_10| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_49| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_modf_double_~#gh_u~1#1.base_10|) (_ bv4 32)))) (and (= .cse0 |ULTIMATE.start_modf_double_~high~1#1|) (= .cse0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_49|)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_49|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_49|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_49|))))))) [2023-11-19 07:38:58,034 INFO L899 garLoopResultBuilder]: For program point L76-2(lines 76 81) no Hoare annotation was computed. [2023-11-19 07:38:58,034 INFO L899 garLoopResultBuilder]: For program point L68(lines 68 109) no Hoare annotation was computed. [2023-11-19 07:38:58,034 INFO L899 garLoopResultBuilder]: For program point L101-1(lines 101 106) no Hoare annotation was computed. [2023-11-19 07:38:58,034 INFO L895 garLoopResultBuilder]: At program point L101-2(lines 101 106) the Hoare annotation is: false [2023-11-19 07:38:58,034 INFO L899 garLoopResultBuilder]: For program point L101-3(lines 101 106) no Hoare annotation was computed. [2023-11-19 07:38:58,038 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-19 07:38:58,040 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:38:58,058 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_modf_double_~high~1#1 : bv32 :: ~res~0 == ~fp~64((~bvand~32(ULTIMATE.start_modf_double_~high~1#1, 2147483648bv32) ++ 0bv32)[63:63], (~bvand~32(ULTIMATE.start_modf_double_~high~1#1, 2147483648bv32) ++ 0bv32)[62:52], (~bvand~32(ULTIMATE.start_modf_double_~high~1#1, 2147483648bv32) ++ 0bv32)[51:0])) could not be translated [2023-11-19 07:38:58,059 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short25 could not be translated [2023-11-19 07:38:58,059 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_modf_double_~high~1#1 : bv32 :: ~fp~64((~bvand~32(ULTIMATE.start_modf_double_~high~1#1, 2147483648bv32) ++ 0bv32)[63:63], (~bvand~32(ULTIMATE.start_modf_double_~high~1#1, 2147483648bv32) ++ 0bv32)[62:52], (~bvand~32(ULTIMATE.start_modf_double_~high~1#1, 2147483648bv32) ++ 0bv32)[51:0]) == #res) could not be translated [2023-11-19 07:38:58,060 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_skolemized_q#valueAsBitvector_49 : bv64, v_arrayElimCell_4 : bv32, currentRoundingMode : FloatRoundingMode :: ~fp~64((~bvand~32(v_skolemized_q#valueAsBitvector_49[63:32], 2147483648bv32) ++ v_arrayElimCell_4)[63:63], (~bvand~32(v_skolemized_q#valueAsBitvector_49[63:32], 2147483648bv32) ++ v_arrayElimCell_4)[62:52], (~bvand~32(v_skolemized_q#valueAsBitvector_49[63:32], 2147483648bv32) ++ v_arrayElimCell_4)[51:0]) == ~x && ~fp.div~64(currentRoundingMode, ~fp.neg~64(~to_fp~64(currentRoundingMode, 1.0)), ~Pluszero~64()) == ~fp~64(v_skolemized_q#valueAsBitvector_49[63:63], v_skolemized_q#valueAsBitvector_49[62:52], v_skolemized_q#valueAsBitvector_49[51:0])) could not be translated [2023-11-19 07:38:58,060 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_skolemized_q#valueAsBitvector_49 : bv64, v_arrayElimCell_4 : bv32, currentRoundingMode : FloatRoundingMode :: ~fp~64((~bvand~32(v_skolemized_q#valueAsBitvector_49[63:32], 2147483648bv32) ++ v_arrayElimCell_4)[63:63], (~bvand~32(v_skolemized_q#valueAsBitvector_49[63:32], 2147483648bv32) ++ v_arrayElimCell_4)[62:52], (~bvand~32(v_skolemized_q#valueAsBitvector_49[63:32], 2147483648bv32) ++ v_arrayElimCell_4)[51:0]) == ~res~0 && ~fp.div~64(currentRoundingMode, ~fp.neg~64(~to_fp~64(currentRoundingMode, 1.0)), ~Pluszero~64()) == ~fp~64(v_skolemized_q#valueAsBitvector_49[63:63], v_skolemized_q#valueAsBitvector_49[62:52], v_skolemized_q#valueAsBitvector_49[51:0])) could not be translated [2023-11-19 07:38:58,060 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_skolemized_q#valueAsBitvector_49 : bv64, v_arrayElimCell_4 : bv32, currentRoundingMode : FloatRoundingMode :: ~fp~64((~bvand~32(v_skolemized_q#valueAsBitvector_49[63:32], 2147483648bv32) ++ v_arrayElimCell_4)[63:63], (~bvand~32(v_skolemized_q#valueAsBitvector_49[63:32], 2147483648bv32) ++ v_arrayElimCell_4)[62:52], (~bvand~32(v_skolemized_q#valueAsBitvector_49[63:32], 2147483648bv32) ++ v_arrayElimCell_4)[51:0]) == #res && ~fp.div~64(currentRoundingMode, ~fp.neg~64(~to_fp~64(currentRoundingMode, 1.0)), ~Pluszero~64()) == ~fp~64(v_skolemized_q#valueAsBitvector_49[63:63], v_skolemized_q#valueAsBitvector_49[62:52], v_skolemized_q#valueAsBitvector_49[51:0])) could not be translated [2023-11-19 07:38:58,061 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_skolemized_q#valueAsBitvector_32 : bv64, currentRoundingMode : FloatRoundingMode :: v_skolemized_q#valueAsBitvector_32[63:32] == ~i0~0 && ~fp.div~64(currentRoundingMode, ~fp.neg~64(~to_fp~64(currentRoundingMode, 1.0)), ~Pluszero~64()) == ~fp~64(v_skolemized_q#valueAsBitvector_32[63:63], v_skolemized_q#valueAsBitvector_32[62:52], v_skolemized_q#valueAsBitvector_32[51:0])) could not be translated [2023-11-19 07:38:58,065 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~x == ~fp.div~64(currentRoundingMode, ~fp.neg~64(~to_fp~64(currentRoundingMode, 1.0)), ~Pluszero~64())) could not be translated [2023-11-19 07:38:58,065 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_skolemized_q#valueAsBitvector_32 : bv64, currentRoundingMode : FloatRoundingMode :: ~bvand~32(2047bv32, ~bvashr~32(v_skolemized_q#valueAsBitvector_32[63:32], 20bv32)) == ~bvadd~32(1023bv32, ~j0~0) && ~fp.div~64(currentRoundingMode, ~fp.neg~64(~to_fp~64(currentRoundingMode, 1.0)), ~Pluszero~64()) == ~fp~64(v_skolemized_q#valueAsBitvector_32[63:63], v_skolemized_q#valueAsBitvector_32[62:52], v_skolemized_q#valueAsBitvector_32[51:0])) could not be translated [2023-11-19 07:38:58,066 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~x == ~fp.div~64(currentRoundingMode, ~fp.neg~64(~to_fp~64(currentRoundingMode, 1.0)), ~Pluszero~64())) could not be translated [2023-11-19 07:38:58,066 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_modf_double_~high~1#1 : bv32 :: ~res~0 == ~fp~64((~bvand~32(ULTIMATE.start_modf_double_~high~1#1, 2147483648bv32) ++ 0bv32)[63:63], (~bvand~32(ULTIMATE.start_modf_double_~high~1#1, 2147483648bv32) ++ 0bv32)[62:52], (~bvand~32(ULTIMATE.start_modf_double_~high~1#1, 2147483648bv32) ++ 0bv32)[51:0])) could not be translated [2023-11-19 07:38:58,067 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_modf_double_~high~1#1 : bv32 :: ~fp~64((~bvand~32(ULTIMATE.start_modf_double_~high~1#1, 2147483648bv32) ++ 0bv32)[63:63], (~bvand~32(ULTIMATE.start_modf_double_~high~1#1, 2147483648bv32) ++ 0bv32)[62:52], (~bvand~32(ULTIMATE.start_modf_double_~high~1#1, 2147483648bv32) ++ 0bv32)[51:0]) == #res) could not be translated [2023-11-19 07:38:58,072 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_skolemized_q#valueAsBitvector_49 : bv64, v_arrayElimCell_4 : bv32, currentRoundingMode : FloatRoundingMode :: ~fp~64((~bvand~32(v_skolemized_q#valueAsBitvector_49[63:32], 2147483648bv32) ++ v_arrayElimCell_4)[63:63], (~bvand~32(v_skolemized_q#valueAsBitvector_49[63:32], 2147483648bv32) ++ v_arrayElimCell_4)[62:52], (~bvand~32(v_skolemized_q#valueAsBitvector_49[63:32], 2147483648bv32) ++ v_arrayElimCell_4)[51:0]) == ~res~0 && ~fp.div~64(currentRoundingMode, ~fp.neg~64(~to_fp~64(currentRoundingMode, 1.0)), ~Pluszero~64()) == ~fp~64(v_skolemized_q#valueAsBitvector_49[63:63], v_skolemized_q#valueAsBitvector_49[62:52], v_skolemized_q#valueAsBitvector_49[51:0])) could not be translated [2023-11-19 07:38:58,073 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_skolemized_q#valueAsBitvector_49 : bv64, v_arrayElimCell_4 : bv32, currentRoundingMode : FloatRoundingMode :: ~fp~64((~bvand~32(v_skolemized_q#valueAsBitvector_49[63:32], 2147483648bv32) ++ v_arrayElimCell_4)[63:63], (~bvand~32(v_skolemized_q#valueAsBitvector_49[63:32], 2147483648bv32) ++ v_arrayElimCell_4)[62:52], (~bvand~32(v_skolemized_q#valueAsBitvector_49[63:32], 2147483648bv32) ++ v_arrayElimCell_4)[51:0]) == #res && ~fp.div~64(currentRoundingMode, ~fp.neg~64(~to_fp~64(currentRoundingMode, 1.0)), ~Pluszero~64()) == ~fp~64(v_skolemized_q#valueAsBitvector_49[63:63], v_skolemized_q#valueAsBitvector_49[62:52], v_skolemized_q#valueAsBitvector_49[51:0])) could not be translated [2023-11-19 07:38:58,074 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_skolemized_q#valueAsBitvector_32 : bv64, currentRoundingMode : FloatRoundingMode :: v_skolemized_q#valueAsBitvector_32[63:32] == ~i0~0 && ~fp.div~64(currentRoundingMode, ~fp.neg~64(~to_fp~64(currentRoundingMode, 1.0)), ~Pluszero~64()) == ~fp~64(v_skolemized_q#valueAsBitvector_32[63:63], v_skolemized_q#valueAsBitvector_32[62:52], v_skolemized_q#valueAsBitvector_32[51:0])) could not be translated [2023-11-19 07:38:58,074 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~x == ~fp.div~64(currentRoundingMode, ~fp.neg~64(~to_fp~64(currentRoundingMode, 1.0)), ~Pluszero~64())) could not be translated [2023-11-19 07:38:58,074 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_skolemized_q#valueAsBitvector_32 : bv64, currentRoundingMode : FloatRoundingMode :: ~bvand~32(2047bv32, ~bvashr~32(v_skolemized_q#valueAsBitvector_32[63:32], 20bv32)) == ~bvadd~32(1023bv32, ~j0~0) && ~fp.div~64(currentRoundingMode, ~fp.neg~64(~to_fp~64(currentRoundingMode, 1.0)), ~Pluszero~64()) == ~fp~64(v_skolemized_q#valueAsBitvector_32[63:63], v_skolemized_q#valueAsBitvector_32[62:52], v_skolemized_q#valueAsBitvector_32[51:0])) could not be translated [2023-11-19 07:38:58,075 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_modf_double_~#gh_u~1#1.base_10 : bv32, v_skolemized_q#valueAsBitvector_49 : bv64, currentRoundingMode : FloatRoundingMode :: (#memory_int[v_ULTIMATE.start_modf_double_~#gh_u~1#1.base_10][4bv32] == ~high~1 && #memory_int[v_ULTIMATE.start_modf_double_~#gh_u~1#1.base_10][4bv32] == v_skolemized_q#valueAsBitvector_49[63:32]) && ~fp.div~64(currentRoundingMode, ~fp.neg~64(~to_fp~64(currentRoundingMode, 1.0)), ~Pluszero~64()) == ~fp~64(v_skolemized_q#valueAsBitvector_49[63:63], v_skolemized_q#valueAsBitvector_49[62:52], v_skolemized_q#valueAsBitvector_49[51:0])) could not be translated [2023-11-19 07:38:58,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:38:58 BoogieIcfgContainer [2023-11-19 07:38:58,075 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:38:58,076 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:38:58,076 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:38:58,076 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:38:58,077 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:38:44" (3/4) ... [2023-11-19 07:38:58,079 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-19 07:38:58,094 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2023-11-19 07:38:58,095 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-11-19 07:38:58,095 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-19 07:38:58,096 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-19 07:38:58,212 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 07:38:58,213 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/witness.yml [2023-11-19 07:38:58,213 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:38:58,214 INFO L158 Benchmark]: Toolchain (without parser) took 16837.99ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 59.7MB in the beginning and 44.4MB in the end (delta: 15.3MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. [2023-11-19 07:38:58,215 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 60.8MB. Free memory was 36.5MB in the beginning and 36.5MB in the end (delta: 49.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:38:58,215 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.06ms. Allocated memory is still 83.9MB. Free memory was 59.4MB in the beginning and 45.9MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-19 07:38:58,216 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.60ms. Allocated memory is still 83.9MB. Free memory was 45.7MB in the beginning and 43.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:38:58,216 INFO L158 Benchmark]: Boogie Preprocessor took 78.22ms. Allocated memory is still 83.9MB. Free memory was 43.4MB in the beginning and 41.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:38:58,216 INFO L158 Benchmark]: RCFGBuilder took 2909.06ms. Allocated memory is still 83.9MB. Free memory was 41.1MB in the beginning and 41.8MB in the end (delta: -632.0kB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2023-11-19 07:38:58,217 INFO L158 Benchmark]: TraceAbstraction took 13210.31ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 40.9MB in the beginning and 50.7MB in the end (delta: -9.8MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2023-11-19 07:38:58,217 INFO L158 Benchmark]: Witness Printer took 137.56ms. Allocated memory is still 100.7MB. Free memory was 50.7MB in the beginning and 44.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-19 07:38:58,220 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.26ms. Allocated memory is still 60.8MB. Free memory was 36.5MB in the beginning and 36.5MB in the end (delta: 49.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 409.06ms. Allocated memory is still 83.9MB. Free memory was 59.4MB in the beginning and 45.9MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.60ms. Allocated memory is still 83.9MB. Free memory was 45.7MB in the beginning and 43.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.22ms. Allocated memory is still 83.9MB. Free memory was 43.4MB in the beginning and 41.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 2909.06ms. Allocated memory is still 83.9MB. Free memory was 41.1MB in the beginning and 41.8MB in the end (delta: -632.0kB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * TraceAbstraction took 13210.31ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 40.9MB in the beginning and 50.7MB in the end (delta: -9.8MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. * Witness Printer took 137.56ms. Allocated memory is still 100.7MB. Free memory was 50.7MB in the beginning and 44.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_modf_double_~high~1#1 : bv32 :: ~res~0 == ~fp~64((~bvand~32(ULTIMATE.start_modf_double_~high~1#1, 2147483648bv32) ++ 0bv32)[63:63], (~bvand~32(ULTIMATE.start_modf_double_~high~1#1, 2147483648bv32) ++ 0bv32)[62:52], (~bvand~32(ULTIMATE.start_modf_double_~high~1#1, 2147483648bv32) ++ 0bv32)[51:0])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short25 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_modf_double_~high~1#1 : bv32 :: ~fp~64((~bvand~32(ULTIMATE.start_modf_double_~high~1#1, 2147483648bv32) ++ 0bv32)[63:63], (~bvand~32(ULTIMATE.start_modf_double_~high~1#1, 2147483648bv32) ++ 0bv32)[62:52], (~bvand~32(ULTIMATE.start_modf_double_~high~1#1, 2147483648bv32) ++ 0bv32)[51:0]) == #res) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_skolemized_q#valueAsBitvector_49 : bv64, v_arrayElimCell_4 : bv32, currentRoundingMode : FloatRoundingMode :: ~fp~64((~bvand~32(v_skolemized_q#valueAsBitvector_49[63:32], 2147483648bv32) ++ v_arrayElimCell_4)[63:63], (~bvand~32(v_skolemized_q#valueAsBitvector_49[63:32], 2147483648bv32) ++ v_arrayElimCell_4)[62:52], (~bvand~32(v_skolemized_q#valueAsBitvector_49[63:32], 2147483648bv32) ++ v_arrayElimCell_4)[51:0]) == ~x && ~fp.div~64(currentRoundingMode, ~fp.neg~64(~to_fp~64(currentRoundingMode, 1.0)), ~Pluszero~64()) == ~fp~64(v_skolemized_q#valueAsBitvector_49[63:63], v_skolemized_q#valueAsBitvector_49[62:52], v_skolemized_q#valueAsBitvector_49[51:0])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_skolemized_q#valueAsBitvector_49 : bv64, v_arrayElimCell_4 : bv32, currentRoundingMode : FloatRoundingMode :: ~fp~64((~bvand~32(v_skolemized_q#valueAsBitvector_49[63:32], 2147483648bv32) ++ v_arrayElimCell_4)[63:63], (~bvand~32(v_skolemized_q#valueAsBitvector_49[63:32], 2147483648bv32) ++ v_arrayElimCell_4)[62:52], (~bvand~32(v_skolemized_q#valueAsBitvector_49[63:32], 2147483648bv32) ++ v_arrayElimCell_4)[51:0]) == ~res~0 && ~fp.div~64(currentRoundingMode, ~fp.neg~64(~to_fp~64(currentRoundingMode, 1.0)), ~Pluszero~64()) == ~fp~64(v_skolemized_q#valueAsBitvector_49[63:63], v_skolemized_q#valueAsBitvector_49[62:52], v_skolemized_q#valueAsBitvector_49[51:0])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_skolemized_q#valueAsBitvector_49 : bv64, v_arrayElimCell_4 : bv32, currentRoundingMode : FloatRoundingMode :: ~fp~64((~bvand~32(v_skolemized_q#valueAsBitvector_49[63:32], 2147483648bv32) ++ v_arrayElimCell_4)[63:63], (~bvand~32(v_skolemized_q#valueAsBitvector_49[63:32], 2147483648bv32) ++ v_arrayElimCell_4)[62:52], (~bvand~32(v_skolemized_q#valueAsBitvector_49[63:32], 2147483648bv32) ++ v_arrayElimCell_4)[51:0]) == #res && ~fp.div~64(currentRoundingMode, ~fp.neg~64(~to_fp~64(currentRoundingMode, 1.0)), ~Pluszero~64()) == ~fp~64(v_skolemized_q#valueAsBitvector_49[63:63], v_skolemized_q#valueAsBitvector_49[62:52], v_skolemized_q#valueAsBitvector_49[51:0])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_skolemized_q#valueAsBitvector_32 : bv64, currentRoundingMode : FloatRoundingMode :: v_skolemized_q#valueAsBitvector_32[63:32] == ~i0~0 && ~fp.div~64(currentRoundingMode, ~fp.neg~64(~to_fp~64(currentRoundingMode, 1.0)), ~Pluszero~64()) == ~fp~64(v_skolemized_q#valueAsBitvector_32[63:63], v_skolemized_q#valueAsBitvector_32[62:52], v_skolemized_q#valueAsBitvector_32[51:0])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~x == ~fp.div~64(currentRoundingMode, ~fp.neg~64(~to_fp~64(currentRoundingMode, 1.0)), ~Pluszero~64())) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_skolemized_q#valueAsBitvector_32 : bv64, currentRoundingMode : FloatRoundingMode :: ~bvand~32(2047bv32, ~bvashr~32(v_skolemized_q#valueAsBitvector_32[63:32], 20bv32)) == ~bvadd~32(1023bv32, ~j0~0) && ~fp.div~64(currentRoundingMode, ~fp.neg~64(~to_fp~64(currentRoundingMode, 1.0)), ~Pluszero~64()) == ~fp~64(v_skolemized_q#valueAsBitvector_32[63:63], v_skolemized_q#valueAsBitvector_32[62:52], v_skolemized_q#valueAsBitvector_32[51:0])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~x == ~fp.div~64(currentRoundingMode, ~fp.neg~64(~to_fp~64(currentRoundingMode, 1.0)), ~Pluszero~64())) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_modf_double_~high~1#1 : bv32 :: ~res~0 == ~fp~64((~bvand~32(ULTIMATE.start_modf_double_~high~1#1, 2147483648bv32) ++ 0bv32)[63:63], (~bvand~32(ULTIMATE.start_modf_double_~high~1#1, 2147483648bv32) ++ 0bv32)[62:52], (~bvand~32(ULTIMATE.start_modf_double_~high~1#1, 2147483648bv32) ++ 0bv32)[51:0])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_modf_double_~high~1#1 : bv32 :: ~fp~64((~bvand~32(ULTIMATE.start_modf_double_~high~1#1, 2147483648bv32) ++ 0bv32)[63:63], (~bvand~32(ULTIMATE.start_modf_double_~high~1#1, 2147483648bv32) ++ 0bv32)[62:52], (~bvand~32(ULTIMATE.start_modf_double_~high~1#1, 2147483648bv32) ++ 0bv32)[51:0]) == #res) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_skolemized_q#valueAsBitvector_49 : bv64, v_arrayElimCell_4 : bv32, currentRoundingMode : FloatRoundingMode :: ~fp~64((~bvand~32(v_skolemized_q#valueAsBitvector_49[63:32], 2147483648bv32) ++ v_arrayElimCell_4)[63:63], (~bvand~32(v_skolemized_q#valueAsBitvector_49[63:32], 2147483648bv32) ++ v_arrayElimCell_4)[62:52], (~bvand~32(v_skolemized_q#valueAsBitvector_49[63:32], 2147483648bv32) ++ v_arrayElimCell_4)[51:0]) == ~res~0 && ~fp.div~64(currentRoundingMode, ~fp.neg~64(~to_fp~64(currentRoundingMode, 1.0)), ~Pluszero~64()) == ~fp~64(v_skolemized_q#valueAsBitvector_49[63:63], v_skolemized_q#valueAsBitvector_49[62:52], v_skolemized_q#valueAsBitvector_49[51:0])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_skolemized_q#valueAsBitvector_49 : bv64, v_arrayElimCell_4 : bv32, currentRoundingMode : FloatRoundingMode :: ~fp~64((~bvand~32(v_skolemized_q#valueAsBitvector_49[63:32], 2147483648bv32) ++ v_arrayElimCell_4)[63:63], (~bvand~32(v_skolemized_q#valueAsBitvector_49[63:32], 2147483648bv32) ++ v_arrayElimCell_4)[62:52], (~bvand~32(v_skolemized_q#valueAsBitvector_49[63:32], 2147483648bv32) ++ v_arrayElimCell_4)[51:0]) == #res && ~fp.div~64(currentRoundingMode, ~fp.neg~64(~to_fp~64(currentRoundingMode, 1.0)), ~Pluszero~64()) == ~fp~64(v_skolemized_q#valueAsBitvector_49[63:63], v_skolemized_q#valueAsBitvector_49[62:52], v_skolemized_q#valueAsBitvector_49[51:0])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_skolemized_q#valueAsBitvector_32 : bv64, currentRoundingMode : FloatRoundingMode :: v_skolemized_q#valueAsBitvector_32[63:32] == ~i0~0 && ~fp.div~64(currentRoundingMode, ~fp.neg~64(~to_fp~64(currentRoundingMode, 1.0)), ~Pluszero~64()) == ~fp~64(v_skolemized_q#valueAsBitvector_32[63:63], v_skolemized_q#valueAsBitvector_32[62:52], v_skolemized_q#valueAsBitvector_32[51:0])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~x == ~fp.div~64(currentRoundingMode, ~fp.neg~64(~to_fp~64(currentRoundingMode, 1.0)), ~Pluszero~64())) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_skolemized_q#valueAsBitvector_32 : bv64, currentRoundingMode : FloatRoundingMode :: ~bvand~32(2047bv32, ~bvashr~32(v_skolemized_q#valueAsBitvector_32[63:32], 20bv32)) == ~bvadd~32(1023bv32, ~j0~0) && ~fp.div~64(currentRoundingMode, ~fp.neg~64(~to_fp~64(currentRoundingMode, 1.0)), ~Pluszero~64()) == ~fp~64(v_skolemized_q#valueAsBitvector_32[63:63], v_skolemized_q#valueAsBitvector_32[62:52], v_skolemized_q#valueAsBitvector_32[51:0])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_modf_double_~#gh_u~1#1.base_10 : bv32, v_skolemized_q#valueAsBitvector_49 : bv64, currentRoundingMode : FloatRoundingMode :: (#memory_int[v_ULTIMATE.start_modf_double_~#gh_u~1#1.base_10][4bv32] == ~high~1 && #memory_int[v_ULTIMATE.start_modf_double_~#gh_u~1#1.base_10][4bv32] == v_skolemized_q#valueAsBitvector_49[63:32]) && ~fp.div~64(currentRoundingMode, ~fp.neg~64(~to_fp~64(currentRoundingMode, 1.0)), ~Pluszero~64()) == ~fp~64(v_skolemized_q#valueAsBitvector_49[63:63], v_skolemized_q#valueAsBitvector_49[62:52], v_skolemized_q#valueAsBitvector_49[51:0])) could not be translated * 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 - PositiveResult [Line: 152]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.1s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 81 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 81 mSDsluCounter, 357 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 214 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 143 IncrementalHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 143 mSDtfsCounter, 143 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=0, InterpolantAutomatonStates: 29, 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, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 17 NumberOfFragments, 463 HoareAnnotationTreeSize, 12 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 101 NumberOfCodeBlocks, 101 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 96 ConstructedInterpolants, 32 QuantifiedInterpolants, 959 SizeOfPredicates, 28 NumberOfNonLiveVariables, 495 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 130]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 71]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 88]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-11-19 07:38:58,266 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dbebfa5-6ba2-4ce7-8600-0410f016b5af/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE