./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-30.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_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/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_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-30.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/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_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/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 4fcc2ce47bc034780fb01758f27a0099ceca40e7fe000487fe647a6fb5f368a8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:07:55,824 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:07:55,890 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 17:07:55,896 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:07:55,899 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:07:55,934 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:07:55,934 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:07:55,935 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:07:55,935 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:07:55,936 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:07:55,936 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:07:55,936 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:07:55,937 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:07:55,937 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:07:55,938 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:07:55,938 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:07:55,938 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:07:55,939 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:07:55,939 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:07:55,942 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:07:55,944 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:07:55,947 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:07:55,948 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:07:55,949 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:07:55,949 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:07:55,949 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:07:55,950 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:07:55,950 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:07:55,951 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:07:55,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:07:55,952 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:07:55,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:07:55,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:07:55,953 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:07:55,954 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:07:55,954 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:07:55,954 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:07:55,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:07:55,955 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:07:55,955 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:07:55,955 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:07:55,956 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:07:55,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_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/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_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/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 -> 4fcc2ce47bc034780fb01758f27a0099ceca40e7fe000487fe647a6fb5f368a8 [2024-11-08 17:07:56,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:07:56,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:07:56,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:07:56,252 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:07:56,253 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:07:56,254 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-30.i Unable to find full path for "g++" [2024-11-08 17:07:58,218 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:07:58,466 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:07:58,467 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-30.i [2024-11-08 17:07:58,475 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/bin/uautomizer-verify-jihMAELWvX/data/1a346ec69/bd9aa2ced9df44069a42ee6337eedea9/FLAG7e0ce0534 [2024-11-08 17:07:58,805 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/bin/uautomizer-verify-jihMAELWvX/data/1a346ec69/bd9aa2ced9df44069a42ee6337eedea9 [2024-11-08 17:07:58,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:07:58,810 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:07:58,811 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:07:58,811 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:07:58,819 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:07:58,822 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:07:58" (1/1) ... [2024-11-08 17:07:58,824 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ae8853d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:07:58, skipping insertion in model container [2024-11-08 17:07:58,824 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:07:58" (1/1) ... [2024-11-08 17:07:58,852 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:07:59,047 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_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-30.i[915,928] [2024-11-08 17:07:59,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:07:59,105 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:07:59,117 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_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-30.i[915,928] [2024-11-08 17:07:59,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:07:59,157 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:07:59,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:07:59 WrapperNode [2024-11-08 17:07:59,158 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:07:59,159 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:07:59,159 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:07:59,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:07:59,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:07:59" (1/1) ... [2024-11-08 17:07:59,173 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:07:59" (1/1) ... [2024-11-08 17:07:59,205 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 86 [2024-11-08 17:07:59,205 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:07:59,206 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:07:59,206 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:07:59,207 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:07:59,220 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:07:59" (1/1) ... [2024-11-08 17:07:59,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:07:59" (1/1) ... [2024-11-08 17:07:59,223 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:07:59" (1/1) ... [2024-11-08 17:07:59,239 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 17:07:59,240 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:07:59" (1/1) ... [2024-11-08 17:07:59,240 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:07:59" (1/1) ... [2024-11-08 17:07:59,246 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:07:59" (1/1) ... [2024-11-08 17:07:59,250 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:07:59" (1/1) ... [2024-11-08 17:07:59,252 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:07:59" (1/1) ... [2024-11-08 17:07:59,253 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:07:59" (1/1) ... [2024-11-08 17:07:59,256 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:07:59,257 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:07:59,258 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:07:59,258 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:07:59,259 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:07:59" (1/1) ... [2024-11-08 17:07:59,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:07:59,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:07:59,303 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:07:59,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:07:59,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:07:59,348 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:07:59,348 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:07:59,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 17:07:59,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:07:59,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:07:59,454 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:07:59,459 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:07:59,889 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 17:07:59,889 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:07:59,906 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:07:59,910 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:07:59,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:07:59 BoogieIcfgContainer [2024-11-08 17:07:59,911 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:07:59,917 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:07:59,918 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:07:59,923 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:07:59,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:07:58" (1/3) ... [2024-11-08 17:07:59,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25fe9cd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:07:59, skipping insertion in model container [2024-11-08 17:07:59,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:07:59" (2/3) ... [2024-11-08 17:07:59,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25fe9cd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:07:59, skipping insertion in model container [2024-11-08 17:07:59,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:07:59" (3/3) ... [2024-11-08 17:07:59,931 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-30.i [2024-11-08 17:07:59,956 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:07:59,956 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:08:00,049 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:08:00,060 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;@1340d461, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:08:00,060 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:08:00,067 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-08 17:08:00,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-08 17:08:00,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:08:00,084 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:08:00,085 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:08:00,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:08:00,093 INFO L85 PathProgramCache]: Analyzing trace with hash -224234091, now seen corresponding path program 1 times [2024-11-08 17:08:00,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:08:00,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974450295] [2024-11-08 17:08:00,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:08:00,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:08:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:08:00,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:08:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:08:00,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:08:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:08:00,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:08:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:08:00,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:08:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:08:00,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 17:08:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:08:00,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:08:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:08:00,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 17:08:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:08:00,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 17:08:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:08:00,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 17:08:00,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:08:00,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:08:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:08:00,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:08:00,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:08:00,556 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-08 17:08:00,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:08:00,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974450295] [2024-11-08 17:08:00,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974450295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:08:00,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:08:00,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:08:00,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871531988] [2024-11-08 17:08:00,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:08:00,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:08:00,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:08:00,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:08:00,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:08:00,600 INFO L87 Difference]: Start difference. First operand has 42 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-08 17:08:00,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:08:00,644 INFO L93 Difference]: Finished difference Result 77 states and 127 transitions. [2024-11-08 17:08:00,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:08:00,648 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 74 [2024-11-08 17:08:00,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:08:00,658 INFO L225 Difference]: With dead ends: 77 [2024-11-08 17:08:00,659 INFO L226 Difference]: Without dead ends: 38 [2024-11-08 17:08:00,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:08:00,672 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:08:00,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:08:00,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-08 17:08:00,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-08 17:08:00,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-08 17:08:00,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2024-11-08 17:08:00,746 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 74 [2024-11-08 17:08:00,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:08:00,749 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2024-11-08 17:08:00,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-08 17:08:00,749 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2024-11-08 17:08:00,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-08 17:08:00,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:08:00,756 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:08:00,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:08:00,757 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:08:00,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:08:00,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1128730733, now seen corresponding path program 1 times [2024-11-08 17:08:00,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:08:00,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361033990] [2024-11-08 17:08:00,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:08:00,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:08:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 17:08:00,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1558541680] [2024-11-08 17:08:00,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:08:00,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:08:00,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:08:00,974 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:08:00,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 17:08:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:08:01,141 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 17:08:01,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:08:01,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 17:08:01,280 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 17:08:01,283 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 17:08:01,310 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 17:08:01,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:08:01,492 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-08 17:08:01,567 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 17:08:01,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 05:08:01 BoogieIcfgContainer [2024-11-08 17:08:01,574 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 17:08:01,575 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 17:08:01,575 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 17:08:01,575 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 17:08:01,576 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:07:59" (3/4) ... [2024-11-08 17:08:01,579 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 17:08:01,580 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 17:08:01,581 INFO L158 Benchmark]: Toolchain (without parser) took 2771.32ms. Allocated memory is still 163.6MB. Free memory was 131.4MB in the beginning and 112.1MB in the end (delta: 19.4MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2024-11-08 17:08:01,581 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 117.4MB. Free memory is still 72.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:08:01,582 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.15ms. Allocated memory is still 163.6MB. Free memory was 131.1MB in the beginning and 117.4MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 17:08:01,582 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.51ms. Allocated memory is still 163.6MB. Free memory was 117.4MB in the beginning and 115.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 17:08:01,583 INFO L158 Benchmark]: Boogie Preprocessor took 50.39ms. Allocated memory is still 163.6MB. Free memory was 115.0MB in the beginning and 111.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 17:08:01,583 INFO L158 Benchmark]: RCFGBuilder took 654.18ms. Allocated memory is still 163.6MB. Free memory was 111.9MB in the beginning and 96.8MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 17:08:01,584 INFO L158 Benchmark]: TraceAbstraction took 1656.77ms. Allocated memory is still 163.6MB. Free memory was 96.1MB in the beginning and 112.1MB in the end (delta: -15.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:08:01,584 INFO L158 Benchmark]: Witness Printer took 5.50ms. Allocated memory is still 163.6MB. Free memory is still 112.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:08:01,587 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 is still 72.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 347.15ms. Allocated memory is still 163.6MB. Free memory was 131.1MB in the beginning and 117.4MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.51ms. Allocated memory is still 163.6MB. Free memory was 117.4MB in the beginning and 115.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.39ms. Allocated memory is still 163.6MB. Free memory was 115.0MB in the beginning and 111.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 654.18ms. Allocated memory is still 163.6MB. Free memory was 111.9MB in the beginning and 96.8MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1656.77ms. Allocated memory is still 163.6MB. Free memory was 96.1MB in the beginning and 112.1MB in the end (delta: -15.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.50ms. Allocated memory is still 163.6MB. Free memory is still 112.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 64; [L23] unsigned char var_1_2 = 0; [L24] signed short int var_1_5 = 8; [L25] signed short int var_1_6 = -32; [L26] unsigned char var_1_7 = 100; [L27] signed long int var_1_8 = 32; [L28] float var_1_10 = 255.3; [L29] float var_1_13 = 2.8; [L30] signed long int last_1_var_1_8 = 32; VAL [isInitial=0, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=0, var_1_5=8, var_1_6=-32, var_1_7=100, var_1_8=32] [L86] isInitial = 1 [L87] FCALL initially() [L88] COND TRUE 1 [L89] CALL updateLastVariables() [L79] last_1_var_1_8 = var_1_8 VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=0, var_1_5=8, var_1_6=-32, var_1_7=100, var_1_8=32] [L89] RET updateLastVariables() [L90] CALL updateVariables() [L61] var_1_2 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_5=8, var_1_6=-32, var_1_7=100, var_1_8=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_5=8, var_1_6=-32, var_1_7=100, var_1_8=32] [L62] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_5=8, var_1_6=-32, var_1_7=100, var_1_8=32] [L63] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=0, var_1_5=8, var_1_6=-32, var_1_7=100, var_1_8=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=0, var_1_5=8, var_1_6=-32, var_1_7=100, var_1_8=32] [L63] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=0, var_1_5=8, var_1_6=-32, var_1_7=100, var_1_8=32] [L64] var_1_5 = __VERIFIER_nondet_short() [L65] CALL assume_abort_if_not(var_1_5 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=0, var_1_5=-32767, var_1_6=-32, var_1_7=100, var_1_8=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=0, var_1_5=-32767, var_1_6=-32, var_1_7=100, var_1_8=32] [L65] RET assume_abort_if_not(var_1_5 >= -32768) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=0, var_1_5=-32767, var_1_6=-32, var_1_7=100, var_1_8=32] [L66] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=0, var_1_5=-32767, var_1_6=-32, var_1_7=100, var_1_8=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=0, var_1_5=-32767, var_1_6=-32, var_1_7=100, var_1_8=32] [L66] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=0, var_1_5=-32767, var_1_6=-32, var_1_7=100, var_1_8=32] [L67] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=0, var_1_5=-32767, var_1_6=-32, var_1_7=100, var_1_8=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=0, var_1_5=-32767, var_1_6=-32, var_1_7=100, var_1_8=32] [L67] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=0, var_1_5=-32767, var_1_6=-32, var_1_7=100, var_1_8=32] [L68] var_1_6 = __VERIFIER_nondet_short() [L69] CALL assume_abort_if_not(var_1_6 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=0, var_1_5=-32767, var_1_6=2, var_1_7=100, var_1_8=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=0, var_1_5=-32767, var_1_6=2, var_1_7=100, var_1_8=32] [L69] RET assume_abort_if_not(var_1_6 >= -32768) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=0, var_1_5=-32767, var_1_6=2, var_1_7=100, var_1_8=32] [L70] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=0, var_1_5=-32767, var_1_6=2, var_1_7=100, var_1_8=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=0, var_1_5=-32767, var_1_6=2, var_1_7=100, var_1_8=32] [L70] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=0, var_1_5=-32767, var_1_6=2, var_1_7=100, var_1_8=32] [L71] CALL assume_abort_if_not(var_1_6 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=0, var_1_5=-32767, var_1_6=2, var_1_7=100, var_1_8=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=0, var_1_5=-32767, var_1_6=2, var_1_7=100, var_1_8=32] [L71] RET assume_abort_if_not(var_1_6 != 0) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=0, var_1_5=-32767, var_1_6=2, var_1_7=100, var_1_8=32] [L72] var_1_7 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=0, var_1_5=-32767, var_1_6=2, var_1_8=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=0, var_1_5=-32767, var_1_6=2, var_1_8=32] [L73] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=0, var_1_5=-32767, var_1_6=2, var_1_8=32] [L74] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=0, var_1_5=-32767, var_1_6=2, var_1_7=256, var_1_8=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=0, var_1_5=-32767, var_1_6=2, var_1_7=256, var_1_8=32] [L74] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=0, var_1_5=-32767, var_1_6=2, var_1_7=256, var_1_8=32] [L75] var_1_13 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_1=64, var_1_2=0, var_1_5=-32767, var_1_6=2, var_1_7=256, var_1_8=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_1=64, var_1_2=0, var_1_5=-32767, var_1_6=2, var_1_7=256, var_1_8=32] [L76] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_1=64, var_1_2=0, var_1_5=-32767, var_1_6=2, var_1_7=256, var_1_8=32] [L90] RET updateVariables() [L91] CALL step() [L34] signed long int stepLocal_0 = (last_1_var_1_8 / var_1_5) % var_1_6; VAL [isInitial=1, last_1_var_1_8=32, stepLocal_0=0, var_1_10=2553/10, var_1_1=64, var_1_2=0, var_1_5=-32767, var_1_6=2, var_1_7=256, var_1_8=32] [L35] COND FALSE !(\read(var_1_2)) [L40] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_8=32, stepLocal_0=0, var_1_10=2553/10, var_1_1=256, var_1_2=0, var_1_5=-32767, var_1_6=2, var_1_7=256, var_1_8=32] [L42] unsigned char stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_8=32, stepLocal_0=0, stepLocal_1=256, var_1_10=2553/10, var_1_1=256, var_1_2=0, var_1_5=-32767, var_1_6=2, var_1_7=256, var_1_8=32] [L43] COND FALSE !(stepLocal_1 < var_1_5) [L46] var_1_8 = var_1_7 VAL [isInitial=1, last_1_var_1_8=32, stepLocal_0=0, var_1_10=2553/10, var_1_1=256, var_1_2=0, var_1_5=-32767, var_1_6=2, var_1_7=256, var_1_8=0] [L48] COND TRUE ((var_1_6 * var_1_8) * var_1_7) <= (var_1_8 - var_1_1) VAL [isInitial=1, last_1_var_1_8=32, stepLocal_0=0, var_1_10=2553/10, var_1_1=256, var_1_2=0, var_1_5=-32767, var_1_6=2, var_1_7=256, var_1_8=0] [L49] COND TRUE var_1_5 <= (var_1_8 + var_1_8) [L50] var_1_10 = var_1_13 VAL [isInitial=1, last_1_var_1_8=32, stepLocal_0=0, var_1_10=2, var_1_13=2, var_1_1=256, var_1_2=0, var_1_5=-32767, var_1_6=2, var_1_7=256, var_1_8=0] [L91] RET step() [L92] CALL, EXPR property() [L82-L83] return ((var_1_2 ? ((last_1_var_1_8 > ((last_1_var_1_8 / var_1_5) % var_1_6)) ? (var_1_1 == ((unsigned char) var_1_7)) : 1) : (var_1_1 == ((unsigned char) var_1_7))) && ((var_1_1 < var_1_5) ? (var_1_8 == ((signed long int) (var_1_1 - ((((var_1_7) < (var_1_1)) ? (var_1_7) : (var_1_1)))))) : (var_1_8 == ((signed long int) var_1_7)))) && ((((var_1_6 * var_1_8) * var_1_7) <= (var_1_8 - var_1_1)) ? ((var_1_5 <= (var_1_8 + var_1_8)) ? (var_1_10 == ((float) var_1_13)) : 1) : ((var_1_1 >= var_1_1) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_13)))) ; VAL [\result=0, isInitial=1, last_1_var_1_8=32, var_1_10=2, var_1_13=2, var_1_1=256, var_1_2=0, var_1_5=-32767, var_1_6=2, var_1_7=256, var_1_8=0] [L92] RET, EXPR property() [L92] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2, var_1_13=2, var_1_1=256, var_1_2=0, var_1_5=-32767, var_1_6=2, var_1_7=256, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2, var_1_13=2, var_1_1=256, var_1_2=0, var_1_5=-32767, var_1_6=2, var_1_7=256, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 2, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 53 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 222 NumberOfCodeBlocks, 222 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 73 ConstructedInterpolants, 0 QuantifiedInterpolants, 73 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 220/220 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 17:08:01,637 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/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_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/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_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-30.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/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_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/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 4fcc2ce47bc034780fb01758f27a0099ceca40e7fe000487fe647a6fb5f368a8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:08:04,328 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:08:04,412 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 17:08:04,420 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:08:04,422 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:08:04,456 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:08:04,457 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:08:04,457 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:08:04,458 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:08:04,459 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:08:04,459 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:08:04,459 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:08:04,460 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:08:04,461 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:08:04,461 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:08:04,461 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:08:04,462 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:08:04,467 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:08:04,468 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:08:04,468 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:08:04,468 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:08:04,469 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:08:04,469 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:08:04,469 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 17:08:04,470 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 17:08:04,470 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:08:04,470 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 17:08:04,470 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:08:04,471 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:08:04,471 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:08:04,471 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:08:04,472 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:08:04,474 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:08:04,475 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:08:04,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:08:04,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:08:04,477 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:08:04,477 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:08:04,477 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 17:08:04,478 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 17:08:04,478 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:08:04,478 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:08:04,478 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:08:04,479 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:08:04,479 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_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/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_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/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 -> 4fcc2ce47bc034780fb01758f27a0099ceca40e7fe000487fe647a6fb5f368a8 [2024-11-08 17:08:04,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:08:04,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:08:04,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:08:04,951 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:08:04,951 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:08:04,953 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-30.i Unable to find full path for "g++" [2024-11-08 17:08:06,966 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:08:07,270 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:08:07,271 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-30.i [2024-11-08 17:08:07,282 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/bin/uautomizer-verify-jihMAELWvX/data/67fc449c0/1ce7c2d7334543ccad5cea41ccd1c5a6/FLAGe4ab1de09 [2024-11-08 17:08:07,561 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/bin/uautomizer-verify-jihMAELWvX/data/67fc449c0/1ce7c2d7334543ccad5cea41ccd1c5a6 [2024-11-08 17:08:07,566 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:08:07,568 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:08:07,569 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:08:07,569 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:08:07,577 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:08:07,578 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:08:07" (1/1) ... [2024-11-08 17:08:07,579 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1be19baf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:08:07, skipping insertion in model container [2024-11-08 17:08:07,579 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:08:07" (1/1) ... [2024-11-08 17:08:07,611 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:08:07,809 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_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-30.i[915,928] [2024-11-08 17:08:07,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:08:07,877 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:08:07,891 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_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-30.i[915,928] [2024-11-08 17:08:07,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:08:07,952 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:08:07,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:08:07 WrapperNode [2024-11-08 17:08:07,952 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:08:07,953 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:08:07,954 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:08:07,954 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:08:07,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:08:07" (1/1) ... [2024-11-08 17:08:07,971 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:08:07" (1/1) ... [2024-11-08 17:08:07,994 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 84 [2024-11-08 17:08:07,995 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:08:07,995 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:08:07,995 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:08:07,996 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:08:08,008 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:08:07" (1/1) ... [2024-11-08 17:08:08,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:08:07" (1/1) ... [2024-11-08 17:08:08,011 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:08:07" (1/1) ... [2024-11-08 17:08:08,025 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 17:08:08,026 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:08:07" (1/1) ... [2024-11-08 17:08:08,026 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:08:07" (1/1) ... [2024-11-08 17:08:08,034 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:08:07" (1/1) ... [2024-11-08 17:08:08,038 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:08:07" (1/1) ... [2024-11-08 17:08:08,040 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:08:07" (1/1) ... [2024-11-08 17:08:08,041 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:08:07" (1/1) ... [2024-11-08 17:08:08,045 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:08:08,046 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:08:08,046 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:08:08,046 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:08:08,047 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:08:07" (1/1) ... [2024-11-08 17:08:08,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:08:08,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:08:08,079 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:08:08,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:08:08,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:08:08,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 17:08:08,109 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:08:08,109 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:08:08,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:08:08,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:08:08,190 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:08:08,197 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:08:08,786 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 17:08:08,787 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:08:08,804 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:08:08,804 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:08:08,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:08:08 BoogieIcfgContainer [2024-11-08 17:08:08,805 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:08:08,813 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:08:08,813 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:08:08,816 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:08:08,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:08:07" (1/3) ... [2024-11-08 17:08:08,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@213beaef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:08:08, skipping insertion in model container [2024-11-08 17:08:08,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:08:07" (2/3) ... [2024-11-08 17:08:08,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@213beaef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:08:08, skipping insertion in model container [2024-11-08 17:08:08,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:08:08" (3/3) ... [2024-11-08 17:08:08,822 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-30.i [2024-11-08 17:08:08,840 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:08:08,841 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:08:08,923 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:08:08,930 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;@32d77c7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:08:08,931 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:08:08,936 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-08 17:08:08,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-08 17:08:08,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:08:08,948 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:08:08,949 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:08:08,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:08:08,955 INFO L85 PathProgramCache]: Analyzing trace with hash -224234091, now seen corresponding path program 1 times [2024-11-08 17:08:08,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:08:08,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [354006344] [2024-11-08 17:08:08,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:08:08,972 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 17:08:08,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:08:08,976 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/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 17:08:08,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/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 17:08:09,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:08:09,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 17:08:09,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:08:09,354 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-08 17:08:09,354 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:08:09,357 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:08:09,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [354006344] [2024-11-08 17:08:09,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [354006344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:08:09,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:08:09,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:08:09,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402394354] [2024-11-08 17:08:09,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:08:09,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:08:09,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:08:09,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:08:09,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:08:09,396 INFO L87 Difference]: Start difference. First operand has 42 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-08 17:08:09,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:08:09,427 INFO L93 Difference]: Finished difference Result 77 states and 127 transitions. [2024-11-08 17:08:09,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:08:09,430 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 74 [2024-11-08 17:08:09,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:08:09,439 INFO L225 Difference]: With dead ends: 77 [2024-11-08 17:08:09,439 INFO L226 Difference]: Without dead ends: 38 [2024-11-08 17:08:09,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:08:09,449 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:08:09,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:08:09,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-08 17:08:09,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-08 17:08:09,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-08 17:08:09,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2024-11-08 17:08:09,503 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 74 [2024-11-08 17:08:09,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:08:09,505 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2024-11-08 17:08:09,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-08 17:08:09,506 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2024-11-08 17:08:09,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-08 17:08:09,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:08:09,510 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:08:09,519 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/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 17:08:09,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/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 17:08:09,711 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:08:09,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:08:09,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1128730733, now seen corresponding path program 1 times [2024-11-08 17:08:09,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:08:09,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780822242] [2024-11-08 17:08:09,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:08:09,713 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 17:08:09,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:08:09,718 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/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 17:08:09,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/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 17:08:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:08:10,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 17:08:10,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:08:18,589 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-08 17:08:18,590 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:08:18,591 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:08:18,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780822242] [2024-11-08 17:08:18,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1780822242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:08:18,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:08:18,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 17:08:18,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952182611] [2024-11-08 17:08:18,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:08:18,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 17:08:18,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:08:18,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 17:08:18,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:08:18,597 INFO L87 Difference]: Start difference. First operand 38 states and 53 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-08 17:08:23,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:08:23,941 INFO L93 Difference]: Finished difference Result 109 states and 144 transitions. [2024-11-08 17:08:23,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 17:08:23,945 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 74 [2024-11-08 17:08:23,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:08:23,948 INFO L225 Difference]: With dead ends: 109 [2024-11-08 17:08:23,948 INFO L226 Difference]: Without dead ends: 74 [2024-11-08 17:08:23,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2024-11-08 17:08:23,953 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 104 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:08:23,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 177 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-08 17:08:23,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-08 17:08:23,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 49. [2024-11-08 17:08:23,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-08 17:08:23,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2024-11-08 17:08:23,977 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 74 [2024-11-08 17:08:23,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:08:23,978 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2024-11-08 17:08:23,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-08 17:08:23,978 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2024-11-08 17:08:23,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-08 17:08:23,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:08:23,980 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:08:23,989 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 17:08:24,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/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 17:08:24,185 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:08:24,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:08:24,186 INFO L85 PathProgramCache]: Analyzing trace with hash -892309357, now seen corresponding path program 1 times [2024-11-08 17:08:24,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:08:24,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1473269896] [2024-11-08 17:08:24,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:08:24,187 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 17:08:24,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:08:24,190 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/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 17:08:24,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/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 17:08:24,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:08:24,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-08 17:08:24,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:08:32,126 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 132 proven. 15 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-08 17:08:32,126 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:09:09,659 WARN L286 SmtUtils]: Spent 17.67s on a formula simplification that was a NOOP. DAG size: 107 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 17:09:44,772 WARN L286 SmtUtils]: Spent 18.11s on a formula simplification that was a NOOP. DAG size: 106 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 17:10:35,058 WARN L286 SmtUtils]: Spent 15.77s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 17:11:13,990 WARN L286 SmtUtils]: Spent 20.03s on a formula simplification. DAG size of input: 85 DAG size of output: 82 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 17:11:36,119 WARN L286 SmtUtils]: Spent 7.19s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 17:11:50,950 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-08 17:11:50,950 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:11:50,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1473269896] [2024-11-08 17:11:50,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1473269896] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 17:11:50,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:11:50,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [15] total 26 [2024-11-08 17:11:50,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863652243] [2024-11-08 17:11:50,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:11:50,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 17:11:50,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:11:50,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 17:11:50,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=528, Unknown=6, NotChecked=0, Total=650 [2024-11-08 17:11:50,957 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-08 17:11:57,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 17:12:43,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 17:12:46,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 17:13:01,880 WARN L286 SmtUtils]: Spent 10.78s on a formula simplification. DAG size of input: 76 DAG size of output: 81 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 17:13:04,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 17:13:32,234 WARN L286 SmtUtils]: Spent 22.80s on a formula simplification. DAG size of input: 93 DAG size of output: 98 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 17:13:35,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 17:13:37,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 17:17:34,056 WARN L286 SmtUtils]: Spent 3.77m on a formula simplification. DAG size of input: 211 DAG size of output: 283 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 17:17:35,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 17:17:37,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 17:17:45,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 17:17:47,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 17:17:49,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 17:17:56,379 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse64 ((_ zero_extend 24) c_~var_1_1~0))) (let ((.cse65 (bvneg .cse64)) (.cse19 ((_ zero_extend 24) c_~var_1_7~0))) (let ((.cse17 (= (_ bv0 8) c_~var_1_2~0)) (.cse6 ((_ sign_extend 16) c_~var_1_5~0)) (.cse68 (bvadd .cse65 .cse19))) (let ((.cse62 ((_ sign_extend 16) c_~var_1_6~0)) (.cse20 (bvadd c_~var_1_8~0 .cse65)) (.cse56 (forall ((~var_1_6~0 (_ BitVec 16))) (bvsle (bvmul (bvmul ((_ sign_extend 16) ~var_1_6~0) .cse19) .cse19) .cse68))) (.cse7 (fp.eq c_~var_1_13~0 c_~var_1_13~0)) (.cse66 (bvadd (bvneg .cse19) .cse64)) (.cse70 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse72 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse6) .cse72))) (bvsle (bvmul (bvmul .cse72 .cse19) .cse19) .cse68))))) (.cse16 (= .cse64 .cse19)) (.cse21 (not .cse17))) (let ((.cse4 (bvslt .cse64 .cse6)) (.cse58 (or (and (or .cse16 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse71 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse6) .cse71)) (bvsle (bvmul (bvmul .cse71 .cse19) .cse19) .cse68))))) (or .cse70 .cse16)) .cse21)) (.cse59 (or .cse70 .cse16 .cse17)) (.cse2 (bvslt .cse19 .cse64)) (.cse55 (= .cse66 .cse19)) (.cse53 (or .cse70 .cse17)) (.cse54 (or (and (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse67 ((_ sign_extend 16) ~var_1_6~0))) (or (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse6) .cse67)))) (bvsle (bvmul (bvmul .cse67 .cse19) .cse19) .cse68)))) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse69 ((_ sign_extend 16) ~var_1_6~0))) (or (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse6) .cse69))) (bvsle (bvmul (bvmul .cse69 .cse19) .cse19) .cse68))))) .cse21)) (.cse57 (or .cse56 .cse7)) (.cse42 (bvsle .cse6 (bvmul (_ bv2 32) c_~var_1_8~0))) (.cse35 (= c_~var_1_8~0 .cse66)) (.cse29 (bvsle (bvmul (bvmul c_~var_1_8~0 .cse62) .cse19) .cse20)) (.cse24 (fp.eq c_~var_1_10~0 c_~var_1_13~0)) (.cse30 (= c_~var_1_8~0 .cse19)) (.cse14 (forall ((~var_1_6~0 (_ BitVec 16))) (bvsle (bvmul (bvmul c_~var_1_8~0 ((_ sign_extend 16) ~var_1_6~0)) .cse19) .cse20)))) (let ((.cse13 (= c_~var_1_8~0 (bvadd .cse64 .cse65))) (.cse8 (or .cse30 .cse14)) (.cse10 (or .cse14 .cse7)) (.cse15 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse63 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse6) .cse63))) (bvsle (bvmul (bvmul c_~var_1_8~0 .cse63) .cse19) .cse20))))) (.cse22 (not .cse24)) (.cse28 (not .cse29)) (.cse40 (not .cse30)) (.cse36 (not .cse35)) (.cse41 (not .cse42)) (.cse32 (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse6) .cse62)))) (.cse31 (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse6) .cse62))))) (.cse0 (and (or (let ((.cse60 (bvsle .cse6 (bvmul (_ bv2 32) .cse19))) (.cse61 (and .cse53 .cse54))) (and (or (not .cse60) .cse61) .cse57 (or .cse60 .cse61))) .cse55) (or (not .cse55) (and .cse53 .cse54 .cse57)))) (.cse1 (not .cse2)) (.cse3 (and .cse58 .cse57 .cse59)) (.cse12 (not .cse4))) (and (or (and (or .cse0 .cse1) (or .cse2 .cse3)) .cse4) (or (forall ((~var_1_7~0 (_ BitVec 8)) (~var_1_6~0 (_ BitVec 16))) (let ((.cse5 ((_ zero_extend 24) ~var_1_7~0))) (or (bvsle (bvmul .cse5 (bvmul .cse5 ((_ sign_extend 16) ~var_1_6~0))) (bvadd (bvneg .cse5) .cse5)) (bvslt .cse5 .cse6)))) .cse7) (or .cse2 (let ((.cse9 (or (and (or .cse16 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse18 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsle (bvmul (bvmul c_~var_1_8~0 .cse18) .cse19) .cse20) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse6) .cse18)))))) (or .cse15 .cse16)) .cse21)) (.cse11 (or .cse15 .cse16 .cse17))) (and (or (and .cse8 .cse9 .cse10 .cse11) .cse4) (or .cse12 (and .cse9 .cse10 (or .cse13 .cse14) .cse11))))) (or .cse2 (let ((.cse25 (or .cse21 (and (or .cse16 .cse31) (or .cse16 .cse32)))) (.cse26 (or .cse16 .cse31 .cse17))) (let ((.cse27 (or (and .cse30 .cse25 .cse26 .cse24) .cse4))) (and (or (and (or (let ((.cse23 (and .cse25 .cse26))) (and (or .cse22 .cse23) .cse13 (or .cse24 .cse23))) .cse12) .cse27) .cse28) (or .cse29 (and (or .cse12 (and .cse25 .cse13 .cse26 .cse24)) .cse27)))))) (or .cse1 (let ((.cse37 (or .cse15 .cse17)) (.cse38 (or (and (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse43 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsle (bvmul (bvmul c_~var_1_8~0 .cse43) .cse19) .cse20) (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse6) .cse43))))))) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse44 ((_ sign_extend 16) ~var_1_6~0))) (or (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse6) .cse44))) (bvsle (bvmul (bvmul c_~var_1_8~0 .cse44) .cse19) .cse20))))) .cse21))) (let ((.cse39 (and .cse37 .cse38))) (let ((.cse33 (or .cse39 .cse42)) (.cse34 (or .cse41 .cse39))) (and (or (and (or (and .cse8 .cse10 .cse33 .cse34) .cse35) (or .cse36 (and .cse8 .cse37 .cse38 .cse10))) .cse4) (or .cse12 (and (or .cse39 .cse40) .cse10 (or .cse14 .cse35) (or .cse30 (and .cse33 .cse34))))))))) (or .cse1 (let ((.cse50 (or .cse31 .cse17)) (.cse51 (or (and .cse32 .cse31) .cse21))) (let ((.cse52 (and .cse50 .cse51))) (let ((.cse45 (or .cse41 .cse52)) (.cse46 (or .cse42 .cse52))) (let ((.cse47 (or (and .cse50 .cse30 .cse51 .cse24) .cse36)) (.cse48 (or .cse40 .cse52)) (.cse49 (or .cse30 (and .cse45 .cse46)))) (and (or (and (or (and (or .cse35 (and .cse30 .cse45 .cse24 .cse46)) .cse47) .cse4) (or .cse12 (and .cse48 .cse35 .cse24 .cse49))) .cse29) (or (and (or (and (or .cse35 (and (or .cse22 (and .cse30 .cse45 .cse46)) (or (and .cse50 .cse30 .cse41 .cse51) .cse24))) .cse47) .cse4) (or .cse12 (and (or (and .cse48 (or .cse30 (and .cse50 .cse41 .cse51))) .cse24) (or .cse22 (and .cse48 .cse49)) .cse35))) .cse28))))))) (or (and (or (and (or .cse0 .cse4) (or (and .cse53 .cse54 (or .cse55 .cse56) .cse57) .cse12)) .cse1) (or .cse2 (and (or .cse3 .cse4) (or .cse12 (and .cse58 .cse56 .cse57 .cse59))))) (bvslt ((_ zero_extend 24) |c_ULTIMATE.start_step_~stepLocal_1~0#1|) .cse6))))))))) is different from true [2024-11-08 17:17:59,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 17:18:00,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 17:18:04,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 17:18:10,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 17:18:11,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 17:18:12,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 17:18:14,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 17:18:17,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 17:18:18,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 17:18:23,154 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse66 ((_ zero_extend 24) c_~var_1_1~0))) (let ((.cse21 (bvneg .cse66)) (.cse6 ((_ zero_extend 24) c_~var_1_7~0))) (let ((.cse65 ((_ sign_extend 16) c_~var_1_6~0)) (.cse14 (bvadd (bvneg .cse6) .cse66)) (.cse52 (bvadd c_~var_1_8~0 .cse21)) (.cse5 ((_ sign_extend 16) c_~var_1_5~0))) (let ((.cse13 (= (_ bv0 8) c_~var_1_2~0)) (.cse40 (bvsle .cse5 (bvmul (_ bv2 32) c_~var_1_8~0))) (.cse22 (bvslt .cse66 .cse5)) (.cse25 (= c_~var_1_8~0 .cse6)) (.cse49 (forall ((~var_1_6~0 (_ BitVec 16))) (bvsle (bvmul (bvmul c_~var_1_8~0 ((_ sign_extend 16) ~var_1_6~0)) .cse6) .cse52))) (.cse24 (= c_~var_1_8~0 .cse14)) (.cse16 (bvslt .cse6 .cse66)) (.cse20 (fp.eq c_~var_1_13~0 c_~var_1_13~0)) (.cse36 (bvsle (bvmul (bvmul c_~var_1_8~0 .cse65) .cse6) .cse52))) (let ((.cse35 (not .cse36)) (.cse28 (not .cse20)) (.cse48 (= c_~var_1_8~0 (bvadd .cse66 .cse21))) (.cse42 (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse5) .cse65))))) (.cse17 (= .cse66 .cse6)) (.cse41 (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse5) .cse65)))) (.cse15 (not .cse16)) (.cse37 (not .cse24)) (.cse44 (or .cse25 .cse49)) (.cse32 (not .cse22)) (.cse38 (not .cse25)) (.cse46 (or .cse49 .cse20)) (.cse30 (not .cse40)) (.cse11 (not .cse13)) (.cse50 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse64 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse5) .cse64))) (bvsle (bvmul (bvmul c_~var_1_8~0 .cse64) .cse6) .cse52)))))) (and (or (let ((.cse9 (bvadd .cse21 .cse6))) (let ((.cse2 (or (forall ((~var_1_6~0 (_ BitVec 16))) (bvsle (bvmul (bvmul ((_ sign_extend 16) ~var_1_6~0) .cse6) .cse6) .cse9)) .cse20)) (.cse12 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse19 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse5) .cse19))) (bvsle (bvmul (bvmul .cse19 .cse6) .cse6) .cse9)))))) (and (or (let ((.cse7 (= .cse14 .cse6)) (.cse3 (or .cse12 .cse13)) (.cse4 (or (and (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse8 ((_ sign_extend 16) ~var_1_6~0))) (or (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse5) .cse8)))) (bvsle (bvmul (bvmul .cse8 .cse6) .cse6) .cse9)))) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse10 ((_ sign_extend 16) ~var_1_6~0))) (or (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse5) .cse10))) (bvsle (bvmul (bvmul .cse10 .cse6) .cse6) .cse9))))) .cse11))) (and (or (let ((.cse0 (bvsle .cse5 (bvmul (_ bv2 32) .cse6))) (.cse1 (and .cse3 .cse4))) (and (or (not .cse0) .cse1) .cse2 (or .cse0 .cse1))) .cse7) (or (not .cse7) (and .cse3 .cse4 .cse2)))) .cse15) (or .cse16 (and (or (and (or .cse17 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse18 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse5) .cse18)) (bvsle (bvmul (bvmul .cse18 .cse6) .cse6) .cse9))))) (or .cse12 .cse17)) .cse11) .cse2 (or .cse12 .cse17 .cse13)))))) .cse22) (or .cse15 (let ((.cse29 (or .cse42 .cse13)) (.cse31 (or (and .cse41 .cse42) .cse11))) (let ((.cse39 (and .cse29 .cse31))) (let ((.cse26 (or .cse30 .cse39)) (.cse27 (or .cse40 .cse39))) (let ((.cse33 (or .cse38 .cse39)) (.cse34 (or .cse25 (and .cse26 .cse27))) (.cse23 (or (and .cse29 .cse25 .cse31 .cse20) .cse37))) (and (or (and (or (and .cse23 (or .cse24 (and (or (and .cse25 .cse26 .cse27) .cse28) (or (and .cse29 .cse25 .cse30 .cse31) .cse20)))) .cse22) (or .cse32 (and .cse24 (or (and .cse33 (or .cse25 (and .cse29 .cse30 .cse31))) .cse20) (or .cse28 (and .cse33 .cse34))))) .cse35) (or .cse36 (and (or .cse32 (and .cse33 .cse24 .cse20 .cse34)) (or (and (or .cse24 (and .cse25 .cse26 .cse20 .cse27)) .cse23) .cse22))))))))) (or (forall ((~var_1_7~0 (_ BitVec 8)) (~var_1_6~0 (_ BitVec 16))) (let ((.cse43 ((_ zero_extend 24) ~var_1_7~0))) (or (bvsle (bvmul .cse43 (bvmul .cse43 ((_ sign_extend 16) ~var_1_6~0))) (bvadd (bvneg .cse43) .cse43)) (bvslt .cse43 .cse5)))) .cse20) (or .cse16 (let ((.cse45 (or (and (or .cse17 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse51 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsle (bvmul (bvmul c_~var_1_8~0 .cse51) .cse6) .cse52) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse5) .cse51)))))) (or .cse50 .cse17)) .cse11)) (.cse47 (or .cse50 .cse17 .cse13))) (and (or (and .cse44 .cse45 .cse46 .cse47) .cse22) (or .cse32 (and .cse45 .cse46 (or .cse48 .cse49) .cse47))))) (or .cse16 (let ((.cse54 (or .cse11 (and (or .cse17 .cse42) (or .cse17 .cse41)))) (.cse55 (or .cse17 .cse42 .cse13))) (let ((.cse56 (or .cse22 (and .cse25 .cse54 .cse55 .cse20)))) (and (or .cse35 (and (or .cse32 (let ((.cse53 (and .cse54 .cse55))) (and (or .cse20 .cse53) .cse48 (or .cse28 .cse53)))) .cse56)) (or .cse36 (and (or (and .cse54 .cse48 .cse55 .cse20) .cse32) .cse56)))))) (or .cse15 (let ((.cse59 (or .cse50 .cse13)) (.cse60 (or (and (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse62 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsle (bvmul (bvmul c_~var_1_8~0 .cse62) .cse6) .cse52) (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse5) .cse62))))))) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse63 ((_ sign_extend 16) ~var_1_6~0))) (or (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse5) .cse63))) (bvsle (bvmul (bvmul c_~var_1_8~0 .cse63) .cse6) .cse52))))) .cse11))) (let ((.cse61 (and .cse59 .cse60))) (let ((.cse57 (or .cse61 .cse40)) (.cse58 (or .cse30 .cse61))) (and (or (and (or (and .cse44 .cse46 .cse57 .cse58) .cse24) (or .cse37 (and .cse44 .cse59 .cse60 .cse46))) .cse22) (or .cse32 (and (or .cse61 .cse38) .cse46 (or .cse49 .cse24) (or .cse25 (and .cse57 .cse58))))))))))))))) is different from true [2024-11-08 17:18:33,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 17:18:35,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:18:35,375 INFO L93 Difference]: Finished difference Result 87 states and 109 transitions. [2024-11-08 17:18:35,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 17:18:35,378 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 74 [2024-11-08 17:18:35,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:18:35,380 INFO L225 Difference]: With dead ends: 87 [2024-11-08 17:18:35,380 INFO L226 Difference]: Without dead ends: 85 [2024-11-08 17:18:35,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 434.0s TimeCoverageRelationStatistics Valid=156, Invalid=655, Unknown=9, NotChecked=110, Total=930 [2024-11-08 17:18:35,382 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 123 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 16 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 110.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 117.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:18:35,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 191 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 286 Invalid, 2 Unknown, 20 Unchecked, 117.3s Time] [2024-11-08 17:18:35,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-08 17:18:35,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 66. [2024-11-08 17:18:35,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 50 states have internal predecessors, (61), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-08 17:18:35,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 87 transitions. [2024-11-08 17:18:35,401 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 87 transitions. Word has length 74 [2024-11-08 17:18:35,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:18:35,402 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 87 transitions. [2024-11-08 17:18:35,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-08 17:18:35,403 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 87 transitions. [2024-11-08 17:18:35,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-08 17:18:35,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:18:35,405 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:18:35,417 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/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)] Ended with exit code 0 [2024-11-08 17:18:35,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/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 17:18:35,606 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:18:35,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:18:35,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1391229201, now seen corresponding path program 1 times [2024-11-08 17:18:35,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:18:35,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724327070] [2024-11-08 17:18:35,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:18:35,608 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 17:18:35,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:18:35,612 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/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 17:18:35,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/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 17:18:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:18:35,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 17:18:35,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:18:37,560 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 114 proven. 18 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-08 17:18:37,561 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:18:38,927 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-08 17:18:38,928 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:18:38,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724327070] [2024-11-08 17:18:38,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [724327070] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 17:18:38,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:18:38,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-11-08 17:18:38,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587188262] [2024-11-08 17:18:38,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:18:38,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:18:38,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:18:38,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:18:38,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:18:38,931 INFO L87 Difference]: Start difference. First operand 66 states and 87 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-08 17:18:41,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:18:41,357 INFO L93 Difference]: Finished difference Result 185 states and 232 transitions. [2024-11-08 17:18:41,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:18:41,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 74 [2024-11-08 17:18:41,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:18:41,363 INFO L225 Difference]: With dead ends: 185 [2024-11-08 17:18:41,363 INFO L226 Difference]: Without dead ends: 122 [2024-11-08 17:18:41,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:18:41,365 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 68 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:18:41,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 161 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 17:18:41,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-08 17:18:41,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 60. [2024-11-08 17:18:41,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 45 states have internal predecessors, (57), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-08 17:18:41,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 79 transitions. [2024-11-08 17:18:41,394 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 79 transitions. Word has length 74 [2024-11-08 17:18:41,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:18:41,395 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 79 transitions. [2024-11-08 17:18:41,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-08 17:18:41,396 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 79 transitions. [2024-11-08 17:18:41,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-08 17:18:41,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:18:41,397 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:18:41,409 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-08 17:18:41,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/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 17:18:41,598 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:18:41,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:18:41,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1393076243, now seen corresponding path program 1 times [2024-11-08 17:18:41,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:18:41,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1837206431] [2024-11-08 17:18:41,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:18:41,600 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 17:18:41,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:18:41,604 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/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 17:18:41,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee5b22f9-6134-46cd-b1a8-81eb7124f2d5/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 (6)] Waiting until timeout for monitored process [2024-11-08 17:18:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:18:41,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 17:18:41,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:18:48,097 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 114 proven. 18 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-08 17:18:48,098 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:19:21,495 WARN L286 SmtUtils]: Spent 11.55s on a formula simplification. DAG size of input: 64 DAG size of output: 63 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 17:19:33,812 WARN L286 SmtUtils]: Spent 5.38s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 17:20:08,863 WARN L286 SmtUtils]: Spent 12.35s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 17:21:04,898 WARN L286 SmtUtils]: Spent 34.82s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 17:21:41,577 WARN L286 SmtUtils]: Spent 12.24s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 17:21:42,371 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-08 17:21:42,371 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:21:42,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1837206431] [2024-11-08 17:21:42,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1837206431] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 17:21:42,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:21:42,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2024-11-08 17:21:42,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004479103] [2024-11-08 17:21:42,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:21:42,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:21:42,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:21:42,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:21:42,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=245, Unknown=4, NotChecked=0, Total=306 [2024-11-08 17:21:42,374 INFO L87 Difference]: Start difference. First operand 60 states and 79 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)