/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-82.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 15:42:45,191 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 15:42:45,245 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 15:42:45,248 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 15:42:45,249 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 15:42:45,263 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 15:42:45,263 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 15:42:45,266 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 15:42:45,267 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 15:42:45,268 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 15:42:45,268 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 15:42:45,269 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 15:42:45,270 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 15:42:45,270 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 15:42:45,270 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 15:42:45,271 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 15:42:45,271 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 15:42:45,271 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 15:42:45,271 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 15:42:45,271 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 15:42:45,272 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 15:42:45,276 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 15:42:45,276 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 15:42:45,276 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 15:42:45,276 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 15:42:45,276 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 15:42:45,276 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 15:42:45,277 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 15:42:45,277 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 15:42:45,277 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 15:42:45,278 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 15:42:45,278 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 15:42:45,278 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 15:42:45,278 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 15:42:45,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 15:42:45,278 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 15:42:45,279 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 15:42:45,279 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 15:42:45,279 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 15:42:45,279 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 15:42:45,279 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 15:42:45,280 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 15:42:45,280 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 15:42:45,280 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 15:42:45,280 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 15:42:45,280 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 15:42:45,280 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 [2023-12-16 15:42:45,474 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 15:42:45,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 15:42:45,494 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 15:42:45,495 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 15:42:45,497 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 15:42:45,499 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-82.i [2023-12-16 15:42:46,624 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 15:42:46,825 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 15:42:46,826 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-82.i [2023-12-16 15:42:46,836 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6a4d2ce7/ede95ce76e78469ca6564f42695c1fcc/FLAG92f85acd6 [2023-12-16 15:42:46,849 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6a4d2ce7/ede95ce76e78469ca6564f42695c1fcc [2023-12-16 15:42:46,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 15:42:46,853 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 15:42:46,854 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 15:42:46,854 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 15:42:46,860 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 15:42:46,861 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:42:46" (1/1) ... [2023-12-16 15:42:46,862 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78fa4a51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:42:46, skipping insertion in model container [2023-12-16 15:42:46,862 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:42:46" (1/1) ... [2023-12-16 15:42:46,910 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 15:42:47,065 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-82.i[917,930] [2023-12-16 15:42:47,120 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 15:42:47,150 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 15:42:47,161 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-82.i[917,930] [2023-12-16 15:42:47,196 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 15:42:47,225 INFO L206 MainTranslator]: Completed translation [2023-12-16 15:42:47,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:42:47 WrapperNode [2023-12-16 15:42:47,226 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 15:42:47,227 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 15:42:47,227 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 15:42:47,227 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 15:42:47,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:42:47" (1/1) ... [2023-12-16 15:42:47,260 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:42:47" (1/1) ... [2023-12-16 15:42:47,305 INFO L138 Inliner]: procedures = 33, calls = 162, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 511 [2023-12-16 15:42:47,305 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 15:42:47,306 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 15:42:47,306 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 15:42:47,306 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 15:42:47,315 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:42:47" (1/1) ... [2023-12-16 15:42:47,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:42:47" (1/1) ... [2023-12-16 15:42:47,323 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:42:47" (1/1) ... [2023-12-16 15:42:47,357 INFO L175 MemorySlicer]: Split 133 memory accesses to 5 slices as follows [2, 10, 6, 41, 74]. 56 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 2, 3, 8]. The 17 writes are split as follows [0, 1, 2, 3, 11]. [2023-12-16 15:42:47,357 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:42:47" (1/1) ... [2023-12-16 15:42:47,357 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:42:47" (1/1) ... [2023-12-16 15:42:47,382 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:42:47" (1/1) ... [2023-12-16 15:42:47,385 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:42:47" (1/1) ... [2023-12-16 15:42:47,400 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:42:47" (1/1) ... [2023-12-16 15:42:47,403 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:42:47" (1/1) ... [2023-12-16 15:42:47,407 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 15:42:47,408 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 15:42:47,408 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 15:42:47,408 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 15:42:47,409 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:42:47" (1/1) ... [2023-12-16 15:42:47,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 15:42:47,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 15:42:47,449 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) [2023-12-16 15:42:47,471 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 [2023-12-16 15:42:47,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 15:42:47,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2023-12-16 15:42:47,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2023-12-16 15:42:47,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2023-12-16 15:42:47,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2023-12-16 15:42:47,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2023-12-16 15:42:47,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2023-12-16 15:42:47,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2023-12-16 15:42:47,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2023-12-16 15:42:47,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2023-12-16 15:42:47,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2023-12-16 15:42:47,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-16 15:42:47,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-16 15:42:47,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-12-16 15:42:47,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-12-16 15:42:47,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-12-16 15:42:47,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 15:42:47,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 15:42:47,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-16 15:42:47,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-16 15:42:47,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-12-16 15:42:47,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2023-12-16 15:42:47,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2023-12-16 15:42:47,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2023-12-16 15:42:47,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2023-12-16 15:42:47,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2023-12-16 15:42:47,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2023-12-16 15:42:47,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2023-12-16 15:42:47,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2023-12-16 15:42:47,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2023-12-16 15:42:47,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2023-12-16 15:42:47,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2023-12-16 15:42:47,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2023-12-16 15:42:47,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2023-12-16 15:42:47,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2023-12-16 15:42:47,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2023-12-16 15:42:47,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2023-12-16 15:42:47,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2023-12-16 15:42:47,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2023-12-16 15:42:47,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2023-12-16 15:42:47,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2023-12-16 15:42:47,487 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 15:42:47,487 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 15:42:47,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 15:42:47,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 15:42:47,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-16 15:42:47,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-16 15:42:47,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-12-16 15:42:47,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2023-12-16 15:42:47,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2023-12-16 15:42:47,647 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 15:42:47,649 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 15:42:51,131 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 15:42:51,262 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 15:42:51,262 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 15:42:51,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:42:51 BoogieIcfgContainer [2023-12-16 15:42:51,262 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 15:42:51,264 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 15:42:51,264 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 15:42:51,266 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 15:42:51,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 03:42:46" (1/3) ... [2023-12-16 15:42:51,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cf878bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:42:51, skipping insertion in model container [2023-12-16 15:42:51,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:42:47" (2/3) ... [2023-12-16 15:42:51,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cf878bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:42:51, skipping insertion in model container [2023-12-16 15:42:51,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:42:51" (3/3) ... [2023-12-16 15:42:51,268 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-82.i [2023-12-16 15:42:51,280 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 15:42:51,280 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 15:42:51,315 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 15:42:51,319 INFO L357 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, mHoare=true, 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;@200887bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 15:42:51,320 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 15:42:51,323 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-16 15:42:51,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-16 15:42:51,334 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:42:51,335 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:42:51,335 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:42:51,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:42:51,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1303278699, now seen corresponding path program 1 times [2023-12-16 15:42:51,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:42:51,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1104013650] [2023-12-16 15:42:51,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:42:51,352 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 [2023-12-16 15:42:51,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:42:51,353 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) [2023-12-16 15:42:51,359 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 [2023-12-16 15:42:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:42:51,667 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 15:42:51,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:42:51,719 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2023-12-16 15:42:51,719 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:42:51,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:42:51,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1104013650] [2023-12-16 15:42:51,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1104013650] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:42:51,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:42:51,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 15:42:51,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862746498] [2023-12-16 15:42:51,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:42:51,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 15:42:51,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:42:51,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 15:42:51,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 15:42:51,769 INFO L87 Difference]: Start difference. First operand has 101 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 15:42:51,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:42:51,829 INFO L93 Difference]: Finished difference Result 199 states and 312 transitions. [2023-12-16 15:42:51,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 15:42:51,832 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2023-12-16 15:42:51,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:42:51,840 INFO L225 Difference]: With dead ends: 199 [2023-12-16 15:42:51,841 INFO L226 Difference]: Without dead ends: 99 [2023-12-16 15:42:51,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 15:42:51,848 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 15:42:51,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 15:42:51,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-12-16 15:42:51,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-12-16 15:42:51,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-16 15:42:51,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2023-12-16 15:42:51,900 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 114 [2023-12-16 15:42:51,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:42:51,900 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2023-12-16 15:42:51,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 15:42:51,903 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2023-12-16 15:42:51,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-16 15:42:51,909 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:42:51,909 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:42:51,918 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 (2)] Ended with exit code 0 [2023-12-16 15:42:52,116 WARN L477 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 [2023-12-16 15:42:52,117 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:42:52,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:42:52,118 INFO L85 PathProgramCache]: Analyzing trace with hash 260723519, now seen corresponding path program 1 times [2023-12-16 15:42:52,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:42:52,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [606516963] [2023-12-16 15:42:52,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:42:52,119 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 [2023-12-16 15:42:52,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:42:52,131 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) [2023-12-16 15:42:52,133 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 [2023-12-16 15:42:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:42:52,435 INFO L262 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 15:42:52,440 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:42:52,485 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2023-12-16 15:42:52,485 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:42:52,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:42:52,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [606516963] [2023-12-16 15:42:52,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [606516963] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:42:52,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:42:52,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 15:42:52,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408191586] [2023-12-16 15:42:52,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:42:52,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 15:42:52,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:42:52,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 15:42:52,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 15:42:52,489 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 15:42:52,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:42:52,573 INFO L93 Difference]: Finished difference Result 203 states and 290 transitions. [2023-12-16 15:42:52,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 15:42:52,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2023-12-16 15:42:52,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:42:52,575 INFO L225 Difference]: With dead ends: 203 [2023-12-16 15:42:52,575 INFO L226 Difference]: Without dead ends: 105 [2023-12-16 15:42:52,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 15:42:52,576 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 10 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:42:52,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 400 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:42:52,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-12-16 15:42:52,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2023-12-16 15:42:52,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 85 states have internal predecessors, (115), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-16 15:42:52,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2023-12-16 15:42:52,585 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 114 [2023-12-16 15:42:52,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:42:52,585 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2023-12-16 15:42:52,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 15:42:52,585 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2023-12-16 15:42:52,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-16 15:42:52,586 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:42:52,586 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:42:52,598 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 [2023-12-16 15:42:52,794 WARN L477 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 [2023-12-16 15:42:52,796 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:42:52,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:42:52,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1636773247, now seen corresponding path program 1 times [2023-12-16 15:42:52,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:42:52,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [637836248] [2023-12-16 15:42:52,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:42:52,799 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 [2023-12-16 15:42:52,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:42:52,800 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) [2023-12-16 15:42:52,833 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 [2023-12-16 15:42:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:42:53,041 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 15:42:53,045 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:42:53,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-16 15:42:53,332 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 15:42:53,333 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:42:53,333 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:42:53,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [637836248] [2023-12-16 15:42:53,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [637836248] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:42:53,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:42:53,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 15:42:53,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578982840] [2023-12-16 15:42:53,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:42:53,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:42:53,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:42:53,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:42:53,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 15:42:53,336 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 15:42:54,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:42:54,128 INFO L93 Difference]: Finished difference Result 298 states and 424 transitions. [2023-12-16 15:42:54,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 15:42:54,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2023-12-16 15:42:54,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:42:54,131 INFO L225 Difference]: With dead ends: 298 [2023-12-16 15:42:54,131 INFO L226 Difference]: Without dead ends: 198 [2023-12-16 15:42:54,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-16 15:42:54,133 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 113 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 15:42:54,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 453 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-16 15:42:54,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2023-12-16 15:42:54,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 171. [2023-12-16 15:42:54,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 140 states have (on average 1.3428571428571427) internal successors, (188), 140 states have internal predecessors, (188), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 15:42:54,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 244 transitions. [2023-12-16 15:42:54,153 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 244 transitions. Word has length 114 [2023-12-16 15:42:54,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:42:54,154 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 244 transitions. [2023-12-16 15:42:54,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 15:42:54,154 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 244 transitions. [2023-12-16 15:42:54,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-16 15:42:54,155 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:42:54,155 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:42:54,176 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 (4)] Forceful destruction successful, exit code 0 [2023-12-16 15:42:54,356 WARN L477 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 [2023-12-16 15:42:54,356 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:42:54,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:42:54,357 INFO L85 PathProgramCache]: Analyzing trace with hash -281703176, now seen corresponding path program 1 times [2023-12-16 15:42:54,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:42:54,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663291515] [2023-12-16 15:42:54,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:42:54,359 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 [2023-12-16 15:42:54,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:42:54,362 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) [2023-12-16 15:42:54,366 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 [2023-12-16 15:42:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:42:54,626 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 15:42:54,630 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:42:54,653 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 15:42:54,654 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:42:54,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:42:54,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663291515] [2023-12-16 15:42:54,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663291515] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:42:54,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:42:54,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 15:42:54,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438297443] [2023-12-16 15:42:54,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:42:54,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 15:42:54,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:42:54,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 15:42:54,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 15:42:54,656 INFO L87 Difference]: Start difference. First operand 171 states and 244 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 15:42:54,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:42:54,726 INFO L93 Difference]: Finished difference Result 301 states and 428 transitions. [2023-12-16 15:42:54,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 15:42:54,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2023-12-16 15:42:54,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:42:54,729 INFO L225 Difference]: With dead ends: 301 [2023-12-16 15:42:54,729 INFO L226 Difference]: Without dead ends: 201 [2023-12-16 15:42:54,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 15:42:54,731 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 49 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 15:42:54,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 446 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 15:42:54,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-12-16 15:42:54,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 175. [2023-12-16 15:42:54,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 144 states have (on average 1.3333333333333333) internal successors, (192), 144 states have internal predecessors, (192), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 15:42:54,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 248 transitions. [2023-12-16 15:42:54,747 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 248 transitions. Word has length 114 [2023-12-16 15:42:54,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:42:54,748 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 248 transitions. [2023-12-16 15:42:54,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 15:42:54,748 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 248 transitions. [2023-12-16 15:42:54,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-16 15:42:54,749 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:42:54,749 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:42:54,757 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 (5)] Forceful destruction successful, exit code 0 [2023-12-16 15:42:54,957 WARN L477 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 [2023-12-16 15:42:54,958 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:42:54,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:42:54,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1491891558, now seen corresponding path program 1 times [2023-12-16 15:42:54,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:42:54,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [935028731] [2023-12-16 15:42:54,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:42:54,959 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 [2023-12-16 15:42:54,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:42:54,963 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) [2023-12-16 15:42:54,964 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 [2023-12-16 15:42:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:42:55,212 INFO L262 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 15:42:55,215 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:42:55,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-16 15:42:55,702 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 88 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 15:42:55,702 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:42:55,874 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 15:42:55,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:42:55,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [935028731] [2023-12-16 15:42:55,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [935028731] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 15:42:55,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 15:42:55,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2023-12-16 15:42:55,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026667833] [2023-12-16 15:42:55,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:42:55,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:42:55,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:42:55,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:42:55,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-12-16 15:42:55,877 INFO L87 Difference]: Start difference. First operand 175 states and 248 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 15:42:55,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:42:55,994 INFO L93 Difference]: Finished difference Result 365 states and 515 transitions. [2023-12-16 15:42:55,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 15:42:55,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2023-12-16 15:42:55,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:42:55,996 INFO L225 Difference]: With dead ends: 365 [2023-12-16 15:42:55,997 INFO L226 Difference]: Without dead ends: 256 [2023-12-16 15:42:55,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-12-16 15:42:55,998 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 127 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 607 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 [2023-12-16 15:42:55,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 607 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:42:55,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2023-12-16 15:42:56,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 195. [2023-12-16 15:42:56,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 164 states have (on average 1.353658536585366) internal successors, (222), 164 states have internal predecessors, (222), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 15:42:56,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 278 transitions. [2023-12-16 15:42:56,025 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 278 transitions. Word has length 116 [2023-12-16 15:42:56,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:42:56,025 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 278 transitions. [2023-12-16 15:42:56,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 15:42:56,025 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 278 transitions. [2023-12-16 15:42:56,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-16 15:42:56,026 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:42:56,026 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:42:56,040 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 (6)] Forceful destruction successful, exit code 0 [2023-12-16 15:42:56,235 WARN L477 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 [2023-12-16 15:42:56,236 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:42:56,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:42:56,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1488294174, now seen corresponding path program 1 times [2023-12-16 15:42:56,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:42:56,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [710711085] [2023-12-16 15:42:56,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:42:56,237 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:42:56,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:42:56,238 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) [2023-12-16 15:42:56,239 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 [2023-12-16 15:42:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:42:56,548 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 15:42:56,551 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:42:56,582 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 15:42:56,582 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:42:56,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:42:56,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [710711085] [2023-12-16 15:42:56,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [710711085] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:42:56,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:42:56,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 15:42:56,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814215239] [2023-12-16 15:42:56,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:42:56,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:42:56,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:42:56,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:42:56,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 15:42:56,585 INFO L87 Difference]: Start difference. First operand 195 states and 278 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 15:42:56,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:42:56,683 INFO L93 Difference]: Finished difference Result 365 states and 517 transitions. [2023-12-16 15:42:56,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 15:42:56,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2023-12-16 15:42:56,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:42:56,689 INFO L225 Difference]: With dead ends: 365 [2023-12-16 15:42:56,689 INFO L226 Difference]: Without dead ends: 253 [2023-12-16 15:42:56,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 15:42:56,691 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 86 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:42:56,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 582 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:42:56,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-12-16 15:42:56,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 197. [2023-12-16 15:42:56,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 166 states have (on average 1.3493975903614457) internal successors, (224), 166 states have internal predecessors, (224), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 15:42:56,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 280 transitions. [2023-12-16 15:42:56,705 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 280 transitions. Word has length 117 [2023-12-16 15:42:56,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:42:56,705 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 280 transitions. [2023-12-16 15:42:56,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 15:42:56,706 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 280 transitions. [2023-12-16 15:42:56,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-16 15:42:56,706 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:42:56,706 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:42:56,716 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 [2023-12-16 15:42:56,914 WARN L477 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 [2023-12-16 15:42:56,914 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:42:56,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:42:56,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1654054424, now seen corresponding path program 1 times [2023-12-16 15:42:56,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:42:56,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1127818254] [2023-12-16 15:42:56,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:42:56,915 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 [2023-12-16 15:42:56,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:42:56,916 INFO L229 MonitoredProcess]: Starting monitored process 8 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) [2023-12-16 15:42:56,920 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 (8)] Waiting until timeout for monitored process [2023-12-16 15:42:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:42:57,230 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 15:42:57,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:42:57,252 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 15:42:57,253 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:42:57,253 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:42:57,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1127818254] [2023-12-16 15:42:57,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1127818254] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:42:57,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:42:57,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 15:42:57,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415556658] [2023-12-16 15:42:57,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:42:57,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 15:42:57,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:42:57,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 15:42:57,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 15:42:57,265 INFO L87 Difference]: Start difference. First operand 197 states and 280 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 15:42:57,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:42:57,401 INFO L93 Difference]: Finished difference Result 322 states and 457 transitions. [2023-12-16 15:42:57,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 15:42:57,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2023-12-16 15:42:57,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:42:57,403 INFO L225 Difference]: With dead ends: 322 [2023-12-16 15:42:57,403 INFO L226 Difference]: Without dead ends: 209 [2023-12-16 15:42:57,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 15:42:57,404 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 21 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:42:57,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 402 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:42:57,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-12-16 15:42:57,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 199. [2023-12-16 15:42:57,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 168 states have (on average 1.3452380952380953) internal successors, (226), 168 states have internal predecessors, (226), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 15:42:57,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 282 transitions. [2023-12-16 15:42:57,412 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 282 transitions. Word has length 118 [2023-12-16 15:42:57,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:42:57,413 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 282 transitions. [2023-12-16 15:42:57,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 15:42:57,413 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 282 transitions. [2023-12-16 15:42:57,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-16 15:42:57,414 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:42:57,414 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:42:57,422 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 (8)] Forceful destruction successful, exit code 0 [2023-12-16 15:42:57,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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 [2023-12-16 15:42:57,623 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:42:57,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:42:57,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1831566246, now seen corresponding path program 1 times [2023-12-16 15:42:57,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:42:57,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1544093552] [2023-12-16 15:42:57,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:42:57,624 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 [2023-12-16 15:42:57,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:42:57,625 INFO L229 MonitoredProcess]: Starting monitored process 9 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) [2023-12-16 15:42:57,636 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 (9)] Waiting until timeout for monitored process [2023-12-16 15:42:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:42:57,880 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 15:42:57,883 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:42:57,909 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 15:42:57,910 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:42:57,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:42:57,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1544093552] [2023-12-16 15:42:57,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1544093552] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:42:57,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:42:57,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 15:42:57,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502740032] [2023-12-16 15:42:57,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:42:57,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:42:57,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:42:57,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:42:57,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 15:42:57,913 INFO L87 Difference]: Start difference. First operand 199 states and 282 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 15:42:58,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:42:58,050 INFO L93 Difference]: Finished difference Result 327 states and 462 transitions. [2023-12-16 15:42:58,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 15:42:58,052 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2023-12-16 15:42:58,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:42:58,053 INFO L225 Difference]: With dead ends: 327 [2023-12-16 15:42:58,053 INFO L226 Difference]: Without dead ends: 212 [2023-12-16 15:42:58,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 15:42:58,054 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 24 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:42:58,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 531 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:42:58,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2023-12-16 15:42:58,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 201. [2023-12-16 15:42:58,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 170 states have (on average 1.3411764705882352) internal successors, (228), 170 states have internal predecessors, (228), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 15:42:58,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 284 transitions. [2023-12-16 15:42:58,063 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 284 transitions. Word has length 118 [2023-12-16 15:42:58,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:42:58,064 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 284 transitions. [2023-12-16 15:42:58,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 15:42:58,064 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 284 transitions. [2023-12-16 15:42:58,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-16 15:42:58,065 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:42:58,066 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:42:58,072 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 (9)] Ended with exit code 0 [2023-12-16 15:42:58,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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 [2023-12-16 15:42:58,272 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:42:58,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:42:58,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1888824548, now seen corresponding path program 1 times [2023-12-16 15:42:58,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:42:58,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1757904033] [2023-12-16 15:42:58,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:42:58,273 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 [2023-12-16 15:42:58,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:42:58,274 INFO L229 MonitoredProcess]: Starting monitored process 10 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) [2023-12-16 15:42:58,308 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 (10)] Waiting until timeout for monitored process [2023-12-16 15:42:58,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:42:58,518 INFO L262 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 15:42:58,521 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:42:58,547 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 15:42:58,547 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:42:58,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:42:58,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1757904033] [2023-12-16 15:42:58,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1757904033] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:42:58,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:42:58,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 15:42:58,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849264628] [2023-12-16 15:42:58,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:42:58,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 15:42:58,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:42:58,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 15:42:58,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 15:42:58,549 INFO L87 Difference]: Start difference. First operand 201 states and 284 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 15:42:58,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:42:58,820 INFO L93 Difference]: Finished difference Result 330 states and 463 transitions. [2023-12-16 15:42:58,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 15:42:58,821 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2023-12-16 15:42:58,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:42:58,822 INFO L225 Difference]: With dead ends: 330 [2023-12-16 15:42:58,822 INFO L226 Difference]: Without dead ends: 213 [2023-12-16 15:42:58,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-16 15:42:58,823 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 19 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 15:42:58,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 653 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 15:42:58,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-12-16 15:42:58,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 203. [2023-12-16 15:42:58,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 172 states have (on average 1.3372093023255813) internal successors, (230), 172 states have internal predecessors, (230), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 15:42:58,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 286 transitions. [2023-12-16 15:42:58,833 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 286 transitions. Word has length 118 [2023-12-16 15:42:58,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:42:58,834 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 286 transitions. [2023-12-16 15:42:58,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 15:42:58,834 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 286 transitions. [2023-12-16 15:42:58,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-16 15:42:58,835 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:42:58,835 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:42:58,844 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 (10)] Forceful destruction successful, exit code 0 [2023-12-16 15:42:59,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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 [2023-12-16 15:42:59,044 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:42:59,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:42:59,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1888884130, now seen corresponding path program 1 times [2023-12-16 15:42:59,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:42:59,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2073619912] [2023-12-16 15:42:59,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:42:59,046 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 [2023-12-16 15:42:59,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:42:59,052 INFO L229 MonitoredProcess]: Starting monitored process 11 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) [2023-12-16 15:42:59,053 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 (11)] Waiting until timeout for monitored process [2023-12-16 15:42:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:42:59,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-16 15:42:59,567 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:43:01,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-12-16 15:43:02,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-16 15:43:03,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-16 15:43:04,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-12-16 15:43:05,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2023-12-16 15:43:05,581 INFO L349 Elim1Store]: treesize reduction 47, result has 19.0 percent of original size [2023-12-16 15:43:05,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 55 treesize of output 70 [2023-12-16 15:43:05,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 62 [2023-12-16 15:43:06,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:43:06,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 72 treesize of output 40 [2023-12-16 15:43:06,244 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 144 proven. 96 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-16 15:43:06,245 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:43:35,008 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_291 (_ BitVec 32)) (~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset (_ BitVec 32))) (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_int#4| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var7_Pointer~0.base (store (select |c_#memory_int#4| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var7_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var7_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (bvadd (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#4| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.offset)))) ((_ zero_extend 24) |c_ULTIMATE.start_step_#t~mem12#1|)))))))) (store .cse2 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer~0.base (store (select .cse2 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse2 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset)))))))) (store .cse1 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base (store (select .cse1 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset v_ArrVal_291))))) (= ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var7_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var7_Pointer~0.offset))) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.offset))) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.offset)))))))))) is different from false [2023-12-16 15:43:39,079 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_291 (_ BitVec 32)) (~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset (_ BitVec 32))) (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_int#4| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var7_Pointer~0.base (store (select |c_#memory_int#4| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var7_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var7_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (bvadd (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#4| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.offset)))) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#4| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.offset)))))))))) (store .cse2 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer~0.base (store (select .cse2 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse2 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset)))))))) (store .cse1 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base (store (select .cse1 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset v_ArrVal_291))))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.offset)))) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.offset)))))) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var7_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var7_Pointer~0.offset)))))) is different from false [2023-12-16 15:43:39,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:43:39,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2073619912] [2023-12-16 15:43:39,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2073619912] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 15:43:39,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [693417461] [2023-12-16 15:43:39,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:43:39,193 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 15:43:39,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 15:43:39,233 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 15:43:39,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2023-12-16 15:43:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:43:40,044 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 51 conjunts are in the unsatisfiable core [2023-12-16 15:43:40,049 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:43:41,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-16 15:43:42,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-16 15:43:43,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-12-16 15:43:44,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-12-16 15:43:45,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2023-12-16 15:43:46,191 INFO L349 Elim1Store]: treesize reduction 55, result has 21.4 percent of original size [2023-12-16 15:43:46,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 68 [2023-12-16 15:43:46,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 67 [2023-12-16 15:43:47,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 61 [2023-12-16 15:43:47,402 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 114 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-12-16 15:43:47,403 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:43:52,051 WARN L854 $PredicateComparison]: unable to prove that (forall ((~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base (_ BitVec 32)) (~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset (_ BitVec 32))) (let ((.cse1 (store |c_#memory_int#4| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer~0.base (store (select |c_#memory_int#4| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#4| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset))))))) (or (forall ((v_ArrVal_331 (_ BitVec 32))) (let ((.cse0 (store .cse1 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base (store (select .cse1 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset v_ArrVal_331)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.offset)))) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.offset)))))) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var7_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var7_Pointer~0.offset)))))) (forall ((|ULTIMATE.start_step_~stepLocal_1~0#1| (_ BitVec 8))) (bvsge (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var7_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var7_Pointer~0.offset))) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.offset)))) ((_ zero_extend 24) |ULTIMATE.start_step_~stepLocal_1~0#1|)))))) is different from false [2023-12-16 15:43:56,150 WARN L854 $PredicateComparison]: unable to prove that (forall ((~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base (_ BitVec 32)) (|ULTIMATE.start_step_~stepLocal_1~0#1| (_ BitVec 8)) (~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_331 (_ BitVec 32))) (let ((.cse0 (let ((.cse2 (store |c_#memory_int#4| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var7_Pointer~0.base (store (select |c_#memory_int#4| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var7_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var7_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) |c_ULTIMATE.start_step_#t~mem12#1|) (bvneg |c_ULTIMATE.start_step_#t~ite11#1|)))))))) (store .cse2 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer~0.base (store (select .cse2 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse2 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset)))))))) (or (bvsge (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var7_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var7_Pointer~0.offset))) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.offset)))) ((_ zero_extend 24) |ULTIMATE.start_step_~stepLocal_1~0#1|)) (let ((.cse1 (store .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base (store (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset v_ArrVal_331)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.offset)))) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.offset)))))) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var7_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var7_Pointer~0.offset)))))))) is different from false Received shutdown request... [2023-12-16 15:44:00,638 WARN L340 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 (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 15:44:00,660 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 15:44:00,660 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 15:44:01,674 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 (11)] Forceful destruction successful, exit code 0 [2023-12-16 15:44:01,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2023-12-16 15:44:01,865 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-16 15:44:01,877 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 137 [2023-12-16 15:44:01,880 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 15:44:01,880 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 119 with TraceHistMax 14,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2023-12-16 15:44:01,883 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:44:01,884 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 15:44:01,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 03:44:01 BoogieIcfgContainer [2023-12-16 15:44:01,886 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 15:44:01,886 INFO L158 Benchmark]: Toolchain (without parser) took 75033.53ms. Allocated memory was 257.9MB in the beginning and 373.3MB in the end (delta: 115.3MB). Free memory was 208.5MB in the beginning and 299.7MB in the end (delta: -91.2MB). Peak memory consumption was 24.8MB. Max. memory is 8.0GB. [2023-12-16 15:44:01,886 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 178.3MB. Free memory is still 133.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 15:44:01,887 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.57ms. Allocated memory is still 257.9MB. Free memory was 208.0MB in the beginning and 191.3MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-16 15:44:01,887 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.40ms. Allocated memory is still 257.9MB. Free memory was 191.3MB in the beginning and 187.6MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 15:44:01,887 INFO L158 Benchmark]: Boogie Preprocessor took 101.50ms. Allocated memory is still 257.9MB. Free memory was 187.6MB in the beginning and 181.8MB in the end (delta: 5.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-16 15:44:01,887 INFO L158 Benchmark]: RCFGBuilder took 3854.26ms. Allocated memory is still 257.9MB. Free memory was 181.8MB in the beginning and 219.1MB in the end (delta: -37.2MB). Peak memory consumption was 48.2MB. Max. memory is 8.0GB. [2023-12-16 15:44:01,887 INFO L158 Benchmark]: TraceAbstraction took 70622.22ms. Allocated memory was 257.9MB in the beginning and 373.3MB in the end (delta: 115.3MB). Free memory was 218.0MB in the beginning and 299.7MB in the end (delta: -81.7MB). Peak memory consumption was 34.4MB. Max. memory is 8.0GB. [2023-12-16 15:44:01,888 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.18ms. Allocated memory is still 178.3MB. Free memory is still 133.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 372.57ms. Allocated memory is still 257.9MB. Free memory was 208.0MB in the beginning and 191.3MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 78.40ms. Allocated memory is still 257.9MB. Free memory was 191.3MB in the beginning and 187.6MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 101.50ms. Allocated memory is still 257.9MB. Free memory was 187.6MB in the beginning and 181.8MB in the end (delta: 5.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 3854.26ms. Allocated memory is still 257.9MB. Free memory was 181.8MB in the beginning and 219.1MB in the end (delta: -37.2MB). Peak memory consumption was 48.2MB. Max. memory is 8.0GB. * TraceAbstraction took 70622.22ms. Allocated memory was 257.9MB in the beginning and 373.3MB in the end (delta: 115.3MB). Free memory was 218.0MB in the beginning and 299.7MB in the end (delta: -81.7MB). Peak memory consumption was 34.4MB. Max. memory is 8.0GB. * 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 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was analyzing trace of length 119 with TraceHistMax 14,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 70.6s, OverallIterations: 10, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 450 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 449 mSDsluCounter, 4211 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2926 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 368 IncrementalHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 1285 mSDtfsCounter, 368 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1167 GetRequests, 1119 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=203occurred in iteration=9, InterpolantAutomatonStates: 57, 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, 9 MinimizatonAttempts, 205 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1043 NumberOfCodeBlocks, 1043 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1149 ConstructedInterpolants, 2 QuantifiedInterpolants, 2397 SizeOfPredicates, 24 NumberOfNonLiveVariables, 2645 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 3552/3640 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown