./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-26.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-26.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 08ef4c3a1699c030822612f64a82179d2ef28481e12c6ce62efbc901639eabc5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:05:07,439 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:05:07,503 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 06:05:07,509 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:05:07,510 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:05:07,537 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:05:07,537 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:05:07,538 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:05:07,538 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:05:07,539 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:05:07,540 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:05:07,540 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:05:07,541 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:05:07,541 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:05:07,542 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:05:07,543 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:05:07,543 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 06:05:07,544 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:05:07,544 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:05:07,545 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:05:07,545 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:05:07,548 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 06:05:07,549 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:05:07,549 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 06:05:07,550 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:05:07,550 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 06:05:07,551 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:05:07,551 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:05:07,552 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:05:07,552 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:05:07,552 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:05:07,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:05:07,553 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:05:07,553 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:05:07,554 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 06:05:07,554 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 06:05:07,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 06:05:07,554 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:05:07,554 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:05:07,555 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 06:05:07,555 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:05:07,555 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:05:07,555 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_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 08ef4c3a1699c030822612f64a82179d2ef28481e12c6ce62efbc901639eabc5 [2023-11-29 06:05:07,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:05:07,772 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:05:07,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:05:07,776 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:05:07,776 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:05:07,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-26.i [2023-11-29 06:05:10,504 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:05:10,672 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:05:10,672 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-26.i [2023-11-29 06:05:10,679 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/data/603fb1e8d/75264007ade84cab885cb411add0d5ec/FLAG62ffa44f6 [2023-11-29 06:05:10,690 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/data/603fb1e8d/75264007ade84cab885cb411add0d5ec [2023-11-29 06:05:10,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:05:10,693 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:05:10,694 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:05:10,694 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:05:10,697 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:05:10,698 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:05:10" (1/1) ... [2023-11-29 06:05:10,699 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b59dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:10, skipping insertion in model container [2023-11-29 06:05:10,699 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:05:10" (1/1) ... [2023-11-29 06:05:10,725 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:05:10,864 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-26.i[915,928] [2023-11-29 06:05:10,893 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:05:10,906 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:05:10,919 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-26.i[915,928] [2023-11-29 06:05:10,933 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:05:10,949 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:05:10,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:10 WrapperNode [2023-11-29 06:05:10,949 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:05:10,950 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:05:10,950 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:05:10,950 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:05:10,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:10" (1/1) ... [2023-11-29 06:05:10,966 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:10" (1/1) ... [2023-11-29 06:05:10,988 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 90 [2023-11-29 06:05:10,989 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:05:10,990 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:05:10,990 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:05:10,990 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:05:11,001 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:10" (1/1) ... [2023-11-29 06:05:11,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:10" (1/1) ... [2023-11-29 06:05:11,003 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:10" (1/1) ... [2023-11-29 06:05:11,015 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 06:05:11,015 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:10" (1/1) ... [2023-11-29 06:05:11,016 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:10" (1/1) ... [2023-11-29 06:05:11,020 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:10" (1/1) ... [2023-11-29 06:05:11,023 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:10" (1/1) ... [2023-11-29 06:05:11,024 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:10" (1/1) ... [2023-11-29 06:05:11,025 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:10" (1/1) ... [2023-11-29 06:05:11,027 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:05:11,028 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:05:11,028 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:05:11,028 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:05:11,029 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:10" (1/1) ... [2023-11-29 06:05:11,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:05:11,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:05:11,056 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:05:11,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:05:11,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:05:11,095 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 06:05:11,095 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 06:05:11,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 06:05:11,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:05:11,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:05:11,174 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:05:11,176 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:05:11,332 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:05:11,383 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:05:11,383 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 06:05:11,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:05:11 BoogieIcfgContainer [2023-11-29 06:05:11,384 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:05:11,387 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:05:11,387 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:05:11,390 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:05:11,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:05:10" (1/3) ... [2023-11-29 06:05:11,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dc869a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:05:11, skipping insertion in model container [2023-11-29 06:05:11,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:10" (2/3) ... [2023-11-29 06:05:11,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dc869a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:05:11, skipping insertion in model container [2023-11-29 06:05:11,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:05:11" (3/3) ... [2023-11-29 06:05:11,393 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-26.i [2023-11-29 06:05:11,428 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:05:11,428 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 06:05:11,475 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:05:11,481 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@112c73fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:05:11,482 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 06:05:11,485 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 06:05:11,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-29 06:05:11,495 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:05:11,495 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:05:11,496 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:05:11,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:05:11,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1590931931, now seen corresponding path program 1 times [2023-11-29 06:05:11,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:05:11,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850091962] [2023-11-29 06:05:11,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:05:11,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:05:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:05:11,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:05:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:05:11,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:05:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:05:11,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:05:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:05:11,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 06:05:11,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:05:11,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 06:05:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:05:11,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:05:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:05:11,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:05:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:05:11,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 06:05:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:05:11,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 06:05:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:05:11,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:05:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:05:11,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:05:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:05:11,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:05:11,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:05:11,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:05:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:05:11,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 06:05:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:05:11,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 06:05:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:05:11,788 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 06:05:11,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:05:11,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850091962] [2023-11-29 06:05:11,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850091962] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:05:11,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:05:11,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:05:11,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206968963] [2023-11-29 06:05:11,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:05:11,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 06:05:11,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:05:11,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 06:05:11,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 06:05:11,827 INFO L87 Difference]: Start difference. First operand has 37 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 06:05:11,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:05:11,862 INFO L93 Difference]: Finished difference Result 71 states and 123 transitions. [2023-11-29 06:05:11,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 06:05:11,864 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 89 [2023-11-29 06:05:11,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:05:11,872 INFO L225 Difference]: With dead ends: 71 [2023-11-29 06:05:11,872 INFO L226 Difference]: Without dead ends: 35 [2023-11-29 06:05:11,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 06:05:11,880 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:05:11,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:05:11,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-29 06:05:11,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-11-29 06:05:11,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 06:05:11,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2023-11-29 06:05:11,918 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 50 transitions. Word has length 89 [2023-11-29 06:05:11,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:05:11,919 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 50 transitions. [2023-11-29 06:05:11,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 06:05:11,919 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2023-11-29 06:05:11,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-29 06:05:11,924 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:05:11,924 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:05:11,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 06:05:11,925 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:05:11,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:05:11,925 INFO L85 PathProgramCache]: Analyzing trace with hash 2141560935, now seen corresponding path program 1 times [2023-11-29 06:05:11,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:05:11,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4393039] [2023-11-29 06:05:11,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:05:11,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:05:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:05:12,075 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:05:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:05:12,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:05:12,171 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 06:05:12,173 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 06:05:12,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 06:05:12,177 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-29 06:05:12,180 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 06:05:12,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 06:05:12 BoogieIcfgContainer [2023-11-29 06:05:12,237 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 06:05:12,238 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 06:05:12,238 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 06:05:12,238 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 06:05:12,239 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:05:11" (3/4) ... [2023-11-29 06:05:12,241 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 06:05:12,242 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 06:05:12,243 INFO L158 Benchmark]: Toolchain (without parser) took 1549.55ms. Allocated memory was 123.7MB in the beginning and 148.9MB in the end (delta: 25.2MB). Free memory was 85.7MB in the beginning and 63.9MB in the end (delta: 21.8MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. [2023-11-29 06:05:12,243 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 123.7MB. Free memory is still 65.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:05:12,244 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.81ms. Allocated memory is still 123.7MB. Free memory was 85.3MB in the beginning and 73.9MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 06:05:12,244 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.94ms. Allocated memory is still 123.7MB. Free memory was 73.9MB in the beginning and 72.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:05:12,245 INFO L158 Benchmark]: Boogie Preprocessor took 37.44ms. Allocated memory is still 123.7MB. Free memory was 72.2MB in the beginning and 70.1MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 06:05:12,246 INFO L158 Benchmark]: RCFGBuilder took 356.26ms. Allocated memory is still 123.7MB. Free memory was 70.1MB in the beginning and 54.6MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 06:05:12,246 INFO L158 Benchmark]: TraceAbstraction took 850.70ms. Allocated memory was 123.7MB in the beginning and 148.9MB in the end (delta: 25.2MB). Free memory was 54.2MB in the beginning and 63.9MB in the end (delta: -9.7MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2023-11-29 06:05:12,247 INFO L158 Benchmark]: Witness Printer took 3.92ms. Allocated memory is still 148.9MB. Free memory is still 63.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:05:12,250 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.14ms. Allocated memory is still 123.7MB. Free memory is still 65.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 255.81ms. Allocated memory is still 123.7MB. Free memory was 85.3MB in the beginning and 73.9MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.94ms. Allocated memory is still 123.7MB. Free memory was 73.9MB in the beginning and 72.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.44ms. Allocated memory is still 123.7MB. Free memory was 72.2MB in the beginning and 70.1MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 356.26ms. Allocated memory is still 123.7MB. Free memory was 70.1MB in the beginning and 54.6MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 850.70ms. Allocated memory was 123.7MB in the beginning and 148.9MB in the end (delta: 25.2MB). Free memory was 54.2MB in the beginning and 63.9MB in the end (delta: -9.7MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * Witness Printer took 3.92ms. Allocated memory is still 148.9MB. Free memory is still 63.9MB. 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 72. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 32; [L23] unsigned char var_1_2 = 1; [L24] unsigned long int var_1_3 = 4; [L25] unsigned long int var_1_4 = 64; [L26] unsigned long int var_1_5 = 32; [L27] unsigned long int var_1_6 = 1908995780; [L28] unsigned long int var_1_7 = 0; [L29] double var_1_8 = 1.7; [L30] double var_1_9 = 1.7; [L31] signed short int var_1_10 = -32; [L32] signed short int var_1_11 = -16; [L76] isInitial = 1 [L77] FCALL initially() [L78] COND TRUE 1 [L79] FCALL updateLastVariables() [L80] CALL updateVariables() [L45] var_1_2 = __VERIFIER_nondet_uchar() [L46] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_3=4, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_3=4, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L46] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_3=4, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L47] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L47] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L48] var_1_3 = __VERIFIER_nondet_ulong() [L49] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L49] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L50] CALL assume_abort_if_not(var_1_3 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=3221225471, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=3221225471, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L50] RET assume_abort_if_not(var_1_3 <= 4294967294) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=3221225471, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L51] var_1_4 = __VERIFIER_nondet_ulong() [L52] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=3221225471, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=3221225471, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L52] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=3221225471, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L53] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=3221225471, var_1_4=2147483647, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=3221225471, var_1_4=2147483647, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L53] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=3221225471, var_1_4=2147483647, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L54] var_1_5 = __VERIFIER_nondet_ulong() [L55] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=3221225471, var_1_4=2147483647, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=3221225471, var_1_4=2147483647, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L55] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=3221225471, var_1_4=2147483647, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L56] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=3221225471, var_1_4=2147483647, var_1_5=1073741824, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=3221225471, var_1_4=2147483647, var_1_5=1073741824, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L56] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=3221225471, var_1_4=2147483647, var_1_5=1073741824, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L57] var_1_6 = __VERIFIER_nondet_ulong() [L58] CALL assume_abort_if_not(var_1_6 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=3221225471, var_1_4=2147483647, var_1_5=1073741824, var_1_6=2147483647, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=3221225471, var_1_4=2147483647, var_1_5=1073741824, var_1_6=2147483647, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L58] RET assume_abort_if_not(var_1_6 >= 1073741823) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=3221225471, var_1_4=2147483647, var_1_5=1073741824, var_1_6=2147483647, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L59] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=3221225471, var_1_4=2147483647, var_1_5=1073741824, var_1_6=2147483647, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=3221225471, var_1_4=2147483647, var_1_5=1073741824, var_1_6=2147483647, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L59] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=3221225471, var_1_4=2147483647, var_1_5=1073741824, var_1_6=2147483647, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L60] var_1_7 = __VERIFIER_nondet_ulong() [L61] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=3221225471, var_1_4=2147483647, var_1_5=1073741824, var_1_6=2147483647, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=3221225471, var_1_4=2147483647, var_1_5=1073741824, var_1_6=2147483647, var_1_8=17/10, var_1_9=17/10] [L61] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=3221225471, var_1_4=2147483647, var_1_5=1073741824, var_1_6=2147483647, var_1_8=17/10, var_1_9=17/10] [L62] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=3221225471, var_1_4=2147483647, var_1_5=1073741824, var_1_6=2147483647, var_1_7=1073741823, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=3221225471, var_1_4=2147483647, var_1_5=1073741824, var_1_6=2147483647, var_1_7=1073741823, var_1_8=17/10, var_1_9=17/10] [L62] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=3221225471, var_1_4=2147483647, var_1_5=1073741824, var_1_6=2147483647, var_1_7=1073741823, var_1_8=17/10, var_1_9=17/10] [L63] var_1_9 = __VERIFIER_nondet_double() [L64] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=3221225471, var_1_4=2147483647, var_1_5=1073741824, var_1_6=2147483647, var_1_7=1073741823, var_1_8=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=3221225471, var_1_4=2147483647, var_1_5=1073741824, var_1_6=2147483647, var_1_7=1073741823, var_1_8=17/10] [L64] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=3221225471, var_1_4=2147483647, var_1_5=1073741824, var_1_6=2147483647, var_1_7=1073741823, var_1_8=17/10] [L65] var_1_11 = __VERIFIER_nondet_short() [L66] CALL assume_abort_if_not(var_1_11 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=32766, var_1_1=32, var_1_2=1, var_1_3=3221225471, var_1_4=2147483647, var_1_5=1073741824, var_1_6=2147483647, var_1_7=1073741823, var_1_8=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-32, var_1_11=32766, var_1_1=32, var_1_2=1, var_1_3=3221225471, var_1_4=2147483647, var_1_5=1073741824, var_1_6=2147483647, var_1_7=1073741823, var_1_8=17/10] [L66] RET assume_abort_if_not(var_1_11 >= -32767) VAL [isInitial=1, var_1_10=-32, var_1_11=32766, var_1_1=32, var_1_2=1, var_1_3=3221225471, var_1_4=2147483647, var_1_5=1073741824, var_1_6=2147483647, var_1_7=1073741823, var_1_8=17/10] [L67] CALL assume_abort_if_not(var_1_11 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=32766, var_1_1=32, var_1_2=1, var_1_3=3221225471, var_1_4=2147483647, var_1_5=1073741824, var_1_6=2147483647, var_1_7=1073741823, var_1_8=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-32, var_1_11=32766, var_1_1=32, var_1_2=1, var_1_3=3221225471, var_1_4=2147483647, var_1_5=1073741824, var_1_6=2147483647, var_1_7=1073741823, var_1_8=17/10] [L67] RET assume_abort_if_not(var_1_11 <= 32766) VAL [isInitial=1, var_1_10=-32, var_1_11=32766, var_1_1=32, var_1_2=1, var_1_3=3221225471, var_1_4=2147483647, var_1_5=1073741824, var_1_6=2147483647, var_1_7=1073741823, var_1_8=17/10] [L80] RET updateVariables() [L81] CALL step() [L36] COND TRUE \read(var_1_2) [L37] var_1_1 = ((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) VAL [isInitial=1, var_1_10=-32, var_1_11=32766, var_1_1=3221225471, var_1_2=1, var_1_3=3221225471, var_1_4=2147483647, var_1_5=1073741824, var_1_6=2147483647, var_1_7=1073741823, var_1_8=17/10] [L41] var_1_8 = var_1_9 [L42] var_1_10 = var_1_11 [L81] RET step() [L82] CALL, EXPR property() [L72-L73] return ((var_1_2 ? (var_1_1 == ((unsigned long int) ((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))))) : (var_1_1 == ((unsigned long int) (3164264966u - ((((var_1_5) < ((var_1_6 - var_1_7))) ? (var_1_5) : ((var_1_6 - var_1_7)))))))) && (var_1_8 == ((double) var_1_9))) && (var_1_10 == ((signed short int) var_1_11)) ; [L82] RET, EXPR property() [L82] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=32766, var_1_11=32766, var_1_1=3221225471, var_1_2=1, var_1_3=3221225471, var_1_4=2147483647, var_1_5=1073741824, var_1_6=2147483647, var_1_7=1073741823, var_1_8=5368709124, var_1_9=5368709124] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=32766, var_1_11=32766, var_1_1=3221225471, var_1_2=1, var_1_3=3221225471, var_1_4=2147483647, var_1_5=1073741824, var_1_6=2147483647, var_1_7=1073741823, var_1_8=5368709124, var_1_9=5368709124] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 15, 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, 47 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 47 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 178 NumberOfCodeBlocks, 178 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 88 ConstructedInterpolants, 0 QuantifiedInterpolants, 88 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 420/420 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 06:05:12,269 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-26.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 08ef4c3a1699c030822612f64a82179d2ef28481e12c6ce62efbc901639eabc5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:05:14,239 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:05:14,307 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 06:05:14,324 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:05:14,325 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:05:14,352 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:05:14,352 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:05:14,353 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:05:14,354 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:05:14,354 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:05:14,355 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:05:14,355 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:05:14,356 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:05:14,357 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:05:14,357 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:05:14,358 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:05:14,358 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 06:05:14,359 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:05:14,359 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:05:14,360 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:05:14,360 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 06:05:14,361 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:05:14,361 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 06:05:14,362 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 06:05:14,362 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 06:05:14,363 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 06:05:14,363 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:05:14,363 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 06:05:14,364 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:05:14,365 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:05:14,365 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:05:14,365 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:05:14,366 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:05:14,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:05:14,366 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:05:14,367 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:05:14,367 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 06:05:14,367 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 06:05:14,367 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 06:05:14,367 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:05:14,368 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:05:14,368 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 06:05:14,368 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:05:14,368 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:05:14,369 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 06:05:14,369 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_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 08ef4c3a1699c030822612f64a82179d2ef28481e12c6ce62efbc901639eabc5 [2023-11-29 06:05:14,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:05:14,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:05:14,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:05:14,705 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:05:14,705 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:05:14,706 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-26.i [2023-11-29 06:05:17,508 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:05:17,671 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:05:17,672 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-26.i [2023-11-29 06:05:17,680 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/data/cbb513367/2fcb5ffe39164dbe958c80111b2bb1fa/FLAG7cffd599d [2023-11-29 06:05:17,694 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/data/cbb513367/2fcb5ffe39164dbe958c80111b2bb1fa [2023-11-29 06:05:17,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:05:17,698 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:05:17,699 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:05:17,699 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:05:17,704 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:05:17,705 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:05:17" (1/1) ... [2023-11-29 06:05:17,706 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@955ec5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:17, skipping insertion in model container [2023-11-29 06:05:17,706 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:05:17" (1/1) ... [2023-11-29 06:05:17,729 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:05:17,865 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-26.i[915,928] [2023-11-29 06:05:17,895 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:05:17,909 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:05:17,920 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-26.i[915,928] [2023-11-29 06:05:17,935 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:05:17,954 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:05:17,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:17 WrapperNode [2023-11-29 06:05:17,955 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:05:17,956 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:05:17,956 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:05:17,956 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:05:17,962 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:17" (1/1) ... [2023-11-29 06:05:17,972 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:17" (1/1) ... [2023-11-29 06:05:17,996 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 89 [2023-11-29 06:05:17,997 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:05:17,998 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:05:17,998 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:05:17,998 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:05:18,007 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:17" (1/1) ... [2023-11-29 06:05:18,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:17" (1/1) ... [2023-11-29 06:05:18,011 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:17" (1/1) ... [2023-11-29 06:05:18,022 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 06:05:18,023 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:17" (1/1) ... [2023-11-29 06:05:18,023 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:17" (1/1) ... [2023-11-29 06:05:18,031 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:17" (1/1) ... [2023-11-29 06:05:18,034 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:17" (1/1) ... [2023-11-29 06:05:18,037 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:17" (1/1) ... [2023-11-29 06:05:18,038 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:17" (1/1) ... [2023-11-29 06:05:18,042 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:05:18,043 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:05:18,043 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:05:18,044 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:05:18,045 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:17" (1/1) ... [2023-11-29 06:05:18,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:05:18,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:05:18,069 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:05:18,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:05:18,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:05:18,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 06:05:18,117 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 06:05:18,118 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 06:05:18,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:05:18,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:05:18,191 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:05:18,193 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:05:18,366 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:05:18,426 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:05:18,427 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 06:05:18,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:05:18 BoogieIcfgContainer [2023-11-29 06:05:18,428 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:05:18,431 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:05:18,431 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:05:18,433 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:05:18,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:05:17" (1/3) ... [2023-11-29 06:05:18,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ebf0383 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:05:18, skipping insertion in model container [2023-11-29 06:05:18,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:17" (2/3) ... [2023-11-29 06:05:18,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ebf0383 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:05:18, skipping insertion in model container [2023-11-29 06:05:18,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:05:18" (3/3) ... [2023-11-29 06:05:18,436 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-26.i [2023-11-29 06:05:18,451 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:05:18,451 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 06:05:18,493 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:05:18,498 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@708cf183, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:05:18,499 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 06:05:18,502 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 06:05:18,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-29 06:05:18,512 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:05:18,513 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:05:18,513 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:05:18,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:05:18,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1590931931, now seen corresponding path program 1 times [2023-11-29 06:05:18,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:05:18,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1158602604] [2023-11-29 06:05:18,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:05:18,531 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:05:18,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:05:18,532 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:05:18,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 06:05:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:05:18,690 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 06:05:18,699 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:05:18,738 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2023-11-29 06:05:18,738 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:05:18,739 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:05:18,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1158602604] [2023-11-29 06:05:18,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1158602604] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:05:18,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:05:18,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:05:18,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470980417] [2023-11-29 06:05:18,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:05:18,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 06:05:18,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:05:18,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 06:05:18,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 06:05:18,773 INFO L87 Difference]: Start difference. First operand has 37 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 06:05:18,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:05:18,825 INFO L93 Difference]: Finished difference Result 71 states and 123 transitions. [2023-11-29 06:05:18,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 06:05:18,828 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 89 [2023-11-29 06:05:18,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:05:18,835 INFO L225 Difference]: With dead ends: 71 [2023-11-29 06:05:18,835 INFO L226 Difference]: Without dead ends: 35 [2023-11-29 06:05:18,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 06:05:18,841 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:05:18,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:05:18,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-29 06:05:18,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-11-29 06:05:18,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 06:05:18,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2023-11-29 06:05:18,883 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 50 transitions. Word has length 89 [2023-11-29 06:05:18,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:05:18,883 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 50 transitions. [2023-11-29 06:05:18,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 06:05:18,884 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2023-11-29 06:05:18,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-29 06:05:18,888 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:05:18,888 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:05:18,896 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 06:05:19,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:05:19,089 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:05:19,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:05:19,089 INFO L85 PathProgramCache]: Analyzing trace with hash 2141560935, now seen corresponding path program 1 times [2023-11-29 06:05:19,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:05:19,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [957360904] [2023-11-29 06:05:19,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:05:19,091 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:05:19,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:05:19,092 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:05:19,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 06:05:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:05:19,209 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 06:05:19,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:05:21,789 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 104 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2023-11-29 06:05:21,789 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:05:23,935 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 6 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-11-29 06:05:23,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:05:23,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [957360904] [2023-11-29 06:05:23,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [957360904] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:05:23,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:05:23,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2023-11-29 06:05:23,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574451677] [2023-11-29 06:05:23,937 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:05:23,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 06:05:23,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:05:23,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 06:05:23,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-11-29 06:05:23,940 INFO L87 Difference]: Start difference. First operand 35 states and 50 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2023-11-29 06:05:25,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:05:25,311 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2023-11-29 06:05:25,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 06:05:25,313 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 89 [2023-11-29 06:05:25,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:05:25,315 INFO L225 Difference]: With dead ends: 47 [2023-11-29 06:05:25,316 INFO L226 Difference]: Without dead ends: 45 [2023-11-29 06:05:25,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2023-11-29 06:05:25,318 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 53 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 06:05:25,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 99 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 06:05:25,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-11-29 06:05:25,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2023-11-29 06:05:25,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 06:05:25,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2023-11-29 06:05:25,332 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 55 transitions. Word has length 89 [2023-11-29 06:05:25,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:05:25,333 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 55 transitions. [2023-11-29 06:05:25,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2023-11-29 06:05:25,333 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 55 transitions. [2023-11-29 06:05:25,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-29 06:05:25,335 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:05:25,336 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:05:25,339 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 06:05:25,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:05:25,539 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:05:25,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:05:25,540 INFO L85 PathProgramCache]: Analyzing trace with hash 2141620517, now seen corresponding path program 1 times [2023-11-29 06:05:25,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:05:25,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1949740525] [2023-11-29 06:05:25,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:05:25,541 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:05:25,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:05:25,542 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:05:25,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 06:05:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:05:25,625 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 06:05:25,628 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:05:27,422 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 104 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2023-11-29 06:05:27,422 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:05:28,202 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 6 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-11-29 06:05:28,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:05:28,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1949740525] [2023-11-29 06:05:28,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1949740525] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:05:28,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:05:28,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2023-11-29 06:05:28,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815267535] [2023-11-29 06:05:28,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:05:28,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 06:05:28,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:05:28,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 06:05:28,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-11-29 06:05:28,205 INFO L87 Difference]: Start difference. First operand 41 states and 55 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2023-11-29 06:05:29,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:05:29,323 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2023-11-29 06:05:29,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 06:05:29,324 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 89 [2023-11-29 06:05:29,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:05:29,325 INFO L225 Difference]: With dead ends: 45 [2023-11-29 06:05:29,325 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 06:05:29,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2023-11-29 06:05:29,327 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 47 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 06:05:29,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 119 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 06:05:29,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 06:05:29,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 06:05:29,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:05:29,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 06:05:29,328 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 89 [2023-11-29 06:05:29,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:05:29,329 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 06:05:29,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2023-11-29 06:05:29,329 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 06:05:29,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 06:05:29,332 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 06:05:29,335 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 06:05:29,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:05:29,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 06:05:30,103 INFO L895 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (= currentRoundingMode roundNearestTiesToEven) [2023-11-29 06:05:30,103 INFO L899 garLoopResultBuilder]: For program point L64-1(line 64) no Hoare annotation was computed. [2023-11-29 06:05:30,103 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2023-11-29 06:05:30,103 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))) (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 06:05:30,104 INFO L895 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))) (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 06:05:30,104 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-29 06:05:30,104 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-29 06:05:30,104 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-29 06:05:30,104 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 40) no Hoare annotation was computed. [2023-11-29 06:05:30,104 INFO L899 garLoopResultBuilder]: For program point L36-2(lines 36 40) no Hoare annotation was computed. [2023-11-29 06:05:30,104 INFO L895 garLoopResultBuilder]: At program point L61(line 61) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))) (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 06:05:30,105 INFO L895 garLoopResultBuilder]: At program point L61-1(line 61) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))) (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 06:05:30,105 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-29 06:05:30,105 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2023-11-29 06:05:30,105 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))) (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 06:05:30,105 INFO L895 garLoopResultBuilder]: At program point L49-1(line 49) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))) (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 06:05:30,105 INFO L895 garLoopResultBuilder]: At program point L78-2(lines 78 84) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))) (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 06:05:30,106 INFO L899 garLoopResultBuilder]: For program point L78-3(lines 78 84) no Hoare annotation was computed. [2023-11-29 06:05:30,106 INFO L895 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))) (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 06:05:30,106 INFO L895 garLoopResultBuilder]: At program point L66-1(line 66) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))) (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 06:05:30,106 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 06:05:30,106 INFO L899 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2023-11-29 06:05:30,106 INFO L895 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))) (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 06:05:30,107 INFO L895 garLoopResultBuilder]: At program point L58-1(line 58) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))) (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 06:05:30,107 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2023-11-29 06:05:30,107 INFO L895 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))) (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 06:05:30,107 INFO L895 garLoopResultBuilder]: At program point L46-1(line 46) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))) (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 06:05:30,107 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 06:05:30,107 INFO L899 garLoopResultBuilder]: For program point L67(lines 44 68) no Hoare annotation was computed. [2023-11-29 06:05:30,108 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2023-11-29 06:05:30,108 INFO L895 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))) (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 06:05:30,108 INFO L895 garLoopResultBuilder]: At program point L55-1(line 55) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))) (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 06:05:30,108 INFO L899 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2023-11-29 06:05:30,108 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-29 06:05:30,108 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-29 06:05:30,109 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-29 06:05:30,109 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-29 06:05:30,112 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-29 06:05:30,114 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 06:05:30,125 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-29 06:05:30,125 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-29 06:05:30,126 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-29 06:05:30,126 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-29 06:05:30,126 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-29 06:05:30,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 06:05:30 BoogieIcfgContainer [2023-11-29 06:05:30,127 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 06:05:30,127 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 06:05:30,128 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 06:05:30,128 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 06:05:30,128 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:05:18" (3/4) ... [2023-11-29 06:05:30,130 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 06:05:30,133 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-29 06:05:30,138 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2023-11-29 06:05:30,139 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2023-11-29 06:05:30,139 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 06:05:30,140 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 06:05:30,233 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 06:05:30,233 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 06:05:30,233 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 06:05:30,234 INFO L158 Benchmark]: Toolchain (without parser) took 12535.95ms. Allocated memory was 62.9MB in the beginning and 264.2MB in the end (delta: 201.3MB). Free memory was 32.3MB in the beginning and 113.3MB in the end (delta: -81.0MB). Peak memory consumption was 118.5MB. Max. memory is 16.1GB. [2023-11-29 06:05:30,234 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 62.9MB. Free memory is still 39.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:05:30,235 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.01ms. Allocated memory was 62.9MB in the beginning and 109.1MB in the end (delta: 46.1MB). Free memory was 31.9MB in the beginning and 83.4MB in the end (delta: -51.5MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2023-11-29 06:05:30,235 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.37ms. Allocated memory is still 109.1MB. Free memory was 83.4MB in the beginning and 82.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:05:30,235 INFO L158 Benchmark]: Boogie Preprocessor took 44.60ms. Allocated memory is still 109.1MB. Free memory was 81.9MB in the beginning and 79.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 06:05:30,236 INFO L158 Benchmark]: RCFGBuilder took 384.86ms. Allocated memory is still 109.1MB. Free memory was 79.2MB in the beginning and 62.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 06:05:30,236 INFO L158 Benchmark]: TraceAbstraction took 11696.32ms. Allocated memory was 109.1MB in the beginning and 264.2MB in the end (delta: 155.2MB). Free memory was 61.8MB in the beginning and 118.6MB in the end (delta: -56.7MB). Peak memory consumption was 98.6MB. Max. memory is 16.1GB. [2023-11-29 06:05:30,236 INFO L158 Benchmark]: Witness Printer took 105.84ms. Allocated memory is still 264.2MB. Free memory was 118.6MB in the beginning and 113.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 06:05:30,238 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 62.9MB. Free memory is still 39.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.01ms. Allocated memory was 62.9MB in the beginning and 109.1MB in the end (delta: 46.1MB). Free memory was 31.9MB in the beginning and 83.4MB in the end (delta: -51.5MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.37ms. Allocated memory is still 109.1MB. Free memory was 83.4MB in the beginning and 82.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.60ms. Allocated memory is still 109.1MB. Free memory was 81.9MB in the beginning and 79.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 384.86ms. Allocated memory is still 109.1MB. Free memory was 79.2MB in the beginning and 62.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11696.32ms. Allocated memory was 109.1MB in the beginning and 264.2MB in the end (delta: 155.2MB). Free memory was 61.8MB in the beginning and 118.6MB in the end (delta: -56.7MB). Peak memory consumption was 98.6MB. Max. memory is 16.1GB. * Witness Printer took 105.84ms. Allocated memory is still 264.2MB. Free memory was 118.6MB in the beginning and 113.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.6s, OverallIterations: 3, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 102 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 100 mSDsluCounter, 265 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 160 mSDsCounter, 145 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 420 IncrementalHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 145 mSolverCounterUnsat, 105 mSDtfsCounter, 420 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 458 GetRequests, 420 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=2, InterpolantAutomatonStates: 26, 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, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 46 PreInvPairs, 63 NumberOfFragments, 559 HoareAnnotationTreeSize, 46 FomulaSimplifications, 1308 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 17 FomulaSimplificationsInter, 413 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 267 NumberOfCodeBlocks, 267 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 440 ConstructedInterpolants, 1 QuantifiedInterpolants, 2069 SizeOfPredicates, 46 NumberOfNonLiveVariables, 447 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 1880/2100 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 78]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-11-29 06:05:30,262 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056848ff-34b9-43eb-8dad-5259920dabc9/bin/uautomizer-verify-BQ2R08f2Ya/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 Writing output log to file Ultimate.log Result: TRUE