./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 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_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4a308eb18926ee1b904bfd6b10e1895d29d262c0ba78b97b1e51aab5a345984c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:55:39,780 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:55:39,887 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 18:55:39,896 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:55:39,897 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:55:39,935 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:55:39,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:55:39,938 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:55:39,939 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:55:39,940 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:55:39,940 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:55:39,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:55:39,943 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:55:39,944 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:55:39,945 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:55:39,946 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:55:39,946 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:55:39,946 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:55:39,947 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:55:39,947 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:55:39,952 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:55:39,953 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:55:39,953 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:55:39,953 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:55:39,954 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:55:39,954 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:55:39,955 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:55:39,955 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:55:39,958 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:55:39,958 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:55:39,959 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:55:39,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:55:39,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:55:39,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:55:39,961 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:55:39,961 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:55:39,961 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 18:55:39,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 18:55:39,962 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:55:39,963 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:55:39,963 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:55:39,963 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:55:39,964 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_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4a308eb18926ee1b904bfd6b10e1895d29d262c0ba78b97b1e51aab5a345984c [2024-11-08 18:55:40,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:55:40,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:55:40,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:55:40,353 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:55:40,353 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:55:40,355 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i Unable to find full path for "g++" [2024-11-08 18:55:42,341 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:55:42,711 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:55:42,712 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i [2024-11-08 18:55:42,724 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/data/9d4fe0737/c509160957d849b5a2be648288302476/FLAGac4e5a7b1 [2024-11-08 18:55:42,952 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/data/9d4fe0737/c509160957d849b5a2be648288302476 [2024-11-08 18:55:42,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:55:42,957 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:55:42,958 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:55:42,959 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:55:42,966 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:55:42,967 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:55:42" (1/1) ... [2024-11-08 18:55:42,968 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ff94b3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:55:42, skipping insertion in model container [2024-11-08 18:55:42,968 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:55:42" (1/1) ... [2024-11-08 18:55:42,999 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:55:43,202 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i[915,928] [2024-11-08 18:55:43,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:55:43,270 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:55:43,284 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i[915,928] [2024-11-08 18:55:43,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:55:43,325 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:55:43,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:55:43 WrapperNode [2024-11-08 18:55:43,326 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:55:43,327 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:55:43,327 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:55:43,327 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:55:43,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:55:43" (1/1) ... [2024-11-08 18:55:43,340 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:55:43" (1/1) ... [2024-11-08 18:55:43,363 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 95 [2024-11-08 18:55:43,364 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:55:43,364 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:55:43,365 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:55:43,365 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:55:43,377 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:55:43" (1/1) ... [2024-11-08 18:55:43,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:55:43" (1/1) ... [2024-11-08 18:55:43,379 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:55:43" (1/1) ... [2024-11-08 18:55:43,392 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 18:55:43,393 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:55:43" (1/1) ... [2024-11-08 18:55:43,393 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:55:43" (1/1) ... [2024-11-08 18:55:43,399 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:55:43" (1/1) ... [2024-11-08 18:55:43,405 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:55:43" (1/1) ... [2024-11-08 18:55:43,407 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:55:43" (1/1) ... [2024-11-08 18:55:43,408 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:55:43" (1/1) ... [2024-11-08 18:55:43,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:55:43,411 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:55:43,411 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:55:43,412 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:55:43,413 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:55:43" (1/1) ... [2024-11-08 18:55:43,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:55:43,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:55:43,458 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:55:43,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:55:43,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:55:43,497 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 18:55:43,497 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 18:55:43,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 18:55:43,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:55:43,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:55:43,597 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:55:43,602 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:55:43,916 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 18:55:43,917 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:55:43,929 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:55:43,929 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:55:43,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:55:43 BoogieIcfgContainer [2024-11-08 18:55:43,930 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:55:43,932 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:55:43,933 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:55:43,936 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:55:43,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:55:42" (1/3) ... [2024-11-08 18:55:43,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41502631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:55:43, skipping insertion in model container [2024-11-08 18:55:43,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:55:43" (2/3) ... [2024-11-08 18:55:43,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41502631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:55:43, skipping insertion in model container [2024-11-08 18:55:43,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:55:43" (3/3) ... [2024-11-08 18:55:43,939 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-46.i [2024-11-08 18:55:43,953 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:55:43,954 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:55:44,019 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:55:44,025 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e465064, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:55:44,025 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:55:44,029 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 18:55:44,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 18:55:44,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:55:44,048 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:55:44,049 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:55:44,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:55:44,056 INFO L85 PathProgramCache]: Analyzing trace with hash -300635202, now seen corresponding path program 1 times [2024-11-08 18:55:44,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:55:44,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372148667] [2024-11-08 18:55:44,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:55:44,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:55:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:44,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:55:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:44,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:55:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:44,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 18:55:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:44,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 18:55:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:44,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 18:55:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:44,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 18:55:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:44,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 18:55:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:44,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:55:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:44,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 18:55:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:44,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 18:55:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:44,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 18:55:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:44,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 18:55:44,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:44,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:55:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:44,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 18:55:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:44,479 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 18:55:44,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:55:44,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372148667] [2024-11-08 18:55:44,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372148667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:55:44,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:55:44,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:55:44,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533015164] [2024-11-08 18:55:44,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:55:44,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 18:55:44,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:55:44,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 18:55:44,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:55:44,528 INFO L87 Difference]: Start difference. First operand has 45 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-08 18:55:44,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:55:44,563 INFO L93 Difference]: Finished difference Result 83 states and 134 transitions. [2024-11-08 18:55:44,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 18:55:44,565 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 90 [2024-11-08 18:55:44,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:55:44,574 INFO L225 Difference]: With dead ends: 83 [2024-11-08 18:55:44,575 INFO L226 Difference]: Without dead ends: 41 [2024-11-08 18:55:44,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:55:44,581 INFO L432 NwaCegarLoop]: 56 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, 56 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:55:44,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:55:44,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-08 18:55:44,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-08 18:55:44,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 18:55:44,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 56 transitions. [2024-11-08 18:55:44,628 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 56 transitions. Word has length 90 [2024-11-08 18:55:44,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:55:44,629 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 56 transitions. [2024-11-08 18:55:44,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-08 18:55:44,629 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 56 transitions. [2024-11-08 18:55:44,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 18:55:44,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:55:44,633 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:55:44,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 18:55:44,633 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:55:44,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:55:44,634 INFO L85 PathProgramCache]: Analyzing trace with hash 358132342, now seen corresponding path program 1 times [2024-11-08 18:55:44,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:55:44,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228903494] [2024-11-08 18:55:44,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:55:44,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:55:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:55:44,781 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:55:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:55:44,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:55:44,931 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 18:55:44,933 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 18:55:44,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 18:55:44,940 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-08 18:55:45,023 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 18:55:45,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:55:45 BoogieIcfgContainer [2024-11-08 18:55:45,027 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 18:55:45,029 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 18:55:45,030 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 18:55:45,030 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 18:55:45,030 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:55:43" (3/4) ... [2024-11-08 18:55:45,034 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 18:55:45,036 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 18:55:45,037 INFO L158 Benchmark]: Toolchain (without parser) took 2080.22ms. Allocated memory is still 148.9MB. Free memory was 116.2MB in the beginning and 83.7MB in the end (delta: 32.6MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2024-11-08 18:55:45,038 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 111.1MB. Free memory is still 60.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:55:45,039 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.93ms. Allocated memory is still 148.9MB. Free memory was 116.1MB in the beginning and 102.5MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 18:55:45,040 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.00ms. Allocated memory is still 148.9MB. Free memory was 102.5MB in the beginning and 100.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 18:55:45,040 INFO L158 Benchmark]: Boogie Preprocessor took 46.07ms. Allocated memory is still 148.9MB. Free memory was 100.4MB in the beginning and 98.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 18:55:45,041 INFO L158 Benchmark]: RCFGBuilder took 518.87ms. Allocated memory is still 148.9MB. Free memory was 98.3MB in the beginning and 85.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 18:55:45,046 INFO L158 Benchmark]: TraceAbstraction took 1094.95ms. Allocated memory is still 148.9MB. Free memory was 84.7MB in the beginning and 84.3MB in the end (delta: 378.7kB). Peak memory consumption was 941.9kB. Max. memory is 16.1GB. [2024-11-08 18:55:45,047 INFO L158 Benchmark]: Witness Printer took 6.93ms. Allocated memory is still 148.9MB. Free memory was 84.3MB in the beginning and 83.7MB in the end (delta: 649.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:55:45,053 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 111.1MB. Free memory is still 60.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 367.93ms. Allocated memory is still 148.9MB. Free memory was 116.1MB in the beginning and 102.5MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.00ms. Allocated memory is still 148.9MB. Free memory was 102.5MB in the beginning and 100.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.07ms. Allocated memory is still 148.9MB. Free memory was 100.4MB in the beginning and 98.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 518.87ms. Allocated memory is still 148.9MB. Free memory was 98.3MB in the beginning and 85.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1094.95ms. Allocated memory is still 148.9MB. Free memory was 84.7MB in the beginning and 84.3MB in the end (delta: 378.7kB). Peak memory consumption was 941.9kB. Max. memory is 16.1GB. * Witness Printer took 6.93ms. Allocated memory is still 148.9MB. Free memory was 84.3MB in the beginning and 83.7MB in the end (delta: 649.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someUnaryDOUBLEoperation at line 31. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 255.3; [L23] unsigned char var_1_2 = 0; [L24] double var_1_3 = 1000000000000.5; [L25] double var_1_4 = 999999999.125; [L26] signed long int var_1_5 = 0; [L27] signed long int var_1_6 = 100; [L28] signed long int var_1_7 = 256; [L29] signed long int var_1_8 = -5; [L30] double var_1_9 = 24.2; [L31] double var_1_10 = -0.125; [L32] double var_1_11 = -0.5; VAL [isInitial=0, var_1_1=2553/10, var_1_2=0, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L78] isInitial = 1 [L79] FCALL initially() [L80] COND TRUE 1 [L81] FCALL updateLastVariables() [L82] CALL updateVariables() [L47] var_1_2 = __VERIFIER_nondet_uchar() [L48] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L48] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_1=2553/10, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L49] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L49] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L50] var_1_3 = __VERIFIER_nondet_double() [L51] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L51] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L52] var_1_4 = __VERIFIER_nondet_double() [L53] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L53] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L54] var_1_5 = __VERIFIER_nondet_long() [L55] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L55] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L56] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L56] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L57] var_1_6 = __VERIFIER_nondet_long() [L58] CALL assume_abort_if_not(var_1_6 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L58] RET assume_abort_if_not(var_1_6 >= -2147483648) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L59] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L59] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L60] var_1_7 = __VERIFIER_nondet_long() [L61] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=-5, var_1_9=121/5] [L61] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=-5, var_1_9=121/5] [L62] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=-5, var_1_9=121/5] [L62] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=-5, var_1_9=121/5] [L63] var_1_8 = __VERIFIER_nondet_long() [L64] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5, var_1_9=121/5] [L64] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5, var_1_9=121/5] [L65] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5, var_1_9=121/5] [L65] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5, var_1_9=121/5] [L66] var_1_9 = __VERIFIER_nondet_double() [L67] CALL assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L67] RET assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L68] var_1_10 = __VERIFIER_nondet_double() [L69] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L69] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L82] RET updateVariables() [L83] CALL step() [L36] signed long int stepLocal_0 = (((((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) > (var_1_7)) ? (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) : (var_1_7)); VAL [isInitial=1, stepLocal_0=4, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L37] COND TRUE \read(var_1_2) [L38] var_1_1 = ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))) VAL [isInitial=1, stepLocal_0=4, var_1_1=1000000000005, var_1_2=1, var_1_3=1000000000005, var_1_4=1000000000005, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L44] var_1_11 = var_1_3 VAL [isInitial=1, stepLocal_0=4, var_1_11=1000000000005, var_1_1=1000000000005, var_1_2=1, var_1_3=1000000000005, var_1_4=1000000000005, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L83] RET step() [L84] CALL, EXPR property() [L74-L75] return (var_1_2 ? (var_1_1 == ((double) ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))))) : ((((((((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) > (var_1_7)) ? (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) : (var_1_7))) < var_1_8) ? (var_1_1 == ((double) (var_1_9 + var_1_10))) : 1)) && (var_1_11 == ((double) var_1_3)) ; VAL [\result=0, isInitial=1, var_1_11=1000000000005, var_1_1=1000000000005, var_1_2=1, var_1_3=1000000000005, var_1_4=1000000000005, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L84] RET, EXPR property() [L84] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=1000000000005, var_1_1=1000000000005, var_1_2=1, var_1_3=1000000000005, var_1_4=1000000000005, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L19] reach_error() VAL [isInitial=1, var_1_11=1000000000005, var_1_1=1000000000005, var_1_2=1, var_1_3=1000000000005, var_1_4=1000000000005, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 56 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 89 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 364/364 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 18:55:45,093 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4a308eb18926ee1b904bfd6b10e1895d29d262c0ba78b97b1e51aab5a345984c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:55:47,566 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:55:47,666 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 18:55:47,675 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:55:47,677 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:55:47,717 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:55:47,718 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:55:47,718 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:55:47,720 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:55:47,722 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:55:47,723 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:55:47,723 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:55:47,723 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:55:47,724 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:55:47,724 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:55:47,726 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:55:47,727 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:55:47,727 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:55:47,728 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:55:47,728 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:55:47,728 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:55:47,732 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:55:47,732 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:55:47,732 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 18:55:47,732 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 18:55:47,732 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:55:47,733 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 18:55:47,733 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:55:47,733 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:55:47,733 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:55:47,734 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:55:47,734 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:55:47,734 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:55:47,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:55:47,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:55:47,735 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:55:47,735 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:55:47,735 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:55:47,736 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 18:55:47,736 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 18:55:47,736 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:55:47,738 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:55:47,738 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:55:47,738 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:55:47,738 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_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4a308eb18926ee1b904bfd6b10e1895d29d262c0ba78b97b1e51aab5a345984c [2024-11-08 18:55:48,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:55:48,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:55:48,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:55:48,168 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:55:48,169 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:55:48,170 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i Unable to find full path for "g++" [2024-11-08 18:55:50,254 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:55:50,524 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:55:50,525 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i [2024-11-08 18:55:50,537 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/data/e862daa2f/ceedb7135e94402c913cfdb2d2651ec4/FLAG873e41338 [2024-11-08 18:55:50,846 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/data/e862daa2f/ceedb7135e94402c913cfdb2d2651ec4 [2024-11-08 18:55:50,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:55:50,849 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:55:50,851 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:55:50,851 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:55:50,859 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:55:50,859 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:55:50" (1/1) ... [2024-11-08 18:55:50,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25833c5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:55:50, skipping insertion in model container [2024-11-08 18:55:50,861 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:55:50" (1/1) ... [2024-11-08 18:55:50,896 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:55:51,135 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i[915,928] [2024-11-08 18:55:51,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:55:51,219 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:55:51,236 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i[915,928] [2024-11-08 18:55:51,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:55:51,319 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:55:51,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:55:51 WrapperNode [2024-11-08 18:55:51,324 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:55:51,325 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:55:51,325 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:55:51,326 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:55:51,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:55:51" (1/1) ... [2024-11-08 18:55:51,371 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:55:51" (1/1) ... [2024-11-08 18:55:51,405 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2024-11-08 18:55:51,405 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:55:51,406 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:55:51,407 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:55:51,407 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:55:51,419 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:55:51" (1/1) ... [2024-11-08 18:55:51,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:55:51" (1/1) ... [2024-11-08 18:55:51,423 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:55:51" (1/1) ... [2024-11-08 18:55:51,452 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 18:55:51,454 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:55:51" (1/1) ... [2024-11-08 18:55:51,455 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:55:51" (1/1) ... [2024-11-08 18:55:51,467 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:55:51" (1/1) ... [2024-11-08 18:55:51,470 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:55:51" (1/1) ... [2024-11-08 18:55:51,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:55:51" (1/1) ... [2024-11-08 18:55:51,477 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:55:51" (1/1) ... [2024-11-08 18:55:51,488 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:55:51,489 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:55:51,490 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:55:51,490 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:55:51,491 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:55:51" (1/1) ... [2024-11-08 18:55:51,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:55:51,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:55:51,529 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:55:51,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:55:51,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:55:51,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 18:55:51,567 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 18:55:51,567 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 18:55:51,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:55:51,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:55:51,658 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:55:51,661 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:55:52,211 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 18:55:52,211 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:55:52,234 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:55:52,235 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:55:52,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:55:52 BoogieIcfgContainer [2024-11-08 18:55:52,236 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:55:52,241 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:55:52,241 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:55:52,245 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:55:52,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:55:50" (1/3) ... [2024-11-08 18:55:52,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1166da46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:55:52, skipping insertion in model container [2024-11-08 18:55:52,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:55:51" (2/3) ... [2024-11-08 18:55:52,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1166da46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:55:52, skipping insertion in model container [2024-11-08 18:55:52,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:55:52" (3/3) ... [2024-11-08 18:55:52,252 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-46.i [2024-11-08 18:55:52,274 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:55:52,274 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:55:52,342 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:55:52,351 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@78ae2a18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:55:52,353 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:55:52,358 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 18:55:52,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 18:55:52,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:55:52,371 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:55:52,372 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:55:52,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:55:52,378 INFO L85 PathProgramCache]: Analyzing trace with hash -300635202, now seen corresponding path program 1 times [2024-11-08 18:55:52,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:55:52,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1941585582] [2024-11-08 18:55:52,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:55:52,394 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:55:52,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:55:52,398 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 18:55:52,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 18:55:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:52,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 18:55:52,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:55:52,807 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-11-08 18:55:52,807 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:55:52,808 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:55:52,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1941585582] [2024-11-08 18:55:52,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1941585582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:55:52,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:55:52,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:55:52,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627790898] [2024-11-08 18:55:52,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:55:52,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 18:55:52,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:55:52,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 18:55:52,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:55:52,843 INFO L87 Difference]: Start difference. First operand has 45 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-08 18:55:52,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:55:52,871 INFO L93 Difference]: Finished difference Result 83 states and 134 transitions. [2024-11-08 18:55:52,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 18:55:52,874 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 90 [2024-11-08 18:55:52,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:55:52,882 INFO L225 Difference]: With dead ends: 83 [2024-11-08 18:55:52,882 INFO L226 Difference]: Without dead ends: 41 [2024-11-08 18:55:52,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:55:52,891 INFO L432 NwaCegarLoop]: 56 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, 56 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:55:52,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:55:52,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-08 18:55:52,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-08 18:55:52,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 18:55:52,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 56 transitions. [2024-11-08 18:55:52,938 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 56 transitions. Word has length 90 [2024-11-08 18:55:52,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:55:52,938 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 56 transitions. [2024-11-08 18:55:52,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-08 18:55:52,939 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 56 transitions. [2024-11-08 18:55:52,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 18:55:52,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:55:52,943 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:55:52,950 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 18:55:53,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:55:53,144 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:55:53,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:55:53,145 INFO L85 PathProgramCache]: Analyzing trace with hash 358132342, now seen corresponding path program 1 times [2024-11-08 18:55:53,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:55:53,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1124247783] [2024-11-08 18:55:53,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:55:53,146 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:55:53,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:55:53,151 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 18:55:53,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 18:55:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:53,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 18:55:53,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:56:19,170 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 118 proven. 60 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-11-08 18:56:19,171 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:57:11,691 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:57:11,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1124247783] [2024-11-08 18:57:11,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1124247783] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:57:11,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622301205] [2024-11-08 18:57:11,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:11,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:57:11,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:57:11,698 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:57:11,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 18:57:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:11,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 18:57:11,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:58:17,495 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 127 proven. 78 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2024-11-08 18:58:17,495 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:58:38,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622301205] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:58:38,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:58:38,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 23 [2024-11-08 18:58:38,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000393580] [2024-11-08 18:58:38,532 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:58:38,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-08 18:58:38,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:58:38,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-08 18:58:38,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=630, Unknown=2, NotChecked=0, Total=756 [2024-11-08 18:58:38,536 INFO L87 Difference]: Start difference. First operand 41 states and 56 transitions. Second operand has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 6 states have call successors, (28), 6 states have call predecessors, (28), 9 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) [2024-11-08 18:58:47,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:58:47,630 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2024-11-08 18:58:47,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 18:58:47,631 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 6 states have call successors, (28), 6 states have call predecessors, (28), 9 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) Word has length 90 [2024-11-08 18:58:47,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:58:47,633 INFO L225 Difference]: With dead ends: 60 [2024-11-08 18:58:47,634 INFO L226 Difference]: Without dead ends: 58 [2024-11-08 18:58:47,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 104.3s TimeCoverageRelationStatistics Valid=202, Invalid=852, Unknown=2, NotChecked=0, Total=1056 [2024-11-08 18:58:47,636 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 38 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:58:47,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 270 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-08 18:58:47,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-08 18:58:47,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2024-11-08 18:58:47,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 18:58:47,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2024-11-08 18:58:47,651 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 90 [2024-11-08 18:58:47,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:58:47,653 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2024-11-08 18:58:47,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 6 states have call successors, (28), 6 states have call predecessors, (28), 9 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) [2024-11-08 18:58:47,654 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2024-11-08 18:58:47,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-08 18:58:47,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:58:47,656 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:58:47,662 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 18:58:47,873 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 18:58:48,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:58:48,057 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:58:48,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:58:48,057 INFO L85 PathProgramCache]: Analyzing trace with hash -66959736, now seen corresponding path program 1 times [2024-11-08 18:58:48,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:58:48,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [429474106] [2024-11-08 18:58:48,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:58:48,061 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:58:48,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:58:48,065 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 18:58:48,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 18:58:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:48,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 18:58:48,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:00:00,718 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 105 proven. 33 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-11-08 19:00:00,718 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:00:46,655 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse19 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (fp.eq ~var_1_1~0 ~var_1_4~0) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse6 (= (_ bv0 8) c_~var_1_2~0)) (.cse1 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) (.cse16 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (fp.gt c_~var_1_3~0 ~var_1_4~0))) (.cse7 (fp.eq c_~var_1_11~0 c_~var_1_3~0))) (let ((.cse11 (bvslt c_~var_1_5~0 c_~var_1_6~0)) (.cse14 (bvslt c_~var_1_5~0 c_~var_1_8~0)) (.cse15 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))))) (.cse17 (or .cse1 .cse16 .cse7)) (.cse3 (not .cse6)) (.cse4 (not (bvslt c_~var_1_7~0 c_~var_1_8~0))) (.cse18 (or .cse19 .cse6)) (.cse9 (bvslt c_~var_1_6~0 c_~var_1_8~0))) (let ((.cse5 (not .cse9)) (.cse10 (and .cse17 (or .cse3 (and (or .cse19 .cse4) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (not (fp.eq ~var_1_1~0 ~var_1_4~0)) (fp.gt c_~var_1_3~0 ~var_1_4~0))) .cse4))) .cse18)) (.cse8 (and .cse17 .cse18)) (.cse0 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (not (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse12 (and (or .cse15 .cse16 .cse7) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 ~var_1_4~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))) (fp.gt c_~var_1_3~0 ~var_1_4~0))) .cse6))) (.cse2 (not .cse14)) (.cse13 (not .cse11))) (and (or .cse0 (and (or .cse1 .cse2 .cse3 .cse4) (or .cse1 .cse5 .cse3 .cse4) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) .cse6) (or .cse1 .cse7))) (or (and (or .cse8 .cse9) (or .cse5 .cse10)) .cse11) (or (and (or .cse12 .cse5) (or .cse12 .cse9)) .cse11) (or .cse13 (and (or .cse2 .cse10) (or .cse14 .cse8))) (or .cse0 (and (or .cse15 .cse7) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))))) .cse6))) (or (and (or .cse12 .cse14) (or .cse12 .cse2)) .cse13))))) is different from true [2024-11-08 19:01:12,757 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse17 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (fp.eq ~var_1_1~0 ~var_1_4~0) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse13 (= (_ bv0 8) c_~var_1_2~0)) (.cse10 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) (.cse18 (fp.eq c_~var_1_3~0 c_~var_1_3~0))) (let ((.cse14 (or .cse10 .cse18)) (.cse11 (not .cse13)) (.cse12 (not (bvslt c_~var_1_7~0 c_~var_1_8~0))) (.cse16 (or .cse17 .cse13)) (.cse2 (bvslt c_~var_1_6~0 c_~var_1_8~0)) (.cse6 (bvslt c_~var_1_5~0 c_~var_1_8~0)) (.cse0 (bvslt c_~var_1_5~0 c_~var_1_6~0)) (.cse15 (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) .cse18))) (let ((.cse1 (and .cse15 (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 ~var_1_4~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))) (fp.gt c_~var_1_3~0 ~var_1_4~0))) .cse13))) (.cse4 (not .cse0)) (.cse5 (not .cse6)) (.cse9 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (not (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse3 (not .cse2)) (.cse8 (and .cse14 (or .cse11 (and (or .cse17 .cse12) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (not (fp.eq ~var_1_1~0 ~var_1_4~0)) (fp.gt c_~var_1_3~0 ~var_1_4~0))) .cse12))) .cse16)) (.cse7 (and .cse14 .cse16))) (and (or .cse0 (and (or .cse1 .cse2) (or .cse3 .cse1))) (or .cse4 (and (or .cse5 .cse1) (or .cse6 .cse1))) (or .cse4 (and (or .cse6 .cse7) (or .cse5 .cse8))) (or .cse9 (and (or .cse10 .cse5 .cse11 .cse12) (or .cse10 .cse3 .cse11 .cse12) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) .cse13) .cse14)) (or .cse9 (and .cse15 (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))))) .cse13))) (or .cse0 (and (or .cse3 .cse8) (or .cse7 .cse2))))))) is different from true [2024-11-08 19:01:35,238 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse13 (fp.eq c_~var_1_3~0 c_~var_1_3~0))) (let ((.cse1 (bvslt c_~var_1_5~0 c_~var_1_6~0)) (.cse11 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (fp.eq ~var_1_1~0 ~var_1_4~0) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse4 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) (.cse15 (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) .cse13)) (.cse7 (= (_ bv0 8) c_~var_1_2~0))) (let ((.cse0 (and .cse15 (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 ~var_1_4~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))) (fp.gt c_~var_1_3~0 ~var_1_4~0))) .cse7))) (.cse8 (bvsle |c_ULTIMATE.start_step_~stepLocal_0~0#1| c_~var_1_6~0)) (.cse12 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (not (fp.eq ~var_1_1~0 ~var_1_4~0)) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse5 (bvsle |c_ULTIMATE.start_step_~stepLocal_0~0#1| c_~var_1_7~0)) (.cse6 (not .cse7)) (.cse9 (or .cse4 .cse13)) (.cse3 (bvsle |c_ULTIMATE.start_step_~stepLocal_0~0#1| c_~var_1_5~0)) (.cse14 (or .cse11 .cse7)) (.cse10 (not .cse1)) (.cse2 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (not (fp.gt c_~var_1_3~0 ~var_1_4~0))))) (and (or .cse0 .cse1) (or .cse2 (and (or .cse3 .cse4 .cse5 .cse6) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) .cse7) (or .cse4 .cse5 .cse8 .cse6) .cse9)) (or .cse10 .cse0) (or (and (or (and (or .cse11 .cse5 .cse8) (or .cse12 .cse5 .cse8)) .cse6) (or .cse4 .cse13 .cse8) (or .cse11 .cse8 .cse7) .cse9 .cse14) .cse1) (or (and (or (and (or .cse3 .cse11 .cse5) (or .cse12 .cse3 .cse5)) .cse6) (or .cse3 .cse11 .cse7) .cse9 (or .cse3 .cse4 .cse13) .cse14) .cse10) (or .cse2 (and .cse15 (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))))) .cse7))))))) is different from true [2024-11-08 19:02:52,511 WARN L286 SmtUtils]: Spent 29.98s on a formula simplification. DAG size of input: 48 DAG size of output: 48 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 19:03:23,868 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 19:03:23,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [429474106] [2024-11-08 19:03:23,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [429474106] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:03:23,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534257280] [2024-11-08 19:03:23,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:03:23,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:03:23,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:03:23,872 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:03:23,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 19:03:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:03:24,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 19:03:24,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:06:13,409 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 114 proven. 54 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-11-08 19:06:13,409 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:06:55,006 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse15 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (fp.eq ~var_1_1~0 ~var_1_4~0) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse4 (not (bvslt c_~var_1_7~0 c_~var_1_8~0))) (.cse6 (= (_ bv0 8) c_~var_1_2~0)) (.cse10 (bvslt c_~var_1_5~0 c_~var_1_8~0)) (.cse1 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) (.cse12 (bvslt c_~var_1_5~0 c_~var_1_6~0)) (.cse13 (bvslt c_~var_1_6~0 c_~var_1_8~0)) (.cse14 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))))) (.cse18 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (fp.gt c_~var_1_3~0 ~var_1_4~0))) (.cse7 (fp.eq c_~var_1_11~0 c_~var_1_3~0))) (let ((.cse9 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 ~var_1_4~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse11 (or .cse14 .cse18 .cse7)) (.cse0 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (not (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse5 (not .cse13)) (.cse8 (not .cse12)) (.cse16 (or .cse1 .cse18 .cse7)) (.cse2 (not .cse10)) (.cse3 (not .cse6)) (.cse17 (and (or .cse15 .cse4) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (not (fp.eq ~var_1_1~0 ~var_1_4~0)) (fp.gt c_~var_1_3~0 ~var_1_4~0))) .cse4)))) (and (or .cse0 (and (or .cse1 .cse2 .cse3 .cse4) (or .cse1 .cse5 .cse3 .cse4) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) .cse6) (or .cse1 .cse7))) (or .cse8 (and (or (and (or .cse2 .cse9) (or .cse10 .cse9)) .cse6) .cse11)) (or .cse12 (and (or (and (or .cse5 .cse9) (or .cse9 .cse13)) .cse6) .cse11)) (or .cse0 (and (or .cse14 .cse7) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))))) .cse6))) (or .cse12 (and (or (and (or .cse15 .cse13) (or .cse5 .cse15)) .cse6) .cse16 (or .cse5 .cse3 .cse17))) (or .cse8 (and .cse16 (or (and (or .cse10 .cse15) (or .cse2 .cse15)) .cse6) (or .cse2 .cse3 .cse17)))))) is different from true [2024-11-08 19:07:17,083 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse14 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) (.cse16 (fp.eq c_~var_1_3~0 c_~var_1_3~0)) (.cse4 (= (_ bv0 8) c_~var_1_2~0)) (.cse11 (bvslt c_~var_1_6~0 c_~var_1_8~0)) (.cse3 (bvslt c_~var_1_5~0 c_~var_1_8~0)) (.cse6 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (fp.eq ~var_1_1~0 ~var_1_4~0) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse15 (not (bvslt c_~var_1_7~0 c_~var_1_8~0))) (.cse12 (bvslt c_~var_1_5~0 c_~var_1_6~0))) (let ((.cse0 (not .cse12)) (.cse2 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 ~var_1_4~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse8 (and (or .cse6 .cse15) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (not (fp.eq ~var_1_1~0 ~var_1_4~0)) (fp.gt c_~var_1_3~0 ~var_1_4~0))) .cse15))) (.cse1 (not .cse3)) (.cse10 (not .cse11)) (.cse7 (not .cse4)) (.cse9 (or .cse14 .cse16)) (.cse13 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (not (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse5 (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) .cse16))) (and (or .cse0 (and (or (and (or .cse1 .cse2) (or .cse3 .cse2)) .cse4) .cse5)) (or .cse0 (and (or (and (or .cse3 .cse6) (or .cse1 .cse6)) .cse4) (or .cse1 .cse7 .cse8) .cse9)) (or (and (or (and (or .cse10 .cse2) (or .cse2 .cse11)) .cse4) .cse5) .cse12) (or .cse12 (and (or (and (or .cse6 .cse11) (or .cse10 .cse6)) .cse4) (or .cse10 .cse7 .cse8) .cse9)) (or .cse13 (and (or .cse14 .cse1 .cse7 .cse15) (or .cse14 .cse10 .cse7 .cse15) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) .cse4) .cse9)) (or .cse13 (and .cse5 (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))))) .cse4)))))) is different from true [2024-11-08 19:07:37,895 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse15 (fp.eq c_~var_1_3~0 c_~var_1_3~0))) (let ((.cse11 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (fp.eq ~var_1_1~0 ~var_1_4~0) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse4 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) (.cse1 (bvslt c_~var_1_5~0 c_~var_1_6~0)) (.cse14 (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) .cse15)) (.cse7 (= (_ bv0 8) c_~var_1_2~0))) (let ((.cse0 (and .cse14 (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 ~var_1_4~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))) (fp.gt c_~var_1_3~0 ~var_1_4~0))) .cse7))) (.cse8 (bvsle |c_ULTIMATE.start_step_~stepLocal_0~0#1| c_~var_1_6~0)) (.cse10 (not .cse1)) (.cse12 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (not (fp.eq ~var_1_1~0 ~var_1_4~0)) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse3 (bvsle |c_ULTIMATE.start_step_~stepLocal_0~0#1| c_~var_1_5~0)) (.cse5 (bvsle |c_ULTIMATE.start_step_~stepLocal_0~0#1| c_~var_1_7~0)) (.cse6 (not .cse7)) (.cse9 (or .cse4 .cse15)) (.cse13 (or .cse11 .cse7)) (.cse2 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (not (fp.gt c_~var_1_3~0 ~var_1_4~0))))) (and (or .cse0 .cse1) (or .cse2 (and (or .cse3 .cse4 .cse5 .cse6) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) .cse7) (or .cse4 .cse5 .cse8 .cse6) .cse9)) (or .cse10 .cse0) (or .cse1 (and (or (and (or .cse11 .cse5 .cse8) (or .cse12 .cse5 .cse8)) .cse6) .cse9 .cse13)) (or .cse10 (and (or (and (or .cse3 .cse11 .cse5) (or .cse12 .cse3 .cse5)) .cse6) .cse9 .cse13)) (or .cse2 (and .cse14 (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))))) .cse7))))))) is different from true [2024-11-08 19:08:55,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534257280] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:08:55,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 19:08:55,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 21 [2024-11-08 19:08:55,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204290898] [2024-11-08 19:08:55,031 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 19:08:55,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 19:08:55,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 19:08:55,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 19:08:55,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=500, Unknown=10, NotChecked=306, Total=930 [2024-11-08 19:08:55,033 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 4 states have call successors, (28), 4 states have call predecessors, (28), 7 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2024-11-08 19:09:14,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:09:14,059 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2024-11-08 19:09:14,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 19:09:14,061 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 4 states have call successors, (28), 4 states have call predecessors, (28), 7 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) Word has length 91 [2024-11-08 19:09:14,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:09:14,063 INFO L225 Difference]: With dead ends: 66 [2024-11-08 19:09:14,063 INFO L226 Difference]: Without dead ends: 64 [2024-11-08 19:09:14,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 168 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 221.8s TimeCoverageRelationStatistics Valid=170, Invalid=713, Unknown=11, NotChecked=366, Total=1260 [2024-11-08 19:09:14,065 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 40 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:09:14,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 276 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-08 19:09:14,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-08 19:09:14,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2024-11-08 19:09:14,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 19:09:14,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2024-11-08 19:09:14,076 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 91 [2024-11-08 19:09:14,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:09:14,077 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2024-11-08 19:09:14,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 4 states have call successors, (28), 4 states have call predecessors, (28), 7 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2024-11-08 19:09:14,078 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2024-11-08 19:09:14,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-08 19:09:14,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:09:14,079 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:09:14,097 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 19:09:14,287 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-08 19:09:14,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:09:14,481 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:09:14,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:09:14,481 INFO L85 PathProgramCache]: Analyzing trace with hash -124218038, now seen corresponding path program 1 times [2024-11-08 19:09:14,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 19:09:14,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1721603397] [2024-11-08 19:09:14,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:09:14,483 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:09:14,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 19:09:14,486 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:09:14,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b3cb217-b2e0-44ba-beb6-79d107bcc21e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-08 19:09:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:09:14,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-08 19:09:14,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:09:52,270 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 178 proven. 27 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2024-11-08 19:09:52,270 INFO L311 TraceCheckSpWp]: Computing backward predicates...