./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-79.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_e314e015-5c80-4622-982f-2de8ae064c9d/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/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_e314e015-5c80-4622-982f-2de8ae064c9d/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-79.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/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_e314e015-5c80-4622-982f-2de8ae064c9d/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 46aaa33ce2cd486d11a2ef4403e2437c8281351e94dc09a4bc73fdbba77b7fda --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:33:18,071 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:33:18,132 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 01:33:18,136 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:33:18,136 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:33:18,158 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:33:18,159 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:33:18,159 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:33:18,160 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:33:18,160 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:33:18,161 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:33:18,162 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:33:18,162 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:33:18,163 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:33:18,163 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:33:18,164 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:33:18,164 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:33:18,165 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:33:18,165 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:33:18,166 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:33:18,167 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:33:18,167 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:33:18,168 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:33:18,168 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:33:18,169 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:33:18,169 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:33:18,170 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:33:18,170 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:33:18,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:33:18,171 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:33:18,172 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:33:18,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:33:18,172 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:33:18,173 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:33:18,173 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:33:18,173 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:33:18,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:33:18,173 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:33:18,173 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:33:18,174 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:33:18,174 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:33:18,174 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:33:18,174 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_e314e015-5c80-4622-982f-2de8ae064c9d/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_e314e015-5c80-4622-982f-2de8ae064c9d/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 -> 46aaa33ce2cd486d11a2ef4403e2437c8281351e94dc09a4bc73fdbba77b7fda [2023-11-29 01:33:18,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:33:18,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:33:18,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:33:18,413 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:33:18,414 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:33:18,415 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-79.i [2023-11-29 01:33:21,197 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:33:21,373 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:33:21,374 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-79.i [2023-11-29 01:33:21,382 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/bin/uautomizer-verify-BQ2R08f2Ya/data/080a44fad/c5b5fd18aba04162bf413d5783282f03/FLAG8eb57e939 [2023-11-29 01:33:21,397 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/bin/uautomizer-verify-BQ2R08f2Ya/data/080a44fad/c5b5fd18aba04162bf413d5783282f03 [2023-11-29 01:33:21,399 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:33:21,401 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:33:21,402 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:33:21,402 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:33:21,408 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:33:21,409 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:33:21" (1/1) ... [2023-11-29 01:33:21,410 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78b0d205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:21, skipping insertion in model container [2023-11-29 01:33:21,410 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:33:21" (1/1) ... [2023-11-29 01:33:21,434 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:33:21,578 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_e314e015-5c80-4622-982f-2de8ae064c9d/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-79.i[915,928] [2023-11-29 01:33:21,603 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:33:21,613 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:33:21,626 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_e314e015-5c80-4622-982f-2de8ae064c9d/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-79.i[915,928] [2023-11-29 01:33:21,637 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:33:21,652 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:33:21,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:21 WrapperNode [2023-11-29 01:33:21,653 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:33:21,654 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:33:21,654 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:33:21,654 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:33:21,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:21" (1/1) ... [2023-11-29 01:33:21,670 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:21" (1/1) ... [2023-11-29 01:33:21,691 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 76 [2023-11-29 01:33:21,691 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:33:21,692 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:33:21,692 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:33:21,692 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:33:21,703 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:21" (1/1) ... [2023-11-29 01:33:21,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:21" (1/1) ... [2023-11-29 01:33:21,705 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:21" (1/1) ... [2023-11-29 01:33:21,717 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 01:33:21,717 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:21" (1/1) ... [2023-11-29 01:33:21,718 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:21" (1/1) ... [2023-11-29 01:33:21,722 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:21" (1/1) ... [2023-11-29 01:33:21,725 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:21" (1/1) ... [2023-11-29 01:33:21,727 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:21" (1/1) ... [2023-11-29 01:33:21,728 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:21" (1/1) ... [2023-11-29 01:33:21,730 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:33:21,731 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:33:21,731 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:33:21,731 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:33:21,732 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:21" (1/1) ... [2023-11-29 01:33:21,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:33:21,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:33:21,764 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:33:21,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:33:21,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:33:21,800 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 01:33:21,801 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 01:33:21,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 01:33:21,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:33:21,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:33:21,874 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:33:21,877 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:33:22,026 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:33:22,058 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:33:22,058 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 01:33:22,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:33:22 BoogieIcfgContainer [2023-11-29 01:33:22,059 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:33:22,062 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:33:22,062 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:33:22,066 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:33:22,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:33:21" (1/3) ... [2023-11-29 01:33:22,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11b1f9a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:33:22, skipping insertion in model container [2023-11-29 01:33:22,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:21" (2/3) ... [2023-11-29 01:33:22,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11b1f9a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:33:22, skipping insertion in model container [2023-11-29 01:33:22,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:33:22" (3/3) ... [2023-11-29 01:33:22,069 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-79.i [2023-11-29 01:33:22,088 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:33:22,088 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 01:33:22,137 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:33:22,144 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;@2c9c3a73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:33:22,145 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 01:33:22,148 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-29 01:33:22,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-29 01:33:22,158 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:33:22,158 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:33:22,159 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:33:22,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:33:22,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1845538419, now seen corresponding path program 1 times [2023-11-29 01:33:22,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:33:22,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082069990] [2023-11-29 01:33:22,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:33:22,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:33:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:33:22,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:33:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:33:22,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:33:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:33:22,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:33:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:33:22,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:33:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:33:22,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:33:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:33:22,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:33:22,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:33:22,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:33:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:33:22,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:33:22,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:33:22,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 01:33:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:33:22,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 01:33:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:33:22,417 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-11-29 01:33:22,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:33:22,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082069990] [2023-11-29 01:33:22,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082069990] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:33:22,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:33:22,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:33:22,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729025637] [2023-11-29 01:33:22,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:33:22,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 01:33:22,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:33:22,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 01:33:22,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 01:33:22,457 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-29 01:33:22,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:33:22,492 INFO L93 Difference]: Finished difference Result 61 states and 102 transitions. [2023-11-29 01:33:22,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 01:33:22,495 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 62 [2023-11-29 01:33:22,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:33:22,503 INFO L225 Difference]: With dead ends: 61 [2023-11-29 01:33:22,503 INFO L226 Difference]: Without dead ends: 30 [2023-11-29 01:33:22,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 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 01:33:22,510 INFO L413 NwaCegarLoop]: 39 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, 39 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 01:33:22,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:33:22,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-29 01:33:22,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-29 01:33:22,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-29 01:33:22,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2023-11-29 01:33:22,570 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 42 transitions. Word has length 62 [2023-11-29 01:33:22,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:33:22,570 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 42 transitions. [2023-11-29 01:33:22,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-29 01:33:22,571 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 42 transitions. [2023-11-29 01:33:22,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-29 01:33:22,574 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:33:22,574 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:33:22,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 01:33:22,585 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:33:22,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:33:22,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1031786121, now seen corresponding path program 1 times [2023-11-29 01:33:22,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:33:22,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473059987] [2023-11-29 01:33:22,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:33:22,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:33:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:33:22,682 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:33:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:33:22,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:33:22,762 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 01:33:22,763 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 01:33:22,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 01:33:22,769 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-29 01:33:22,773 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 01:33:22,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 01:33:22 BoogieIcfgContainer [2023-11-29 01:33:22,818 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 01:33:22,819 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 01:33:22,819 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 01:33:22,819 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 01:33:22,820 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:33:22" (3/4) ... [2023-11-29 01:33:22,822 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 01:33:22,823 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 01:33:22,824 INFO L158 Benchmark]: Toolchain (without parser) took 1423.20ms. Allocated memory was 148.9MB in the beginning and 186.6MB in the end (delta: 37.7MB). Free memory was 110.6MB in the beginning and 144.1MB in the end (delta: -33.5MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2023-11-29 01:33:22,825 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 148.9MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:33:22,825 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.83ms. Allocated memory is still 148.9MB. Free memory was 110.1MB in the beginning and 99.0MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 01:33:22,826 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.78ms. Allocated memory is still 148.9MB. Free memory was 99.0MB in the beginning and 97.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:33:22,826 INFO L158 Benchmark]: Boogie Preprocessor took 38.01ms. Allocated memory is still 148.9MB. Free memory was 97.4MB in the beginning and 95.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:33:22,827 INFO L158 Benchmark]: RCFGBuilder took 328.21ms. Allocated memory is still 148.9MB. Free memory was 95.4MB in the beginning and 81.8MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 01:33:22,828 INFO L158 Benchmark]: TraceAbstraction took 756.38ms. Allocated memory was 148.9MB in the beginning and 186.6MB in the end (delta: 37.7MB). Free memory was 81.3MB in the beginning and 144.1MB in the end (delta: -62.8MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:33:22,828 INFO L158 Benchmark]: Witness Printer took 4.40ms. Allocated memory is still 186.6MB. Free memory is still 144.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:33:22,831 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 148.9MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.83ms. Allocated memory is still 148.9MB. Free memory was 110.1MB in the beginning and 99.0MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.78ms. Allocated memory is still 148.9MB. Free memory was 99.0MB in the beginning and 97.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.01ms. Allocated memory is still 148.9MB. Free memory was 97.4MB in the beginning and 95.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 328.21ms. Allocated memory is still 148.9MB. Free memory was 95.4MB in the beginning and 81.8MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 756.38ms. Allocated memory was 148.9MB in the beginning and 186.6MB in the end (delta: 37.7MB). Free memory was 81.3MB in the beginning and 144.1MB in the end (delta: -62.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.40ms. Allocated memory is still 186.6MB. Free memory is still 144.1MB. 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 65. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 3.375; [L23] unsigned char var_1_2 = 0; [L24] unsigned long int var_1_3 = 4257803242; [L25] unsigned long int var_1_4 = 16; [L26] unsigned long int var_1_5 = 256; [L27] double var_1_6 = 7.375; [L28] double var_1_7 = 9.9; [L69] isInitial = 1 [L70] FCALL initially() [L71] COND TRUE 1 [L72] FCALL updateLastVariables() [L73] 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_1=27/8, var_1_3=4257803242, var_1_4=16, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=27/8, var_1_3=4257803242, var_1_4=16, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L46] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_1=27/8, var_1_3=4257803242, var_1_4=16, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L47] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=4257803242, var_1_4=16, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=4257803242, var_1_4=16, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L47] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=4257803242, var_1_4=16, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L48] var_1_3 = __VERIFIER_nondet_ulong() [L49] CALL assume_abort_if_not(var_1_3 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=16, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=16, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L49] RET assume_abort_if_not(var_1_3 >= 2147483647) VAL [isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=16, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L50] CALL assume_abort_if_not(var_1_3 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=16, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=16, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L50] RET assume_abort_if_not(var_1_3 <= 4294967295) VAL [isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=16, var_1_5=256, var_1_6=59/8, var_1_7=99/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_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L52] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L53] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=1, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=1, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L53] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=1, var_1_5=256, var_1_6=59/8, var_1_7=99/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_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=1, var_1_6=59/8, var_1_7=99/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=1, var_1_6=59/8, var_1_7=99/10] [L55] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=1, var_1_6=59/8, var_1_7=99/10] [L56] CALL assume_abort_if_not(var_1_5 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=1, var_1_6=59/8, var_1_7=99/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=1, var_1_6=59/8, var_1_7=99/10] [L56] RET assume_abort_if_not(var_1_5 <= 4294967295) VAL [isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=1, var_1_6=59/8, var_1_7=99/10] [L57] var_1_6 = __VERIFIER_nondet_double() [L58] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=1, var_1_7=99/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=1, var_1_7=99/10] [L58] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=1, var_1_7=99/10] [L59] var_1_7 = __VERIFIER_nondet_double() [L60] CALL assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=1] [L60] RET assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=1] [L73] RET updateVariables() [L74] CALL step() [L32] unsigned long int stepLocal_1 = var_1_5; [L33] unsigned long int stepLocal_0 = ((((var_1_3 - var_1_4)) < (var_1_5)) ? ((var_1_3 - var_1_4)) : (var_1_5)); VAL [isInitial=1, stepLocal_0=2147483646, stepLocal_1=2147483646, var_1_1=27/8, var_1_2=1, var_1_3=2147483647, var_1_4=1, var_1_5=2147483646] [L34] COND FALSE !(stepLocal_0 <= 50u) [L41] var_1_1 = var_1_7 VAL [isInitial=1, stepLocal_0=2147483646, stepLocal_1=2147483646, var_1_1=4257803247, var_1_2=1, var_1_3=2147483647, var_1_4=1, var_1_5=2147483646, var_1_7=4257803247] [L74] RET step() [L75] CALL, EXPR property() [L65-L66] return ((((((var_1_3 - var_1_4)) < (var_1_5)) ? ((var_1_3 - var_1_4)) : (var_1_5))) <= 50u) ? (var_1_2 ? ((var_1_3 > var_1_5) ? (var_1_1 == ((double) (var_1_6 + var_1_7))) : 1) : 1) : (var_1_1 == ((double) var_1_7)) ; [L75] RET, EXPR property() [L75] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_1=4257803247, var_1_2=1, var_1_3=2147483647, var_1_4=1, var_1_5=2147483646, var_1_7=4257803247] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_1=4257803247, var_1_2=1, var_1_3=2147483647, var_1_4=1, var_1_5=2147483646, var_1_7=4257803247] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 10, 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, 39 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, 39 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred 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.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 124 NumberOfCodeBlocks, 124 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 61 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 180/180 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 01:33:22,853 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/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_e314e015-5c80-4622-982f-2de8ae064c9d/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/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_e314e015-5c80-4622-982f-2de8ae064c9d/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-79.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/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_e314e015-5c80-4622-982f-2de8ae064c9d/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 46aaa33ce2cd486d11a2ef4403e2437c8281351e94dc09a4bc73fdbba77b7fda --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:33:24,798 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:33:24,875 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 01:33:24,882 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:33:24,882 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:33:24,911 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:33:24,912 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:33:24,912 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:33:24,913 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:33:24,913 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:33:24,914 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:33:24,914 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:33:24,915 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:33:24,916 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:33:24,916 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:33:24,917 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:33:24,917 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:33:24,918 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:33:24,918 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:33:24,919 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:33:24,919 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:33:24,920 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:33:24,920 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:33:24,920 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 01:33:24,921 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 01:33:24,921 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 01:33:24,921 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:33:24,922 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:33:24,922 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:33:24,923 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:33:24,923 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:33:24,923 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:33:24,924 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:33:24,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:33:24,924 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:33:24,924 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:33:24,925 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:33:24,925 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 01:33:24,925 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 01:33:24,925 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:33:24,926 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:33:24,926 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:33:24,926 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:33:24,926 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:33:24,926 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 01:33:24,927 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_e314e015-5c80-4622-982f-2de8ae064c9d/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_e314e015-5c80-4622-982f-2de8ae064c9d/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 -> 46aaa33ce2cd486d11a2ef4403e2437c8281351e94dc09a4bc73fdbba77b7fda [2023-11-29 01:33:25,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:33:25,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:33:25,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:33:25,225 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:33:25,226 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:33:25,227 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-79.i [2023-11-29 01:33:27,990 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:33:28,204 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:33:28,205 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-79.i [2023-11-29 01:33:28,212 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/bin/uautomizer-verify-BQ2R08f2Ya/data/d15f05c3e/f537d94df4d04000a8c608f288dc7382/FLAGedf61e743 [2023-11-29 01:33:28,224 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/bin/uautomizer-verify-BQ2R08f2Ya/data/d15f05c3e/f537d94df4d04000a8c608f288dc7382 [2023-11-29 01:33:28,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:33:28,228 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:33:28,229 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:33:28,229 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:33:28,233 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:33:28,234 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:33:28" (1/1) ... [2023-11-29 01:33:28,235 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5faf490e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:28, skipping insertion in model container [2023-11-29 01:33:28,235 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:33:28" (1/1) ... [2023-11-29 01:33:28,255 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:33:28,373 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_e314e015-5c80-4622-982f-2de8ae064c9d/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-79.i[915,928] [2023-11-29 01:33:28,398 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:33:28,412 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:33:28,423 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_e314e015-5c80-4622-982f-2de8ae064c9d/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-79.i[915,928] [2023-11-29 01:33:28,435 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:33:28,454 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:33:28,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:28 WrapperNode [2023-11-29 01:33:28,454 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:33:28,456 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:33:28,456 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:33:28,456 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:33:28,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:28" (1/1) ... [2023-11-29 01:33:28,471 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:28" (1/1) ... [2023-11-29 01:33:28,494 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 76 [2023-11-29 01:33:28,494 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:33:28,495 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:33:28,495 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:33:28,495 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:33:28,504 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:28" (1/1) ... [2023-11-29 01:33:28,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:28" (1/1) ... [2023-11-29 01:33:28,508 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:28" (1/1) ... [2023-11-29 01:33:28,519 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 01:33:28,520 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:28" (1/1) ... [2023-11-29 01:33:28,520 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:28" (1/1) ... [2023-11-29 01:33:28,529 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:28" (1/1) ... [2023-11-29 01:33:28,532 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:28" (1/1) ... [2023-11-29 01:33:28,535 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:28" (1/1) ... [2023-11-29 01:33:28,537 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:28" (1/1) ... [2023-11-29 01:33:28,541 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:33:28,542 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:33:28,542 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:33:28,542 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:33:28,543 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:28" (1/1) ... [2023-11-29 01:33:28,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:33:28,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:33:28,570 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:33:28,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:33:28,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:33:28,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 01:33:28,604 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 01:33:28,605 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 01:33:28,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:33:28,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:33:28,671 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:33:28,673 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:33:28,995 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:33:29,040 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:33:29,041 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 01:33:29,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:33:29 BoogieIcfgContainer [2023-11-29 01:33:29,041 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:33:29,045 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:33:29,045 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:33:29,048 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:33:29,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:33:28" (1/3) ... [2023-11-29 01:33:29,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e078ebe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:33:29, skipping insertion in model container [2023-11-29 01:33:29,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:28" (2/3) ... [2023-11-29 01:33:29,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e078ebe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:33:29, skipping insertion in model container [2023-11-29 01:33:29,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:33:29" (3/3) ... [2023-11-29 01:33:29,051 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-79.i [2023-11-29 01:33:29,065 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:33:29,066 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 01:33:29,106 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:33:29,112 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;@40e8b246, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:33:29,112 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 01:33:29,116 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-29 01:33:29,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-29 01:33:29,124 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:33:29,125 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:33:29,126 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:33:29,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:33:29,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1845538419, now seen corresponding path program 1 times [2023-11-29 01:33:29,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:33:29,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1114333761] [2023-11-29 01:33:29,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:33:29,162 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 01:33:29,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:33:29,167 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/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 01:33:29,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/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 01:33:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:33:29,373 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 01:33:29,380 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:33:29,409 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2023-11-29 01:33:29,409 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:33:29,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:33:29,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1114333761] [2023-11-29 01:33:29,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1114333761] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:33:29,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:33:29,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:33:29,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723743232] [2023-11-29 01:33:29,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:33:29,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 01:33:29,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:33:29,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 01:33:29,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 01:33:29,442 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-29 01:33:29,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:33:29,582 INFO L93 Difference]: Finished difference Result 61 states and 102 transitions. [2023-11-29 01:33:29,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 01:33:29,590 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 62 [2023-11-29 01:33:29,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:33:29,595 INFO L225 Difference]: With dead ends: 61 [2023-11-29 01:33:29,596 INFO L226 Difference]: Without dead ends: 30 [2023-11-29 01:33:29,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 61 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 01:33:29,601 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 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.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:33:29,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:33:29,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-29 01:33:29,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-29 01:33:29,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-29 01:33:29,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2023-11-29 01:33:29,633 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 42 transitions. Word has length 62 [2023-11-29 01:33:29,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:33:29,633 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 42 transitions. [2023-11-29 01:33:29,633 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-29 01:33:29,634 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 42 transitions. [2023-11-29 01:33:29,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-29 01:33:29,636 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:33:29,636 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:33:29,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/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 01:33:29,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/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 01:33:29,837 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:33:29,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:33:29,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1031786121, now seen corresponding path program 1 times [2023-11-29 01:33:29,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:33:29,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1924447380] [2023-11-29 01:33:29,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:33:29,839 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 01:33:29,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:33:29,840 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/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 01:33:29,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/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 01:33:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:33:30,005 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 01:33:30,010 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:33:35,893 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-11-29 01:33:35,893 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:33:35,893 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:33:35,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1924447380] [2023-11-29 01:33:35,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1924447380] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:33:35,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:33:35,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:33:35,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342038270] [2023-11-29 01:33:35,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:33:35,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 01:33:35,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:33:35,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 01:33:35,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:33:35,896 INFO L87 Difference]: Start difference. First operand 30 states and 42 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-29 01:33:38,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:33:38,313 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2023-11-29 01:33:38,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 01:33:38,315 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 62 [2023-11-29 01:33:38,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:33:38,316 INFO L225 Difference]: With dead ends: 51 [2023-11-29 01:33:38,316 INFO L226 Difference]: Without dead ends: 49 [2023-11-29 01:33:38,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2023-11-29 01:33:38,318 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 56 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:33:38,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 88 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-29 01:33:38,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-29 01:33:38,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2023-11-29 01:33:38,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 01:33:38,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2023-11-29 01:33:38,333 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 62 [2023-11-29 01:33:38,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:33:38,333 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2023-11-29 01:33:38,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-29 01:33:38,334 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2023-11-29 01:33:38,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-29 01:33:38,335 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:33:38,335 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:33:38,340 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/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)] Forceful destruction successful, exit code 0 [2023-11-29 01:33:38,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/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 01:33:38,536 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:33:38,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:33:38,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1906016461, now seen corresponding path program 1 times [2023-11-29 01:33:38,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:33:38,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1432567139] [2023-11-29 01:33:38,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:33:38,537 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 01:33:38,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:33:38,538 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/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 01:33:38,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/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 01:33:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:33:38,692 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 01:33:38,696 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:33:42,025 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-11-29 01:33:42,025 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:33:42,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:33:42,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1432567139] [2023-11-29 01:33:42,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1432567139] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:33:42,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:33:42,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:33:42,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975402449] [2023-11-29 01:33:42,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:33:42,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:33:42,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:33:42,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:33:42,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:33:42,028 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-29 01:33:43,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:33:43,053 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2023-11-29 01:33:43,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 01:33:43,054 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 63 [2023-11-29 01:33:43,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:33:43,056 INFO L225 Difference]: With dead ends: 58 [2023-11-29 01:33:43,057 INFO L226 Difference]: Without dead ends: 56 [2023-11-29 01:33:43,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:33:43,058 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 27 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 01:33:43,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 158 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 01:33:43,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-11-29 01:33:43,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 43. [2023-11-29 01:33:43,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 01:33:43,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2023-11-29 01:33:43,069 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 63 [2023-11-29 01:33:43,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:33:43,070 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2023-11-29 01:33:43,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-29 01:33:43,070 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2023-11-29 01:33:43,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-29 01:33:43,072 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:33:43,072 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:33:43,077 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/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 01:33:43,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/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 01:33:43,273 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:33:43,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:33:43,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1052221900, now seen corresponding path program 1 times [2023-11-29 01:33:43,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:33:43,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [968037219] [2023-11-29 01:33:43,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:33:43,274 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 01:33:43,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:33:43,275 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/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 01:33:43,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/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 (5)] Waiting until timeout for monitored process [2023-11-29 01:33:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:33:43,418 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 01:33:43,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:34:10,696 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-11-29 01:34:10,696 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:34:10,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:34:10,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [968037219] [2023-11-29 01:34:10,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [968037219] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:10,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:10,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-29 01:34:10,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324588836] [2023-11-29 01:34:10,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:10,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 01:34:10,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:34:10,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 01:34:10,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-11-29 01:34:10,699 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-29 01:34:20,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:34:20,791 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2023-11-29 01:34:20,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 01:34:20,792 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 64 [2023-11-29 01:34:20,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:34:20,793 INFO L225 Difference]: With dead ends: 72 [2023-11-29 01:34:20,793 INFO L226 Difference]: Without dead ends: 70 [2023-11-29 01:34:20,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2023-11-29 01:34:20,795 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 68 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-29 01:34:20,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 114 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-11-29 01:34:20,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-29 01:34:20,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 47. [2023-11-29 01:34:20,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 01:34:20,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2023-11-29 01:34:20,802 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 64 [2023-11-29 01:34:20,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:34:20,803 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2023-11-29 01:34:20,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-29 01:34:20,803 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2023-11-29 01:34:20,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-29 01:34:20,804 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:34:20,804 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:34:20,808 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/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 (5)] Ended with exit code 0 [2023-11-29 01:34:21,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/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 01:34:21,005 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:34:21,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:21,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1052162318, now seen corresponding path program 1 times [2023-11-29 01:34:21,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:34:21,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [808511389] [2023-11-29 01:34:21,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:21,006 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 01:34:21,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:34:21,007 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/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 01:34:21,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/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 (6)] Waiting until timeout for monitored process [2023-11-29 01:34:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,133 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 01:34:21,136 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:34:21,829 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2023-11-29 01:34:21,829 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:34:24,853 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-11-29 01:34:24,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:34:24,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [808511389] [2023-11-29 01:34:24,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [808511389] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 01:34:24,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:34:24,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2023-11-29 01:34:24,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815665765] [2023-11-29 01:34:24,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:24,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:34:24,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:34:24,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:34:24,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2023-11-29 01:34:24,856 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-29 01:34:25,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:34:25,606 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2023-11-29 01:34:25,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 01:34:25,607 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 64 [2023-11-29 01:34:25,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:34:25,607 INFO L225 Difference]: With dead ends: 50 [2023-11-29 01:34:25,607 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 01:34:25,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2023-11-29 01:34:25,609 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 12 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 01:34:25,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 125 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 01:34:25,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 01:34:25,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 01:34:25,610 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 01:34:25,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 01:34:25,610 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2023-11-29 01:34:25,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:34:25,610 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 01:34:25,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-29 01:34:25,610 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 01:34:25,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 01:34:25,613 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 01:34:25,617 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/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 (6)] Ended with exit code 0 [2023-11-29 01:34:25,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/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 01:34:25,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 01:34:29,496 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 43) no Hoare annotation was computed. [2023-11-29 01:34:29,497 INFO L895 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.geq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode .cse1))) (and (fp.geq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.leq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 01:34:29,497 INFO L899 garLoopResultBuilder]: For program point L60-1(lines 44 61) no Hoare annotation was computed. [2023-11-29 01:34:29,497 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2023-11-29 01:34:29,497 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse4 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse3 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4))) (.cse2 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse0 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse1 ((_ to_fp 11 53) currentRoundingMode .cse4))) (and (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 .cse2) (fp.leq ~var_1_6~0 .cse3))) (= currentRoundingMode roundNearestTiesToEven) (or (and (fp.leq ~var_1_7~0 .cse3) (fp.geq ~var_1_7~0 .cse2)) (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)))))) [2023-11-29 01:34:29,497 INFO L895 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse4 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse3 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4))) (.cse2 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse0 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse1 ((_ to_fp 11 53) currentRoundingMode .cse4))) (and (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 .cse2) (fp.leq ~var_1_6~0 .cse3))) (= currentRoundingMode roundNearestTiesToEven) (or (and (fp.leq ~var_1_7~0 .cse3) (fp.geq ~var_1_7~0 .cse2)) (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)))))) [2023-11-29 01:34:29,497 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-29 01:34:29,497 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-29 01:34:29,498 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-29 01:34:29,498 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 38) no Hoare annotation was computed. [2023-11-29 01:34:29,498 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-29 01:34:29,498 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2023-11-29 01:34:29,498 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse4 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse3 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4))) (.cse2 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse0 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse1 ((_ to_fp 11 53) currentRoundingMode .cse4))) (and (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 .cse2) (fp.leq ~var_1_6~0 .cse3))) (= currentRoundingMode roundNearestTiesToEven) (or (and (fp.leq ~var_1_7~0 .cse3) (fp.geq ~var_1_7~0 .cse2)) (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)))))) [2023-11-29 01:34:29,499 INFO L895 garLoopResultBuilder]: At program point L49-1(line 49) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse4 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse3 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4))) (.cse2 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse0 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse1 ((_ to_fp 11 53) currentRoundingMode .cse4))) (and (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 .cse2) (fp.leq ~var_1_6~0 .cse3))) (= currentRoundingMode roundNearestTiesToEven) (or (and (fp.leq ~var_1_7~0 .cse3) (fp.geq ~var_1_7~0 .cse2)) (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)))))) [2023-11-29 01:34:29,499 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 01:34:29,499 INFO L895 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (and (= currentRoundingMode roundNearestTiesToEven) (let ((.cse1 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_7~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.geq ~var_1_7~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))) (and (fp.leq ~var_1_7~0 ((_ to_fp 11 53) currentRoundingMode .cse1)) (fp.geq ~var_1_7~0 ((_ to_fp 11 53) currentRoundingMode .cse0)))))) [2023-11-29 01:34:29,499 INFO L899 garLoopResultBuilder]: For program point L58-1(line 58) no Hoare annotation was computed. [2023-11-29 01:34:29,499 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2023-11-29 01:34:29,499 INFO L895 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse4 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse3 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4))) (.cse2 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse0 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse1 ((_ to_fp 11 53) currentRoundingMode .cse4))) (and (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 .cse2) (fp.leq ~var_1_6~0 .cse3))) (= currentRoundingMode roundNearestTiesToEven) (or (and (fp.leq ~var_1_7~0 .cse3) (fp.geq ~var_1_7~0 .cse2)) (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)))))) [2023-11-29 01:34:29,500 INFO L895 garLoopResultBuilder]: At program point L46-1(line 46) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse4 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse3 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4))) (.cse2 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse0 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse1 ((_ to_fp 11 53) currentRoundingMode .cse4))) (and (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 .cse2) (fp.leq ~var_1_6~0 .cse3))) (= currentRoundingMode roundNearestTiesToEven) (or (and (fp.leq ~var_1_7~0 .cse3) (fp.geq ~var_1_7~0 .cse2)) (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)))))) [2023-11-29 01:34:29,500 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 01:34:29,500 INFO L895 garLoopResultBuilder]: At program point L71-2(lines 71 77) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse4 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse3 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4))) (.cse2 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse0 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse1 ((_ to_fp 11 53) currentRoundingMode .cse4))) (and (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 .cse2) (fp.leq ~var_1_6~0 .cse3))) (= currentRoundingMode roundNearestTiesToEven) (or (and (fp.leq ~var_1_7~0 .cse3) (fp.geq ~var_1_7~0 .cse2)) (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)))))) [2023-11-29 01:34:29,500 INFO L899 garLoopResultBuilder]: For program point L71-3(lines 71 77) no Hoare annotation was computed. [2023-11-29 01:34:29,500 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 42) no Hoare annotation was computed. [2023-11-29 01:34:29,501 INFO L895 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse4 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse3 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4))) (.cse2 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse0 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse1 ((_ to_fp 11 53) currentRoundingMode .cse4))) (and (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 .cse2) (fp.leq ~var_1_6~0 .cse3))) (= currentRoundingMode roundNearestTiesToEven) (or (and (fp.leq ~var_1_7~0 .cse3) (fp.geq ~var_1_7~0 .cse2)) (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)))))) [2023-11-29 01:34:29,501 INFO L895 garLoopResultBuilder]: At program point L55-1(line 55) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse4 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse3 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4))) (.cse2 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse0 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse1 ((_ to_fp 11 53) currentRoundingMode .cse4))) (and (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 .cse2) (fp.leq ~var_1_6~0 .cse3))) (= currentRoundingMode roundNearestTiesToEven) (or (and (fp.leq ~var_1_7~0 .cse3) (fp.geq ~var_1_7~0 .cse2)) (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)))))) [2023-11-29 01:34:29,501 INFO L899 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2023-11-29 01:34:29,501 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 39) no Hoare annotation was computed. [2023-11-29 01:34:29,501 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-29 01:34:29,501 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-29 01:34:29,501 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-29 01:34:29,502 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-29 01:34:29,505 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-29 01:34:29,506 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 01:34:29,515 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-29 01:34:29,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 01:34:29 BoogieIcfgContainer [2023-11-29 01:34:29,517 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 01:34:29,517 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 01:34:29,518 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 01:34:29,518 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 01:34:29,518 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:33:29" (3/4) ... [2023-11-29 01:34:29,520 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 01:34:29,522 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-29 01:34:29,526 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2023-11-29 01:34:29,527 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2023-11-29 01:34:29,527 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 01:34:29,527 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 01:34:29,612 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 01:34:29,612 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 01:34:29,613 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 01:34:29,613 INFO L158 Benchmark]: Toolchain (without parser) took 61385.71ms. Allocated memory was 136.3MB in the beginning and 453.0MB in the end (delta: 316.7MB). Free memory was 112.8MB in the beginning and 252.5MB in the end (delta: -139.7MB). Peak memory consumption was 178.9MB. Max. memory is 16.1GB. [2023-11-29 01:34:29,614 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 75.5MB. Free memory is still 52.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:34:29,614 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.72ms. Allocated memory is still 136.3MB. Free memory was 112.4MB in the beginning and 100.7MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 01:34:29,614 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.63ms. Allocated memory is still 136.3MB. Free memory was 100.7MB in the beginning and 99.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:34:29,615 INFO L158 Benchmark]: Boogie Preprocessor took 46.09ms. Allocated memory is still 136.3MB. Free memory was 99.0MB in the beginning and 96.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:34:29,615 INFO L158 Benchmark]: RCFGBuilder took 499.87ms. Allocated memory is still 136.3MB. Free memory was 96.9MB in the beginning and 82.3MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 01:34:29,616 INFO L158 Benchmark]: TraceAbstraction took 60472.16ms. Allocated memory was 136.3MB in the beginning and 453.0MB in the end (delta: 316.7MB). Free memory was 81.4MB in the beginning and 257.7MB in the end (delta: -176.3MB). Peak memory consumption was 141.2MB. Max. memory is 16.1GB. [2023-11-29 01:34:29,616 INFO L158 Benchmark]: Witness Printer took 95.35ms. Allocated memory is still 453.0MB. Free memory was 257.7MB in the beginning and 252.5MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 01:34:29,618 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.22ms. Allocated memory is still 75.5MB. Free memory is still 52.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 225.72ms. Allocated memory is still 136.3MB. Free memory was 112.4MB in the beginning and 100.7MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.63ms. Allocated memory is still 136.3MB. Free memory was 100.7MB in the beginning and 99.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.09ms. Allocated memory is still 136.3MB. Free memory was 99.0MB in the beginning and 96.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 499.87ms. Allocated memory is still 136.3MB. Free memory was 96.9MB in the beginning and 82.3MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 60472.16ms. Allocated memory was 136.3MB in the beginning and 453.0MB in the end (delta: 316.7MB). Free memory was 81.4MB in the beginning and 257.7MB in the end (delta: -176.3MB). Peak memory consumption was 141.2MB. Max. memory is 16.1GB. * Witness Printer took 95.35ms. Allocated memory is still 453.0MB. Free memory was 257.7MB in the beginning and 252.5MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: 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, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 60.4s, OverallIterations: 5, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 184 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 163 mSDsluCounter, 524 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 351 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 608 IncrementalHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 173 mSDtfsCounter, 608 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 399 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 14.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=4, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 41 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 33 PreInvPairs, 48 NumberOfFragments, 705 HoareAnnotationTreeSize, 33 FomulaSimplifications, 4893 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 3310 FormulaSimplificationTreeSizeReductionInter, 3.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 40.3s InterpolantComputationTime, 315 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 373 ConstructedInterpolants, 0 QuantifiedInterpolants, 1726 SizeOfPredicates, 60 NumberOfNonLiveVariables, 538 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 1059/1080 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: 71]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-11-29 01:34:29,693 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e314e015-5c80-4622-982f-2de8ae064c9d/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