./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-14.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_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/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_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-14.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/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_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/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 0cb882cfd69f05f54da892fd87d6e6d21910f2af522148b65b2b913f00b9dfcc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:30:55,327 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:30:55,396 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 16:30:55,400 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:30:55,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:30:55,432 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:30:55,433 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:30:55,433 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:30:55,434 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:30:55,434 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:30:55,434 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:30:55,435 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:30:55,435 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:30:55,436 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:30:55,436 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:30:55,437 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:30:55,439 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:30:55,440 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:30:55,440 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:30:55,440 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:30:55,441 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:30:55,444 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:30:55,445 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:30:55,453 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:30:55,454 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:30:55,454 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:30:55,454 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:30:55,454 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:30:55,455 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:30:55,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:30:55,455 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:30:55,456 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:30:55,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:30:55,456 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:30:55,456 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:30:55,457 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:30:55,457 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:30:55,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:30:55,459 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:30:55,459 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:30:55,459 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:30:55,460 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:30:55,460 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_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/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_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/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 -> 0cb882cfd69f05f54da892fd87d6e6d21910f2af522148b65b2b913f00b9dfcc [2024-11-08 16:30:55,731 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:30:55,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:30:55,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:30:55,761 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:30:55,762 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:30:55,763 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-14.i Unable to find full path for "g++" [2024-11-08 16:30:57,765 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:30:57,936 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:30:57,937 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-14.i [2024-11-08 16:30:57,944 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/bin/uautomizer-verify-jihMAELWvX/data/5f2c42c0a/965f0c1eaa4746d2989dd96a9fd4dea4/FLAGe6427da8d [2024-11-08 16:30:58,329 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/bin/uautomizer-verify-jihMAELWvX/data/5f2c42c0a/965f0c1eaa4746d2989dd96a9fd4dea4 [2024-11-08 16:30:58,332 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:30:58,333 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:30:58,335 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:30:58,335 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:30:58,343 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:30:58,344 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:30:58" (1/1) ... [2024-11-08 16:30:58,345 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48f4742b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:30:58, skipping insertion in model container [2024-11-08 16:30:58,345 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:30:58" (1/1) ... [2024-11-08 16:30:58,380 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:30:58,555 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_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-14.i[915,928] [2024-11-08 16:30:58,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:30:58,593 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:30:58,605 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_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-14.i[915,928] [2024-11-08 16:30:58,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:30:58,636 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:30:58,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:30:58 WrapperNode [2024-11-08 16:30:58,637 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:30:58,638 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:30:58,638 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:30:58,638 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:30:58,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:30:58" (1/1) ... [2024-11-08 16:30:58,654 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:30:58" (1/1) ... [2024-11-08 16:30:58,675 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 71 [2024-11-08 16:30:58,676 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:30:58,677 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:30:58,677 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:30:58,677 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:30:58,689 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:30:58" (1/1) ... [2024-11-08 16:30:58,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:30:58" (1/1) ... [2024-11-08 16:30:58,691 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:30:58" (1/1) ... [2024-11-08 16:30:58,703 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 16:30:58,704 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:30:58" (1/1) ... [2024-11-08 16:30:58,704 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:30:58" (1/1) ... [2024-11-08 16:30:58,711 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:30:58" (1/1) ... [2024-11-08 16:30:58,719 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:30:58" (1/1) ... [2024-11-08 16:30:58,721 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:30:58" (1/1) ... [2024-11-08 16:30:58,722 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:30:58" (1/1) ... [2024-11-08 16:30:58,724 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:30:58,725 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:30:58,725 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:30:58,725 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:30:58,726 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:30:58" (1/1) ... [2024-11-08 16:30:58,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:30:58,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:30:58,769 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:30:58,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:30:58,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:30:58,801 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:30:58,801 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:30:58,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 16:30:58,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:30:58,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:30:58,861 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:30:58,864 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:30:59,015 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 16:30:59,015 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:30:59,027 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:30:59,028 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:30:59,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:30:59 BoogieIcfgContainer [2024-11-08 16:30:59,028 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:30:59,030 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:30:59,031 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:30:59,034 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:30:59,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:30:58" (1/3) ... [2024-11-08 16:30:59,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aa417c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:30:59, skipping insertion in model container [2024-11-08 16:30:59,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:30:58" (2/3) ... [2024-11-08 16:30:59,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aa417c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:30:59, skipping insertion in model container [2024-11-08 16:30:59,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:30:59" (3/3) ... [2024-11-08 16:30:59,037 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-14.i [2024-11-08 16:30:59,053 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:30:59,054 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:30:59,139 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:30:59,144 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;@1b98ff8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:30:59,144 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:30:59,148 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-08 16:30:59,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-08 16:30:59,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:30:59,158 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 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 16:30:59,158 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:30:59,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:30:59,164 INFO L85 PathProgramCache]: Analyzing trace with hash -809313889, now seen corresponding path program 1 times [2024-11-08 16:30:59,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:30:59,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797792380] [2024-11-08 16:30:59,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:30:59,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:30:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:30:59,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:30:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:30:59,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:30:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:30:59,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:30:59,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:30:59,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:30:59,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:30:59,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 16:30:59,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:30:59,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 16:30:59,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:30:59,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 16:30:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:30:59,401 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-08 16:30:59,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:30:59,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797792380] [2024-11-08 16:30:59,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797792380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:30:59,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:30:59,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:30:59,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477084018] [2024-11-08 16:30:59,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:30:59,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:30:59,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:30:59,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:30:59,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:30:59,440 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-08 16:30:59,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:30:59,458 INFO L93 Difference]: Finished difference Result 57 states and 85 transitions. [2024-11-08 16:30:59,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:30:59,460 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2024-11-08 16:30:59,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:30:59,468 INFO L225 Difference]: With dead ends: 57 [2024-11-08 16:30:59,468 INFO L226 Difference]: Without dead ends: 28 [2024-11-08 16:30:59,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 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 16:30:59,474 INFO L432 NwaCegarLoop]: 35 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, 35 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 16:30:59,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:30:59,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-08 16:30:59,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-08 16:30:59,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-08 16:30:59,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-11-08 16:30:59,514 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 50 [2024-11-08 16:30:59,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:30:59,515 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-11-08 16:30:59,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-08 16:30:59,515 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-11-08 16:30:59,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-08 16:30:59,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:30:59,518 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 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 16:30:59,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:30:59,518 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:30:59,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:30:59,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1353734491, now seen corresponding path program 1 times [2024-11-08 16:30:59,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:30:59,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46002774] [2024-11-08 16:30:59,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:30:59,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:30:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:30:59,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:30:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:30:59,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:30:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:30:59,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:30:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:30:59,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:30:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:30:59,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 16:30:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:30:59,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 16:30:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:30:59,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 16:30:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:30:59,950 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-08 16:30:59,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:30:59,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46002774] [2024-11-08 16:30:59,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46002774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:30:59,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:30:59,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:30:59,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026897924] [2024-11-08 16:30:59,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:30:59,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:30:59,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:30:59,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:30:59,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:30:59,959 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-08 16:30:59,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:30:59,994 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2024-11-08 16:30:59,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:30:59,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 50 [2024-11-08 16:30:59,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:30:59,999 INFO L225 Difference]: With dead ends: 53 [2024-11-08 16:31:00,000 INFO L226 Difference]: Without dead ends: 28 [2024-11-08 16:31:00,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:31:00,006 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:31:00,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:31:00,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-08 16:31:00,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-08 16:31:00,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-08 16:31:00,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-11-08 16:31:00,022 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 50 [2024-11-08 16:31:00,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:31:00,026 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-11-08 16:31:00,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-08 16:31:00,027 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-11-08 16:31:00,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-08 16:31:00,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:31:00,030 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 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 16:31:00,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:31:00,031 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:31:00,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:31:00,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1355581533, now seen corresponding path program 1 times [2024-11-08 16:31:00,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:31:00,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008553308] [2024-11-08 16:31:00,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:31:00,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:31:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:31:00,117 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:31:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:31:00,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:31:00,196 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 16:31:00,198 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 16:31:00,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 16:31:00,203 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 16:31:00,250 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 16:31:00,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 04:31:00 BoogieIcfgContainer [2024-11-08 16:31:00,254 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 16:31:00,255 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 16:31:00,255 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 16:31:00,255 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 16:31:00,256 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:30:59" (3/4) ... [2024-11-08 16:31:00,259 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 16:31:00,260 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 16:31:00,261 INFO L158 Benchmark]: Toolchain (without parser) took 1927.97ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 81.6MB in the beginning and 85.1MB in the end (delta: -3.5MB). Peak memory consumption was 50.1MB. Max. memory is 16.1GB. [2024-11-08 16:31:00,262 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 117.4MB. Free memory is still 87.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:31:00,262 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.39ms. Allocated memory is still 117.4MB. Free memory was 81.2MB in the beginning and 68.2MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 16:31:00,263 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.06ms. Allocated memory is still 117.4MB. Free memory was 68.2MB in the beginning and 66.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 16:31:00,263 INFO L158 Benchmark]: Boogie Preprocessor took 47.60ms. Allocated memory is still 117.4MB. Free memory was 66.5MB in the beginning and 64.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 16:31:00,264 INFO L158 Benchmark]: RCFGBuilder took 303.42ms. Allocated memory is still 117.4MB. Free memory was 64.4MB in the beginning and 52.9MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 16:31:00,264 INFO L158 Benchmark]: TraceAbstraction took 1223.67ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 52.2MB in the beginning and 85.9MB in the end (delta: -33.8MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2024-11-08 16:31:00,265 INFO L158 Benchmark]: Witness Printer took 5.85ms. Allocated memory is still 167.8MB. Free memory was 85.9MB in the beginning and 85.1MB in the end (delta: 816.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 16:31:00,268 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.26ms. Allocated memory is still 117.4MB. Free memory is still 87.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 302.39ms. Allocated memory is still 117.4MB. Free memory was 81.2MB in the beginning and 68.2MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.06ms. Allocated memory is still 117.4MB. Free memory was 68.2MB in the beginning and 66.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.60ms. Allocated memory is still 117.4MB. Free memory was 66.5MB in the beginning and 64.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 303.42ms. Allocated memory is still 117.4MB. Free memory was 64.4MB in the beginning and 52.9MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1223.67ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 52.2MB in the beginning and 85.9MB in the end (delta: -33.8MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * Witness Printer took 5.85ms. Allocated memory is still 167.8MB. Free memory was 85.9MB in the beginning and 85.1MB in the end (delta: 816.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 59, overapproximation of someBinaryArithmeticDOUBLEoperation at line 39. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 16.75; [L23] double var_1_5 = 2.05; [L24] double var_1_6 = 9.375; [L25] double var_1_7 = 64.4; [L26] double var_1_8 = 10000.25; [L27] signed short int var_1_9 = -2; [L28] signed short int var_1_10 = 0; [L29] unsigned short int var_1_11 = 4; [L30] unsigned short int var_1_12 = 128; VAL [isInitial=0, var_1_10=0, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_5=41/20, var_1_6=75/8, var_1_7=322/5, var_1_8=40001/4, var_1_9=-2] [L63] isInitial = 1 [L64] FCALL initially() [L65] COND TRUE 1 [L66] FCALL updateLastVariables() [L67] CALL updateVariables() [L43] var_1_5 = __VERIFIER_nondet_double() [L44] CALL assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_6=75/8, var_1_7=322/5, var_1_8=40001/4, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_6=75/8, var_1_7=322/5, var_1_8=40001/4, var_1_9=-2] [L44] RET assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_6=75/8, var_1_7=322/5, var_1_8=40001/4, var_1_9=-2] [L45] var_1_6 = __VERIFIER_nondet_double() [L46] CALL assume_abort_if_not((var_1_6 >= -230584.3009213691390e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 2305843.009213691390e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_7=322/5, var_1_8=40001/4, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_7=322/5, var_1_8=40001/4, var_1_9=-2] [L46] RET assume_abort_if_not((var_1_6 >= -230584.3009213691390e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 2305843.009213691390e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_7=322/5, var_1_8=40001/4, var_1_9=-2] [L47] var_1_7 = __VERIFIER_nondet_double() [L48] CALL assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L48] RET assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L49] var_1_10 = __VERIFIER_nondet_short() [L50] CALL assume_abort_if_not(var_1_10 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L50] RET assume_abort_if_not(var_1_10 >= -32767) VAL [isInitial=1, var_1_10=-32767, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L51] CALL assume_abort_if_not(var_1_10 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L51] RET assume_abort_if_not(var_1_10 <= 32766) VAL [isInitial=1, var_1_10=-32767, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L52] var_1_12 = __VERIFIER_nondet_ushort() [L53] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=4, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=4, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L53] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=-32767, var_1_11=4, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L54] CALL assume_abort_if_not(var_1_12 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=4, var_1_12=0, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=4, var_1_12=0, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L54] RET assume_abort_if_not(var_1_12 <= 65534) VAL [isInitial=1, var_1_10=-32767, var_1_11=4, var_1_12=0, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L67] RET updateVariables() [L68] CALL step() [L34] var_1_8 = var_1_5 [L35] var_1_9 = var_1_10 [L36] var_1_11 = var_1_12 [L37] signed short int stepLocal_0 = var_1_9; VAL [isInitial=1, stepLocal_0=-32767, var_1_10=-32767, var_1_11=0, var_1_12=0, var_1_1=67/4, var_1_5=10005, var_1_8=10005, var_1_9=-32767] [L38] COND TRUE stepLocal_0 <= (var_1_11 + ((((50) > (var_1_9)) ? (50) : (var_1_9)))) [L39] var_1_1 = ((var_1_5 + var_1_6) + var_1_7) VAL [isInitial=1, var_1_10=-32767, var_1_11=0, var_1_12=0, var_1_5=10005, var_1_8=10005, var_1_9=-32767] [L68] RET step() [L69] CALL, EXPR property() [L59-L60] return ((((var_1_9 <= (var_1_11 + ((((50) > (var_1_9)) ? (50) : (var_1_9))))) ? (var_1_1 == ((double) ((var_1_5 + var_1_6) + var_1_7))) : 1) && (var_1_8 == ((double) var_1_5))) && (var_1_9 == ((signed short int) var_1_10))) && (var_1_11 == ((unsigned short int) var_1_12)) ; VAL [\result=0, isInitial=1, var_1_10=-32767, var_1_11=0, var_1_12=0, var_1_5=10005, var_1_8=10005, var_1_9=-32767] [L69] RET, EXPR property() [L69] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-32767, var_1_11=0, var_1_12=0, var_1_5=10005, var_1_8=10005, var_1_9=-32767] [L19] reach_error() VAL [isInitial=1, var_1_10=-32767, var_1_11=0, var_1_12=0, var_1_5=10005, var_1_8=10005, var_1_9=-32767] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 3, TraceHistogramMax: 7, 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, 98 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4 IncrementalHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 68 mSDtfsCounter, 4 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 150 NumberOfCodeBlocks, 150 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 100 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 168/168 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 16:31:00,305 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/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_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/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_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-14.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/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_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/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 0cb882cfd69f05f54da892fd87d6e6d21910f2af522148b65b2b913f00b9dfcc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:31:02,950 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:31:03,029 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 16:31:03,034 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:31:03,035 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:31:03,071 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:31:03,072 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:31:03,072 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:31:03,073 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:31:03,075 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:31:03,076 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:31:03,077 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:31:03,077 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:31:03,081 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:31:03,082 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:31:03,082 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:31:03,082 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:31:03,083 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:31:03,083 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:31:03,083 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:31:03,083 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:31:03,085 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:31:03,085 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:31:03,085 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 16:31:03,086 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 16:31:03,086 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:31:03,087 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 16:31:03,087 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:31:03,087 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:31:03,088 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:31:03,089 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:31:03,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:31:03,089 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:31:03,090 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:31:03,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:31:03,091 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:31:03,091 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:31:03,091 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:31:03,092 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 16:31:03,092 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 16:31:03,092 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:31:03,093 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:31:03,093 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:31:03,102 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:31:03,103 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_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/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_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/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 -> 0cb882cfd69f05f54da892fd87d6e6d21910f2af522148b65b2b913f00b9dfcc [2024-11-08 16:31:03,490 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:31:03,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:31:03,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:31:03,529 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:31:03,530 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:31:03,531 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-14.i Unable to find full path for "g++" [2024-11-08 16:31:05,813 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:31:06,107 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:31:06,108 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-14.i [2024-11-08 16:31:06,118 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/bin/uautomizer-verify-jihMAELWvX/data/7f18e3a97/7f044bc790f24a3ca02f8d8ea2e9ea21/FLAG63747a421 [2024-11-08 16:31:06,132 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/bin/uautomizer-verify-jihMAELWvX/data/7f18e3a97/7f044bc790f24a3ca02f8d8ea2e9ea21 [2024-11-08 16:31:06,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:31:06,136 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:31:06,138 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:31:06,138 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:31:06,145 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:31:06,145 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:31:06" (1/1) ... [2024-11-08 16:31:06,147 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a9b47e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:31:06, skipping insertion in model container [2024-11-08 16:31:06,147 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:31:06" (1/1) ... [2024-11-08 16:31:06,170 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:31:06,437 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_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-14.i[915,928] [2024-11-08 16:31:06,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:31:06,505 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:31:06,551 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_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-14.i[915,928] [2024-11-08 16:31:06,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:31:06,643 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:31:06,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:31:06 WrapperNode [2024-11-08 16:31:06,647 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:31:06,648 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:31:06,648 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:31:06,648 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:31:06,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:31:06" (1/1) ... [2024-11-08 16:31:06,671 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:31:06" (1/1) ... [2024-11-08 16:31:06,701 INFO L138 Inliner]: procedures = 27, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 70 [2024-11-08 16:31:06,704 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:31:06,705 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:31:06,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:31:06,705 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:31:06,719 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:31:06" (1/1) ... [2024-11-08 16:31:06,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:31:06" (1/1) ... [2024-11-08 16:31:06,725 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:31:06" (1/1) ... [2024-11-08 16:31:06,754 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 16:31:06,758 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:31:06" (1/1) ... [2024-11-08 16:31:06,759 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:31:06" (1/1) ... [2024-11-08 16:31:06,770 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:31:06" (1/1) ... [2024-11-08 16:31:06,778 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:31:06" (1/1) ... [2024-11-08 16:31:06,780 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:31:06" (1/1) ... [2024-11-08 16:31:06,784 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:31:06" (1/1) ... [2024-11-08 16:31:06,787 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:31:06,792 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:31:06,792 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:31:06,792 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:31:06,793 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:31:06" (1/1) ... [2024-11-08 16:31:06,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:31:06,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:31:06,843 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:31:06,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:31:06,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:31:06,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 16:31:06,883 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:31:06,883 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:31:06,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:31:06,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:31:07,001 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:31:07,005 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:31:09,016 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 16:31:09,017 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:31:09,038 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:31:09,039 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:31:09,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:31:09 BoogieIcfgContainer [2024-11-08 16:31:09,040 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:31:09,043 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:31:09,044 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:31:09,048 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:31:09,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:31:06" (1/3) ... [2024-11-08 16:31:09,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7189f8d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:31:09, skipping insertion in model container [2024-11-08 16:31:09,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:31:06" (2/3) ... [2024-11-08 16:31:09,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7189f8d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:31:09, skipping insertion in model container [2024-11-08 16:31:09,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:31:09" (3/3) ... [2024-11-08 16:31:09,056 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-14.i [2024-11-08 16:31:09,093 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:31:09,094 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:31:09,172 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:31:09,182 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;@4a87c6d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:31:09,182 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:31:09,191 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-08 16:31:09,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-08 16:31:09,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:31:09,203 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 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 16:31:09,204 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:31:09,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:31:09,215 INFO L85 PathProgramCache]: Analyzing trace with hash -809313889, now seen corresponding path program 1 times [2024-11-08 16:31:09,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:31:09,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1488273783] [2024-11-08 16:31:09,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:31:09,237 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 16:31:09,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:31:09,241 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/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 16:31:09,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/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 16:31:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:31:09,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 16:31:09,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:31:09,674 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-08 16:31:09,676 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:31:09,677 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:31:09,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1488273783] [2024-11-08 16:31:09,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1488273783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:31:09,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:31:09,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:31:09,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630717604] [2024-11-08 16:31:09,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:31:09,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:31:09,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:31:09,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:31:09,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:31:09,730 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-08 16:31:09,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:31:09,764 INFO L93 Difference]: Finished difference Result 57 states and 85 transitions. [2024-11-08 16:31:09,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:31:09,768 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2024-11-08 16:31:09,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:31:09,778 INFO L225 Difference]: With dead ends: 57 [2024-11-08 16:31:09,779 INFO L226 Difference]: Without dead ends: 28 [2024-11-08 16:31:09,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 49 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 16:31:09,791 INFO L432 NwaCegarLoop]: 35 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, 35 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 16:31:09,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:31:09,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-08 16:31:09,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-08 16:31:09,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-08 16:31:09,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-11-08 16:31:09,848 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 50 [2024-11-08 16:31:09,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:31:09,849 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-11-08 16:31:09,849 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-08 16:31:09,851 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-11-08 16:31:09,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-08 16:31:09,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:31:09,867 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 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 16:31:09,876 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/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 16:31:10,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/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 16:31:10,069 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:31:10,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:31:10,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1353734491, now seen corresponding path program 1 times [2024-11-08 16:31:10,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:31:10,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1019162518] [2024-11-08 16:31:10,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:31:10,071 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 16:31:10,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:31:10,073 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/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 16:31:10,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/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 16:31:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:31:10,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 16:31:10,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:31:10,437 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-08 16:31:10,437 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:31:10,437 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:31:10,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1019162518] [2024-11-08 16:31:10,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1019162518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:31:10,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:31:10,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:31:10,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349622915] [2024-11-08 16:31:10,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:31:10,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:31:10,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:31:10,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:31:10,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:31:10,442 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-08 16:31:12,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:31:12,258 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2024-11-08 16:31:12,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:31:12,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 50 [2024-11-08 16:31:12,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:31:12,273 INFO L225 Difference]: With dead ends: 53 [2024-11-08 16:31:12,273 INFO L226 Difference]: Without dead ends: 28 [2024-11-08 16:31:12,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:31:12,275 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:31:12,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 16:31:12,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-08 16:31:12,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-08 16:31:12,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-08 16:31:12,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-11-08 16:31:12,284 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 50 [2024-11-08 16:31:12,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:31:12,286 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-11-08 16:31:12,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-08 16:31:12,287 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-11-08 16:31:12,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-08 16:31:12,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:31:12,289 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 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 16:31:12,297 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/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 16:31:12,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/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 16:31:12,490 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:31:12,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:31:12,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1355581533, now seen corresponding path program 1 times [2024-11-08 16:31:12,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:31:12,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1007402885] [2024-11-08 16:31:12,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:31:12,492 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 16:31:12,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:31:12,496 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/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 16:31:12,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bfd0bf-5fe2-4e0b-b0b3-3ffeddbfa8d9/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 16:31:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:31:12,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-08 16:31:12,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:32:20,193 WARN L286 SmtUtils]: Spent 18.36s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 16:32:35,736 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:32:40,797 WARN L286 SmtUtils]: Spent 5.06s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:32:47,373 WARN L286 SmtUtils]: Spent 5.28s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:32:56,040 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:33:01,283 WARN L286 SmtUtils]: Spent 5.24s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:33:09,656 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:33:15,186 WARN L286 SmtUtils]: Spent 5.53s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:33:23,247 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:33:36,259 WARN L286 SmtUtils]: Spent 5.12s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:33:44,762 WARN L286 SmtUtils]: Spent 5.47s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:33:52,831 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:34:00,889 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:34:17,302 WARN L286 SmtUtils]: Spent 5.61s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:34:33,196 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:34:38,369 WARN L286 SmtUtils]: Spent 5.17s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:34:46,440 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:34:54,516 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:35:00,008 WARN L286 SmtUtils]: Spent 5.49s on a formula simplification. DAG size of input: 6 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:35:08,070 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:35:16,130 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:35:29,055 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:35:37,138 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:35:45,233 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:35:53,306 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:36:06,058 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:36:14,119 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:36:20,618 WARN L286 SmtUtils]: Spent 5.51s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:36:47,043 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:36:52,952 WARN L286 SmtUtils]: Spent 5.91s on a formula simplification. DAG size of input: 7 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:36:59,176 WARN L286 SmtUtils]: Spent 6.22s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:37:11,832 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:37:24,639 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:37:30,301 WARN L286 SmtUtils]: Spent 5.66s on a formula simplification. DAG size of input: 6 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:37:45,037 WARN L286 SmtUtils]: Spent 6.20s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:38:05,454 WARN L286 SmtUtils]: Spent 6.16s on a formula simplification. DAG size of input: 7 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:38:25,659 WARN L286 SmtUtils]: Spent 5.65s on a formula simplification. DAG size of input: 7 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:38:32,619 WARN L286 SmtUtils]: Spent 6.96s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:38:45,468 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:38:51,796 WARN L286 SmtUtils]: Spent 6.33s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:38:57,836 WARN L286 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:39:10,686 WARN L286 SmtUtils]: Spent 5.69s on a formula simplification. DAG size of input: 6 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:39:18,774 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:39:24,154 WARN L286 SmtUtils]: Spent 5.38s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:39:34,053 WARN L286 SmtUtils]: Spent 5.88s on a formula simplification. DAG size of input: 7 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:39:39,464 WARN L286 SmtUtils]: Spent 5.41s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:39:45,175 WARN L286 SmtUtils]: Spent 5.71s on a formula simplification. DAG size of input: 6 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:39:52,996 WARN L286 SmtUtils]: Spent 7.82s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:40:05,412 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:40:11,275 WARN L286 SmtUtils]: Spent 5.86s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:40:25,307 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:40:30,398 WARN L286 SmtUtils]: Spent 5.09s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:40:36,481 WARN L286 SmtUtils]: Spent 6.08s on a formula simplification. DAG size of input: 7 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:40:49,436 WARN L286 SmtUtils]: Spent 6.95s on a formula simplification. DAG size of input: 7 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:40:54,988 WARN L286 SmtUtils]: Spent 5.55s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:41:03,037 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:41:08,092 WARN L286 SmtUtils]: Spent 5.05s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:41:16,172 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:41:28,812 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:41:35,465 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse6 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 2305843009213691390.0))) (let ((.cse0 (= |c_ULTIMATE.start_property_#res#1| (_ bv0 32))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse4))) (.cse8 ((_ to_fp 11 53) roundNearestTiesToEven .cse6)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven .cse2))) (or (and .cse0 (exists ((~var_1_7~0 (_ FloatingPoint 11 53)) (~var_1_6~0 (_ FloatingPoint 11 53)) (~var_1_8~0 (_ FloatingPoint 11 53))) (and (fp.geq ~var_1_6~0 .cse1) (fp.leq ~var_1_7~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse2))) (not (let ((.cse3 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ~var_1_8~0 ~var_1_6~0) ~var_1_7~0))) (fp.eq .cse3 .cse3))) (fp.leq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse4)) (fp.geq ~var_1_8~0 .cse5) (fp.geq ~var_1_7~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse6)))))) (and .cse0 (exists ((~var_1_7~0 (_ FloatingPoint 11 53)) (~var_1_6~0 (_ FloatingPoint 11 53)) (~var_1_8~0 (_ FloatingPoint 11 53))) (and (fp.geq ~var_1_6~0 .cse1) (not (let ((.cse7 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ~var_1_8~0 ~var_1_6~0) ~var_1_7~0))) (fp.eq .cse7 .cse7))) (fp.leq ~var_1_7~0 .cse8) (fp.geq ~var_1_7~0 .cse1) (fp.geq ~var_1_8~0 .cse5)))) (= |c_ULTIMATE.start_property_#res#1| (_ bv1 32)) (and .cse0 (exists ((~var_1_7~0 (_ FloatingPoint 11 53)) (~var_1_6~0 (_ FloatingPoint 11 53)) (~var_1_8~0 (_ FloatingPoint 11 53))) (and (fp.geq ~var_1_6~0 .cse5) (fp.geq ~var_1_8~0 .cse1) (not (let ((.cse9 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ~var_1_8~0 ~var_1_6~0) ~var_1_7~0))) (fp.eq .cse9 .cse9))) (fp.leq ~var_1_7~0 .cse8) (fp.geq ~var_1_7~0 .cse1))))))) is different from false [2024-11-08 16:41:45,637 WARN L286 SmtUtils]: Spent 6.10s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:41:50,858 WARN L286 SmtUtils]: Spent 5.22s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:42:03,758 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:42:09,347 WARN L286 SmtUtils]: Spent 5.59s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:42:18,921 WARN L286 SmtUtils]: Spent 5.53s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:42:24,475 WARN L286 SmtUtils]: Spent 5.55s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:42:32,535 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:42:37,772 WARN L286 SmtUtils]: Spent 5.24s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:42:43,549 WARN L286 SmtUtils]: Spent 5.78s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:42:55,640 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:43:03,698 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:43:09,003 WARN L286 SmtUtils]: Spent 5.30s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:43:17,065 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:43:23,894 WARN L286 SmtUtils]: Spent 6.83s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:43:31,956 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:43:36,001 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse8 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) roundNearestTiesToEven 2305843009213691390.0))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse7))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven .cse8)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven .cse5)) (.cse0 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)))) (or (and .cse0 (exists ((~var_1_7~0 (_ FloatingPoint 11 53)) (~var_1_6~0 (_ FloatingPoint 11 53)) (~var_1_8~0 (_ FloatingPoint 11 53))) (and (fp.geq ~var_1_6~0 .cse1) (not (let ((.cse2 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ~var_1_8~0 ~var_1_6~0) ~var_1_7~0))) (fp.eq .cse2 .cse2))) (fp.leq ~var_1_7~0 .cse3) (fp.geq ~var_1_7~0 .cse1) (fp.geq ~var_1_8~0 .cse4)))) (and (exists ((~var_1_7~0 (_ FloatingPoint 11 53)) (~var_1_6~0 (_ FloatingPoint 11 53)) (~var_1_8~0 (_ FloatingPoint 11 53))) (and (fp.geq ~var_1_6~0 .cse1) (fp.leq ~var_1_7~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse5))) (not (let ((.cse6 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ~var_1_8~0 ~var_1_6~0) ~var_1_7~0))) (fp.eq .cse6 .cse6))) (fp.leq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse7)) (fp.geq ~var_1_8~0 .cse4) (fp.geq ~var_1_7~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse8))))) .cse0) (and (exists ((~var_1_7~0 (_ FloatingPoint 11 53)) (~var_1_6~0 (_ FloatingPoint 11 53)) (~var_1_8~0 (_ FloatingPoint 11 53))) (and (fp.geq ~var_1_6~0 .cse4) (fp.geq ~var_1_8~0 .cse1) (not (let ((.cse9 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ~var_1_8~0 ~var_1_6~0) ~var_1_7~0))) (fp.eq .cse9 .cse9))) (fp.leq ~var_1_7~0 .cse3) (fp.geq ~var_1_7~0 .cse1))) .cse0) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))))) is different from false [2024-11-08 16:43:45,889 WARN L286 SmtUtils]: Spent 5.85s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:43:52,345 WARN L286 SmtUtils]: Spent 6.46s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:43:57,525 WARN L286 SmtUtils]: Spent 5.18s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:44:05,590 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:44:11,734 WARN L286 SmtUtils]: Spent 6.14s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:44:23,475 WARN L286 SmtUtils]: Spent 7.72s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:44:31,537 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:44:37,091 WARN L286 SmtUtils]: Spent 5.55s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:44:45,154 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:44:57,824 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:45:06,890 WARN L286 SmtUtils]: Spent 5.05s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:45:12,061 WARN L286 SmtUtils]: Spent 5.17s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:45:20,117 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:45:32,977 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven 2305843009213691390.0)) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse7 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven .cse7)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven .cse4)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse6)))) (or (exists ((~var_1_7~0 (_ FloatingPoint 11 53)) (~var_1_6~0 (_ FloatingPoint 11 53)) (~var_1_8~0 (_ FloatingPoint 11 53))) (and (fp.geq ~var_1_6~0 .cse0) (fp.geq ~var_1_8~0 .cse1) (not (let ((.cse2 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ~var_1_8~0 ~var_1_6~0) ~var_1_7~0))) (fp.eq .cse2 .cse2))) (fp.leq ~var_1_7~0 .cse3) (fp.geq ~var_1_7~0 .cse1))) (exists ((~var_1_7~0 (_ FloatingPoint 11 53)) (~var_1_6~0 (_ FloatingPoint 11 53)) (~var_1_8~0 (_ FloatingPoint 11 53))) (and (fp.geq ~var_1_6~0 .cse1) (fp.leq ~var_1_7~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse4))) (not (let ((.cse5 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ~var_1_8~0 ~var_1_6~0) ~var_1_7~0))) (fp.eq .cse5 .cse5))) (fp.leq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse6)) (fp.geq ~var_1_8~0 .cse0) (fp.geq ~var_1_7~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse7))))) (exists ((~var_1_7~0 (_ FloatingPoint 11 53)) (~var_1_6~0 (_ FloatingPoint 11 53)) (~var_1_8~0 (_ FloatingPoint 11 53))) (and (fp.geq ~var_1_6~0 .cse1) (not (let ((.cse8 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ~var_1_8~0 ~var_1_6~0) ~var_1_7~0))) (fp.eq .cse8 .cse8))) (fp.leq ~var_1_7~0 .cse3) (fp.geq ~var_1_7~0 .cse1) (fp.geq ~var_1_8~0 .cse0)))))) is different from false [2024-11-08 16:45:37,003 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven 2305843009213691390.0)) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse7 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven .cse7)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven .cse4)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse6)))) (or (exists ((~var_1_7~0 (_ FloatingPoint 11 53)) (~var_1_6~0 (_ FloatingPoint 11 53)) (~var_1_8~0 (_ FloatingPoint 11 53))) (and (fp.geq ~var_1_6~0 .cse0) (fp.geq ~var_1_8~0 .cse1) (not (let ((.cse2 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ~var_1_8~0 ~var_1_6~0) ~var_1_7~0))) (fp.eq .cse2 .cse2))) (fp.leq ~var_1_7~0 .cse3) (fp.geq ~var_1_7~0 .cse1))) (exists ((~var_1_7~0 (_ FloatingPoint 11 53)) (~var_1_6~0 (_ FloatingPoint 11 53)) (~var_1_8~0 (_ FloatingPoint 11 53))) (and (fp.geq ~var_1_6~0 .cse1) (fp.leq ~var_1_7~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse4))) (not (let ((.cse5 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ~var_1_8~0 ~var_1_6~0) ~var_1_7~0))) (fp.eq .cse5 .cse5))) (fp.leq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse6)) (fp.geq ~var_1_8~0 .cse0) (fp.geq ~var_1_7~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse7))))) (exists ((~var_1_7~0 (_ FloatingPoint 11 53)) (~var_1_6~0 (_ FloatingPoint 11 53)) (~var_1_8~0 (_ FloatingPoint 11 53))) (and (fp.geq ~var_1_6~0 .cse1) (not (let ((.cse8 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ~var_1_8~0 ~var_1_6~0) ~var_1_7~0))) (fp.eq .cse8 .cse8))) (fp.leq ~var_1_7~0 .cse3) (fp.geq ~var_1_7~0 .cse1) (fp.geq ~var_1_8~0 .cse0)))))) is different from true [2024-11-08 16:45:37,005 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 16:45:37,005 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:46:18,223 WARN L286 SmtUtils]: Spent 5.25s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)