./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-89.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/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_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-89.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/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_ecff04c4-c464-4141-bb6d-8b69231e7b91/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 ef5db925f2e8ec3d5648f64b513836d0bb3bb3fe326dda100ad59242c7d9ff1f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:22:29,032 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:22:29,115 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-28 20:22:29,121 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:22:29,122 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:22:29,147 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:22:29,148 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:22:29,149 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:22:29,149 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:22:29,150 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:22:29,150 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:22:29,151 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:22:29,152 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:22:29,152 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:22:29,153 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:22:29,153 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:22:29,154 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 20:22:29,154 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:22:29,155 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 20:22:29,155 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:22:29,156 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:22:29,156 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 20:22:29,157 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:22:29,157 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 20:22:29,158 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:22:29,158 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 20:22:29,158 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:22:29,159 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:22:29,159 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:22:29,160 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:22:29,160 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:22:29,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:22:29,161 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:22:29,161 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:22:29,161 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 20:22:29,161 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 20:22:29,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 20:22:29,162 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:22:29,162 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:22:29,162 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 20:22:29,162 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:22:29,163 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:22:29,163 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_ecff04c4-c464-4141-bb6d-8b69231e7b91/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_ecff04c4-c464-4141-bb6d-8b69231e7b91/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 -> ef5db925f2e8ec3d5648f64b513836d0bb3bb3fe326dda100ad59242c7d9ff1f [2023-11-28 20:22:29,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:22:29,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:22:29,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:22:29,426 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:22:29,426 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:22:29,427 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-89.i [2023-11-28 20:22:32,112 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:22:32,280 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:22:32,281 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-89.i [2023-11-28 20:22:32,289 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/data/2bc2f1e22/90c2798a9e694dd5afb388acae348c17/FLAG66ee3b992 [2023-11-28 20:22:32,302 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/data/2bc2f1e22/90c2798a9e694dd5afb388acae348c17 [2023-11-28 20:22:32,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:22:32,306 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:22:32,307 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:22:32,307 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:22:32,312 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:22:32,312 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:22:32" (1/1) ... [2023-11-28 20:22:32,313 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34346a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:32, skipping insertion in model container [2023-11-28 20:22:32,314 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:22:32" (1/1) ... [2023-11-28 20:22:32,338 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:22:32,459 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_ecff04c4-c464-4141-bb6d-8b69231e7b91/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-89.i[915,928] [2023-11-28 20:22:32,500 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:22:32,511 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:22:32,522 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_ecff04c4-c464-4141-bb6d-8b69231e7b91/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-89.i[915,928] [2023-11-28 20:22:32,545 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:22:32,563 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:22:32,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:32 WrapperNode [2023-11-28 20:22:32,563 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:22:32,564 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:22:32,564 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:22:32,565 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:22:32,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:32" (1/1) ... [2023-11-28 20:22:32,581 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:32" (1/1) ... [2023-11-28 20:22:32,607 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2023-11-28 20:22:32,607 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:22:32,608 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:22:32,608 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:22:32,608 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:22:32,620 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:32" (1/1) ... [2023-11-28 20:22:32,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:32" (1/1) ... [2023-11-28 20:22:32,624 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:32" (1/1) ... [2023-11-28 20:22:32,644 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-28 20:22:32,644 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:32" (1/1) ... [2023-11-28 20:22:32,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:32" (1/1) ... [2023-11-28 20:22:32,653 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:32" (1/1) ... [2023-11-28 20:22:32,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:32" (1/1) ... [2023-11-28 20:22:32,659 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:32" (1/1) ... [2023-11-28 20:22:32,661 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:32" (1/1) ... [2023-11-28 20:22:32,665 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:22:32,666 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:22:32,666 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:22:32,666 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:22:32,667 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:32" (1/1) ... [2023-11-28 20:22:32,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:22:32,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:22:32,698 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:22:32,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:22:32,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:22:32,732 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-28 20:22:32,732 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-28 20:22:32,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-28 20:22:32,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:22:32,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:22:32,801 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:22:32,803 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:22:33,032 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:22:33,064 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:22:33,064 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-28 20:22:33,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:22:33 BoogieIcfgContainer [2023-11-28 20:22:33,064 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:22:33,067 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:22:33,067 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:22:33,070 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:22:33,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:22:32" (1/3) ... [2023-11-28 20:22:33,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48816000 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:22:33, skipping insertion in model container [2023-11-28 20:22:33,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:32" (2/3) ... [2023-11-28 20:22:33,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48816000 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:22:33, skipping insertion in model container [2023-11-28 20:22:33,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:22:33" (3/3) ... [2023-11-28 20:22:33,073 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-89.i [2023-11-28 20:22:33,092 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:22:33,093 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-28 20:22:33,143 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:22:33,149 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;@1f2a57e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:22:33,150 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-28 20:22:33,154 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-28 20:22:33,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-28 20:22:33,167 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:22:33,168 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:22:33,169 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:22:33,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:33,174 INFO L85 PathProgramCache]: Analyzing trace with hash -307185012, now seen corresponding path program 1 times [2023-11-28 20:22:33,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:33,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583790978] [2023-11-28 20:22:33,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:33,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:33,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:33,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583790978] [2023-11-28 20:22:33,362 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-11-28 20:22:33,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887442963] [2023-11-28 20:22:33,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:33,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:22:33,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:22:33,364 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:22:33,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-28 20:22:33,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:33,502 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-28 20:22:33,513 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:22:33,558 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2023-11-28 20:22:33,558 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:22:33,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887442963] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:33,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:33,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:22:33,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068311497] [2023-11-28 20:22:33,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:33,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-28 20:22:33,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:33,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-28 20:22:33,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-28 20:22:33,624 INFO L87 Difference]: Start difference. First operand has 48 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-28 20:22:33,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:22:33,660 INFO L93 Difference]: Finished difference Result 93 states and 161 transitions. [2023-11-28 20:22:33,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-28 20:22:33,663 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 116 [2023-11-28 20:22:33,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:22:33,671 INFO L225 Difference]: With dead ends: 93 [2023-11-28 20:22:33,672 INFO L226 Difference]: Without dead ends: 46 [2023-11-28 20:22:33,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 115 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-28 20:22:33,680 INFO L413 NwaCegarLoop]: 64 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, 64 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-28 20:22:33,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:22:33,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-28 20:22:33,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-11-28 20:22:33,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-28 20:22:33,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2023-11-28 20:22:33,730 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 116 [2023-11-28 20:22:33,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:22:33,730 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2023-11-28 20:22:33,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-28 20:22:33,731 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2023-11-28 20:22:33,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-28 20:22:33,734 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:22:33,735 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:22:33,742 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-28 20:22:33,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-11-28 20:22:33,937 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:22:33,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:33,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1475096890, now seen corresponding path program 1 times [2023-11-28 20:22:33,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:33,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171687479] [2023-11-28 20:22:33,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:33,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:33,990 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-28 20:22:33,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1874352131] [2023-11-28 20:22:33,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:33,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:22:33,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:22:33,992 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:22:34,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-28 20:22:34,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:34,105 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-28 20:22:34,111 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:22:34,282 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 27 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2023-11-28 20:22:34,283 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:22:34,475 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 27 proven. 27 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2023-11-28 20:22:34,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:34,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171687479] [2023-11-28 20:22:34,475 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-28 20:22:34,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874352131] [2023-11-28 20:22:34,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874352131] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:22:34,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:22:34,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2023-11-28 20:22:34,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672646318] [2023-11-28 20:22:34,477 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:22:34,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-28 20:22:34,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:34,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-28 20:22:34,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:22:34,480 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2023-11-28 20:22:34,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:22:34,725 INFO L93 Difference]: Finished difference Result 97 states and 138 transitions. [2023-11-28 20:22:34,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-28 20:22:34,727 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 116 [2023-11-28 20:22:34,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:22:34,730 INFO L225 Difference]: With dead ends: 97 [2023-11-28 20:22:34,730 INFO L226 Difference]: Without dead ends: 52 [2023-11-28 20:22:34,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 222 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2023-11-28 20:22:34,733 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 42 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-28 20:22:34,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 110 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-28 20:22:34,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-11-28 20:22:34,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2023-11-28 20:22:34,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-28 20:22:34,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 69 transitions. [2023-11-28 20:22:34,748 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 69 transitions. Word has length 116 [2023-11-28 20:22:34,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:22:34,749 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 69 transitions. [2023-11-28 20:22:34,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2023-11-28 20:22:34,750 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 69 transitions. [2023-11-28 20:22:34,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-28 20:22:34,752 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:22:34,753 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:22:34,760 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-28 20:22:34,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:22:34,956 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:22:34,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:34,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1475156472, now seen corresponding path program 1 times [2023-11-28 20:22:34,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:34,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120488123] [2023-11-28 20:22:34,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:34,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:35,011 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-28 20:22:35,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [196078571] [2023-11-28 20:22:35,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:35,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:22:35,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:22:35,014 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:22:35,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-28 20:22:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:22:35,126 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 20:22:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:22:35,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 20:22:35,218 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-28 20:22:35,218 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-28 20:22:35,225 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-28 20:22:35,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-28 20:22:35,423 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-28 20:22:35,426 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-28 20:22:35,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:22:35 BoogieIcfgContainer [2023-11-28 20:22:35,498 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-28 20:22:35,499 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-28 20:22:35,499 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-28 20:22:35,499 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-28 20:22:35,500 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:22:33" (3/4) ... [2023-11-28 20:22:35,503 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-28 20:22:35,504 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-28 20:22:35,505 INFO L158 Benchmark]: Toolchain (without parser) took 3199.02ms. Allocated memory is still 146.8MB. Free memory was 108.1MB in the beginning and 93.3MB in the end (delta: 14.9MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2023-11-28 20:22:35,505 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 107.0MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:22:35,506 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.66ms. Allocated memory is still 146.8MB. Free memory was 108.1MB in the beginning and 95.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-28 20:22:35,506 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.20ms. Allocated memory is still 146.8MB. Free memory was 95.6MB in the beginning and 92.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 20:22:35,507 INFO L158 Benchmark]: Boogie Preprocessor took 56.88ms. Allocated memory is still 146.8MB. Free memory was 92.8MB in the beginning and 89.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-28 20:22:35,507 INFO L158 Benchmark]: RCFGBuilder took 398.73ms. Allocated memory is still 146.8MB. Free memory was 89.3MB in the beginning and 71.0MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-28 20:22:35,508 INFO L158 Benchmark]: TraceAbstraction took 2431.52ms. Allocated memory is still 146.8MB. Free memory was 70.4MB in the beginning and 93.3MB in the end (delta: -22.9MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:22:35,508 INFO L158 Benchmark]: Witness Printer took 5.05ms. Allocated memory is still 146.8MB. Free memory is still 93.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:22:35,511 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 107.0MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.66ms. Allocated memory is still 146.8MB. Free memory was 108.1MB in the beginning and 95.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.20ms. Allocated memory is still 146.8MB. Free memory was 95.6MB in the beginning and 92.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.88ms. Allocated memory is still 146.8MB. Free memory was 92.8MB in the beginning and 89.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 398.73ms. Allocated memory is still 146.8MB. Free memory was 89.3MB in the beginning and 71.0MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2431.52ms. Allocated memory is still 146.8MB. Free memory was 70.4MB in the beginning and 93.3MB in the end (delta: -22.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.05ms. Allocated memory is still 146.8MB. Free memory is still 93.3MB. 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 90, overapproximation of someUnaryDOUBLEoperation at line 31, overapproximation of someBinaryArithmeticDOUBLEoperation at line 52. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_2 = 5; [L24] unsigned char var_1_3 = 4; [L25] signed long int var_1_4 = -256; [L26] unsigned char var_1_5 = 0; [L27] unsigned char var_1_6 = 1; [L28] unsigned char var_1_7 = 0; [L29] unsigned char var_1_8 = 0; [L30] double var_1_9 = 9.5; [L31] double var_1_10 = -0.4; [L32] double var_1_11 = 31.5; [L33] double var_1_12 = 16.25; [L34] double var_1_13 = 127.5; [L35] double var_1_14 = 100000.5; [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] FCALL updateLastVariables() [L98] CALL updateVariables() [L56] var_1_2 = __VERIFIER_nondet_uchar() [L57] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L57] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L58] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L58] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L59] var_1_3 = __VERIFIER_nondet_uchar() [L60] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L60] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L61] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L61] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L62] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L62] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L63] var_1_4 = __VERIFIER_nondet_long() [L64] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L64] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L65] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L65] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L66] var_1_5 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L67] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L68] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L68] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L69] var_1_6 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_6 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L70] RET assume_abort_if_not(var_1_6 >= 1) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L71] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L71] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L72] var_1_7 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_8=0, var_1_9=19/2] [L73] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_8=0, var_1_9=19/2] [L74] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L74] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L75] var_1_8 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_9=19/2] [L76] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_9=19/2] [L77] CALL assume_abort_if_not(var_1_8 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L77] RET assume_abort_if_not(var_1_8 <= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L78] var_1_10 = __VERIFIER_nondet_double() [L79] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L79] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L80] var_1_12 = __VERIFIER_nondet_double() [L81] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=63/2, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L81] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=63/2, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L82] var_1_13 = __VERIFIER_nondet_double() [L83] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=63/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L83] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=63/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L84] var_1_14 = __VERIFIER_nondet_double() [L85] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=63/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L85] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=63/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L98] RET updateVariables() [L99] CALL step() [L39] COND TRUE (var_1_2 / var_1_3) >= var_1_4 [L40] var_1_1 = (var_1_5 && var_1_6) VAL [isInitial=1, var_1_11=63/2, var_1_1=1, var_1_2=5, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L44] unsigned char stepLocal_0 = (var_1_6 && var_1_8) || (var_1_2 >= 5); VAL [isInitial=1, stepLocal_0=1, var_1_11=63/2, var_1_1=1, var_1_2=5, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L45] COND TRUE stepLocal_0 && (var_1_3 < var_1_4) [L46] var_1_9 = var_1_10 VAL [isInitial=1, stepLocal_0=1, var_1_10=2, var_1_11=63/2, var_1_1=1, var_1_2=5, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=2] [L50] unsigned char stepLocal_1 = var_1_6; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=1, var_1_10=2, var_1_11=63/2, var_1_1=1, var_1_2=5, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=2] [L51] COND TRUE (((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) > ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2)))) || stepLocal_1 [L52] var_1_11 = (((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))) + var_1_14) VAL [isInitial=1, stepLocal_0=1, stepLocal_1=1, var_1_10=2, var_1_1=1, var_1_2=5, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=2] [L99] RET step() [L100] CALL, EXPR property() [L90-L91] return ((((var_1_2 / var_1_3) >= var_1_4) ? (var_1_1 == ((unsigned char) (var_1_5 && var_1_6))) : (var_1_1 == ((unsigned char) ((var_1_3 >= var_1_2) && (var_1_7 || var_1_8))))) && ((((var_1_6 && var_1_8) || (var_1_2 >= 5)) && (var_1_3 < var_1_4)) ? (var_1_9 == ((double) var_1_10)) : (var_1_9 == ((double) var_1_10)))) && (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) > ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2)))) || var_1_6) ? (var_1_11 == ((double) (((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))) + var_1_14))) : 1) ; [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=2, var_1_1=1, var_1_2=5, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=2] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=2, var_1_1=1, var_1_2=5, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 51 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 174 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 72 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 146 IncrementalHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 102 mSDtfsCounter, 146 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 350 GetRequests, 337 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=2, InterpolantAutomatonStates: 11, 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, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 464 NumberOfCodeBlocks, 464 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 345 ConstructedInterpolants, 0 QuantifiedInterpolants, 695 SizeOfPredicates, 2 NumberOfNonLiveVariables, 520 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 1998/2052 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-28 20:22:35,532 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/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_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-89.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/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_ecff04c4-c464-4141-bb6d-8b69231e7b91/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 ef5db925f2e8ec3d5648f64b513836d0bb3bb3fe326dda100ad59242c7d9ff1f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:22:37,412 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:22:37,489 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-28 20:22:37,496 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:22:37,497 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:22:37,526 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:22:37,526 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:22:37,527 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:22:37,528 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:22:37,528 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:22:37,529 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:22:37,529 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:22:37,530 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:22:37,531 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:22:37,531 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:22:37,532 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:22:37,533 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 20:22:37,533 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:22:37,534 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:22:37,534 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:22:37,535 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 20:22:37,535 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:22:37,536 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 20:22:37,536 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 20:22:37,537 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-28 20:22:37,537 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-28 20:22:37,538 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:22:37,538 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 20:22:37,538 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:22:37,539 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:22:37,539 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:22:37,540 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:22:37,540 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:22:37,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:22:37,541 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:22:37,541 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:22:37,541 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 20:22:37,541 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-28 20:22:37,542 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-28 20:22:37,542 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:22:37,542 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:22:37,542 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 20:22:37,543 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:22:37,543 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:22:37,543 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-28 20:22:37,543 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_ecff04c4-c464-4141-bb6d-8b69231e7b91/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_ecff04c4-c464-4141-bb6d-8b69231e7b91/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 -> ef5db925f2e8ec3d5648f64b513836d0bb3bb3fe326dda100ad59242c7d9ff1f [2023-11-28 20:22:37,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:22:37,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:22:37,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:22:37,889 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:22:37,890 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:22:37,891 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-89.i [2023-11-28 20:22:40,656 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:22:40,871 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:22:40,872 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-89.i [2023-11-28 20:22:40,881 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/data/e88778a12/227ef79074bc4bfb8bb67f066f50373f/FLAG0e71fcd3b [2023-11-28 20:22:40,896 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/data/e88778a12/227ef79074bc4bfb8bb67f066f50373f [2023-11-28 20:22:40,899 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:22:40,901 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:22:40,902 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:22:40,902 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:22:40,908 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:22:40,909 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:22:40" (1/1) ... [2023-11-28 20:22:40,910 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49b6b579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:40, skipping insertion in model container [2023-11-28 20:22:40,910 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:22:40" (1/1) ... [2023-11-28 20:22:40,940 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:22:41,100 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_ecff04c4-c464-4141-bb6d-8b69231e7b91/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-89.i[915,928] [2023-11-28 20:22:41,142 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:22:41,160 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:22:41,175 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_ecff04c4-c464-4141-bb6d-8b69231e7b91/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-89.i[915,928] [2023-11-28 20:22:41,199 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:22:41,220 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:22:41,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:41 WrapperNode [2023-11-28 20:22:41,221 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:22:41,222 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:22:41,223 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:22:41,223 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:22:41,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:41" (1/1) ... [2023-11-28 20:22:41,244 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:41" (1/1) ... [2023-11-28 20:22:41,275 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2023-11-28 20:22:41,275 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:22:41,276 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:22:41,276 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:22:41,277 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:22:41,289 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:41" (1/1) ... [2023-11-28 20:22:41,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:41" (1/1) ... [2023-11-28 20:22:41,294 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:41" (1/1) ... [2023-11-28 20:22:41,309 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-28 20:22:41,309 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:41" (1/1) ... [2023-11-28 20:22:41,310 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:41" (1/1) ... [2023-11-28 20:22:41,320 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:41" (1/1) ... [2023-11-28 20:22:41,324 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:41" (1/1) ... [2023-11-28 20:22:41,327 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:41" (1/1) ... [2023-11-28 20:22:41,329 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:41" (1/1) ... [2023-11-28 20:22:41,333 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:22:41,334 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:22:41,334 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:22:41,335 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:22:41,335 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:41" (1/1) ... [2023-11-28 20:22:41,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:22:41,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:22:41,367 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:22:41,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:22:41,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:22:41,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-28 20:22:41,407 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-28 20:22:41,407 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-28 20:22:41,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:22:41,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:22:41,501 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:22:41,503 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:22:42,197 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:22:42,233 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:22:42,233 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-28 20:22:42,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:22:42 BoogieIcfgContainer [2023-11-28 20:22:42,234 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:22:42,237 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:22:42,237 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:22:42,240 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:22:42,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:22:40" (1/3) ... [2023-11-28 20:22:42,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b259b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:22:42, skipping insertion in model container [2023-11-28 20:22:42,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:41" (2/3) ... [2023-11-28 20:22:42,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b259b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:22:42, skipping insertion in model container [2023-11-28 20:22:42,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:22:42" (3/3) ... [2023-11-28 20:22:42,243 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-89.i [2023-11-28 20:22:42,262 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:22:42,262 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-28 20:22:42,305 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:22:42,310 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;@5dd849b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:22:42,310 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-28 20:22:42,314 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-28 20:22:42,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-28 20:22:42,328 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:22:42,328 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:22:42,329 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:22:42,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:42,335 INFO L85 PathProgramCache]: Analyzing trace with hash -307185012, now seen corresponding path program 1 times [2023-11-28 20:22:42,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:22:42,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [355789144] [2023-11-28 20:22:42,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:42,349 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-28 20:22:42,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:22:42,353 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/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-28 20:22:42,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/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-28 20:22:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:42,635 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-28 20:22:42,643 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:22:42,687 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2023-11-28 20:22:42,687 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:22:42,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:22:42,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [355789144] [2023-11-28 20:22:42,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [355789144] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:42,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:42,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:22:42,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611682004] [2023-11-28 20:22:42,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:42,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-28 20:22:42,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:22:42,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-28 20:22:42,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-28 20:22:42,728 INFO L87 Difference]: Start difference. First operand has 48 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-28 20:22:43,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:22:43,085 INFO L93 Difference]: Finished difference Result 93 states and 161 transitions. [2023-11-28 20:22:43,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-28 20:22:43,099 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 116 [2023-11-28 20:22:43,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:22:43,106 INFO L225 Difference]: With dead ends: 93 [2023-11-28 20:22:43,107 INFO L226 Difference]: Without dead ends: 46 [2023-11-28 20:22:43,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 115 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-28 20:22:43,114 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 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.3s IncrementalHoareTripleChecker+Time [2023-11-28 20:22:43,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-28 20:22:43,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-28 20:22:43,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-11-28 20:22:43,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-28 20:22:43,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2023-11-28 20:22:43,160 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 116 [2023-11-28 20:22:43,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:22:43,160 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2023-11-28 20:22:43,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-28 20:22:43,161 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2023-11-28 20:22:43,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-28 20:22:43,164 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:22:43,164 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:22:43,173 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/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-28 20:22:43,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/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-28 20:22:43,365 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:22:43,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:43,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1475096890, now seen corresponding path program 1 times [2023-11-28 20:22:43,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:22:43,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2004863514] [2023-11-28 20:22:43,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:43,368 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-28 20:22:43,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:22:43,369 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/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-28 20:22:43,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/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-28 20:22:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:43,597 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-28 20:22:43,604 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:22:44,144 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 371 proven. 48 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2023-11-28 20:22:44,145 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:22:44,474 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 27 proven. 27 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2023-11-28 20:22:44,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:22:44,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2004863514] [2023-11-28 20:22:44,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2004863514] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:22:44,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:22:44,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2023-11-28 20:22:44,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361919175] [2023-11-28 20:22:44,476 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:22:44,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-28 20:22:44,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:22:44,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-28 20:22:44,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-28 20:22:44,480 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2023-11-28 20:22:45,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:22:45,686 INFO L93 Difference]: Finished difference Result 101 states and 141 transitions. [2023-11-28 20:22:45,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-28 20:22:45,697 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 116 [2023-11-28 20:22:45,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:22:45,699 INFO L225 Difference]: With dead ends: 101 [2023-11-28 20:22:45,699 INFO L226 Difference]: Without dead ends: 56 [2023-11-28 20:22:45,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2023-11-28 20:22:45,701 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 34 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:22:45,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 169 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-28 20:22:45,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-11-28 20:22:45,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2023-11-28 20:22:45,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-28 20:22:45,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2023-11-28 20:22:45,716 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 72 transitions. Word has length 116 [2023-11-28 20:22:45,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:22:45,717 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 72 transitions. [2023-11-28 20:22:45,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2023-11-28 20:22:45,717 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 72 transitions. [2023-11-28 20:22:45,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-28 20:22:45,719 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:22:45,720 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:22:45,727 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-28 20:22:45,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/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-28 20:22:45,925 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:22:45,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:45,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1475156472, now seen corresponding path program 1 times [2023-11-28 20:22:45,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:22:45,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1605325593] [2023-11-28 20:22:45,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:45,926 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-28 20:22:45,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:22:45,928 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/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-28 20:22:45,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/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-28 20:22:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:46,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-28 20:22:46,202 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:23:49,374 WARN L293 SmtUtils]: Spent 19.80s on a formula simplification that was a NOOP. DAG size: 85 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-28 20:25:18,735 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-11-28 20:25:18,736 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:25:18,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:25:18,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1605325593] [2023-11-28 20:25:18,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1605325593] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:25:18,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:25:18,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-11-28 20:25:18,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542435309] [2023-11-28 20:25:18,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:25:18,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-28 20:25:18,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:25:18,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-28 20:25:18,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2023-11-28 20:25:18,739 INFO L87 Difference]: Start difference. First operand 54 states and 72 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 4 states have call successors, (19), 4 states have call predecessors, (19), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:25:27,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:25:52,077 WARN L293 SmtUtils]: Spent 22.18s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-28 20:25:54,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:25:55,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:25:58,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:25:59,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:25:59,207 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2023-11-28 20:25:59,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-28 20:25:59,247 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 4 states have call successors, (19), 4 states have call predecessors, (19), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) Word has length 116 [2023-11-28 20:25:59,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:25:59,248 INFO L225 Difference]: With dead ends: 83 [2023-11-28 20:25:59,248 INFO L226 Difference]: Without dead ends: 81 [2023-11-28 20:25:59,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 54.4s TimeCoverageRelationStatistics Valid=193, Invalid=509, Unknown=0, NotChecked=0, Total=702 [2023-11-28 20:25:59,250 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 83 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2023-11-28 20:25:59,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 156 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 14.6s Time] [2023-11-28 20:25:59,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-28 20:25:59,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2023-11-28 20:25:59,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-28 20:25:59,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2023-11-28 20:25:59,261 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 116 [2023-11-28 20:25:59,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:25:59,262 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2023-11-28 20:25:59,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 4 states have call successors, (19), 4 states have call predecessors, (19), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:25:59,262 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2023-11-28 20:25:59,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-28 20:25:59,264 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:25:59,264 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:25:59,269 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/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-28 20:25:59,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/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-28 20:25:59,465 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:25:59,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:25:59,466 INFO L85 PathProgramCache]: Analyzing trace with hash 2010464198, now seen corresponding path program 1 times [2023-11-28 20:25:59,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:25:59,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1154159098] [2023-11-28 20:25:59,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:25:59,466 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-28 20:25:59,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:25:59,467 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/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-28 20:25:59,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/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-28 20:25:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:25:59,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-28 20:25:59,700 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:27:07,568 WARN L293 SmtUtils]: Spent 19.22s on a formula simplification that was a NOOP. DAG size: 90 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-28 20:28:15,891 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-11-28 20:28:15,891 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:28:15,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:28:15,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1154159098] [2023-11-28 20:28:15,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1154159098] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:28:15,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:28:15,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-11-28 20:28:15,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807940053] [2023-11-28 20:28:15,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:28:15,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-28 20:28:15,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:28:15,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-28 20:28:15,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2023-11-28 20:28:15,894 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 4 states have call successors, (19), 4 states have call predecessors, (19), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:28:32,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:29:04,587 WARN L293 SmtUtils]: Spent 30.21s on a formula simplification that was a NOOP. DAG size: 93 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-28 20:29:07,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:29:09,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:29:10,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:29:11,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:29:11,918 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2023-11-28 20:29:11,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-28 20:29:11,937 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 4 states have call successors, (19), 4 states have call predecessors, (19), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) Word has length 116 [2023-11-28 20:29:11,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:29:11,938 INFO L225 Difference]: With dead ends: 80 [2023-11-28 20:29:11,939 INFO L226 Difference]: Without dead ends: 0 [2023-11-28 20:29:11,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 62.7s TimeCoverageRelationStatistics Valid=193, Invalid=509, Unknown=0, NotChecked=0, Total=702 [2023-11-28 20:29:11,941 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 104 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.8s IncrementalHoareTripleChecker+Time [2023-11-28 20:29:11,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 175 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 22.8s Time] [2023-11-28 20:29:11,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-28 20:29:11,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-28 20:29:11,942 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-28 20:29:11,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-28 20:29:11,942 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 116 [2023-11-28 20:29:11,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:29:11,943 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-28 20:29:11,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 4 states have call successors, (19), 4 states have call predecessors, (19), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:29:11,943 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-28 20:29:11,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-28 20:29:11,946 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-28 20:29:11,953 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/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-28 20:29:12,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/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-28 20:29:12,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-28 20:29:22,971 WARN L293 SmtUtils]: Spent 9.10s on a formula simplification. DAG size of input: 110 DAG size of output: 56 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-28 20:29:29,491 INFO L895 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-11-28 20:29:29,492 INFO L895 garLoopResultBuilder]: At program point L64-1(line 64) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-11-28 20:29:29,492 INFO L895 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-11-28 20:29:29,493 INFO L895 garLoopResultBuilder]: At program point L60-1(line 60) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-11-28 20:29:29,493 INFO L895 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse7 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0))) (let ((.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6))) (.cse4 ((_ zero_extend 24) ~var_1_6~0))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (= currentRoundingMode roundNearestTiesToEven)))) [2023-11-28 20:29:29,493 INFO L899 garLoopResultBuilder]: For program point L85-1(lines 55 86) no Hoare annotation was computed. [2023-11-28 20:29:29,493 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-28 20:29:29,494 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-28 20:29:29,494 INFO L895 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_6~0))) (and (bvsle .cse0 (_ bv1 32)) (let ((.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse2 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse1)) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse2))) (and (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1))) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse2)))))) (bvsge .cse0 (_ bv1 32)) (= currentRoundingMode roundNearestTiesToEven))) [2023-11-28 20:29:29,494 INFO L899 garLoopResultBuilder]: For program point L81-1(line 81) no Hoare annotation was computed. [2023-11-28 20:29:29,494 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-28 20:29:29,494 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-11-28 20:29:29,495 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-11-28 20:29:29,495 INFO L895 garLoopResultBuilder]: At program point L73-1(line 73) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-11-28 20:29:29,495 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2023-11-28 20:29:29,495 INFO L895 garLoopResultBuilder]: At program point L61(line 61) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-11-28 20:29:29,496 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-11-28 20:29:29,496 INFO L895 garLoopResultBuilder]: At program point L57-1(line 57) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-11-28 20:29:29,496 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-28 20:29:29,497 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 49) no Hoare annotation was computed. [2023-11-28 20:29:29,497 INFO L899 garLoopResultBuilder]: For program point L45-2(lines 45 49) no Hoare annotation was computed. [2023-11-28 20:29:29,497 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-11-28 20:29:29,497 INFO L895 garLoopResultBuilder]: At program point L70(line 70) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse6 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse3 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (let ((.cse4 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse4))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4)))))) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-11-28 20:29:29,497 INFO L895 garLoopResultBuilder]: At program point L70-1(line 70) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse6 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse3 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (let ((.cse4 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse4))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4)))))) (bvsge ((_ zero_extend 24) ~var_1_6~0) (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-11-28 20:29:29,498 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-28 20:29:29,498 INFO L899 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2023-11-28 20:29:29,498 INFO L899 garLoopResultBuilder]: For program point L58(line 58) no Hoare annotation was computed. [2023-11-28 20:29:29,498 INFO L895 garLoopResultBuilder]: At program point L83(line 83) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse2 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse3 ((_ zero_extend 24) ~var_1_6~0))) (and (let ((.cse1 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))) (and (fp.leq ~var_1_12~0 ((_ to_fp 11 53) currentRoundingMode .cse1)) (fp.geq ~var_1_12~0 .cse2)))) (bvsle .cse3 (_ bv1 32)) (let ((.cse4 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse2) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse4))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4)))))) (bvsge .cse3 (_ bv1 32)) (= currentRoundingMode roundNearestTiesToEven)))) [2023-11-28 20:29:29,498 INFO L899 garLoopResultBuilder]: For program point L83-1(line 83) no Hoare annotation was computed. [2023-11-28 20:29:29,498 INFO L895 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_6~0))) (and (bvsle .cse0 (_ bv1 32)) (bvsge .cse0 (_ bv1 32)) (= currentRoundingMode roundNearestTiesToEven))) [2023-11-28 20:29:29,499 INFO L899 garLoopResultBuilder]: For program point L79-1(line 79) no Hoare annotation was computed. [2023-11-28 20:29:29,499 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-28 20:29:29,499 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2023-11-28 20:29:29,499 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 54) no Hoare annotation was computed. [2023-11-28 20:29:29,499 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-11-28 20:29:29,500 INFO L895 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-11-28 20:29:29,500 INFO L895 garLoopResultBuilder]: At program point L96-2(lines 96 102) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-11-28 20:29:29,500 INFO L899 garLoopResultBuilder]: For program point L96-3(lines 96 102) no Hoare annotation was computed. [2023-11-28 20:29:29,500 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 53) no Hoare annotation was computed. [2023-11-28 20:29:29,501 INFO L895 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-11-28 20:29:29,501 INFO L895 garLoopResultBuilder]: At program point L76-1(line 76) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-11-28 20:29:29,501 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2023-11-28 20:29:29,501 INFO L899 garLoopResultBuilder]: For program point L39-2(lines 39 43) no Hoare annotation was computed. [2023-11-28 20:29:29,501 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2023-11-28 20:29:29,501 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-28 20:29:29,502 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-28 20:29:29,502 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-28 20:29:29,502 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-28 20:29:29,505 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-28 20:29:29,507 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-28 20:29:29,519 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-28 20:29:29,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:29:29 BoogieIcfgContainer [2023-11-28 20:29:29,520 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-28 20:29:29,521 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-28 20:29:29,521 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-28 20:29:29,521 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-28 20:29:29,522 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:22:42" (3/4) ... [2023-11-28 20:29:29,523 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-28 20:29:29,527 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-28 20:29:29,532 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2023-11-28 20:29:29,532 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-28 20:29:29,533 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-28 20:29:29,533 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-28 20:29:29,631 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-28 20:29:29,631 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-28 20:29:29,631 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-28 20:29:29,632 INFO L158 Benchmark]: Toolchain (without parser) took 408731.54ms. Allocated memory was 77.6MB in the beginning and 943.7MB in the end (delta: 866.1MB). Free memory was 53.8MB in the beginning and 890.5MB in the end (delta: -836.7MB). Peak memory consumption was 31.8MB. Max. memory is 16.1GB. [2023-11-28 20:29:29,633 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 52.4MB. Free memory was 28.9MB in the beginning and 28.9MB in the end (delta: 52.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:29:29,633 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.50ms. Allocated memory is still 77.6MB. Free memory was 53.6MB in the beginning and 40.7MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-28 20:29:29,633 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.04ms. Allocated memory is still 77.6MB. Free memory was 40.7MB in the beginning and 38.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 20:29:29,634 INFO L158 Benchmark]: Boogie Preprocessor took 57.23ms. Allocated memory is still 77.6MB. Free memory was 38.4MB in the beginning and 35.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-28 20:29:29,634 INFO L158 Benchmark]: RCFGBuilder took 899.88ms. Allocated memory is still 77.6MB. Free memory was 35.7MB in the beginning and 43.3MB in the end (delta: -7.6MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2023-11-28 20:29:29,634 INFO L158 Benchmark]: TraceAbstraction took 407283.83ms. Allocated memory was 77.6MB in the beginning and 943.7MB in the end (delta: 866.1MB). Free memory was 42.6MB in the beginning and 895.7MB in the end (delta: -853.2MB). Peak memory consumption was 557.9MB. Max. memory is 16.1GB. [2023-11-28 20:29:29,635 INFO L158 Benchmark]: Witness Printer took 110.54ms. Allocated memory is still 943.7MB. Free memory was 895.7MB in the beginning and 890.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-28 20:29:29,637 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 52.4MB. Free memory was 28.9MB in the beginning and 28.9MB in the end (delta: 52.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 319.50ms. Allocated memory is still 77.6MB. Free memory was 53.6MB in the beginning and 40.7MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.04ms. Allocated memory is still 77.6MB. Free memory was 40.7MB in the beginning and 38.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.23ms. Allocated memory is still 77.6MB. Free memory was 38.4MB in the beginning and 35.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 899.88ms. Allocated memory is still 77.6MB. Free memory was 35.7MB in the beginning and 43.3MB in the end (delta: -7.6MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. * TraceAbstraction took 407283.83ms. Allocated memory was 77.6MB in the beginning and 943.7MB in the end (delta: 866.1MB). Free memory was 42.6MB in the beginning and 895.7MB in the end (delta: -853.2MB). Peak memory consumption was 557.9MB. Max. memory is 16.1GB. * Witness Printer took 110.54ms. Allocated memory is still 943.7MB. Free memory was 895.7MB in the beginning and 890.5MB in the end (delta: 5.2MB). 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, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 407.2s, OverallIterations: 4, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 98.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 17.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 260 SdHoareTripleChecker+Valid, 38.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 221 mSDsluCounter, 564 SdHoareTripleChecker+Invalid, 36.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 387 mSDsCounter, 178 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1015 IncrementalHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 178 mSolverCounterUnsat, 177 mSDtfsCounter, 1015 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 597 GetRequests, 530 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 117.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=3, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 77 PreInvPairs, 98 NumberOfFragments, 2539 HoareAnnotationTreeSize, 77 FomulaSimplifications, 4937 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 2901 FormulaSimplificationTreeSizeReductionInter, 17.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 289.7s InterpolantComputationTime, 464 NumberOfCodeBlocks, 464 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 575 ConstructedInterpolants, 0 QuantifiedInterpolants, 6384 SizeOfPredicates, 47 NumberOfNonLiveVariables, 752 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 3345/3420 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: 96]: Loop Invariant Derived loop invariant: ((var_1_6 <= 1) && (var_1_6 >= 1)) RESULT: Ultimate proved your program to be correct! [2023-11-28 20:29:29,847 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-11-28 20:29:29,878 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecff04c4-c464-4141-bb6d-8b69231e7b91/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE