./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-20.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-20.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd --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 9942167140f46cf9a6de342ca7e9162ccfb76997661e3494128a17b58a9424e7 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:01:25,273 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:01:25,357 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 14:01:25,364 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:01:25,367 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:01:25,402 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:01:25,403 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:01:25,403 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:01:25,404 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:01:25,404 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:01:25,404 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:01:25,405 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:01:25,405 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:01:25,405 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:01:25,406 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:01:25,406 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:01:25,406 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:01:25,407 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:01:25,407 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:01:25,407 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:01:25,407 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:01:25,408 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:01:25,408 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:01:25,408 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:01:25,408 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:01:25,408 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:01:25,408 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:01:25,408 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:01:25,408 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:01:25,409 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:01:25,409 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:01:25,409 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:01:25,409 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:01:25,410 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:01:25,410 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:01:25,410 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:01:25,410 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:01:25,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:01:25,411 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:01:25,411 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:01:25,411 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:01:25,411 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:01:25,411 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd 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 -> 9942167140f46cf9a6de342ca7e9162ccfb76997661e3494128a17b58a9424e7 [2024-11-13 14:01:25,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:01:25,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:01:25,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:01:25,740 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:01:25,741 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:01:25,744 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-20.i Unable to find full path for "g++" [2024-11-13 14:01:27,608 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:01:27,867 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:01:27,869 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-20.i [2024-11-13 14:01:27,881 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd/data/dff571fd3/66a07fdaf5494001bf66192d368b37e2/FLAG338f7b4e3 [2024-11-13 14:01:28,173 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd/data/dff571fd3/66a07fdaf5494001bf66192d368b37e2 [2024-11-13 14:01:28,175 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:01:28,177 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:01:28,179 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:01:28,180 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:01:28,185 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:01:28,186 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:01:28" (1/1) ... [2024-11-13 14:01:28,189 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@374bb99e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:01:28, skipping insertion in model container [2024-11-13 14:01:28,189 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:01:28" (1/1) ... [2024-11-13 14:01:28,211 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:01:28,385 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_2108ac04-e2ba-458c-b275-6ea1aefe0e33/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-20.i[915,928] [2024-11-13 14:01:28,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:01:28,452 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:01:28,462 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_2108ac04-e2ba-458c-b275-6ea1aefe0e33/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-20.i[915,928] [2024-11-13 14:01:28,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:01:28,493 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:01:28,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:01:28 WrapperNode [2024-11-13 14:01:28,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:01:28,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:01:28,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:01:28,495 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:01:28,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:01:28" (1/1) ... [2024-11-13 14:01:28,509 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:01:28" (1/1) ... [2024-11-13 14:01:28,532 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 78 [2024-11-13 14:01:28,533 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:01:28,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:01:28,534 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:01:28,534 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:01:28,545 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:01:28" (1/1) ... [2024-11-13 14:01:28,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:01:28" (1/1) ... [2024-11-13 14:01:28,552 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:01:28" (1/1) ... [2024-11-13 14:01:28,566 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-13 14:01:28,566 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:01:28" (1/1) ... [2024-11-13 14:01:28,567 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:01:28" (1/1) ... [2024-11-13 14:01:28,575 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:01:28" (1/1) ... [2024-11-13 14:01:28,584 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:01:28" (1/1) ... [2024-11-13 14:01:28,586 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:01:28" (1/1) ... [2024-11-13 14:01:28,590 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:01:28" (1/1) ... [2024-11-13 14:01:28,592 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:01:28,593 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:01:28,593 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:01:28,593 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:01:28,594 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:01:28" (1/1) ... [2024-11-13 14:01:28,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:01:28,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:01:28,636 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:01:28,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:01:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:01:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 14:01:28,667 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 14:01:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:01:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:01:28,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:01:28,762 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:01:28,764 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:01:28,947 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-13 14:01:28,948 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:01:28,958 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:01:28,958 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:01:28,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:01:28 BoogieIcfgContainer [2024-11-13 14:01:28,959 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:01:28,962 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:01:28,962 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:01:28,967 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:01:28,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:01:28" (1/3) ... [2024-11-13 14:01:28,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec3e06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:01:28, skipping insertion in model container [2024-11-13 14:01:28,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:01:28" (2/3) ... [2024-11-13 14:01:28,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec3e06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:01:28, skipping insertion in model container [2024-11-13 14:01:28,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:01:28" (3/3) ... [2024-11-13 14:01:28,970 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-20.i [2024-11-13 14:01:28,986 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:01:28,988 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-20.i that has 2 procedures, 36 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:01:29,062 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:01:29,078 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;@35bdfddd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:01:29,078 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:01:29,082 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 14:01:29,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-13 14:01:29,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:01:29,093 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 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-13 14:01:29,094 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:01:29,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:01:29,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1762824234, now seen corresponding path program 1 times [2024-11-13 14:01:29,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:01:29,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936180502] [2024-11-13 14:01:29,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:01:29,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:01:29,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:01:29,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:01:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:01:29,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:01:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:01:29,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:01:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:01:29,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-13 14:01:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:01:29,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 14:01:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:01:29,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 14:01:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:01:29,406 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-13 14:01:29,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:01:29,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936180502] [2024-11-13 14:01:29,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936180502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:01:29,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:01:29,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:01:29,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422369126] [2024-11-13 14:01:29,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:01:29,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 14:01:29,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:01:29,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:01:29,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:01:29,445 INFO L87 Difference]: Start difference. First operand has 36 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-13 14:01:29,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:01:29,479 INFO L93 Difference]: Finished difference Result 65 states and 100 transitions. [2024-11-13 14:01:29,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:01:29,481 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, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 49 [2024-11-13 14:01:29,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:01:29,490 INFO L225 Difference]: With dead ends: 65 [2024-11-13 14:01:29,490 INFO L226 Difference]: Without dead ends: 32 [2024-11-13 14:01:29,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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-13 14:01:29,508 INFO L432 NwaCegarLoop]: 43 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, 43 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-13 14:01:29,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:01:29,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-13 14:01:29,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-13 14:01:29,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 14:01:29,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2024-11-13 14:01:29,600 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 49 [2024-11-13 14:01:29,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:01:29,600 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2024-11-13 14:01:29,601 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, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-13 14:01:29,601 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2024-11-13 14:01:29,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-13 14:01:29,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:01:29,604 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 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-13 14:01:29,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:01:29,605 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:01:29,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:01:29,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1236900978, now seen corresponding path program 1 times [2024-11-13 14:01:29,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:01:29,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479086100] [2024-11-13 14:01:29,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:01:29,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:01:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:01:29,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:01:29,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:01:29,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:01:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:01:29,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:01:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:01:29,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-13 14:01:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:01:29,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 14:01:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:01:29,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 14:01:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:01:29,882 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-13 14:01:29,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:01:29,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479086100] [2024-11-13 14:01:29,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479086100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:01:29,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:01:29,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:01:29,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557672532] [2024-11-13 14:01:29,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:01:29,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:01:29,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:01:29,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:01:29,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:01:29,886 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-13 14:01:29,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:01:29,952 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2024-11-13 14:01:29,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:01:29,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 49 [2024-11-13 14:01:29,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:01:29,954 INFO L225 Difference]: With dead ends: 72 [2024-11-13 14:01:29,955 INFO L226 Difference]: Without dead ends: 43 [2024-11-13 14:01:29,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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-13 14:01:29,957 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 12 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:01:29,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 73 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:01:29,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-13 14:01:29,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2024-11-13 14:01:29,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 14:01:29,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2024-11-13 14:01:29,970 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 49 [2024-11-13 14:01:29,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:01:29,971 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2024-11-13 14:01:29,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-13 14:01:29,971 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2024-11-13 14:01:29,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-13 14:01:29,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:01:29,975 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 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-13 14:01:29,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 14:01:29,975 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:01:29,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:01:29,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1797194382, now seen corresponding path program 1 times [2024-11-13 14:01:29,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:01:29,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635917014] [2024-11-13 14:01:29,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:01:29,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:01:30,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:01:30,052 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:01:30,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:01:30,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:01:30,145 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 14:01:30,146 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 14:01:30,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 14:01:30,156 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-13 14:01:30,201 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:01:30,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:01:30 BoogieIcfgContainer [2024-11-13 14:01:30,204 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:01:30,205 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:01:30,205 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:01:30,205 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:01:30,206 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:01:28" (3/4) ... [2024-11-13 14:01:30,207 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 14:01:30,208 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:01:30,209 INFO L158 Benchmark]: Toolchain (without parser) took 2032.21ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 73.9MB in the end (delta: 18.5MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2024-11-13 14:01:30,209 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 83.9MB. Free memory is still 39.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:01:30,209 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.03ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 80.1MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:01:30,209 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.25ms. Allocated memory is still 117.4MB. Free memory was 80.1MB in the beginning and 78.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:01:30,210 INFO L158 Benchmark]: Boogie Preprocessor took 58.70ms. Allocated memory is still 117.4MB. Free memory was 78.7MB in the beginning and 77.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:01:30,210 INFO L158 Benchmark]: RCFGBuilder took 366.20ms. Allocated memory is still 117.4MB. Free memory was 77.1MB in the beginning and 65.5MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:01:30,210 INFO L158 Benchmark]: TraceAbstraction took 1241.76ms. Allocated memory is still 117.4MB. Free memory was 64.7MB in the beginning and 74.0MB in the end (delta: -9.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:01:30,211 INFO L158 Benchmark]: Witness Printer took 3.36ms. Allocated memory is still 117.4MB. Free memory was 74.0MB in the beginning and 73.9MB in the end (delta: 14.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:01:30,212 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.31ms. Allocated memory is still 83.9MB. Free memory is still 39.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 315.03ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 80.1MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.25ms. Allocated memory is still 117.4MB. Free memory was 80.1MB in the beginning and 78.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.70ms. Allocated memory is still 117.4MB. Free memory was 78.7MB in the beginning and 77.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 366.20ms. Allocated memory is still 117.4MB. Free memory was 77.1MB in the beginning and 65.5MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1241.76ms. Allocated memory is still 117.4MB. Free memory was 64.7MB in the beginning and 74.0MB in the end (delta: -9.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.36ms. Allocated memory is still 117.4MB. Free memory was 74.0MB in the beginning and 73.9MB in the end (delta: 14.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 41, overapproximation of someBinaryFLOATComparisonOperation at line 65, overapproximation of someBinaryFLOATComparisonOperation at line 67, overapproximation of someBinaryFLOATComparisonOperation at line 69, overapproximation of someBinaryFLOATComparisonOperation at line 63, overapproximation of someBinaryFLOATComparisonOperation at line 54, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 44, overapproximation of someBinaryArithmeticFLOAToperation at line 36, overapproximation of someBinaryArithmeticFLOAToperation at line 45. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 0.6; [L23] unsigned char var_1_2 = 0; [L24] float var_1_3 = 0.0; [L25] float var_1_4 = 2.95; [L26] float var_1_5 = 8.5; [L27] float var_1_6 = 999999999999.4; [L28] double var_1_7 = 10.2; [L29] double var_1_8 = 32.7; [L30] double var_1_9 = 32.75; [L31] double last_1_var_1_8 = 32.7; VAL [isInitial=0, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=0, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L79] isInitial = 1 [L80] FCALL initially() [L81] COND TRUE 1 [L82] CALL updateLastVariables() [L72] last_1_var_1_8 = var_1_8 VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=0, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L82] RET updateLastVariables() [L83] CALL updateVariables() [L59] var_1_2 = __VERIFIER_nondet_uchar() [L60] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L60] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L61] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L61] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L62] var_1_3 = __VERIFIER_nondet_float() [L63] CALL assume_abort_if_not((var_1_3 >= 4611686.018427382800e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L63] RET assume_abort_if_not((var_1_3 >= 4611686.018427382800e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L64] var_1_4 = __VERIFIER_nondet_float() [L65] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L65] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L66] var_1_5 = __VERIFIER_nondet_float() [L67] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L67] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L68] var_1_6 = __VERIFIER_nondet_float() [L69] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L69] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L83] RET updateVariables() [L84] CALL step() [L35] COND TRUE \read(var_1_2) [L36] var_1_1 = ((var_1_3 - var_1_4) - var_1_5) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L40] COND TRUE \read(var_1_2) [L41] var_1_7 = ((((((var_1_3 - 255.719)) < (var_1_5)) ? ((var_1_3 - 255.719)) : (var_1_5))) - 2.3) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_8=327/10, var_1_9=131/4] [L43] COND TRUE \read(var_1_2) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_8=327/10, var_1_9=131/4] [L44] COND TRUE var_1_7 >= ((((last_1_var_1_8) > (var_1_6)) ? (last_1_var_1_8) : (var_1_6))) [L45] var_1_8 = (var_1_5 - var_1_3) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_9=131/4] [L54] COND TRUE var_1_4 != (var_1_3 - var_1_5) [L55] var_1_9 = var_1_6 VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_6=1000000000004, var_1_9=1000000000004] [L84] RET step() [L85] CALL, EXPR property() [L75-L76] return (((var_1_2 ? (var_1_1 == ((float) ((var_1_3 - var_1_4) - var_1_5))) : (var_1_1 == ((float) (var_1_4 + var_1_6)))) && (var_1_2 ? (var_1_7 == ((double) ((((((var_1_3 - 255.719)) < (var_1_5)) ? ((var_1_3 - 255.719)) : (var_1_5))) - 2.3))) : 1)) && (var_1_2 ? ((var_1_7 >= ((((last_1_var_1_8) > (var_1_6)) ? (last_1_var_1_8) : (var_1_6)))) ? (var_1_8 == ((double) (var_1_5 - var_1_3))) : (var_1_8 == ((double) var_1_4))) : ((var_1_7 <= var_1_5) ? (var_1_8 == ((double) var_1_6)) : 1))) && ((var_1_4 != (var_1_3 - var_1_5)) ? (var_1_9 == ((double) var_1_6)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_6=1000000000004, var_1_9=1000000000004] [L85] RET, EXPR property() [L85] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_6=1000000000004, var_1_9=1000000000004] [L19] reach_error() VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_6=1000000000004, var_1_9=1000000000004] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 3, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 116 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11 IncrementalHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 85 mSDtfsCounter, 11 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred 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.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 106 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 120/120 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-13 14:01:30,235 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd/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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-20.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd --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 9942167140f46cf9a6de342ca7e9162ccfb76997661e3494128a17b58a9424e7 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:01:33,097 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:01:33,202 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 14:01:33,219 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:01:33,219 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:01:33,258 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:01:33,260 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:01:33,260 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:01:33,261 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:01:33,261 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:01:33,261 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:01:33,261 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:01:33,262 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:01:33,262 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:01:33,262 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:01:33,262 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:01:33,262 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:01:33,262 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:01:33,263 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:01:33,263 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:01:33,263 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:01:33,263 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:01:33,263 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:01:33,263 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 14:01:33,263 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 14:01:33,263 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:01:33,264 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 14:01:33,264 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:01:33,264 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:01:33,264 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:01:33,264 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:01:33,264 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:01:33,264 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:01:33,265 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:01:33,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:01:33,265 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:01:33,265 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:01:33,265 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:01:33,265 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 14:01:33,265 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 14:01:33,266 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:01:33,266 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:01:33,266 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:01:33,266 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:01:33,266 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd 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 -> 9942167140f46cf9a6de342ca7e9162ccfb76997661e3494128a17b58a9424e7 [2024-11-13 14:01:33,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:01:33,589 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:01:33,592 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:01:33,593 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:01:33,594 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:01:33,595 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-20.i Unable to find full path for "g++" [2024-11-13 14:01:35,568 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:01:35,859 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:01:35,859 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-20.i [2024-11-13 14:01:35,872 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd/data/7aed52384/0319bcaf320543128beab649280b25d2/FLAG772fcc01f [2024-11-13 14:01:36,140 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd/data/7aed52384/0319bcaf320543128beab649280b25d2 [2024-11-13 14:01:36,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:01:36,146 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:01:36,148 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:01:36,148 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:01:36,153 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:01:36,154 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:01:36" (1/1) ... [2024-11-13 14:01:36,155 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54d02088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:01:36, skipping insertion in model container [2024-11-13 14:01:36,155 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:01:36" (1/1) ... [2024-11-13 14:01:36,177 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:01:36,343 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_2108ac04-e2ba-458c-b275-6ea1aefe0e33/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-20.i[915,928] [2024-11-13 14:01:36,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:01:36,392 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:01:36,404 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_2108ac04-e2ba-458c-b275-6ea1aefe0e33/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-20.i[915,928] [2024-11-13 14:01:36,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:01:36,439 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:01:36,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:01:36 WrapperNode [2024-11-13 14:01:36,439 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:01:36,441 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:01:36,441 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:01:36,441 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:01:36,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:01:36" (1/1) ... [2024-11-13 14:01:36,456 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:01:36" (1/1) ... [2024-11-13 14:01:36,477 INFO L138 Inliner]: procedures = 27, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 78 [2024-11-13 14:01:36,478 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:01:36,478 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:01:36,478 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:01:36,479 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:01:36,487 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:01:36" (1/1) ... [2024-11-13 14:01:36,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:01:36" (1/1) ... [2024-11-13 14:01:36,490 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:01:36" (1/1) ... [2024-11-13 14:01:36,503 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-13 14:01:36,503 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:01:36" (1/1) ... [2024-11-13 14:01:36,503 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:01:36" (1/1) ... [2024-11-13 14:01:36,511 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:01:36" (1/1) ... [2024-11-13 14:01:36,515 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:01:36" (1/1) ... [2024-11-13 14:01:36,517 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:01:36" (1/1) ... [2024-11-13 14:01:36,521 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:01:36" (1/1) ... [2024-11-13 14:01:36,528 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:01:36,529 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:01:36,529 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:01:36,529 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:01:36,530 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:01:36" (1/1) ... [2024-11-13 14:01:36,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:01:36,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:01:36,571 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:01:36,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:01:36,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:01:36,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 14:01:36,599 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 14:01:36,600 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 14:01:36,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:01:36,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:01:36,688 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:01:36,690 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:01:44,804 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-13 14:01:44,804 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:01:44,813 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:01:44,814 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:01:44,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:01:44 BoogieIcfgContainer [2024-11-13 14:01:44,814 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:01:44,818 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:01:44,818 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:01:44,824 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:01:44,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:01:36" (1/3) ... [2024-11-13 14:01:44,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e73f7ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:01:44, skipping insertion in model container [2024-11-13 14:01:44,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:01:36" (2/3) ... [2024-11-13 14:01:44,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e73f7ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:01:44, skipping insertion in model container [2024-11-13 14:01:44,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:01:44" (3/3) ... [2024-11-13 14:01:44,827 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-20.i [2024-11-13 14:01:44,842 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:01:44,844 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-20.i that has 2 procedures, 36 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:01:44,904 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:01:44,915 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;@8d06af0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:01:44,915 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:01:44,919 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 14:01:44,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-13 14:01:44,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:01:44,928 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 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-13 14:01:44,929 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:01:44,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:01:44,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1762824234, now seen corresponding path program 1 times [2024-11-13 14:01:44,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:01:44,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [641801562] [2024-11-13 14:01:44,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:01:44,946 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-13 14:01:44,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:01:44,949 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:01:44,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:01:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:01:45,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 14:01:45,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:01:45,609 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-13 14:01:45,609 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:01:45,610 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:01:45,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [641801562] [2024-11-13 14:01:45,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [641801562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:01:45,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:01:45,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:01:45,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957264500] [2024-11-13 14:01:45,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:01:45,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 14:01:45,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:01:45,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:01:45,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:01:45,641 INFO L87 Difference]: Start difference. First operand has 36 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-13 14:01:45,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:01:45,660 INFO L93 Difference]: Finished difference Result 65 states and 100 transitions. [2024-11-13 14:01:45,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:01:45,661 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 49 [2024-11-13 14:01:45,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:01:45,666 INFO L225 Difference]: With dead ends: 65 [2024-11-13 14:01:45,666 INFO L226 Difference]: Without dead ends: 32 [2024-11-13 14:01:45,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 48 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-13 14:01:45,672 INFO L432 NwaCegarLoop]: 43 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, 43 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-13 14:01:45,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:01:45,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-13 14:01:45,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-13 14:01:45,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 14:01:45,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2024-11-13 14:01:45,718 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 49 [2024-11-13 14:01:45,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:01:45,720 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2024-11-13 14:01:45,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-13 14:01:45,721 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2024-11-13 14:01:45,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-13 14:01:45,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:01:45,725 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 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-13 14:01:45,739 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-13 14:01:45,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:01:45,926 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:01:45,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:01:45,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1236900978, now seen corresponding path program 1 times [2024-11-13 14:01:45,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:01:45,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [512209945] [2024-11-13 14:01:45,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:01:45,928 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-13 14:01:45,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:01:45,930 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:01:45,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:01:46,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:01:46,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 14:01:46,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:01:46,505 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-13 14:01:46,505 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:01:46,505 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:01:46,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [512209945] [2024-11-13 14:01:46,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [512209945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:01:46,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:01:46,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:01:46,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291807898] [2024-11-13 14:01:46,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:01:46,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:01:46,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:01:46,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:01:46,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:01:46,513 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-13 14:01:47,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:01:51,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:01:55,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:01:55,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:01:55,953 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2024-11-13 14:01:55,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:01:55,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 49 [2024-11-13 14:01:55,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:01:55,955 INFO L225 Difference]: With dead ends: 72 [2024-11-13 14:01:55,955 INFO L226 Difference]: Without dead ends: 43 [2024-11-13 14:01:55,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 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-13 14:01:55,957 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 12 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:01:55,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 73 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 2 Unknown, 0 Unchecked, 9.4s Time] [2024-11-13 14:01:55,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-13 14:01:55,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2024-11-13 14:01:55,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 14:01:55,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2024-11-13 14:01:55,966 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 49 [2024-11-13 14:01:55,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:01:55,967 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2024-11-13 14:01:55,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-13 14:01:55,968 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2024-11-13 14:01:55,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-13 14:01:55,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:01:55,969 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 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-13 14:01:55,978 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:01:56,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:01:56,170 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:01:56,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:01:56,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1797194382, now seen corresponding path program 1 times [2024-11-13 14:01:56,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:01:56,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1510922269] [2024-11-13 14:01:56,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:01:56,171 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-13 14:01:56,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:01:56,172 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:01:56,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2108ac04-e2ba-458c-b275-6ea1aefe0e33/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:01:56,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:01:56,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-13 14:01:56,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:02:13,836 WARN L286 SmtUtils]: Spent 5.44s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:02:20,307 WARN L286 SmtUtils]: Spent 6.44s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:02:27,734 WARN L286 SmtUtils]: Spent 7.43s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:02:39,305 WARN L286 SmtUtils]: Spent 8.11s 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-13 14:02:44,778 WARN L286 SmtUtils]: Spent 5.47s 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-13 14:02:52,870 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-13 14:02:59,063 WARN L286 SmtUtils]: Spent 6.19s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:03:04,086 WARN L286 SmtUtils]: Spent 5.02s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:03:12,198 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:03:22,445 WARN L286 SmtUtils]: Spent 5.61s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:03:28,232 WARN L286 SmtUtils]: Spent 5.79s 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-13 14:03:33,874 WARN L286 SmtUtils]: Spent 5.64s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:03:40,322 WARN L286 SmtUtils]: Spent 6.45s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:03:47,329 WARN L286 SmtUtils]: Spent 7.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:03:59,923 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:04:03,944 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (and (fp.leq c_~var_1_5~0 .cse0) (fp.leq c_~var_1_3~0 .cse0) (fp.geq c_~var_1_3~0 .cse1) (or (and (fp.geq c_~var_1_6~0 .cse1) (fp.leq c_~var_1_6~0 .cse2)) (and (fp.geq c_~var_1_6~0 (fp.neg .cse2)) (fp.leq c_~var_1_6~0 (fp.neg .cse1)))) (fp.leq c_~var_1_4~0 .cse2) (= c_~var_1_1~0 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0) c_~var_1_5~0)) (fp.geq c_~var_1_4~0 .cse1) (let ((.cse6 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_3~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 255719.0 1000.0)))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_5~0))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (/ 23.0 10.0))) (.cse3 (fp.lt .cse6 .cse4))) (or (and (not .cse3) (= c_~var_1_7~0 (fp.sub c_currentRoundingMode .cse4 .cse5))) (and (= c_~var_1_7~0 (fp.sub c_currentRoundingMode .cse6 .cse5)) .cse3)))) (fp.geq c_~var_1_5~0 .cse1) (not (= (_ bv0 8) c_~var_1_2~0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-13 14:04:12,291 WARN L286 SmtUtils]: Spent 7.03s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:04:18,677 WARN L286 SmtUtils]: Spent 6.39s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:04:24,597 WARN L286 SmtUtils]: Spent 5.92s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:04:32,187 WARN L286 SmtUtils]: Spent 7.59s 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-13 14:04:37,207 WARN L286 SmtUtils]: Spent 5.02s 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-13 14:04:43,312 WARN L286 SmtUtils]: Spent 6.10s 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-13 14:04:48,680 WARN L286 SmtUtils]: Spent 5.37s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:04:56,786 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:05:04,210 WARN L286 SmtUtils]: Spent 7.42s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:05:16,103 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:05:21,666 WARN L286 SmtUtils]: Spent 5.56s 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-13 14:05:34,846 WARN L286 SmtUtils]: Spent 6.48s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:05:40,012 WARN L286 SmtUtils]: Spent 5.17s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:05:45,319 WARN L286 SmtUtils]: Spent 5.31s 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-13 14:05:53,521 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:06:01,730 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:06:09,904 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:06:18,024 WARN L286 SmtUtils]: Spent 8.12s 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-13 14:06:26,156 WARN L286 SmtUtils]: Spent 8.13s 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-13 14:06:34,290 WARN L286 SmtUtils]: Spent 8.13s 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-13 14:06:42,429 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:06:50,593 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:06:58,752 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:07:06,885 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:07:15,027 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:07:23,157 WARN L286 SmtUtils]: Spent 8.13s 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-13 14:07:31,312 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:07:39,461 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:07:47,637 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:07:55,766 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:08:03,965 WARN L286 SmtUtils]: Spent 8.20s 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-13 14:08:12,091 WARN L286 SmtUtils]: Spent 8.13s 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-13 14:08:20,221 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:08:28,345 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:08:36,490 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:08:44,606 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:08:48,676 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (and (fp.leq c_~var_1_5~0 .cse0) (fp.leq c_~var_1_3~0 .cse0) (fp.geq c_~var_1_3~0 .cse1) (or (and (fp.geq c_~var_1_6~0 .cse1) (fp.leq c_~var_1_6~0 .cse2)) (and (fp.geq c_~var_1_6~0 (fp.neg .cse2)) (fp.leq c_~var_1_6~0 (fp.neg .cse1)))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_6~0))) (let ((.cse4 (fp.gt c_~last_1_var_1_8~0 .cse3))) (or (and (fp.geq c_~var_1_7~0 .cse3) (not .cse4)) (and .cse4 (fp.geq c_~var_1_7~0 c_~last_1_var_1_8~0))))) (fp.leq c_~var_1_4~0 .cse2) (= c_~var_1_1~0 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0) c_~var_1_5~0)) (fp.geq c_~var_1_4~0 .cse1) (= c_~var_1_8~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_5~0 c_~var_1_3~0))) (let ((.cse8 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_3~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 255719.0 1000.0)))) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_5~0))) (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode (/ 23.0 10.0))) (.cse5 (fp.lt .cse8 .cse6))) (or (and (not .cse5) (= c_~var_1_7~0 (fp.sub c_currentRoundingMode .cse6 .cse7))) (and (= c_~var_1_7~0 (fp.sub c_currentRoundingMode .cse8 .cse7)) .cse5)))) (fp.geq c_~var_1_5~0 .cse1) (not (= (_ bv0 8) c_~var_1_2~0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-13 14:08:52,706 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (and (fp.leq c_~var_1_5~0 .cse0) (fp.leq c_~var_1_3~0 .cse0) (fp.geq c_~var_1_3~0 .cse1) (or (and (fp.geq c_~var_1_6~0 .cse1) (fp.leq c_~var_1_6~0 .cse2)) (and (fp.geq c_~var_1_6~0 (fp.neg .cse2)) (fp.leq c_~var_1_6~0 (fp.neg .cse1)))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_6~0))) (let ((.cse4 (fp.gt c_~last_1_var_1_8~0 .cse3))) (or (and (fp.geq c_~var_1_7~0 .cse3) (not .cse4)) (and .cse4 (fp.geq c_~var_1_7~0 c_~last_1_var_1_8~0))))) (fp.leq c_~var_1_4~0 .cse2) (= c_~var_1_1~0 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0) c_~var_1_5~0)) (fp.geq c_~var_1_4~0 .cse1) (= c_~var_1_8~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_5~0 c_~var_1_3~0))) (let ((.cse8 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_3~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 255719.0 1000.0)))) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_5~0))) (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode (/ 23.0 10.0))) (.cse5 (fp.lt .cse8 .cse6))) (or (and (not .cse5) (= c_~var_1_7~0 (fp.sub c_currentRoundingMode .cse6 .cse7))) (and (= c_~var_1_7~0 (fp.sub c_currentRoundingMode .cse8 .cse7)) .cse5)))) (fp.geq c_~var_1_5~0 .cse1) (not (= (_ bv0 8) c_~var_1_2~0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-13 14:09:00,890 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:09:09,037 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:09:17,189 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:09:25,332 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:09:33,525 WARN L286 SmtUtils]: Spent 8.19s 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-13 14:09:41,691 WARN L286 SmtUtils]: Spent 8.17s 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-13 14:09:49,859 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:09:58,010 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:10:06,181 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:10:14,337 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:10:22,494 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:10:30,645 WARN L286 SmtUtils]: Spent 8.15s 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-13 14:10:38,786 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:10:46,946 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:10:55,111 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:11:03,276 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:11:11,415 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:11:19,566 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:11:27,737 WARN L286 SmtUtils]: Spent 8.17s 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-13 14:11:35,882 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:11:44,028 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:11:52,170 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:12:00,361 WARN L286 SmtUtils]: Spent 8.19s 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-13 14:12:04,414 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_6~0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (and (fp.leq c_~var_1_5~0 .cse0) (fp.leq c_~var_1_3~0 .cse0) (fp.geq c_~var_1_3~0 .cse1) (or (and (fp.geq c_~var_1_6~0 .cse1) (fp.leq c_~var_1_6~0 .cse2)) (and (fp.geq c_~var_1_6~0 (fp.neg .cse2)) (fp.leq c_~var_1_6~0 (fp.neg .cse1)))) (= c_~var_1_9~0 .cse3) (let ((.cse4 (fp.gt c_~last_1_var_1_8~0 .cse3))) (or (and (fp.geq c_~var_1_7~0 .cse3) (not .cse4)) (and .cse4 (fp.geq c_~var_1_7~0 c_~last_1_var_1_8~0)))) (fp.leq c_~var_1_4~0 .cse2) (= c_~var_1_1~0 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0) c_~var_1_5~0)) (fp.geq c_~var_1_4~0 .cse1) (= c_~var_1_8~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_5~0 c_~var_1_3~0))) (let ((.cse8 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_3~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 255719.0 1000.0)))) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_5~0))) (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode (/ 23.0 10.0))) (.cse5 (fp.lt .cse8 .cse6))) (or (and (not .cse5) (= c_~var_1_7~0 (fp.sub c_currentRoundingMode .cse6 .cse7))) (and (= c_~var_1_7~0 (fp.sub c_currentRoundingMode .cse8 .cse7)) .cse5)))) (fp.geq c_~var_1_5~0 .cse1) (not (= (_ bv0 8) c_~var_1_2~0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-13 14:12:08,445 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_6~0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (and (fp.leq c_~var_1_5~0 .cse0) (fp.leq c_~var_1_3~0 .cse0) (fp.geq c_~var_1_3~0 .cse1) (or (and (fp.geq c_~var_1_6~0 .cse1) (fp.leq c_~var_1_6~0 .cse2)) (and (fp.geq c_~var_1_6~0 (fp.neg .cse2)) (fp.leq c_~var_1_6~0 (fp.neg .cse1)))) (= c_~var_1_9~0 .cse3) (let ((.cse4 (fp.gt c_~last_1_var_1_8~0 .cse3))) (or (and (fp.geq c_~var_1_7~0 .cse3) (not .cse4)) (and .cse4 (fp.geq c_~var_1_7~0 c_~last_1_var_1_8~0)))) (fp.leq c_~var_1_4~0 .cse2) (= c_~var_1_1~0 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0) c_~var_1_5~0)) (fp.geq c_~var_1_4~0 .cse1) (= c_~var_1_8~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_5~0 c_~var_1_3~0))) (let ((.cse8 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_3~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 255719.0 1000.0)))) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_5~0))) (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode (/ 23.0 10.0))) (.cse5 (fp.lt .cse8 .cse6))) (or (and (not .cse5) (= c_~var_1_7~0 (fp.sub c_currentRoundingMode .cse6 .cse7))) (and (= c_~var_1_7~0 (fp.sub c_currentRoundingMode .cse8 .cse7)) .cse5)))) (fp.geq c_~var_1_5~0 .cse1) (not (= (_ bv0 8) c_~var_1_2~0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-13 14:14:53,915 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:15:04,131 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:15:11,960 WARN L286 SmtUtils]: Spent 7.76s 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-13 14:15:19,568 WARN L286 SmtUtils]: Spent 7.56s 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-13 14:15:30,805 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:16:00,340 WARN L286 SmtUtils]: Spent 6.95s 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-13 14:16:18,172 WARN L286 SmtUtils]: Spent 7.50s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:16:30,127 WARN L286 SmtUtils]: Spent 7.75s 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-13 14:16:48,714 WARN L286 SmtUtils]: Spent 5.79s on a formula simplification. DAG size of input: 3 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)