./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-80.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 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_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-80.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fe1fe0b5e0a3ec8c50f7deed8e5c41ff7c08f0d5f402373171036b554bec1d5c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 19:17:29,730 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:17:29,843 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 19:17:29,853 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:17:29,854 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:17:29,912 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:17:29,915 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:17:29,916 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:17:29,917 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:17:29,919 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:17:29,919 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:17:29,920 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:17:29,921 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:17:29,921 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:17:29,922 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:17:29,925 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:17:29,936 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:17:29,938 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:17:29,942 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:17:29,942 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:17:29,943 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:17:29,943 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:17:29,944 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:17:29,944 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:17:29,944 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:17:29,945 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:17:29,945 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:17:29,945 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:17:29,946 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:17:29,946 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:17:29,950 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:17:29,951 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:17:29,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:17:29,951 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:17:29,952 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:17:29,953 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:17:29,953 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:17:29,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:17:29,954 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:17:29,954 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:17:29,955 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:17:29,956 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:17:29,956 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_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fe1fe0b5e0a3ec8c50f7deed8e5c41ff7c08f0d5f402373171036b554bec1d5c [2024-11-08 19:17:30,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:17:30,419 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:17:30,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:17:30,427 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:17:30,427 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:17:30,429 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-80.i Unable to find full path for "g++" [2024-11-08 19:17:32,773 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:17:33,104 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:17:33,105 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-80.i [2024-11-08 19:17:33,119 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/data/978fc7dc8/97945a8a21dd43baa831fd30f96889f3/FLAG1879d46ae [2024-11-08 19:17:33,136 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/data/978fc7dc8/97945a8a21dd43baa831fd30f96889f3 [2024-11-08 19:17:33,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:17:33,140 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:17:33,141 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:17:33,141 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:17:33,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:17:33,148 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:17:33" (1/1) ... [2024-11-08 19:17:33,148 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ea8470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:33, skipping insertion in model container [2024-11-08 19:17:33,149 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:17:33" (1/1) ... [2024-11-08 19:17:33,183 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:17:33,419 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-80.i[915,928] [2024-11-08 19:17:33,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:17:33,529 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:17:33,546 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-80.i[915,928] [2024-11-08 19:17:33,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:17:33,623 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:17:33,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:33 WrapperNode [2024-11-08 19:17:33,624 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:17:33,625 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:17:33,625 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:17:33,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:17:33,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:33" (1/1) ... [2024-11-08 19:17:33,648 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:33" (1/1) ... [2024-11-08 19:17:33,703 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2024-11-08 19:17:33,703 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:17:33,704 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:17:33,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:17:33,705 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:17:33,720 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:33" (1/1) ... [2024-11-08 19:17:33,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:33" (1/1) ... [2024-11-08 19:17:33,725 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:33" (1/1) ... [2024-11-08 19:17:33,761 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 19:17:33,762 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:33" (1/1) ... [2024-11-08 19:17:33,762 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:33" (1/1) ... [2024-11-08 19:17:33,784 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:33" (1/1) ... [2024-11-08 19:17:33,788 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:33" (1/1) ... [2024-11-08 19:17:33,794 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:33" (1/1) ... [2024-11-08 19:17:33,800 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:33" (1/1) ... [2024-11-08 19:17:33,811 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:17:33,812 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:17:33,812 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:17:33,812 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:17:33,813 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:33" (1/1) ... [2024-11-08 19:17:33,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:17:33,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:17:33,873 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:17:33,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:17:33,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:17:33,921 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:17:33,921 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:17:33,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:17:33,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:17:33,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:17:34,050 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:17:34,053 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:17:34,554 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 19:17:34,554 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:17:34,568 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:17:34,569 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:17:34,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:17:34 BoogieIcfgContainer [2024-11-08 19:17:34,569 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:17:34,573 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:17:34,573 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:17:34,577 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:17:34,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:17:33" (1/3) ... [2024-11-08 19:17:34,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37245384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:17:34, skipping insertion in model container [2024-11-08 19:17:34,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:33" (2/3) ... [2024-11-08 19:17:34,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37245384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:17:34, skipping insertion in model container [2024-11-08 19:17:34,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:17:34" (3/3) ... [2024-11-08 19:17:34,581 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-80.i [2024-11-08 19:17:34,601 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:17:34,602 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:17:34,682 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:17:34,691 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@63245df2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:17:34,691 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:17:34,696 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 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) [2024-11-08 19:17:34,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 19:17:34,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:17:34,714 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:17:34,715 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:17:34,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:17:34,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1893642822, now seen corresponding path program 1 times [2024-11-08 19:17:34,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:17:34,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611800000] [2024-11-08 19:17:34,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:17:34,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:17:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:35,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:17:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:35,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 19:17:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:35,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 19:17:35,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:35,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 19:17:35,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:35,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 19:17:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:35,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 19:17:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:35,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 19:17:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:35,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 19:17:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:35,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 19:17:35,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:35,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 19:17:35,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:35,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 19:17:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:35,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 19:17:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:35,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 19:17:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:35,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 19:17:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:35,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 19:17:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:35,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 19:17:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:35,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 19:17:35,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:35,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 19:17:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:35,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 19:17:35,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:35,702 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 19:17:35,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:17:35,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611800000] [2024-11-08 19:17:35,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611800000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:17:35,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:17:35,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:17:35,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228877091] [2024-11-08 19:17:35,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:17:35,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:17:35,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:17:35,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:17:35,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:17:35,750 INFO L87 Difference]: Start difference. First operand has 61 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 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 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 19:17:35,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:17:35,884 INFO L93 Difference]: Finished difference Result 169 states and 299 transitions. [2024-11-08 19:17:35,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:17:35,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 125 [2024-11-08 19:17:35,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:17:35,900 INFO L225 Difference]: With dead ends: 169 [2024-11-08 19:17:35,900 INFO L226 Difference]: Without dead ends: 111 [2024-11-08 19:17:35,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:17:35,909 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 80 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:17:35,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 231 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:17:35,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-08 19:17:35,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 59. [2024-11-08 19:17:35,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 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) [2024-11-08 19:17:35,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2024-11-08 19:17:35,998 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 125 [2024-11-08 19:17:36,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:17:36,002 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2024-11-08 19:17:36,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 19:17:36,003 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2024-11-08 19:17:36,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 19:17:36,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:17:36,008 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:17:36,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:17:36,010 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:17:36,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:17:36,011 INFO L85 PathProgramCache]: Analyzing trace with hash 2008297464, now seen corresponding path program 1 times [2024-11-08 19:17:36,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:17:36,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681045229] [2024-11-08 19:17:36,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:17:36,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:17:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:36,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:17:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:36,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 19:17:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:36,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 19:17:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:36,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 19:17:36,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:36,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 19:17:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:36,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 19:17:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:36,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 19:17:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:36,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 19:17:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:36,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 19:17:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:36,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 19:17:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:36,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 19:17:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:36,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 19:17:36,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:36,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 19:17:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:36,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 19:17:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:36,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 19:17:36,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:36,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 19:17:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:36,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 19:17:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:36,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 19:17:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:36,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 19:17:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:36,740 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 19:17:36,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:17:36,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681045229] [2024-11-08 19:17:36,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681045229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:17:36,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:17:36,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:17:36,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285718377] [2024-11-08 19:17:36,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:17:36,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:17:36,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:17:36,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:17:36,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:17:36,745 INFO L87 Difference]: Start difference. First operand 59 states and 86 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 19:17:36,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:17:36,827 INFO L93 Difference]: Finished difference Result 171 states and 252 transitions. [2024-11-08 19:17:36,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:17:36,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 125 [2024-11-08 19:17:36,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:17:36,833 INFO L225 Difference]: With dead ends: 171 [2024-11-08 19:17:36,833 INFO L226 Difference]: Without dead ends: 115 [2024-11-08 19:17:36,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:17:36,840 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 39 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:17:36,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 163 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:17:36,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-08 19:17:36,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2024-11-08 19:17:36,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 72 states have internal predecessors, (88), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-08 19:17:36,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 164 transitions. [2024-11-08 19:17:36,889 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 164 transitions. Word has length 125 [2024-11-08 19:17:36,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:17:36,894 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 164 transitions. [2024-11-08 19:17:36,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 19:17:36,895 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 164 transitions. [2024-11-08 19:17:36,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 19:17:36,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:17:36,898 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:17:36,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 19:17:36,898 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:17:36,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:17:36,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1635477384, now seen corresponding path program 1 times [2024-11-08 19:17:36,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:17:36,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847075348] [2024-11-08 19:17:36,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:17:36,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:17:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:37,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:17:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:37,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 19:17:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:37,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 19:17:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:37,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 19:17:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:37,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 19:17:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:37,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 19:17:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:37,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 19:17:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:37,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 19:17:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:37,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 19:17:37,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:37,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 19:17:37,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:37,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 19:17:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:37,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 19:17:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:37,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 19:17:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:37,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 19:17:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:37,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 19:17:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:37,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 19:17:37,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:37,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 19:17:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:37,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 19:17:37,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:37,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 19:17:37,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:37,218 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 19:17:37,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:17:37,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847075348] [2024-11-08 19:17:37,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847075348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:17:37,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:17:37,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:17:37,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147730190] [2024-11-08 19:17:37,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:17:37,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:17:37,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:17:37,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:17:37,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:17:37,225 INFO L87 Difference]: Start difference. First operand 113 states and 164 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 19:17:37,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:17:37,279 INFO L93 Difference]: Finished difference Result 167 states and 240 transitions. [2024-11-08 19:17:37,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:17:37,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 125 [2024-11-08 19:17:37,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:17:37,285 INFO L225 Difference]: With dead ends: 167 [2024-11-08 19:17:37,285 INFO L226 Difference]: Without dead ends: 57 [2024-11-08 19:17:37,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:17:37,288 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:17:37,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:17:37,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-08 19:17:37,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-08 19:17:37,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 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) [2024-11-08 19:17:37,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 78 transitions. [2024-11-08 19:17:37,312 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 78 transitions. Word has length 125 [2024-11-08 19:17:37,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:17:37,317 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 78 transitions. [2024-11-08 19:17:37,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 19:17:37,317 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2024-11-08 19:17:37,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 19:17:37,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:17:37,323 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:17:37,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 19:17:37,323 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:17:37,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:17:37,324 INFO L85 PathProgramCache]: Analyzing trace with hash 639194679, now seen corresponding path program 1 times [2024-11-08 19:17:37,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:17:37,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354944123] [2024-11-08 19:17:37,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:17:37,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:17:37,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:17:37,569 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:17:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:17:37,822 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:17:37,822 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 19:17:37,823 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 19:17:37,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 19:17:37,830 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-08 19:17:37,974 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:17:37,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:17:37 BoogieIcfgContainer [2024-11-08 19:17:37,980 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:17:37,981 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:17:37,982 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:17:37,982 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:17:37,983 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:17:34" (3/4) ... [2024-11-08 19:17:37,986 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 19:17:37,988 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:17:37,989 INFO L158 Benchmark]: Toolchain (without parser) took 4848.35ms. Allocated memory was 117.4MB in the beginning and 163.6MB in the end (delta: 46.1MB). Free memory was 89.2MB in the beginning and 115.3MB in the end (delta: -26.1MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2024-11-08 19:17:37,989 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 92.5MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:17:37,990 INFO L158 Benchmark]: CACSL2BoogieTranslator took 483.26ms. Allocated memory is still 117.4MB. Free memory was 88.8MB in the beginning and 73.2MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 19:17:37,994 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.53ms. Allocated memory is still 117.4MB. Free memory was 72.9MB in the beginning and 68.8MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 19:17:37,995 INFO L158 Benchmark]: Boogie Preprocessor took 106.66ms. Allocated memory is still 117.4MB. Free memory was 68.8MB in the beginning and 61.9MB in the end (delta: 6.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 19:17:37,995 INFO L158 Benchmark]: RCFGBuilder took 757.74ms. Allocated memory was 117.4MB in the beginning and 163.6MB in the end (delta: 46.1MB). Free memory was 61.9MB in the beginning and 127.6MB in the end (delta: -65.6MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. [2024-11-08 19:17:37,997 INFO L158 Benchmark]: TraceAbstraction took 3407.45ms. Allocated memory is still 163.6MB. Free memory was 127.1MB in the beginning and 116.4MB in the end (delta: 10.7MB). Peak memory consumption was 87.3MB. Max. memory is 16.1GB. [2024-11-08 19:17:38,000 INFO L158 Benchmark]: Witness Printer took 6.94ms. Allocated memory is still 163.6MB. Free memory is still 115.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:17:38,003 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 92.5MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 483.26ms. Allocated memory is still 117.4MB. Free memory was 88.8MB in the beginning and 73.2MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.53ms. Allocated memory is still 117.4MB. Free memory was 72.9MB in the beginning and 68.8MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.66ms. Allocated memory is still 117.4MB. Free memory was 68.8MB in the beginning and 61.9MB in the end (delta: 6.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 757.74ms. Allocated memory was 117.4MB in the beginning and 163.6MB in the end (delta: 46.1MB). Free memory was 61.9MB in the beginning and 127.6MB in the end (delta: -65.6MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3407.45ms. Allocated memory is still 163.6MB. Free memory was 127.1MB in the beginning and 116.4MB in the end (delta: 10.7MB). Peak memory consumption was 87.3MB. Max. memory is 16.1GB. * Witness Printer took 6.94ms. Allocated memory is still 163.6MB. Free memory is still 115.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 122, overapproximation of someBinaryFLOATComparisonOperation at line 122. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 128; [L23] double var_1_2 = 24.25; [L24] double var_1_3 = 128.5; [L25] double var_1_4 = 4.5; [L26] double var_1_5 = 49.5; [L27] signed short int var_1_9 = -25; [L28] unsigned char var_1_10 = 200; [L29] unsigned char var_1_11 = 1; [L30] unsigned char var_1_12 = 1; [L31] double var_1_13 = 128.375; [L32] unsigned short int var_1_14 = 0; [L33] float var_1_15 = 0.0; [L34] float var_1_16 = 4.87; [L35] float var_1_17 = 8.875; [L36] signed short int var_1_18 = -128; [L37] unsigned char var_1_19 = 0; [L38] unsigned char var_1_20 = 1; [L39] unsigned char var_1_21 = 0; [L40] unsigned long int var_1_22 = 16; [L41] unsigned long int var_1_23 = 4200661734; [L42] unsigned char last_1_var_1_10 = 200; VAL [isInitial=0, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_2=97/4, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L126] isInitial = 1 [L127] FCALL initially() [L128] COND TRUE 1 [L129] CALL updateLastVariables() [L119] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_2=97/4, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L129] RET updateLastVariables() [L130] CALL updateVariables() [L85] var_1_2 = __VERIFIER_nondet_double() [L86] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L86] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L87] var_1_3 = __VERIFIER_nondet_double() [L88] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L88] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L89] var_1_4 = __VERIFIER_nondet_double() [L90] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_5=99/2, var_1_9=-25] [L90] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_5=99/2, var_1_9=-25] [L91] var_1_5 = __VERIFIER_nondet_double() [L92] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L92] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L93] var_1_11 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L94] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L95] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L95] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L96] var_1_12 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L97] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L98] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L98] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L99] var_1_13 = __VERIFIER_nondet_double() [L100] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L100] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L101] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L101] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L102] var_1_15 = __VERIFIER_nondet_float() [L103] CALL assume_abort_if_not((var_1_15 >= 4611686.018427387900e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L103] RET assume_abort_if_not((var_1_15 >= 4611686.018427387900e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L104] var_1_16 = __VERIFIER_nondet_float() [L105] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L105] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L106] var_1_17 = __VERIFIER_nondet_float() [L107] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L107] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L108] var_1_20 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L109] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L110] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L110] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L111] var_1_21 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L112] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L113] CALL assume_abort_if_not(var_1_21 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L113] RET assume_abort_if_not(var_1_21 <= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L114] var_1_23 = __VERIFIER_nondet_ulong() [L115] CALL assume_abort_if_not(var_1_23 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_9=-25] [L115] RET assume_abort_if_not(var_1_23 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_9=-25] [L116] CALL assume_abort_if_not(var_1_23 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_9=-25] [L116] RET assume_abort_if_not(var_1_23 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_9=-25] [L130] RET updateVariables() [L131] CALL step() [L46] signed long int stepLocal_0 = last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=200, stepLocal_0=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_9=-25] [L47] COND TRUE stepLocal_0 >= last_1_var_1_10 [L48] var_1_9 = (-256 + last_1_var_1_10) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_9=-56] [L52] signed short int stepLocal_1 = var_1_9; VAL [isInitial=1, last_1_var_1_10=200, stepLocal_1=-56, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_9=-56] [L53] COND FALSE !(stepLocal_1 > 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_9=-56] [L56] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_9=-56] [L59] COND TRUE ! (var_1_5 > (255.9 / var_1_13)) [L60] var_1_10 = var_1_12 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=-256, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_9=-56] [L63] COND TRUE ((var_1_2 - var_1_3) * var_1_4) < var_1_5 [L64] var_1_1 = ((((-8) < ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10)))))) ? (-8) : ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))))))) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=-256, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_9=-56] [L68] COND FALSE !((var_1_17 <= (- var_1_16)) && var_1_19) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=-256, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_9=-56] [L71] COND FALSE !(\read(var_1_19)) [L74] var_1_22 = (((((var_1_23 - var_1_9)) < (var_1_10)) ? ((var_1_23 - var_1_9)) : (var_1_10))) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=-256, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_9=-56] [L76] COND TRUE ! var_1_19 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=-256, var_1_11=1, var_1_12=-256, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_9=-56] [L77] COND FALSE !(((var_1_15 - var_1_16) - var_1_17) <= var_1_13) [L80] var_1_14 = var_1_18 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=-256, var_1_11=1, var_1_12=-256, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_9=-56] [L131] RET step() [L132] CALL, EXPR property() [L122-L123] return (((((((((var_1_2 - var_1_3) * var_1_4) < var_1_5) ? (var_1_1 == ((signed short int) ((((-8) < ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10)))))) ? (-8) : ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))))))))) : (var_1_1 == ((signed short int) var_1_10))) && ((last_1_var_1_10 >= last_1_var_1_10) ? (var_1_9 == ((signed short int) (-256 + last_1_var_1_10))) : (var_1_9 == ((signed short int) (last_1_var_1_10 + last_1_var_1_10))))) && (var_1_19 ? (var_1_10 == ((unsigned char) ((((0) < (var_1_12)) ? (0) : (var_1_12))))) : ((! (var_1_5 > (255.9 / var_1_13))) ? (var_1_10 == ((unsigned char) var_1_12)) : 1))) && ((! var_1_19) ? ((((var_1_15 - var_1_16) - var_1_17) <= var_1_13) ? (var_1_14 == ((unsigned short int) var_1_18)) : (var_1_14 == ((unsigned short int) var_1_18))) : 1)) && (((var_1_17 <= (- var_1_16)) && var_1_19) ? (var_1_18 == ((signed short int) var_1_10)) : 1)) && ((var_1_9 > 0) ? (var_1_19 == ((unsigned char) ((var_1_5 >= (- var_1_15)) && (var_1_11 && (var_1_20 && var_1_21))))) : 1)) && (var_1_19 ? (var_1_22 == ((unsigned long int) (var_1_9 + var_1_10))) : (var_1_22 == ((unsigned long int) (((((var_1_23 - var_1_9)) < (var_1_10)) ? ((var_1_23 - var_1_9)) : (var_1_10)))))) ; VAL [\result=0, isInitial=1, last_1_var_1_10=200, var_1_10=-256, var_1_11=1, var_1_12=-256, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_9=-56] [L132] RET, EXPR property() [L132] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=-256, var_1_11=1, var_1_12=-256, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_9=-56] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=200, var_1_10=-256, var_1_11=1, var_1_12=-256, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_9=-56] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 4, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 119 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 119 mSDsluCounter, 544 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 296 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37 IncrementalHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 248 mSDtfsCounter, 37 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=2, InterpolantAutomatonStates: 10, 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, 3 MinimizatonAttempts, 54 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 502 NumberOfCodeBlocks, 502 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 372 ConstructedInterpolants, 0 QuantifiedInterpolants, 784 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2052/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 [2024-11-08 19:17:38,049 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-80.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fe1fe0b5e0a3ec8c50f7deed8e5c41ff7c08f0d5f402373171036b554bec1d5c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 19:17:40,952 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:17:41,093 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 19:17:41,102 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:17:41,106 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:17:41,155 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:17:41,156 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:17:41,156 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:17:41,157 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:17:41,160 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:17:41,161 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:17:41,161 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:17:41,162 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:17:41,166 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:17:41,167 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:17:41,167 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:17:41,167 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:17:41,168 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:17:41,168 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:17:41,169 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:17:41,169 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:17:41,172 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:17:41,172 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:17:41,173 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 19:17:41,173 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 19:17:41,173 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:17:41,174 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 19:17:41,174 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:17:41,175 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:17:41,175 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:17:41,175 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:17:41,176 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:17:41,176 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:17:41,177 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:17:41,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:17:41,177 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:17:41,178 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:17:41,181 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:17:41,181 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 19:17:41,182 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 19:17:41,182 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:17:41,183 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:17:41,183 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:17:41,184 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:17:41,185 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_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fe1fe0b5e0a3ec8c50f7deed8e5c41ff7c08f0d5f402373171036b554bec1d5c [2024-11-08 19:17:41,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:17:41,724 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:17:41,728 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:17:41,730 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:17:41,730 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:17:41,732 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-80.i Unable to find full path for "g++" [2024-11-08 19:17:44,190 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:17:44,510 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:17:44,511 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-80.i [2024-11-08 19:17:44,528 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/data/bcfc83036/8c6ff9ba829d418eac99fa23bec6ca73/FLAG7bda9e36d [2024-11-08 19:17:44,788 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/data/bcfc83036/8c6ff9ba829d418eac99fa23bec6ca73 [2024-11-08 19:17:44,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:17:44,800 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:17:44,802 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:17:44,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:17:44,812 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:17:44,813 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:17:44" (1/1) ... [2024-11-08 19:17:44,814 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6930129b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:44, skipping insertion in model container [2024-11-08 19:17:44,815 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:17:44" (1/1) ... [2024-11-08 19:17:44,862 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:17:45,150 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-80.i[915,928] [2024-11-08 19:17:45,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:17:45,278 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:17:45,299 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-80.i[915,928] [2024-11-08 19:17:45,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:17:45,360 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:17:45,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:45 WrapperNode [2024-11-08 19:17:45,362 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:17:45,363 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:17:45,363 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:17:45,364 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:17:45,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:45" (1/1) ... [2024-11-08 19:17:45,396 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:45" (1/1) ... [2024-11-08 19:17:45,452 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2024-11-08 19:17:45,456 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:17:45,457 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:17:45,457 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:17:45,457 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:17:45,476 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:45" (1/1) ... [2024-11-08 19:17:45,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:45" (1/1) ... [2024-11-08 19:17:45,502 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:45" (1/1) ... [2024-11-08 19:17:45,531 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 19:17:45,535 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:45" (1/1) ... [2024-11-08 19:17:45,535 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:45" (1/1) ... [2024-11-08 19:17:45,555 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:45" (1/1) ... [2024-11-08 19:17:45,577 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:45" (1/1) ... [2024-11-08 19:17:45,582 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:45" (1/1) ... [2024-11-08 19:17:45,588 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:45" (1/1) ... [2024-11-08 19:17:45,597 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:17:45,598 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:17:45,598 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:17:45,602 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:17:45,603 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:45" (1/1) ... [2024-11-08 19:17:45,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:17:45,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:17:45,650 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:17:45,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:17:45,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:17:45,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 19:17:45,692 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:17:45,693 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:17:45,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:17:45,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:17:45,821 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:17:45,827 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:18:08,992 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 19:18:08,992 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:18:09,018 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:18:09,018 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:18:09,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:18:09 BoogieIcfgContainer [2024-11-08 19:18:09,019 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:18:09,021 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:18:09,022 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:18:09,026 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:18:09,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:17:44" (1/3) ... [2024-11-08 19:18:09,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792efdd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:18:09, skipping insertion in model container [2024-11-08 19:18:09,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:45" (2/3) ... [2024-11-08 19:18:09,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792efdd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:18:09, skipping insertion in model container [2024-11-08 19:18:09,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:18:09" (3/3) ... [2024-11-08 19:18:09,033 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-80.i [2024-11-08 19:18:09,065 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:18:09,066 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:18:09,168 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:18:09,181 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6747d6e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:18:09,181 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:18:09,186 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 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) [2024-11-08 19:18:09,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 19:18:09,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:09,202 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:09,202 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:09,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:09,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1893642822, now seen corresponding path program 1 times [2024-11-08 19:18:09,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 19:18:09,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099543922] [2024-11-08 19:18:09,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:09,225 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:18:09,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 19:18:09,227 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:18:09,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 19:18:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:10,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 19:18:10,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:18:11,057 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 19:18:11,061 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:18:11,062 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 19:18:11,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1099543922] [2024-11-08 19:18:11,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1099543922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:11,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:11,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:18:11,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075031642] [2024-11-08 19:18:11,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:11,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:18:11,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 19:18:11,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:18:11,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:18:11,119 INFO L87 Difference]: Start difference. First operand has 61 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 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 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 19:18:15,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 19:18:19,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 19:18:23,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 19:18:27,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 19:18:27,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:27,943 INFO L93 Difference]: Finished difference Result 169 states and 299 transitions. [2024-11-08 19:18:28,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:18:28,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 125 [2024-11-08 19:18:28,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:28,058 INFO L225 Difference]: With dead ends: 169 [2024-11-08 19:18:28,058 INFO L226 Difference]: Without dead ends: 111 [2024-11-08 19:18:28,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:28,066 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 80 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:28,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 232 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 4 Unknown, 0 Unchecked, 16.7s Time] [2024-11-08 19:18:28,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-08 19:18:28,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 59. [2024-11-08 19:18:28,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 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) [2024-11-08 19:18:28,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2024-11-08 19:18:28,122 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 125 [2024-11-08 19:18:28,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:28,125 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2024-11-08 19:18:28,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 19:18:28,126 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2024-11-08 19:18:28,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 19:18:28,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:28,130 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:28,150 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 19:18:28,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:18:28,332 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:28,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:28,333 INFO L85 PathProgramCache]: Analyzing trace with hash 2008297464, now seen corresponding path program 1 times [2024-11-08 19:18:28,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 19:18:28,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584365283] [2024-11-08 19:18:28,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:28,336 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:18:28,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 19:18:28,338 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:18:28,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 19:18:29,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:29,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 19:18:29,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:18:32,765 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 19:18:32,769 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:18:32,770 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 19:18:32,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1584365283] [2024-11-08 19:18:32,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1584365283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:32,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:32,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:18:32,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470901264] [2024-11-08 19:18:32,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:32,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:18:32,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 19:18:32,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:18:32,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:18:32,776 INFO L87 Difference]: Start difference. First operand 59 states and 86 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 19:18:37,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:18:41,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:18:41,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:41,634 INFO L93 Difference]: Finished difference Result 169 states and 248 transitions. [2024-11-08 19:18:41,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:18:41,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 125 [2024-11-08 19:18:41,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:41,741 INFO L225 Difference]: With dead ends: 169 [2024-11-08 19:18:41,741 INFO L226 Difference]: Without dead ends: 113 [2024-11-08 19:18:41,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:18:41,744 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 14 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:41,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 157 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 10 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2024-11-08 19:18:41,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-08 19:18:41,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2024-11-08 19:18:41,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-08 19:18:41,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 160 transitions. [2024-11-08 19:18:41,772 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 160 transitions. Word has length 125 [2024-11-08 19:18:41,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:41,774 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 160 transitions. [2024-11-08 19:18:41,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 19:18:41,774 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 160 transitions. [2024-11-08 19:18:41,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 19:18:41,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:41,778 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:41,803 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 19:18:41,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:18:41,979 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:41,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:41,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1635477384, now seen corresponding path program 1 times [2024-11-08 19:18:41,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 19:18:41,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40018119] [2024-11-08 19:18:41,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:41,983 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:18:41,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 19:18:41,988 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:18:41,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 19:18:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:43,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 19:18:43,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:18:46,447 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 19:18:46,448 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:18:46,448 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 19:18:46,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40018119] [2024-11-08 19:18:46,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [40018119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:46,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:46,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:18:46,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213075108] [2024-11-08 19:18:46,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:46,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:18:46,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 19:18:46,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:18:46,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:46,453 INFO L87 Difference]: Start difference. First operand 111 states and 160 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 19:18:49,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:18:53,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:18:58,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:19:02,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:19:06,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:19:10,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:19:11,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:19:16,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:19:20,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:19:24,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:19:28,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:19:32,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:19:36,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:19:40,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:19:44,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:19:48,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:19:52,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:19:52,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:19:52,345 INFO L93 Difference]: Finished difference Result 285 states and 407 transitions. [2024-11-08 19:19:52,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:19:52,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 125 [2024-11-08 19:19:52,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:19:52,456 INFO L225 Difference]: With dead ends: 285 [2024-11-08 19:19:52,456 INFO L226 Difference]: Without dead ends: 177 [2024-11-08 19:19:52,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:19:52,459 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 57 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 39 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 65.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 65.7s IncrementalHoareTripleChecker+Time [2024-11-08 19:19:52,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 287 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 60 Invalid, 14 Unknown, 0 Unchecked, 65.7s Time] [2024-11-08 19:19:52,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-08 19:19:52,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 163. [2024-11-08 19:19:52,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 102 states have (on average 1.1764705882352942) internal successors, (120), 102 states have internal predecessors, (120), 57 states have call successors, (57), 3 states have call predecessors, (57), 3 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-08 19:19:52,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 234 transitions. [2024-11-08 19:19:52,537 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 234 transitions. Word has length 125 [2024-11-08 19:19:52,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:19:52,539 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 234 transitions. [2024-11-08 19:19:52,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 19:19:52,540 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 234 transitions. [2024-11-08 19:19:52,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 19:19:52,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:19:52,543 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:19:52,568 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-08 19:19:52,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:19:52,744 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:19:52,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:19:52,745 INFO L85 PathProgramCache]: Analyzing trace with hash 639194679, now seen corresponding path program 1 times [2024-11-08 19:19:52,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 19:19:52,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268267100] [2024-11-08 19:19:52,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:19:52,746 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:19:52,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 19:19:52,755 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:19:52,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_098ff250-4e3b-47b4-87b3-338d75acc4b6/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 19:19:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:54,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 19:19:54,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:20:13,599 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:20:21,720 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:20:29,787 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:20:33,823 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~var_1_9~0 ((_ extract 15 0) (bvadd ((_ zero_extend 24) c_~last_1_var_1_10~0) (_ bv4294967040 32)))) (fp.lt (fp.mul c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_2~0 c_~var_1_3~0) c_~var_1_4~0) c_~var_1_5~0) (= c_~var_1_12~0 c_~var_1_10~0) (bvsle ((_ zero_extend 24) c_~var_1_21~0) (_ bv0 32)) (= (_ bv0 16) (bvadd c_~var_1_1~0 (_ bv8 16)))) is different from false [2024-11-08 19:20:37,853 WARN L873 $PredicateComparison]: unable to prove that (and (= c_~var_1_9~0 ((_ extract 15 0) (bvadd ((_ zero_extend 24) c_~last_1_var_1_10~0) (_ bv4294967040 32)))) (fp.lt (fp.mul c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_2~0 c_~var_1_3~0) c_~var_1_4~0) c_~var_1_5~0) (= c_~var_1_12~0 c_~var_1_10~0) (bvsle ((_ zero_extend 24) c_~var_1_21~0) (_ bv0 32)) (= (_ bv0 16) (bvadd c_~var_1_1~0 (_ bv8 16)))) is different from true [2024-11-08 19:20:43,877 WARN L286 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:20:51,571 WARN L286 SmtUtils]: Spent 7.69s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:21:01,987 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:21:31,601 WARN L286 SmtUtils]: Spent 7.84s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:21:40,003 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:21:48,126 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:21:56,248 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:22:04,317 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:22:08,355 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse0 (bvadd (bvneg ((_ sign_extend 16) c_~var_1_9~0)) c_~var_1_23~0)) (.cse2 ((_ zero_extend 24) c_~var_1_10~0))) (let ((.cse1 (bvult .cse0 .cse2))) (or (and (= c_~var_1_22~0 .cse0) .cse1) (and (= c_~var_1_22~0 .cse2) (not .cse1))))) (= c_~var_1_9~0 ((_ extract 15 0) (bvadd ((_ zero_extend 24) c_~last_1_var_1_10~0) (_ bv4294967040 32)))) (fp.lt (fp.mul c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_2~0 c_~var_1_3~0) c_~var_1_4~0) c_~var_1_5~0) (= c_~var_1_12~0 c_~var_1_10~0) (bvsle ((_ zero_extend 24) c_~var_1_21~0) (_ bv0 32)) (= (_ bv0 16) (bvadd c_~var_1_1~0 (_ bv8 16))) (= (_ bv0 8) c_~var_1_19~0)) is different from false [2024-11-08 19:22:12,391 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse0 (bvadd (bvneg ((_ sign_extend 16) c_~var_1_9~0)) c_~var_1_23~0)) (.cse2 ((_ zero_extend 24) c_~var_1_10~0))) (let ((.cse1 (bvult .cse0 .cse2))) (or (and (= c_~var_1_22~0 .cse0) .cse1) (and (= c_~var_1_22~0 .cse2) (not .cse1))))) (= c_~var_1_9~0 ((_ extract 15 0) (bvadd ((_ zero_extend 24) c_~last_1_var_1_10~0) (_ bv4294967040 32)))) (fp.lt (fp.mul c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_2~0 c_~var_1_3~0) c_~var_1_4~0) c_~var_1_5~0) (= c_~var_1_12~0 c_~var_1_10~0) (bvsle ((_ zero_extend 24) c_~var_1_21~0) (_ bv0 32)) (= (_ bv0 16) (bvadd c_~var_1_1~0 (_ bv8 16))) (= (_ bv0 8) c_~var_1_19~0)) is different from true [2024-11-08 19:22:28,845 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:22:36,048 WARN L286 SmtUtils]: Spent 7.20s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:22:44,171 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:22:52,119 WARN L286 SmtUtils]: Spent 7.95s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:22:57,137 WARN L286 SmtUtils]: Spent 5.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:23:05,292 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:23:10,521 WARN L286 SmtUtils]: Spent 5.23s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:23:18,589 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:23:26,497 WARN L286 SmtUtils]: Spent 7.88s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:23:34,622 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:23:42,797 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:23:50,996 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:23:59,131 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:24:10,137 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:24:18,173 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:24:30,431 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:24:38,499 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:24:42,555 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse0 (bvadd (bvneg ((_ sign_extend 16) c_~var_1_9~0)) c_~var_1_23~0)) (.cse2 ((_ zero_extend 24) c_~var_1_10~0))) (let ((.cse1 (bvult .cse0 .cse2))) (or (and (= c_~var_1_22~0 .cse0) .cse1) (and (= c_~var_1_22~0 .cse2) (not .cse1))))) (= c_~var_1_9~0 ((_ extract 15 0) (bvadd ((_ zero_extend 24) c_~last_1_var_1_10~0) (_ bv4294967040 32)))) (fp.lt (fp.mul c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_2~0 c_~var_1_3~0) c_~var_1_4~0) c_~var_1_5~0) (= c_~var_1_12~0 c_~var_1_10~0) (bvsle ((_ zero_extend 24) c_~var_1_21~0) (_ bv0 32)) (= c_~var_1_18~0 c_~var_1_14~0) (= (_ bv0 16) (bvadd c_~var_1_1~0 (_ bv8 16))) (= (_ bv0 8) c_~var_1_19~0)) is different from false [2024-11-08 19:24:46,601 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse0 (bvadd (bvneg ((_ sign_extend 16) c_~var_1_9~0)) c_~var_1_23~0)) (.cse2 ((_ zero_extend 24) c_~var_1_10~0))) (let ((.cse1 (bvult .cse0 .cse2))) (or (and (= c_~var_1_22~0 .cse0) .cse1) (and (= c_~var_1_22~0 .cse2) (not .cse1))))) (= c_~var_1_9~0 ((_ extract 15 0) (bvadd ((_ zero_extend 24) c_~last_1_var_1_10~0) (_ bv4294967040 32)))) (fp.lt (fp.mul c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_2~0 c_~var_1_3~0) c_~var_1_4~0) c_~var_1_5~0) (= c_~var_1_12~0 c_~var_1_10~0) (bvsle ((_ zero_extend 24) c_~var_1_21~0) (_ bv0 32)) (= c_~var_1_18~0 c_~var_1_14~0) (= (_ bv0 16) (bvadd c_~var_1_1~0 (_ bv8 16))) (= (_ bv0 8) c_~var_1_19~0)) is different from true