/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver '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' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/floats-cbmc-regression/float-no-simp4.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-df9f019-m [2024-11-05 20:35:43,284 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 20:35:43,354 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-05 20:35:43,358 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 20:35:43,359 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 20:35:43,393 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 20:35:43,394 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 20:35:43,394 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 20:35:43,395 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 20:35:43,396 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 20:35:43,396 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 20:35:43,396 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 20:35:43,397 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 20:35:43,399 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 20:35:43,399 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 20:35:43,399 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 20:35:43,399 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 20:35:43,400 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 20:35:43,400 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 20:35:43,400 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 20:35:43,400 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 20:35:43,402 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 20:35:43,403 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 20:35:43,403 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 20:35:43,403 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 20:35:43,403 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 20:35:43,404 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 20:35:43,404 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 20:35:43,404 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 20:35:43,404 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 20:35:43,404 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 20:35:43,405 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 20:35:43,405 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 20:35:43,405 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 20:35:43,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 20:35:43,406 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 20:35:43,406 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 20:35:43,406 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 20:35:43,406 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 20:35:43,407 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 20:35:43,407 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 20:35:43,407 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 20:35:43,407 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 20:35:43,407 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 20:35:43,408 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> 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-05 20:35:43,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 20:35:43,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 20:35:43,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 20:35:43,663 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 20:35:43,663 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 20:35:43,664 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-cbmc-regression/float-no-simp4.i [2024-11-05 20:35:45,021 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 20:35:45,256 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 20:35:45,257 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float-no-simp4.i [2024-11-05 20:35:45,274 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2f6cf4e4/429c687cbd3c4d4e85e312d465f599a7/FLAGf3fd69a89 [2024-11-05 20:35:45,290 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2f6cf4e4/429c687cbd3c4d4e85e312d465f599a7 [2024-11-05 20:35:45,293 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 20:35:45,294 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 20:35:45,297 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 20:35:45,297 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 20:35:45,303 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 20:35:45,303 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:35:45" (1/1) ... [2024-11-05 20:35:45,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a02f514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:35:45, skipping insertion in model container [2024-11-05 20:35:45,305 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:35:45" (1/1) ... [2024-11-05 20:35:45,358 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 20:35:45,804 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float-no-simp4.i[41149,41162] [2024-11-05 20:35:45,810 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float-no-simp4.i[41296,41309] [2024-11-05 20:35:45,811 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float-no-simp4.i[41445,41458] [2024-11-05 20:35:45,814 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float-no-simp4.i[41846,41859] [2024-11-05 20:35:45,816 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float-no-simp4.i[41993,42006] [2024-11-05 20:35:45,818 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float-no-simp4.i[42394,42407] [2024-11-05 20:35:45,819 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float-no-simp4.i[42541,42554] [2024-11-05 20:35:45,820 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float-no-simp4.i[42582,42595] [2024-11-05 20:35:45,822 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float-no-simp4.i[42965,42978] [2024-11-05 20:35:45,823 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float-no-simp4.i[43112,43125] [2024-11-05 20:35:45,825 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float-no-simp4.i[43610,43623] [2024-11-05 20:35:45,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 20:35:45,839 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 20:35:45,878 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float-no-simp4.i[41149,41162] [2024-11-05 20:35:45,879 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float-no-simp4.i[41296,41309] [2024-11-05 20:35:45,884 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float-no-simp4.i[41445,41458] [2024-11-05 20:35:45,890 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float-no-simp4.i[41846,41859] [2024-11-05 20:35:45,891 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float-no-simp4.i[41993,42006] [2024-11-05 20:35:45,893 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float-no-simp4.i[42394,42407] [2024-11-05 20:35:45,894 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float-no-simp4.i[42541,42554] [2024-11-05 20:35:45,894 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float-no-simp4.i[42582,42595] [2024-11-05 20:35:45,896 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float-no-simp4.i[42965,42978] [2024-11-05 20:35:45,897 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float-no-simp4.i[43112,43125] [2024-11-05 20:35:45,899 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float-no-simp4.i[43610,43623] [2024-11-05 20:35:45,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 20:35:46,032 INFO L204 MainTranslator]: Completed translation [2024-11-05 20:35:46,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:35:46 WrapperNode [2024-11-05 20:35:46,033 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 20:35:46,034 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 20:35:46,034 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 20:35:46,034 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 20:35:46,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:35:46" (1/1) ... [2024-11-05 20:35:46,062 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:35:46" (1/1) ... [2024-11-05 20:35:46,084 INFO L138 Inliner]: procedures = 449, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 82 [2024-11-05 20:35:46,084 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 20:35:46,085 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 20:35:46,085 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 20:35:46,085 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 20:35:46,097 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:35:46" (1/1) ... [2024-11-05 20:35:46,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:35:46" (1/1) ... [2024-11-05 20:35:46,100 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:35:46" (1/1) ... [2024-11-05 20:35:46,110 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-05 20:35:46,111 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:35:46" (1/1) ... [2024-11-05 20:35:46,111 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:35:46" (1/1) ... [2024-11-05 20:35:46,117 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:35:46" (1/1) ... [2024-11-05 20:35:46,119 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:35:46" (1/1) ... [2024-11-05 20:35:46,121 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:35:46" (1/1) ... [2024-11-05 20:35:46,122 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:35:46" (1/1) ... [2024-11-05 20:35:46,125 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 20:35:46,126 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 20:35:46,126 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 20:35:46,126 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 20:35:46,127 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:35:46" (1/1) ... [2024-11-05 20:35:46,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 20:35:46,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 20:35:46,157 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-05 20:35:46,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-05 20:35:46,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 20:35:46,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 20:35:46,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 20:35:46,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 20:35:46,180 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 20:35:46,180 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 20:35:46,266 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 20:35:46,268 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 20:35:46,413 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-05 20:35:46,413 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 20:35:46,429 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 20:35:46,429 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-05 20:35:46,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:35:46 BoogieIcfgContainer [2024-11-05 20:35:46,430 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 20:35:46,432 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 20:35:46,432 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 20:35:46,435 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 20:35:46,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 08:35:45" (1/3) ... [2024-11-05 20:35:46,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e776571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:35:46, skipping insertion in model container [2024-11-05 20:35:46,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:35:46" (2/3) ... [2024-11-05 20:35:46,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e776571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:35:46, skipping insertion in model container [2024-11-05 20:35:46,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:35:46" (3/3) ... [2024-11-05 20:35:46,438 INFO L112 eAbstractionObserver]: Analyzing ICFG float-no-simp4.i [2024-11-05 20:35:46,453 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 20:35:46,454 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2024-11-05 20:35:46,500 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 20:35:46,505 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;@aad2bbf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 20:35:46,505 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-05 20:35:46,509 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 33 states have (on average 1.696969696969697) internal successors, (56), 44 states have internal predecessors, (56), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-05 20:35:46,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-05 20:35:46,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:35:46,517 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:35:46,518 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-05 20:35:46,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:35:46,524 INFO L85 PathProgramCache]: Analyzing trace with hash 855794161, now seen corresponding path program 1 times [2024-11-05 20:35:46,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:35:46,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [399603367] [2024-11-05 20:35:46,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:35:46,533 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-05 20:35:46,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:35:46,535 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-05 20:35:46,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-05 20:35:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:35:46,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 20:35:46,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:35:46,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:35:46,621 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:35:46,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:35:46,632 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:35:46,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [399603367] [2024-11-05 20:35:46,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [399603367] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:35:46,633 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:35:46,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2024-11-05 20:35:46,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536559382] [2024-11-05 20:35:46,635 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:35:46,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 20:35:46,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:35:46,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 20:35:46,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 20:35:46,661 INFO L87 Difference]: Start difference. First operand has 51 states, 33 states have (on average 1.696969696969697) internal successors, (56), 44 states have internal predecessors, (56), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-05 20:35:46,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:35:46,684 INFO L93 Difference]: Finished difference Result 99 states and 133 transitions. [2024-11-05 20:35:46,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 20:35:46,686 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2024-11-05 20:35:46,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:35:46,694 INFO L225 Difference]: With dead ends: 99 [2024-11-05 20:35:46,694 INFO L226 Difference]: Without dead ends: 48 [2024-11-05 20:35:46,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 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-05 20:35:46,701 INFO L432 NwaCegarLoop]: 54 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, 54 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-05 20:35:46,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:35:46,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-05 20:35:46,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-05 20:35:46,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 41 states have internal predecessors, (41), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-05 20:35:46,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2024-11-05 20:35:46,739 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 9 [2024-11-05 20:35:46,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:35:46,740 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2024-11-05 20:35:46,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-05 20:35:46,740 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2024-11-05 20:35:46,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-05 20:35:46,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:35:46,741 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:35:46,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-05 20:35:46,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-05 20:35:46,945 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-05 20:35:46,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:35:46,946 INFO L85 PathProgramCache]: Analyzing trace with hash 857641203, now seen corresponding path program 1 times [2024-11-05 20:35:46,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:35:46,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2073428812] [2024-11-05 20:35:46,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:35:46,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-05 20:35:46,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:35:46,948 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-05 20:35:46,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-05 20:35:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:35:47,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 20:35:47,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:35:47,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:35:47,207 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:35:47,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:35:47,485 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:35:47,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2073428812] [2024-11-05 20:35:47,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2073428812] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:35:47,485 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:35:47,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2024-11-05 20:35:47,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101837199] [2024-11-05 20:35:47,486 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:35:47,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 20:35:47,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:35:47,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 20:35:47,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-05 20:35:47,490 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-05 20:35:47,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:35:47,640 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2024-11-05 20:35:47,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 20:35:47,640 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 9 [2024-11-05 20:35:47,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:35:47,642 INFO L225 Difference]: With dead ends: 48 [2024-11-05 20:35:47,642 INFO L226 Difference]: Without dead ends: 42 [2024-11-05 20:35:47,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-05 20:35:47,643 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:35:47,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 130 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:35:47,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-05 20:35:47,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-05 20:35:47,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.25) internal successors, (35), 35 states have internal predecessors, (35), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-05 20:35:47,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2024-11-05 20:35:47,651 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 9 [2024-11-05 20:35:47,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:35:47,652 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2024-11-05 20:35:47,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-05 20:35:47,656 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2024-11-05 20:35:47,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-05 20:35:47,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:35:47,656 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:35:47,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-05 20:35:47,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-05 20:35:47,858 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-05 20:35:47,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:35:47,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1222120034, now seen corresponding path program 1 times [2024-11-05 20:35:47,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:35:47,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [166965604] [2024-11-05 20:35:47,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:35:47,860 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-05 20:35:47,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:35:47,861 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-05 20:35:47,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-05 20:35:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:35:47,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 20:35:47,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:35:47,925 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-05 20:35:47,925 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:35:48,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-05 20:35:48,007 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:35:48,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [166965604] [2024-11-05 20:35:48,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [166965604] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:35:48,007 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:35:48,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2024-11-05 20:35:48,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640520837] [2024-11-05 20:35:48,008 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:35:48,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 20:35:48,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:35:48,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 20:35:48,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-05 20:35:48,009 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-05 20:35:48,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:35:48,073 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2024-11-05 20:35:48,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 20:35:48,074 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 18 [2024-11-05 20:35:48,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:35:48,075 INFO L225 Difference]: With dead ends: 42 [2024-11-05 20:35:48,075 INFO L226 Difference]: Without dead ends: 38 [2024-11-05 20:35:48,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-05 20:35:48,076 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:35:48,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 117 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:35:48,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-05 20:35:48,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-05 20:35:48,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 31 states have internal predecessors, (31), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-05 20:35:48,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2024-11-05 20:35:48,089 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 18 [2024-11-05 20:35:48,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:35:48,090 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2024-11-05 20:35:48,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-05 20:35:48,090 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2024-11-05 20:35:48,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-05 20:35:48,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:35:48,092 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:35:48,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-05 20:35:48,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-05 20:35:48,296 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-05 20:35:48,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:35:48,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1704996651, now seen corresponding path program 1 times [2024-11-05 20:35:48,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:35:48,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [390648201] [2024-11-05 20:35:48,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:35:48,297 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-05 20:35:48,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:35:48,299 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-05 20:35:48,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-05 20:35:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:35:48,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 20:35:48,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:35:48,371 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-05 20:35:48,371 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:35:48,452 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-05 20:35:48,453 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:35:48,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [390648201] [2024-11-05 20:35:48,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [390648201] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:35:48,453 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:35:48,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2024-11-05 20:35:48,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548266734] [2024-11-05 20:35:48,453 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:35:48,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 20:35:48,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:35:48,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 20:35:48,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-05 20:35:48,455 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 20:35:48,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:35:48,511 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2024-11-05 20:35:48,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 20:35:48,512 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 26 [2024-11-05 20:35:48,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:35:48,513 INFO L225 Difference]: With dead ends: 38 [2024-11-05 20:35:48,513 INFO L226 Difference]: Without dead ends: 32 [2024-11-05 20:35:48,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-05 20:35:48,514 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 4 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:35:48,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 70 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:35:48,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-05 20:35:48,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-05 20:35:48,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 25 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-05 20:35:48,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2024-11-05 20:35:48,523 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 26 [2024-11-05 20:35:48,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:35:48,523 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2024-11-05 20:35:48,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 20:35:48,524 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2024-11-05 20:35:48,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-05 20:35:48,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:35:48,525 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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-05 20:35:48,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-05 20:35:48,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-05 20:35:48,729 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-05 20:35:48,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:35:48,729 INFO L85 PathProgramCache]: Analyzing trace with hash -826066940, now seen corresponding path program 1 times [2024-11-05 20:35:48,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:35:48,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [699628201] [2024-11-05 20:35:48,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:35:48,730 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-05 20:35:48,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:35:48,731 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-05 20:35:48,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-05 20:35:48,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:35:48,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 20:35:48,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:35:48,815 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-05 20:35:48,815 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:35:48,888 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-05 20:35:48,889 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:35:48,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [699628201] [2024-11-05 20:35:48,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [699628201] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:35:48,889 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:35:48,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2024-11-05 20:35:48,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919775597] [2024-11-05 20:35:48,890 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:35:48,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 20:35:48,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:35:48,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 20:35:48,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-05 20:35:48,891 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-05 20:35:48,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:35:48,961 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2024-11-05 20:35:48,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 20:35:48,962 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 35 [2024-11-05 20:35:48,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:35:48,962 INFO L225 Difference]: With dead ends: 32 [2024-11-05 20:35:48,963 INFO L226 Difference]: Without dead ends: 28 [2024-11-05 20:35:48,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-05 20:35:48,964 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:35:48,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:35:48,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-05 20:35:48,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-05 20:35:48,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.0) internal successors, (21), 21 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-05 20:35:48,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2024-11-05 20:35:48,974 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 35 [2024-11-05 20:35:48,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:35:48,975 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-11-05 20:35:48,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-05 20:35:48,975 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2024-11-05 20:35:48,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-05 20:35:48,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:35:48,976 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 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-05 20:35:48,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-05 20:35:49,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-05 20:35:49,177 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-05 20:35:49,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:35:49,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1889668375, now seen corresponding path program 1 times [2024-11-05 20:35:49,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:35:49,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1185024632] [2024-11-05 20:35:49,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:35:49,178 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-05 20:35:49,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:35:49,180 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-05 20:35:49,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (7)] Waiting until timeout for monitored process [2024-11-05 20:35:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:35:49,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 20:35:49,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:35:49,263 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-05 20:35:49,263 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:35:49,364 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-05 20:35:49,365 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:35:49,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1185024632] [2024-11-05 20:35:49,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1185024632] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:35:49,365 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:35:49,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 6 [2024-11-05 20:35:49,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085601950] [2024-11-05 20:35:49,365 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:35:49,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 20:35:49,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:35:49,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 20:35:49,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:35:49,367 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-05 20:35:49,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:35:49,412 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2024-11-05 20:35:49,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 20:35:49,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 43 [2024-11-05 20:35:49,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:35:49,413 INFO L225 Difference]: With dead ends: 28 [2024-11-05 20:35:49,413 INFO L226 Difference]: Without dead ends: 0 [2024-11-05 20:35:49,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:35:49,414 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:35:49,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:35:49,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-05 20:35:49,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-05 20:35:49,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:35:49,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-05 20:35:49,416 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2024-11-05 20:35:49,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:35:49,416 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-05 20:35:49,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-05 20:35:49,416 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-05 20:35:49,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-05 20:35:49,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (10 of 11 remaining) [2024-11-05 20:35:49,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (9 of 11 remaining) [2024-11-05 20:35:49,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (8 of 11 remaining) [2024-11-05 20:35:49,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (7 of 11 remaining) [2024-11-05 20:35:49,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (6 of 11 remaining) [2024-11-05 20:35:49,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (5 of 11 remaining) [2024-11-05 20:35:49,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (4 of 11 remaining) [2024-11-05 20:35:49,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (3 of 11 remaining) [2024-11-05 20:35:49,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (2 of 11 remaining) [2024-11-05 20:35:49,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (1 of 11 remaining) [2024-11-05 20:35:49,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (0 of 11 remaining) [2024-11-05 20:35:49,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (7)] Forceful destruction successful, exit code 0 [2024-11-05 20:35:49,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-05 20:35:49,624 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-05 20:35:49,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-05 20:35:49,642 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-05 20:35:49,658 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_NAN [2024-11-05 20:35:49,659 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_INFINITE [2024-11-05 20:35:49,659 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_ZERO [2024-11-05 20:35:49,659 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_SUBNORMAL [2024-11-05 20:35:49,659 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_NORMAL [2024-11-05 20:35:49,659 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_IEEE_ [2024-11-05 20:35:49,659 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_SVID_ [2024-11-05 20:35:49,659 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_XOPEN_ [2024-11-05 20:35:49,659 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_POSIX_ [2024-11-05 20:35:49,659 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_ISOC_ [2024-11-05 20:35:49,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.11 08:35:49 BoogieIcfgContainer [2024-11-05 20:35:49,662 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-05 20:35:49,663 INFO L158 Benchmark]: Toolchain (without parser) took 4368.53ms. Allocated memory was 195.0MB in the beginning and 338.7MB in the end (delta: 143.7MB). Free memory was 139.7MB in the beginning and 288.0MB in the end (delta: -148.3MB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-05 20:35:49,663 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 195.0MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-05 20:35:49,663 INFO L158 Benchmark]: CACSL2BoogieTranslator took 735.96ms. Allocated memory was 195.0MB in the beginning and 338.7MB in the end (delta: 143.7MB). Free memory was 139.7MB in the beginning and 291.7MB in the end (delta: -152.0MB). Peak memory consumption was 51.9MB. Max. memory is 8.0GB. [2024-11-05 20:35:49,664 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.25ms. Allocated memory is still 338.7MB. Free memory was 291.7MB in the beginning and 289.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-05 20:35:49,664 INFO L158 Benchmark]: Boogie Preprocessor took 40.15ms. Allocated memory is still 338.7MB. Free memory was 289.0MB in the beginning and 286.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-05 20:35:49,664 INFO L158 Benchmark]: RCFGBuilder took 304.23ms. Allocated memory is still 338.7MB. Free memory was 286.9MB in the beginning and 272.8MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-11-05 20:35:49,664 INFO L158 Benchmark]: TraceAbstraction took 3230.06ms. Allocated memory is still 338.7MB. Free memory was 271.7MB in the beginning and 288.0MB in the end (delta: -16.3MB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-05 20:35:49,666 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.12ms. Allocated memory is still 195.0MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 735.96ms. Allocated memory was 195.0MB in the beginning and 338.7MB in the end (delta: 143.7MB). Free memory was 139.7MB in the beginning and 291.7MB in the end (delta: -152.0MB). Peak memory consumption was 51.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.25ms. Allocated memory is still 338.7MB. Free memory was 291.7MB in the beginning and 289.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.15ms. Allocated memory is still 338.7MB. Free memory was 289.0MB in the beginning and 286.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 304.23ms. Allocated memory is still 338.7MB. Free memory was 286.9MB in the beginning and 272.8MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 3230.06ms. Allocated memory is still 338.7MB. Free memory was 271.7MB in the beginning and 288.0MB in the end (delta: -16.3MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_NAN - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_INFINITE - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_ZERO - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_SUBNORMAL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_NORMAL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_IEEE_ - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_SVID_ - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_XOPEN_ - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_POSIX_ - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_ISOC_ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 973]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 974]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 975]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 981]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 982]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 988]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 989]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 990]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 997]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 998]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1004]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 6, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 530 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 335 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 193 IncrementalHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 195 mSDtfsCounter, 193 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 268 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=0, InterpolantAutomatonStates: 27, 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 140 NumberOfCodeBlocks, 140 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 268 ConstructedInterpolants, 0 QuantifiedInterpolants, 402 SizeOfPredicates, 5 NumberOfNonLiveVariables, 232 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 160/160 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 11 specifications checked. All of them hold - ProcedureContractResult [Line: 2]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((0 != cond) && ((signgam == \old(signgam)) && (_LIB_VERSION == \old(_LIB_VERSION)))) RESULT: Ultimate proved your program to be correct! [2024-11-05 20:35:49,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...